Pith. sign in

REVIEW 2 major objections 5 minor 3 cited by

Remarks on orthogonality spaces

T0 review · 2 major / 5 minor · reviewed 2026-08-15 · deepseek-v4-flash

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

Pith's one-line read A finite orthogonality configuration exists over $\mathbb{C}^3$ but not $\mathbb{R}^3$, and every finite graph is realized by a finite orthomodular lattice.

desk verdict The finite-oml embedding theorem is solid, but the C^3/R^3 separating-graph result rests on a false complex cross-product lemma and is unproven as written. read the letter →

arxiv 2505.13871 v1 pith:S7ZNCTSQ submitted 2025-05-20 math-ph math.FAmath.MP

John Harding , Remi Salinas Schmeis This is my paper · ORCID
classification math-phmath.FAmath.MP MSC 06C1581P0581P10
keywords orthomodularposetlatticeorthogonalityspacemutuallyunbiasedbasesgraphembeddingGreechiediagramsubgraph
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

Orthogonality spaces record which one-dimensional subspaces of a Hilbert space are perpendicular to which. This paper aims to establish two claims. First, a finite configuration of rays built around mutually unbiased bases can be embedded into the orthogonality space of $\mathbb{C}^3$ but not into that of $\mathbb{R}^3$: complex 3-space can hold two rays that are each at equal angle to all three members of a basis and are orthogonal to each other, while real 3-space cannot. Second, every finite graph can be fully embedded into the orthogonality graph of a finite orthomodular lattice, and every graph whatsoever into some atomic orthomodular lattice. These results matter because they show that simple orthogonality data can encode both a coordinate-field distinction and arbitrary finite combinatorics.

What carries the argument

Greechie diagram: a graph determined by its maximal cliques, which for $\mathcal{P}(\mathbb{R}^3)$ and $\mathcal{P}(\mathbb{C}^3)$ are triples of pairwise orthogonal rays. The load-bearing device for the first result is a cross-product formula used to generate all rays of the center diagram; the diagram occurs exactly when the three inner products $\langle c_1,b_{23}\rangle$, $\langle c_2,b_{13}\rangle$, and $\langle c_3,b_{12}\rangle$ are all zero, which for nonzero $x,y,z$ is equivalent to $|x|=|y|=|z|$. For the second result the machinery is a powerset construction that makes the image of an element lie under the join of a set of images only when the element is in that set, the coatom-extension construction that adds a new atom beneath a chosen nonzero element, and an induction that turns graph adjacency into atom orthogonality; compactness then extends the finite theorem to arbitrary graphs.

What would settle it

Evaluate the paper's Lemma 2.2 at $\mathbf{u}=(1,i,0)$ and $\mathbf{v}=(0,0,1)$: the formula gives $\mathbf{u}\times\mathbf{v}=(i,-1,0)$, and the Hermitian inner product with $\mathbf{u}$ is $\langle (i,-1,0),(1,i,0)\rangle=2i\ne 0$, so the asserted orthogonality fails as stated. The second theorem, on finite orthomodular lattices, does not use this lemma.

Watch

Extended reading notes

Core claim

On its own terms, the paper's first claim is that the orthogonality graph of $\mathcal{P}(\mathbb{C}^3)$ contains a finite Greechie diagram — two copies of a 'center' configuration glued along their circular rims, with the two centers orthogonal — that the orthogonality graph of $\mathcal{P}(\mathbb{R}^3)$ does not contain. The second claim is that for any finite loopless graph $G$ there is a finite orthomodular lattice whose atom orthogonality graph contains $G$ as an induced subgraph, and by a compactness argument every graph occurs as an induced subgraph in some atomic orthomodular lattice. Along the way the paper characterizes the central configuration: a ray $\langle x,y,z\rangle$ is a center for the standard basis exactly when $|x|=|y|=|z|$, i.e. exactly when it is unbiased with respect to that basis. This is what lets a pair of mutually unbiased bases in $\mathbb{C}^3$ produce two orthogonal centers, a configuration impossible over $\mathbb{R}^3$.

Load-bearing premise

The first result's load-bearing premise is that the paper's complex cross-product formula always produces a nonzero vector perpendicular to both input vectors; the center characterization and the $\mathbb{C}^3$-vs-$\mathbb{R}^3$ separation depend on that single claim.

Editorial extensions

