- #1,191
JesseM
Science Advisor
- 8,520
- 16
See my most recent response to your post #1186 for a request for clarification on what you mean by "something different from term to term."billschnieder said:If by this you mean the inequality in which (a,b,c) mean something different from term to term needs extra assumptions to be valid,
Sure there's a difference. Suppose our dataset consisted only of the five you mention, and that for each iteration the pair measured was as follows:billschnieder said:You are confused. If I have a dataset of triples such as:
a b c
1: + + -
2: + - +
3: + - -
4: - + -
5: - - +
...
in iteration (1), if the experimenter measured (a,b) they will obtain (++) and if they measured (b,c) they would have obtained (+-). So contrary to your statements above, there is no difference between
"average value of a*b for the all triples" and "average value of a*b for all triples for which the experimenter measured a and b".
a b c
1: + + - (measured a,b)
2: + - + (measured b,c)
3: + - - (measured a,c)
4: - + - (measured a,b)
5: - - + (measured b,c)
In this case, "average value of a*b for all triples" = [(value of a*b for #1) + (value of a*b for #2) + (value of a*b for #3) + (value of a*b for #4) + (value of a*b for #5)]/5 =
[(+1) + (-1) + (-1) + (-1) + (+1)]/5 = -1/5
On the other hand, "average value of a*b for all triples for which the experimenter measured a and b" would only include triple #1 and triple #4, so it'd be [(value of a*b for #1) + (value of a*b for #4)]/2 = [(+1) + (-1)]/2 = 0.
Using pure arithmetical reasoning, we can prove this inequality must hold for all datasets of triples, including the above:
1 + (average value of b*c for all triples)
>= |(average value of a*b for all triples) - (average value of a*c for all triples)|
But without additional assumptions we cannot prove this inequality:
1 + (average value of b*c for all triples where experimenter sampled b and c)
>= |(average value of a*b for all triples where experimenter sampled a and b) - (average value of a*c for all triples where experimenter sampled a and c)|
Do you disagree?
I don't see anything on that page where he does a factorization like P(a,b) + P(a,c) = P(a*(b+c)), can you quote the line you're referring to?billschnieder said:The factorization <ab> + <ac> = <a(b+c)> is not my idea, it is Bell's. Look at page 406 of his original paper, the section leading up to equation (15) and shortly there after.
You mean each "run" consists of multiple pairs of particles that are each measured with the same detector settings? And that notation like a1 only refers to the "run" and not the iteration? That's fine with me, but we are still free to introduce some more detailed notation like a1,3 to mean "the third iteration of the first run", and then my objections to your math could be rephrased in terms of this new notation. For example, if each run consisted of only three iterations, then notation like <a1*b1> could be written out in "long form" as:billschnieder said:Also, you are confusing runs with iterations. Note that within angled brackets, terms such as a1,b1, etc are lists of numbers with values (+1,-1) since we are calculating averages. So if you performed three runs of the experiment in which you measured (a,b) on the first, (a,c) on the second and (b,c) on the third the averages from each run will be
<a1*b1> for run 1
<a2*c2> for run 2
<b3*c3> for run 3
(a1,1*b1,1 + a1,2*b1,2 + a1,3*b1,3)/3
...and then I still wouldn't know what to make of the notation <ab> + <ac> = <a(b+c)>. To rephrase my previous comments in terms of this notation
Then <a1*b1> + <a2*c2> would be equivalent to:
(a1,1*b1,1 + a1,2*b1,2 + a1,3*b1,3)/3 + (a2,1*c2,1 + a2,2*c2,2 + a2,3*c2,3)/3
But with the averages written out in this explicit form, I don't see how it makes sense to reduce this to <a(b+c)>. If you think it does make sense, can you show what that factorization would look like written out in the same sort of explicit form?
I'm not clear on what you mean by "sort them such that a1 becomes equivalent to a2 and b2 to b3 etc.", but later you do give an example of such "sorting" so I'll wait until later to ask questions about it.billschnieder said:Again you are agreeing while appearing to disagree with me. My argument is that you can not apply Bell's inequality to dataset of pairs obtained in this way UNLESS you sort them such that a1 becomes equivalent to a2 and b2 to b3 etc. If you do not do that, you do not have terms that can be used in Bell's inequality or the one I derived.
In any case, my disagreement once again lies with your claims that Bell's inequality is nothing more than the type of purely arithmetical inequality that we can prove must hold, of this type:
1 + (average value of b*c for all triples)
>= |(average value of a*b for all triples) - (average value of a*c for all triples)|
Rather, Bell's inequality is of this type:
1 + (average value of b*c for all triples where experimenter sampled b and c)
>= |(average value of a*b for all triples where experimenter sampled a and b) - (average value of a*c for all triples where experimenter sampled a and c)|
...and of course some lists of pairs sampled from triplets can violate this second inequality, but the inequality can nevertheless be justified with some additional physical assumptions, which are exactly the ones made in derivations of Bell's inequality.
OK, so here you're talking about combining a's and c's from the second run (where a and c were measured) with b's from the third run (where b and c were measured) and treating them all as "triples". In effect you're just showing that if we have 3 runs of N iterations each, then we can prove in a purely arithmetic way that this inequality must hold:billschnieder said:Essentially you have the datasets of pairs as follows:
Run1:
a1b1
-+
++
+-
Run2:
a2c3
++
+-
++
Run3:
b3c3
+-
-+
-+<a1b1> = -1/3
<a2c2> = 1/3
<b3c3> = -1
Note that the symbols in the inequality do not mean the same thing so we can not factor them the way Bell did. You can only factor them if you have a dataset of triples, or you resort the dataset of pairs so that it becomes a dataset of triples. Using your dataset above, let us focus the last two runs. we can write them down as follows:
a2 c2 b3 c3
+ + + -
+ - - +
+ + - +
Clearly we can resort the last two columns so that the c2 column matches the c3 column to get
a2 c2 b3 c3
+ + - +
+ - + -
+ + - +
And since c2 and c3 are now equivalent, we can drop the c3 column altogether and we now have our dataset of triples which can never violate the inequality.
1 + [tex]\mbox{$ 1/N \sum_{i=1}^N $}[/tex] bj,i*ck,i (where j represents the run where the experimenter sampled b and c, while k represents the run where a and c were sampled)
>= |[tex]\mbox{$ 1/N \sum_{i=1}^N $}[/tex] ak,i*bj,i (where j represents the run where the experimenter sampled b and c, while k represents the run where a and c were sampled) - [tex]\mbox{$ 1/N \sum_{i=1}^N $}[/tex] ak,i*ck,i (where k represents the run where a and c were sampled)|
But of course this is totally different from Bell's inequality! Bell's inequality takes this form:
1 + [tex]\mbox{$ 1/N \sum_{i=1}^N $}[/tex] bj,i*cj,i (where j represents the run where the experimenter sampled b and c)
>= |[tex]\mbox{$ 1/N \sum_{i=1}^N $}[/tex] ak,i*bk,i (where k represents the run where the experimenter sampled a and b) - [tex]\mbox{$ 1/N \sum_{i=1}^N $}[/tex] al,i*cl,i (where l represents the run where the experimenter sampled a and c)|
...and neither Bell nor any other physicist would claim that an inequality like this could be derived in a purely arithmetic manner! You can derive it using additional physical assumptions, which would be mentioned in any really rigorous derivation of a Bell inequality, although Bell's original paper left some things implicit (and perhaps some necessary conditions hadn't occurred to him yet).
Last edited: