Skip to content

An orthomodular lattice is an orthocomplemented lattice in which a proposition containing another can be decomposed into that proposition and an orthogonal remainder. Hilbert-space projection lattices satisfy this law even though they need not be distributive. The weaker identity captures one aspect of quantum-event geometry.

Helpful background. Projection Lattices defines meet, join, order, and orthocomplement.

An orthocomplementation reverses order, obeys (P⊥)⊥=P(P^\perp)^\perp=P, and satisfies P∧P⊥=0P\wedge P^\perp=0 and P∨P⊥=IP\vee P^\perp=I. Orthomodularity adds

P≤Q⟹Q=P∨(Q∧P⊥).P\leq Q \quad\Longrightarrow\quad Q=P\vee(Q\wedge P^\perp).

The hypothesis P≤QP\leq Q is essential. The identity does not hold with an arbitrary PP substituted into a distributive decomposition of every QQ.

For closed Hilbert subspaces M⊆NM\subseteq N, every v∈Nv\in N has a unique decomposition v=PMv+(v−PMv)v=P_Mv+(v-P_Mv). The first term lies in MM and the second in N∩M⊥N\cap M^\perp. Hence

N=M⊕(N∩M⊥),N=M\oplus(N\cap M^\perp),

which proves the orthomodular identity for their projections.

Let NN be the plane spanned by e1,e2e_1,e_2 in C3\mathbb C^3, and let MM be the line spanned by e1e_1. The orthogonal remainder is the e2e_2 line. In matrices,

Q=diag⁡(1,1,0),P=diag⁡(1,0,0),Q−P=diag⁡(0,1,0).Q=\operatorname{diag}(1,1,0),\qquad P=\operatorname{diag}(1,0,0),\qquad Q-P=\operatorname{diag}(0,1,0).

Now replace MM by a line outside NN. There is no inclusion hypothesis and the argument no longer applies. This provides a practical way to detect misuse of the law: first check the order relation.

Every Boolean lattice is orthomodular, so orthomodularity does not by itself imply nonclassicality. Conversely, abstract orthomodular lattices need not all be projection lattices of complex Hilbert spaces.

Representation theorems require further hypotheses about atoms, dimension, continuity, or covering properties, depending on the theorem. Even obtaining a Hilbert-space-like geometry may leave the scalar field and dynamics unspecified. Reconstruction programs should therefore be compared by complete assumption lists.

In infinite-dimensional Hilbert space, the closed-subspace lattice remains orthomodular, while unrestricted modular identities can fail. Closure and domain issues should not be suppressed by extrapolating finite-dimensional vector-space arguments.

Show why a Boolean distributive lattice with an orthocomplement satisfies the orthomodular identity.

Solution

If P≤QP\leq Q, then Q∧P=PQ\wedge P=P. Distributing Q∧(P∨P⊥)Q\wedge(P\vee P^\perp) gives Q=(Q∧P)∨(Q∧P⊥)=P∨(Q∧P⊥)Q=(Q\wedge P)\vee(Q\wedge P^\perp)=P\vee(Q\wedge P^\perp). Thus orthomodularity is compatible with classical event logic and cannot alone distinguish it from quantum logic.

  • Birkhoff, Garrett, and John von Neumann, “The logic of quantum mechanics,” Annals of Mathematics 37, 823–843 (1936). Original paper.
  • Piron, Constantin, “Axiomatique quantique,” Helvetica Physica Acta 37, 439–468 (1964) — an early representation program with assumptions beyond orthomodularity. Journal archive.