If this is right

  • The orthogonality space of $\mathbb{C}^3$ is not graph-theoretically identical to that of $\mathbb{R}^3$: a single finite, coordinate-free configuration witnesses the difference.
  • Unbiasedness with respect to an orthonormal basis is detectable from orthogonality alone, since it is equivalent to the occurrence of the center diagram.
  • Every finite graph is realizable as the orthogonality graph of atoms of a finite orthomodular lattice, so finite quantum-logical structures are universal for finite graphs.
  • Every graph, including uncountable ones, appears as an induced subgraph of the orthogonality graph of some atomic orthomodular lattice.
  • The finite-graph realization is produced by an explicit induction, so for any finite graph one can in principle write down a finite orthomodular lattice that realizes it.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Editorial extension: the center/unbiasedness equivalence suggests that similar finite diagrams could serve as coordinate-free graph-theoretic probes for the existence of mutually unbiased bases in other dimensions and fields.
  • Editorial extension: because the second construction is purely order-theoretic and independent of Hilbert-space coordinates, the same compactness route may realize other first-order configurations of atoms inside atomic orthomodular lattices.
  • Editorial extension: if the first theorem can be restated without reliance on the complex cross-product lemma, it would supply a small explicit graph separating complex from real dimension-three quantum logics, potentially useful as a dimension witness.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 5 minor

Summary. The manuscript contains two independent results. The first constructs a finite Greechie diagram from two copies of a configuration based on mutually unbiased bases and claims it embeds into the orthogonality graph of P(C^3) but not into that of P(R^3); the proof relies on a 'cross product' in C^3 (Definition 2.1) and on Lemmas 2.2 and 2.3 asserting that this product is Hermitian-orthogonal to both factors. The second result shows that every finite graph can be strongly embedded into the orthogonality graph of a finite orthomodular lattice (Theorem 3.3) via a sequence of lemmas using powersets and Kalmbach's coatom extension, and uses compactness to extend this to every graph into an atomic orthomodular lattice (Corollary 3.8).

Significance. The intended first result is a concrete finite combinatorial separation between the orthogonality spaces of complex and real 3-dimensional quantum logics, which would be a valuable addition. The second result provides a finite-dimensional version of the Tau-Tserunyan embedding theorem and appears to be a genuine contribution if the lemmas in Section 3 are correct. The paper is clearly organized and the algebraic constructions with the powerset and the coatom extension are elegant. However, the cross-product lemma that drives the first result is false as stated, and Corollary 3.8 omits a necessary definitional axiom; these issues affect the two central claims as written.

major comments (2)
  1. [§2, Definition 2.1, Lemma 2.2] Lemma 2.2 is false for C^3 under the Hermitian inner product used in Definition 2.4. For u=(1,i,0) and v=(0,0,1), the product defined in Definition 2.1 gives u×v=(i,-1,0), and ⟨u×v,u⟩=2i (up to the convention for which argument is conjugated), not 0. Consequently the vector identities in Lemma 2.3 do not produce the orthogonalities claimed in Figure 1, and the reduction in Theorem 2.5 to the three conditions c1⊥b23, c2⊥b13 and c3⊥b12 is invalid. For the two centers used in the proof of Theorem 2.6, namely (1,1,1) and (1,ω,ω^2), the vector c1=(0,z,-y) is not Hermitian-orthogonal to b1=(0,y,z) unless z times conjugate(y) equals y times conjugate(z); for (y,z)=(ω,ω^2) this inner product is ω - ω^2, which is not 0. Thus the asserted realization of Figure 2 as a sub-Greechie diagram of P(C^3) fails for the specified vectors, and Theorem 2.6 is unsupported as written. The construction may be repairable by using a conjugate cross product such as conjugate(u)×v and recomputing the vector table, but the current argument does not go through.
  2. [§3, Corollary 3.8] The first-order language introduces a binary predicate E for edges, but the theory Σ does not contain a sentence linking E to the orthogonality relation of the oml, for instance E(x,y) iff x ≤ y′. The sentences E(c_u,c_v) and ¬E(c_u,c_v) constrain E only on the constants naming the vertices. A compactness model can therefore interpret E arbitrarily on other pairs of elements, and even on the constants the connection between E and the orthogonality relation of the oml is not enforced. Without such a definitional axiom, the conclusion that G is strongly embedded into the orthogonality graph of an atomic oml does not follow. Adding the axiom E(x,y) iff x ≤ y′ to Σ repairs the proof, since every finite subset can then be modeled by Theorem 3.3 with E interpreted as orthogonality.
