Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

The character lattice of a split torus

Example

Assume the Axiom of Choice. For every field k, T=Gmr has X∗(T)=Zr with trivial Galois action. A vector (n1,…,nr) represents the character (t1,…,tr)↦∏itini. A map Gmr→Gms is therefore an s-tuple of such monomials, or an integer s×r matrix, in every characteristic.

Facts & Assumptions

[A1]

Assume The Axiom of Choice; it is used through the general multiplicative-type classification, whose affineness interface uses fpqc submersiveness.

[F1]

The complete split character dictionary is Split diagonalizable groups are dual to abelian groups.

Verification

Given: r,s≥0 and a field k.

1.1F1F2algebra

The coordinate algebra is k[t1±1,…,tr±1]=k[Zr]. F1 shows that all characters are exactly its monomials; every exponent tuple occurs uniquely. These functions are defined over k, so the entire Galois action is trivial.

2.1A1F1F2step 1.1algebra∎

F1 identifies a map to Gms with a homomorphism Zs→Zr, determined by the images of the s basis vectors, giving the stated matrix and formulas. The module is torsion-free, so F2 identifies this group as a torus. The same formulas include rank zero and the unique map involving a trivial source or target as appropriate.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

12 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