I review the two theorems referred to in the title, and then suggest that it would be interesting to know how much of Hilbert space one can use without forcing the proof of these theorems. It would also be interesting to know what parts of Hilbert space that are essential for the proofs. I go on to discuss cubes, graphs, and pentagrams.
The purpose of this note is to complete the interesting review on quantum contextuality [1] that appeared recently. In particular we will introduce and discuss the ideas of extracontextuality and extravalence, that allow one to relate Kochen-Specker's and Gleason's theorems, and also to shift the emphasis from the first to the second one. We will also argue that whereas Kochen-Specker's is essentially a negative result (a no-go theorem), Gleason's is a positive one since it provides a mathematical justification of Born's rule. The link between these issues is provided by a specific quantum feature that we call extravalence.
The Kochen-Specker theorem is a fundamental result in quantum foundations that has spawned massive interest since its inception. We show that within every Kochen-Specker graph, there exist interesting subgraphs which we term 01 -gadgets, that capture the essential contradiction necessary to prove the Kochen-Specker theorem, i.e,. every Kochen-Specker graph contains a 01 -gadget and from every 01 -gadget one can construct a proof of the Kochen-Specker theorem. Moreover, we show that the 01 -gadgets form a fundamental primitive that can be used to formulate state-independent and state-dependent statistical Kochen-Specker arguments as well as to give simple constructive proofs of an ``extended'' Kochen-Specker theorem first considered by Pitowsky in \cite{Pitowsky}.