minor comments (5)
  1. [§3, after Theorem 3.1] The sentence 'we will not reproduce this in detail here since it is not as pertinent to our investigation, but only provide a brief a brief sketch' contains a duplicated 'a brief'.
  2. [§3, Corollary 3.8 proof] The name 'Tao and Tserunyan' should be 'Tau and Tserunyan' to match the reference and the rest of the paper.
  3. [§3, Lemma 3.5] The displayed property (2) is dimensionally inconsistent as printed: the upset of a in M intersected with L is a subset of L, while the upset of e in M is a subset of M. The intended statement is presumably that the intersection equals the upset of e in L, which is the form used in Lemmas 3.6 and 3.7.
  4. [§3, Lemma 3.7 proof] In the sentence 'obtain a finite oml N with M≤N and a∈N\M such that a is an atom of M', the phrase 'atom of M' should read 'atom of N', since a is explicitly outside M.
  5. [§3, proof of Theorem 3.3] After defining the map h by h(x_i)=a_i, the sentence 'Then f is one-one' should refer to h rather than f.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity found: the derivation chain is self-contained and uses external mathematical facts; the cross-product flaw is a correctness concern, not a circularity.

full rationale

The paper does not fit parameters to data and then predict fitted quantities. Its first result constructs a Greechie diagram through explicit vector formulas and cross products, then uses the externally known existence of two mutually unbiased bases in C^3 and their nonexistence in R^3 to show that the diagram embeds in P(C^3) but not in P(R^3). The equivalence in Theorem 2.5 between being a 'center' and being unbiased is established by direct inner-product computation, not by defining one notion in terms of the other. The second result builds on standard external ingredients: Tau and Tserunyan's graph-realization theorem, Kalmbach's coatom extension, and first-order compactness. Lemma 3.4 and Lemma 3.5 are explicit lattice-theoretic constructions, and Lemma 3.7 is an induction using those constructions. No load-bearing step is justified solely by a self-citation: the references are to Kalmbach, Greechie, Ptak-Pulmannova, and Tau-Tserunyan, none of which are by the present authors. The serious mathematical error in Lemma 2.2, where the defined complex cross product is not Hermitian-orthogonal to its factors, undermines the proof of the C^3 half of Theorem 2.6, but an incorrect calculation is not circularity: the derivation does not assume its conclusion. The paper is self-contained against external benchmarks and contains no definitional reduction of a predicted result to an input. Therefore the circularity score is 0.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

No free parameters or invented physical entities are present. The paper's first result depends on a false premise about the complex cross product; the second relies on standard lattice-theoretic constructions and compactness. The missing E-definition in Corollary 3.8 is a proof gap, not an axiom.

assumptions (5)
  • domain assumption The complex cross product u×v is Hermitian-orthogonal to u and v in C^3.
    Used in Lemma 2.2 and in the vector assignments of Lemma 2.3 to build the orthogonality diagram. It is false under the standard Hermitian inner product, so the first result is invalid as written.
  • standard math Kalmbach's coatom extension exists and behaves as stated for finite orthomodular lattices.
    Cited to Kalmbach [3, p.310] and used in Lemmas 3.5, 3.6, and 3.7 to insert new atoms with prescribed upsets.
  • domain assumption Mutually unbiased bases exist in C^3, and no pair exists in R^3.
    Well-known fact used in the proof of Theorem 2.6 to place two orthogonal centers in C^3 and to rule out the configuration in R^3.
  • standard math The first-order compactness theorem for arbitrary signatures.
    Used in Corollary 3.8 to pass from finite embeddability to the existence of an atomic oml for an arbitrary graph.
  • standard math Greechie's paste job produces the coatom extension.
    Cited to Kalmbach and Greechie [4] as the construction underlying Lemma 3.5.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Remarks on orthogonality spaces." pith.science (2026). https://pith.science/paper/S7ZNCTSQ

@misc{pith2026250513871,
  author       = {Pith},
  title        = {Pith review of: Remarks on orthogonality spaces},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/S7ZNCTSQ}},
  note         = {Machine review of arXiv:2505.13871}
}
abstract

