Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Self-dual simple cyclotomic modules give the upper global basis

Statement

Assume the Axiom of Choice (The Axiom of Choice), inherited through the lower projective, canonical crystal, restricted-dual and global-basis duality suppliers.

In exactly the symmetric normalized-di=1, characteristic-zero, loopless arbitrary-multiedge geometric-parameter regime of the lower projective theorem, the CANONICAL restricted-dual identification Ψcan:G0(RΛ)→VA(Λ)∨ maps normalized Dψ-self-dual simple classes bijectively to the upper global basis, form-dual to the lower projective basis under the actual highest-weight contravariant form. A simple and its normalized projective COVER have the same B(Λ) label; this is the cover/simple correspondence, not projective Hom duality applied to a simple. Canonical G0 operators have the same projective normalization. The alternative KK module action remains valid, but its intertwiner is ΨKK=qdef⁡Λ(β)Ψcan on root β and sends a simple to that defect-rescaled upper vector. The unrescaled upper-basis claim is made only for Ψcan.

Facts & Assumptions

Given: Assume the Axiom of Choice. The geometric-parameter regime of the lower projective theorem, the normalized Dψ-self-dual simples and normalized covers, and the two restricted-dual identifications.

[F1]

The quotient-cover pairing (Cyclotomic projective covers and dualities descend through the quotient): T(P(S),S′)=δS,S′ in normalized bases.

[F2]

The lower projective theorem (Self-dual indecomposable cyclotomic projectives give the lower global basis): ϕ(P(S)) is the lower global vector with the same crystal label.

Proof

Proof technique: pair the normalized simple functional against the lower basis, identify it with the form-dual lower functional, and apply the upper/lower duality theorem; then compare the two normalizations.

1.1F1F2

The functional Ψcan(S). By [F1] the pairing is diagonal in normalized bases, and by [F2] the class ϕ(P(S)) is the lower global vector with the same crystal label; therefore Ψcan(S) is exactly the weightwise dual lower-basis functional with that label.

2.1step 1.1F3

Identification with the upper global basis. The integral projective identification [F3] identifies the tensor form on projectives with the actual highest-weight contravariant form; the upper/lower duality theorem identifies these restricted dual functionals with the upper global vectors and preserves crystal labels. This proves the bijection and the normalization statements, using neither a generic negative-half form nor a vector-dual trace shift.

3.1step 2.1F2F3∎

Cover/simple correspondence and the two actions. A simple and its normalized projective cover have the same B(Λ) label by the cover/simple correspondence of [F2], not by applying projective Hom duality to a simple. The G0 theorem [F3] proves the canonical action and its defect-rescaled KK version; keeping the two maps distinct preserves both sound quantum actions and the rank-one λ=2 check, with ΨKK=qdef⁡Λ(β)Ψcan on root β, so that only Ψcan gives the unrescaled upper-basis claim. The Axiom of Choice is inherited through the lower projective and canonical crystal suppliers, the QG-5 global-basis duality and the restricted-dual identifications of [F2] and [F3].

Depends on

Used by

Dependency tree · two levels

53 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