[過去ログ] 現代数学の系譜 工学物理雑談 古典ガロア理論も読む75 (1002レス)
1-

このスレッドは過去ログ倉庫に格納されています。
次スレ検索 歴削→次スレ 栞削→次スレ 過去ログメニュー
158
(3): 現代数学の系譜 雑談 古典ガロア理論も読む ◆e.a0E5TtKE 2019/08/17(土)07:32 ID:sbItYGIt(3/35) AAS
>>157
つづき

Alexander Pruss answered
The probabilistic reasoning depends on a conglomerability assumption, namely that given a fixed sequence u ̄ , the probability of guessing correctly is (n?1)/n, then for a randomly selected sequence, the probability of guessing correctly is (n?1)/n.
But we have no reason to think the event of guessing correctly is measurable with respect to the probability measure induced by the random choice of sequence and index i, and we have no reason to think that the conglomerability assumption is appropriate.

A quick way to see that the conglomerability assumption is going to be dubious is to consider the analogy of the Brown-Freiling argument against the Continuum Hypothesis (see here for a discussion).
外部リンク:www.mdpi.com

Let's go back to the riddle. Suppose u ̄ is chosen randomly. The most natural option is that it is a nontrivial i.i.d. sequence (uk), independent of the random index i which is uniformly distributed over [100]={0,...,99}.
In general, Mj will be nonmeasurable (one can prove this in at least some cases). We likewise have no reason to think that M is measurable. But without measurability, we can't make sense of talk of the probability that the guess will be correct.

Here's an amusing thing that may help see how measurability enters into these things. Consider a single sequence of infinitely many independent fair coin flips. Our state space is Ω={0,1}^N, corresponding to an infinite sequence (Xi)^∞ i=0 of i.i.d. r.v.s with P(Xi=1)=P(Xi=0)=1/2.

Can you guess the first coin flip on the basis of all the others? You might think: "Of course not! No matter what function from the values of flips X1,X2,... to {0,1} is chosen, the probability that the value of the function equals X0 is going to be 1/2."

つづく
1-
あと 844 レスあります
スレ情報 赤レス抽出 画像レス抽出 歴の未読スレ

ぬこの手 ぬこTOP 0.011s