Recursive proof of the Bell-Kochen-Specker theorem in any dimension n>3
Abstract
We present a method to obtain sets of vectors proving the Bell-Kochen-Specker theorem in dimension n from a similar set in dimension d (3≤ d<n≤ 2d). As an application of the method we find the smallest proofs known in dimension five (29 vectors), six (31) and seven (34), and different sets matching the current record (36) in dimension eight.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.