We provide two results. The first gives a finite graph constructed from consideration of mutually unbiased bases that occurs as a subgraph of the orthogonality space of $\mathbb{C}^3$ but not of that of $\mathbb{R}^3$. The second is a companion result to the result of Tau and Tserunyan \cite{Tau} that every countable graph occurs as an induced subgraph of the orthogonality space of a Hilbert space. We show that every finite graph occurs as an induced subgraph of the orthogonality space of a finite orthomodular lattice and that every graph occurs as an induced subgraph of the orthogonality space of some atomic orthomodular lattice.

Figures

Figures reproduced from arXiv: 2505.13871 by the authors.

Figure 1
Figure 1. A partial configuration a1 = ⟨1, 0, 0⟩ b1 = ⟨0, y, z⟩ c1 = ⟨0, z, −y⟩ d1 = ⟨−yy − zz, xy, xz⟩ a2 = ⟨0, 1, 0⟩ b2 = ⟨x, 0, z⟩ c2 = ⟨z, 0, −x⟩ d2 = ⟨xy, −xx − zz, yz⟩ a3 = ⟨0, 0, 1⟩ b3 = ⟨x, y, 0⟩ c3 = ⟨y, −x, 0⟩ d3 = ⟨xz, yz, −xx − yy⟩ b12 = ⟨yz, xz, −xy⟩ b112 = ⟨xyy + xzz, −yzz, yyz⟩ b212 = ⟨−xzz, xxy + yzz, xxz⟩ b13 = ⟨yz, −xz, xy⟩ b113 = ⟨xyy + xzz, yzz, −yyz⟩ b313 = ⟨−xyy, xxy, xxz + yyz⟩ b23 = ⟨−yz, xz, xy⟩ b223 … view at source ↗
Figure 2
Figure 2. Diagram for ⟨u⟩ to be a center of the block of ⟨a1⟩, ⟨a2⟩, ⟨a3⟩. 5 [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Chromatic Completeness and the Independence of Geometric Obstruction

    quant-ph 2026-07 accept novelty 7.0 of 10

    Strong chromatic number exceeding dimension blocks only chromatic completeness, not faithful orthogonal ray representations; completed Yu–Oh has χ=4 with an R³ FOR while Greechie G₃₂ has χ=4 with none in C³.

  2. Construction of Kochen-Specker Sets from Mutually Unbiased Bases

    quant-ph 2025-09 conditional novelty 6.0 of 10

    A systematic MUB-based enumeration yields a 69-ray 50-context KS nucleus unifying known constructions, plus forcing gadgets in D=4 and D=5 that enforce maximal unbiasedness.

  3. Faithful real embedding of a three-dimensional complex Kochen-Specker configuration

    quant-ph 2025-11 conditional novelty 4.0 of 10

    Any finite set of complex 3D rays can be phase-adjusted to embed faithfully in real 6D, and the Cabello 165-ray KS set becomes colourable there.

Reference graph

Works this paper leans on

7 extracted references · 7 canonical work pages · cited by 3 Pith papers

  1. [1]

    Birkhoff and J

    G. Birkhoff and J. von Neumann, J.: The logic of quantum mechanics. Ann. of Math. 37, 823–843 (1936)

    work page 1936

  2. [2]

    Crawley and R

    P. Crawley and R. P. Dilworth, Algebraic theory of lattices , Prentice-Hall, 1973

    work page 1973

  3. [3]

    Kalmbach, Orthomodular lattices , London Math

    G. Kalmbach, Orthomodular lattices , London Math. Soc. Monogr., 18 Academic Press, 1983

    work page 1983

  4. [4]

    R. J. Greechie, On the structure of orthomodular lattices satisfying the chain condition , J. Combinatorial Theory, 4, 210-218, (1968)

    work page 1968

  5. [5]

    Pt\'ak and S

    P. Pt\'ak and S. Pulmannov'a, Orthomodular structures as quantum logics , Fundamental Theories of Physics, 44, Kluwer Academic Publishers Group, Dordrecht, 1991

    work page 1991

  6. [6]

    Bure s ov\' a , K

    D. Bure s ov\' a , K. Hou s kov\' a , M. Navara, P. Pt\' a k, M. Slouka, and J. S evic, Reichenbach's common cause completeness of quantum probability spaces , manuscript

    work page

  7. [7]

    Tau and A

    T. Tau and A. Tserunyan, Realization of graphs in Hilbert space , www.math.mcgill.ca/atserunyan/ Research_notes/Hilbert_space_graph_realizations.pdf

    work page

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.