Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-22
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.

Character and cocharacter lattices

Definition

Let T be a torus, i.e. a compact connected abelian Lie group. Write S1=R/Z for the circle group.

  • The character lattice of T is X(T):=Hom(T,S1), the group of continuous (equivalently smooth) group homomorphisms TS1, with pointwise multiplication.
  • The cocharacter lattice of T is X(T):=Hom(S1,T), the group of continuous group homomorphisms S1T, with pointwise multiplication.
  • Pairing. For χX(T) and ηX(T) the composite χη:S1S1 is a continuous homomorphism; every such homomorphism has the form zzn for a unique nZ, and the pairing is χ,η:=n,whereχ(η(z))=zn. The pairing is biadditive in χ and η.

The identity element of either lattice is the trivial homomorphism; the inverse of χ is the character tχ(t)1 for tT and is written χ1, while the inverse of η is the cocharacter zη(z)1 and is written η1. Both lattices are abelian groups.

Remarks

  • Both lattices are finitely generated free abelian groups: for T(S1)r one has X(T)Zr and X(T)Zr, and the pairing becomes the standard dot product in the dual coordinates. This is proved on this page by differentiating characters; the definition itself asserts no freeness.
  • The duality between X and X is perfect: a character is trivial exactly when it pairs to zero with every cocharacter and a cocharacter is trivial exactly when it pairs to zero with every character. This is proved with the differentiation theorem on this page.
  • In the following, characters of a maximal torus T are written multiplicatively, and the integer n of the pairing is the weight of the cocharacter; the roots of (G,T) are characters, so they pair integrally with the cocharacters supplied by the compact root SU(2) subgroups.

Used by

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources