Pith. sign in

REVIEW 4 minor 8 references

A strong chromatic number larger than Hilbert-space dimension blocks only global spectral labeling, not the existence of a faithful ray representation of an orthogonality hypergraph.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · grok-4.5

2026-07-11 20:19 UTC pith:NLEIJA62

load-bearing objection Clean, elementary separation of chromatic completeness from geometric coordinatizability, backed by two explicit 3D examples that anyone can check by hand.

arxiv 2607.04289 v1 pith:NLEIJA62 submitted 2026-07-05 quant-ph math.CO

Chromatic Completeness and the Independence of Geometric Obstruction

Karl Svozil This is my paper
classification quant-ph math.CO
keywords orthogonality hypergraphschromatic completenessfaithful orthogonal representationstrong chromatic numberYu–Oh configurationGreechie diagramKochen–Specker theoremprojective geometry
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper separates two notions that look similar but are logically independent for orthogonality hypergraphs: chromatic completeness (whether every context can be given the same fixed nondegenerate spectrum) and geometric coordinatizability (whether the vertices can be realized as distinct rays whose orthogonalities match the hyperedges). A strong chromatic number bigger than the ambient dimension rules out the first but says nothing by itself about the second. The separation is shown by two three-dimensional examples that share strong chromatic number four: a completed 25-ray Yu–Oh hypergraph that nevertheless admits an explicit faithful orthogonal representation in real 3-space, and Greechie’s G32 that possesses a rich supply of two-valued states yet forces two distinct atoms onto the same ray, so no faithful representation in complex 3-space exists. The obstruction in the second case is projective-geometric, not chromatic. The result matters because it keeps spectral-labeling questions cleanly distinct from questions of ray geometry in the foundations of quantum contextuality.

Core claim

Already in dimension three the strong chromatic number of an orthogonality hypergraph is neither necessary nor sufficient for the existence of a faithful orthogonal representation: the completed Yu–Oh hypergraph has chromatic number four yet possesses an explicit faithful representation by 25 rays in R3, while Greechie’s G32 also has chromatic number four (and a separating unital set of two-valued states) yet admits none in C3 because its incidence relations force two atoms to collapse onto the same ray.

What carries the argument

The elementary projection identity that, for an orthonormal basis {x,y,z}, any vectors u perpendicular to x and w perpendicular to z satisfy ⟨u,w⟩=⟨u,y⟩⟨y,w⟩; this identity is applied to opposite blocks of G32 and produces two incompatible factorizations of a transition amplitude, forcing a collapse of distinct rays.

Load-bearing premise

The dual incidence graph formed by the ten blocks of G32 is exactly the Petersen graph, so the known fact that Petersen has chromatic index four immediately yields that G32 itself has strong chromatic number four.

What would settle it

Either exhibit an explicit assignment of fifteen distinct rays in C3 whose orthogonalities realize every block of G32, or produce a strong three-coloring of the atoms of G32 (equivalently a proper three-edge-coloring of its dual cubic graph).

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • Chromatic-contextuality arguments can no longer be read as automatic proofs of geometric non-realizability.
  • Existence of a separating unital set of two-valued states does not guarantee a faithful orthogonal representation.
  • Any future classification of three-dimensional Kochen–Specker-type hypergraphs must treat chromatic number, two-valued states, and ray coordinatizability as three independent layers.
  • Proofs that a hypergraph is non-coordinatizable must supply geometric or algebraic collapse arguments rather than resting solely on coloring obstructions.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same separation technique can be applied in higher dimensions to decide whether known chromatic-contextuality examples are truly non-coordinatizable or merely lack global spectral labels.
  • Algebraic identities like the projection factorization used for G32 may yield a systematic decision procedure for small Greechie diagrams that have so far been settled only by computer search.
  • Once chromatic and geometric layers are cleanly separated, one can ask which of them is responsible for the experimental violation of noncontextual inequalities built from the same hypergraphs.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 4 minor

Summary. The paper establishes a logical separation between chromatic completeness (existence of a globally consistent nondegenerate spectral labeling of all contexts, equivalent for n-uniform hypergraphs to strong n-colorability) and geometric coordinatizability (existence of a faithful orthogonal representation by distinct rays) for orthogonality hypergraphs. A strong chromatic number χ(H) > n obstructs only the former. This is made explicit in dimension 3 by two hypergraphs both having χ = 4: a completed 25-ray Yu–Oh configuration that admits an explicit faithful orthogonal representation in R^{3} (vectors given in (2)–(3)), and Greechie’s G_{32}, which possesses a separating unital set of two-valued states yet admits no faithful orthogonal representation in C^{3} (Theorem 6). The obstruction for G_{32} is projective-geometric: incidence forces distinct atoms onto the same ray.

