Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Orthogonal-Projector Reflection and Access Contract

Definition

Let H be a finite-dimensional complex-inner-product space and let Π be an orthogonal projection on H. Fix the two signs

RΠ:=2Π−I,SΠ:=I−2Π=−RΠ.

Thus RΠ acts as +I on ran⁡Π and −I on ker⁡Π; SΠ reverses those signs. They are not interchangeable inside a controlled block. For a unit vector ψ, the rank-one reflection is Rψ=2∣ψ⟩⟨ψ∣−I with the Dirac convention of Dirac Notation Conversion.

An access model counts a direct reflection as one primitive call only when that call is explicitly declared. Controlled reflection access is a separate declaration. If ∣0⟩ is a specified unit input in the same space H, the state is prepared as ψ=U∣0⟩ for a declared unitary U, and a reflection is implemented by conjugating R0=2∣0⟩⟨0∣−I, the construction is UR0U† and its cost must include the calls to U, R0, and U†. A state vector or matrix description alone implies neither an efficient reflection nor inverse access.

Remarks

The root theorem An endomorphism is an orthogonal projection exactly when it is idempotent and self-adjoint identifies an orthogonal projection as a self-adjoint idempotent. Projector Reflections Are Hermitian Unitary Involutions ↗ proves the algebraic identities for both signs; Rank-One Reflection Is Ray-Invariant and Its Signs Differ Under Control ↗ proves ray invariance and the controlled sign relation. Their actual proof inputs remain subject to cross-pair supplier reconciliation.

Depends on

Used by

Dependency tree · two levels

22 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources