gill1109 wrote:I am not stupid.
Sometimes I wonder.
The expression axb - axb' + a'xb + a'xb' has an *upper bound* of 2.
Please can you give me a single example of values (a,b,a',b') each +/-1 which violates this bound by 0.0000000000001 even? Can you give me a spreadsheet of values with 4 columns of a,b,a',b' for which averages of those paired products will exceed this bound by 0.0000000000000000000000000000000000001 even? Why do you keep deluding yourself that because of "statistical error" or other statistical tricks, you will have a "somewhat" larger bound?
The expression a1xb1 - a2xb2' + a3'xb3 + a4'xb4' where each of the values (a1, b1, a2, b2', a3', b3, a4', b4') are +/-1 has an
upper bound of 4. Can you give me an example of a single set of 8 values which violates that bound by even 0.0000000000000000000000000000000001? Can you give me a spreadsheet of 8 columns of values for those variables for which the averages of the paired products exceed the bound of 4 by even 0.0000000000000000000000000000001? Then why do you keep deluding yourself that due to statistical error or some other statistical tricks, the upper bound can be revised-up?
Why are you still unable to see that just because you can write a silly piece of R-code to generate a value of the expression which is much less than 4, does not change the fact that THE UPPER BOUND OF THE EXPRESSION IS 4???????????????????? Duh! it is an upper bound, it means it can not be higher, it doesn't mean any Tom and Dick can not generate a value lower than it!
Why do you continue to claim that QM violates the upper bound of an expression when I've explained to you and you accept that the upper bound is 4 and the QM value is 2 root 2, nowhere close?