Significance. The result cleanly distinguishes three independent layers of structure relevant to the Kochen–Specker theorem and quantum contextuality: strong chromatic number, the supply of two-valued states, and ray realizability. If correct, it prevents conflating global spectral-labeling failures with genuine geometric non-coordinatizability. Strengths include fully explicit, parameter-free constructions (the 25 vectors of the completed Yu–Oh hypergraph and the elementary algebraic collapse proof of Theorem 6 that tracks conjugations via the projection identity (8) and never invokes chromatic number). Both examples are hand- or computer-algebra-verifiable, rendering the independence claim immediately checkable and usable by the community.

minor comments (4)
  1. Sec. VI B asserts without an edge list or external citation that the dual incidence graph of G_{32} is exactly the Petersen graph. While the paper already supplies an independent strong 4-coloring (7) and the non-coordinatizability proof is independent of χ, a one-sentence verification or reference would remove any residual doubt about the chromatic-index argument.
  2. Sec. V: the claim that the original Yu–Oh 13-ray orthogonality graph is not 3-colorable is sketched by case analysis and referred to Ref. [3]. Expanding the sketch by one or two sentences (or noting that the supplied 4-coloring of the completion already implies the result) would make the section fully self-contained.
  3. Minor typographical issues appear throughout (e.g., missing spaces such as “vectorr i”, “Greechie’sG 32”, and the broken heading “COORDINA TIZA TION”). These are easily cleaned in production.
  4. Eqs. (2)–(3) list unnormalized vectors; a parenthetical remark that any overall complex phase may be chosen freely (as rays are considered) would forestall a possible pedantic objection.

Circularity Check

2 steps flagged

Minor non-load-bearing self-citations for chromatic numbers of the two examples; central independence claim and geometric non-existence proof are fully self-contained and parameter-free.

specific steps
  1. self citation load bearing [Sec. V (completed Yu–Oh chromatic number)]
    "But the Yu–Oh orthogonality graph is not 3-colorable; the elementary case analysis is the one given in Ref. [3]. Briefly, after fixing the color of h0, the three vertices y−1,y−2,y−3 must use only the two remaining colors. Up to symmetry there are two cases. In both cases the forced colors on the coordinate vertices and on the adjacent y+i vertices leave one of h1,h2,h3 with no available color."

    Non-3-colorability of the underlying 13-ray graph is justified by citation to the author's own prior paper [3]. The present text supplies only a brief sketch rather than a fully independent proof. However the citation is not load-bearing for the paper's main claim: an explicit strong 4-coloring is given, the faithful orthogonal representation is constructed from scratch with concrete vectors, and the independence result only needs χ=4 (which is exhibited) together with the existence of the FOR.

  2. self citation load bearing [Sec. VI B (G32 chromatic number)]
    "This agrees with the previous chromatic analysis of G32 in Ref. [2]."

    The numerical value χ(G32)=4 is said to agree with the author's earlier joint work [2]. The present paper nevertheless supplies an independent dual-graph argument (dual is the Petersen graph, whose chromatic index is classically 4) and an explicit strong 4-coloring (7). The citation is therefore confirmatory rather than load-bearing; the geometric non-coordinatizability proof (Theorem 6) never uses the chromatic number at all.

full rationale

The paper's core result (Proposition 5 and Theorem 6) is the logical independence of strong chromatic number from the existence of a faithful orthogonal representation. This is established by two explicit, hand-checkable constructions: (i) the completed 25-ray Yu–Oh hypergraph with concrete vectors (2)–(3) realizing every triad as an orthogonal basis in R^{3} together with an explicit strong 4-coloring (4)–(5), and (ii) the elementary algebraic collapse argument for Greechie G_{32} that never mentions chromatic number. The only self-citations are to the author's prior chromatic analyses ([2],[3]) for the claim that three colors do not suffice; even these are accompanied by independent sketches (dual = Petersen for G_{32}; brief case analysis for Yu–Oh) and by the paper's own 4-colorings. No fitted parameters, no definitional tautologies, no uniqueness theorems imported as external facts, and no renaming of known results appear. The derivation chain is therefore self-contained against external benchmarks; the self-citations are ordinary background and do not force the separation claim.

