N88
- 225
- 12
For PeterDonis: Of course! Many thanks and my apologies! The problem occurs lower down! Let me redefine it using {.} to keep related terms together:
$$=-\smallint d\lambda \rho(\lambda)\{A(a, \lambda)A(b, \lambda)\}\left[1-\{A(a, \lambda)A(b, \lambda)\}\{A(a, \lambda)A(c, \lambda)\}\right].\;\;(2)$$
$$So, since \;A(a, \lambda)A(b, \lambda)\leq1: \;\;(3)$$
$$ |E(a,b)-E(a,c)|\leq\smallint d\lambda \rho(\lambda)\left[1-\{A(a, \lambda)A(b, \lambda)\}\{A(a, \lambda)A(c, \lambda)\}\right]\;\;(4)$$
$$\leq1-E(a,b)E(a,c).\;\;(5)$$
Now, in eqn (4), if I used ##A(a, \lambda)A(a, \lambda)=1##, I would get Bell's inequality; just like you and DarMM and many others do using ##A(b, \lambda)A(b, \lambda)=1## in the alternative formulation in Post #51.
But then I would have converted (5) -- by an improper separation of terms* -- from an inequality that is never false into Bell's inequality which is frequently false.
* By an improper separation I mean this: I would have converted ##E(a,b)E(a,c)## into ##E(b,c)##; which is unlikely to be true. That a function ##F(b,c)## should equal a function ##F(a,b)F(a,c)## over all ##a,b,c##.
The above should show why I am still seeking to understand the mathematics behind Bell's theorem.
My question: Given the above, does Bell's inequality ##
|E(a,b)-E(a,c)|\leq1+E(b,c)
## arise from an improper mathematical separation of terms?
From the first eqn in Post #51 above, including the integrals in line with Bell (1964):
$$E(a,b)-E(a,c)=-\smallint d\lambda \rho(\lambda)\left[\{A(a, \lambda)A(b, \lambda)\}-\{A(a, \lambda)A(c, \lambda)\}\right]\;\;(1)$$$$=-\smallint d\lambda \rho(\lambda)\{A(a, \lambda)A(b, \lambda)\}\left[1-\{A(a, \lambda)A(b, \lambda)\}\{A(a, \lambda)A(c, \lambda)\}\right].\;\;(2)$$
$$So, since \;A(a, \lambda)A(b, \lambda)\leq1: \;\;(3)$$
$$ |E(a,b)-E(a,c)|\leq\smallint d\lambda \rho(\lambda)\left[1-\{A(a, \lambda)A(b, \lambda)\}\{A(a, \lambda)A(c, \lambda)\}\right]\;\;(4)$$
$$\leq1-E(a,b)E(a,c).\;\;(5)$$
Now, in eqn (4), if I used ##A(a, \lambda)A(a, \lambda)=1##, I would get Bell's inequality; just like you and DarMM and many others do using ##A(b, \lambda)A(b, \lambda)=1## in the alternative formulation in Post #51.
But then I would have converted (5) -- by an improper separation of terms* -- from an inequality that is never false into Bell's inequality which is frequently false.
* By an improper separation I mean this: I would have converted ##E(a,b)E(a,c)## into ##E(b,c)##; which is unlikely to be true. That a function ##F(b,c)## should equal a function ##F(a,b)F(a,c)## over all ##a,b,c##.
The above should show why I am still seeking to understand the mathematics behind Bell's theorem.
My question: Given the above, does Bell's inequality ##
|E(a,b)-E(a,c)|\leq1+E(b,c)
## arise from an improper mathematical separation of terms?
Last edited: