Sasaki Hook

Origin. Usa Sasaki, "Orthocomplemented lattices satisfying the exchange axiom" (1954), where the projection appeared; Finch (1970) and Mittelstaedt (1972) proposed it as the quantum conditional; Gary Hardegree, "The conditional in quantum logic" (1975) and "Material implication in orthomodular lattices" (1979), gave the argument that it is the one. Herman, Marsden, and Piziak (1975) classified the alternatives.

Models. Orthomodular lattices have no material conditional: a⊥ ∨ b fails the property one wants, since a ∧ (a⊥ ∨ b) ≤ b holds only in the distributive case. There are exactly five polynomial candidates satisfying the minimal requirement that a → b = 1 iff a ≤ b, and the Sasaki hook is the one that survives the further conditions — which is why quantum logic has a conditional at all, and why it is not the classical one.

Formalism.

The hook: a →_S b = a⊥ ∨ (a ∧ b)

The projection: φ_a(b) = a ∧ (a⊥ ∨ b) In Hilbert space: φ_a is the orthogonal projection onto the subspace a, applied to b.

Residuation — the reason it is the right connective: φ_a(b) ≤ c iff b ≤ a →_S c The Sasaki projection is left adjoint to the Sasaki hook. Orthomodular lattices are, in this sense, residuated — with a non-monotone product.

Modus ponens: a ∧ (a →_S b) ≤ b holds in every orthomodular lattice. This is equivalent to orthomodularity, so the connective and the lattice condition are the same fact.

The five candidates (Kotas 1967, Hardegree): Each polynomial p(a,b) with p(a,b) = 1 iff a ≤ b. They coincide exactly on the distributive lattices — that is, in classical logic all five are material implication. Hardegree's criteria (Birkhoff–von Neumann conditional, the counterfactual reading, the Sasaki adjunction) select →_S uniquely.

What fails: Import-export: a →_S (b →_S c) ≠ (a ∧ b) →_S c Transitivity of →_S fails. Contraposition fails. The deduction theorem holds for a single premise and not in general (Malinowski 1990).

Symbols.

Metatheory. The adjunction φ_a ⊣ (a →_S −) is what makes the Sasaki hook the quantum conditional rather than one of five: it is the residual, and residuation is what an implication is in every other algebraic setting in this collection. That modus ponens for →_S is equivalent to orthomodularity is the second half of the case — the lattice condition Birkhoff and von Neumann imposed on physical grounds turns out to be exactly the condition for the conditional to detach. Malinowski's negative results on the deduction theorem bound what the connective can do: quantum logic is algebraizable through it, and the deduction theorem is not recovered in full.

Applies to. Quantum logic's conditional and the counterfactual reading of measurement. Orthomodular lattice theory. The algebraizability of quantum logic. Quantum computation's assertion logics, where the Sasaki adjunction supplies the weakest precondition.

Limitations. Import-export, transitivity, and contraposition all fail, so the hook supports almost none of the reasoning a conditional is wanted for — chaining two quantum conditionals is not licensed. Hardegree's uniqueness argument depends on the criteria chosen, and the other four polynomials have had their defenders. And the physical interpretation is contested at the root: whether a →_S b says anything about a quantum system, or is an artifact of insisting that the lattice carry a conditional, is the question the quantum-logic programme never settled.

© 2026 Lingenic LLC