Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16
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.

An endomorphism is an orthogonal projection exactly when it is idempotent and self-adjoint

Statement

An endomorphism P of a finite-dimensional inner product space is the orthogonal projection onto some subspace if and only if

P2=PandP∗=P.

In that case it is the orthogonal projection onto im⁡P, along ker⁡P=(im⁡P)⊥. The cases P=0 and P=I are included.

Facts & Assumptions

Given: An endomorphism P of a finite-dimensional inner product space.

[L1]

Orthogonal projection onto W is linear, idempotent, has image W, and has kernel W⊥ (Orthogonal projection is linear, and an orthonormal basis (ei) of W gives PWv=∑i⟨v,ei⟩ei).

[L3]

An orthogonal projection selects the subspace component in the orthogonal direct-sum decomposition (The orthogonal projection PWv is the W-component in V=W⊕W⊥).

Proof

technique · direct
1.1L1L2L3

Suppose P=PW. By [L1], P2=P. Decompose both v and w into their W and W⊥ components. Orthogonality gives ⟨Pv,w⟩=⟨Pv,Pw⟩=⟨v,Pw⟩, so uniqueness in [L2] yields P∗=P.

1.2givenalgebra

Conversely, suppose P2=P and P∗=P. Every v has the algebraic decomposition v=Pv+(I−P)v, where Pv∈im⁡P and P(I−P)v=0, so (I−P)v∈ker⁡P.

1.3L2given

If x=Pu∈im⁡P and z∈ker⁡P, then [L2] and self-adjointness give ⟨x,z⟩=⟨Pu,z⟩=⟨u,Pz⟩=0. Thus im⁡P⊥ker⁡P.

2.1step 1.2step 1.3L1L3∎

Steps 1.2 and 1.3 show that P selects the im⁡P component in the orthogonal decomposition V=im⁡P⊕ker⁡P. By [L3], P=Pim⁡P, and [L1] identifies its kernel with (im⁡P)⊥.

Depends on

Used by

Dependency tree · two levels

10 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