Axiom & Free-Parameter Ledger

0 free parameters · 3 axioms · 0 invented entities

The argument rests entirely on standard finite-dimensional linear algebra over C (or R) and on the combinatorial definition of orthogonality hypergraphs. No free parameters are fitted; no new physical entities are postulated. The only domain-level assumptions are the usual identification of contexts with orthonormal bases and the minimal faithfulness requirement that distinct vertices receive distinct rays.

axioms (3)
  • standard math Inner product on C³ is conjugate-linear in the first argument and linear in the second; orthonormal bases exist and can be unitarily rotated to the standard basis.
    Used throughout the parametrization and projection identity of Theorem 6.
  • domain assumption An n-uniform orthogonality hypergraph models collections of n mutually orthogonal rays in an n-dimensional Hilbert space.
    Stated in the Introduction and Definitions; standard in the Kochen–Specker literature.
  • domain assumption Faithfulness of an orthogonal representation requires only that distinct vertices map to distinct rays.
    Explicitly adopted as the minimal distinctness condition for the negative result (Theorem 6).

pith-pipeline@v1.1.0-grok45 · 12691 in / 2152 out tokens · 37991 ms · 2026-07-11T20:19:49.005330+00:00 · methodology

0 comments
read the original abstract

We establish a strict logical separation between two distinct phenomena in orthogonality hypergraphs: chromatic completeness, the possibility of assigning a single globally consistent nondegenerate spectrum to all contexts, and geometric coordinatizability, the existence of a faithful orthogonal representation by rays. A strong chromatic number larger than the Hilbert-space dimension obstructs only the former. It does not, by itself, obstruct the existence of a faithful orthogonal representation. We make this separation explicit by comparing two three-dimensional examples with the same strong chromatic number. A completed 25-ray version of the Yu-Oh configuration has strong chromatic number four and nevertheless possesses an explicit faithful orthogonal representation in R^3. Conversely, Greechie's G_{32} hypergraph also has strong chromatic number four, and has a separating and unital set of two-valued states, but we give an elementary algebraic proof that it admits no faithful orthogonal representation in C^3. The obstruction in G_{32} is therefore not chromatic but projective-geometric: the incidence relations force two distinct atoms to collapse onto the same ray.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

8 extracted references · 5 linked inside Pith

  1. [1]

    Kochen and E

    S. Kochen and E. P. Specker, The problem of hidden vari- ables in quantum mechanics, Journal of Mathematics and Mechanics (now Indiana University Mathematics Journal) 17, 59 (1967)

    1967

  2. [2]

    M. H. Shekarriz and K. Svozil, Noncontextual coloring of orthogonality hypergraphs, Journal of Mathematical Physics63, 032104 (2022), arXiv:2105.08520

    Pith/arXiv arXiv 2022

  3. [3]

    Svozil, Chromatic quantum contextuality, Entropy27, 387 (2025), arXiv:2501.15261

    K. Svozil, Chromatic quantum contextuality, Entropy27, 387 (2025), arXiv:2501.15261

    Pith/arXiv arXiv 2025

  4. [4]

    Yu and C

    S. Yu and C. H. Oh, State-independent proof of Kochen- Specker theorem with 13 rays, Physical Review Letters 108, 030402 (2012), arXiv:1109.4396

    Pith/arXiv arXiv 2012

  5. [5]

    Harding and R

    J. Harding and R. Salinas Schmeis, Remarks on orthogo- nality spaces, International Journal of Theoretical Physics 64, 211 (2025), arXiv:2505.13871 [math-ph]

    Pith/arXiv arXiv 2025

  6. [6]

    Cabello, Simplest kochen-specker set, Physical Review Letters135, 190203 (2025), arXiv:2508.07335 [quant-ph]

    A. Cabello, Simplest kochen-specker set, Physical Review Letters135, 190203 (2025), arXiv:2508.07335 [quant-ph]

    arXiv 2025

  7. [7]

    Navara and K

    M. Navara and K. Svozil, Construction of Kochen- Specker sets from mutually unbiased bases (2025), arXiv:2509.08636 [quant-ph]

    Pith/arXiv arXiv 2025

  8. [8]

    R. J. Greechie, Orthomodular lattices admitting no states, Journal of Combinatorial Theory. Series A10, 119 (1971)

    1971