Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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.

Minimal realizations exist and are unique up to isomorphism

Statement

Every finite GCM has a minimal complex realization. Any two are isomorphic preserving all indexed roots and coroots. The dimension 2nrankA is the smallest possible dimension with both families independent.

Facts & Assumptions

Given: A GCM of size n, rank r, and the row convention αj(hi)=aij.

[F1]

The indexed roots and coroots must each be independent. (Realization of a generalized cartan matrix).

Proof

1.1

Let V=Cn have basis vi, and define p0:VCn by p0(vi)=(ai1,,ain). Choose a complement C of imp0 by finite elimination. On H=VC put p(v,c)=p0(v)+c, hi=(vi,0) and αj=prjp. The map p is onto, so its coordinate functionals are independent; the hi are independent and have the prescribed evaluations. Moreover dimH=n+(nr).

givenF1
2.1

In any realization with independent roots, p:HCn, h(αj(h))j, is onto. Its restriction to V=span(hi) has rank r, so dim(H/V)nr. This proves the lower bound. At equality, kerpV, because dimkerp=nr=dimker(pV).

F1step 1.1
3.1

For two minimal realizations choose the same complement C of the common row image in Cn. Lift a basis of C to each H using surjectivity of p. The resulting linear sections s:CH give H=Vs(C): an intersection vector has image both in C and in the row image, hence zero; injectivity of p on s(C) then kills it. Dimensions give spanning. The map hihi, s(c)s(c) is invertible and commutes with p, so preserves every αj. All selections are finite Gaussian elimination.

step 1.1step 2.1F1

Sources

Source comparison: Kleshchev, Proposition 1.2.4, pp.11–12; independent row-image construction replaces a principal-minor assumption.

Depends on

Used by

Cited to discharge well-definedness by Realization of a generalized cartan matrix.

Dependency tree · two levels

2 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