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.
Characters are the integral weights
Statement
Assume the Axiom of Choice. Let be a torus with Lie algebra and exponential map , normalized so that the exponential of the circle group satisfies . Differentiation identifies the character lattice with the set through the formula ; the cocharacter lattice is identified with the lattice through , and under these identifications the pairing is In particular and are free abelian groups of rank , and the pairing is perfect.
Facts & Assumptions
Given: Assume the Axiom of Choice, a torus with Lie algebra and kernel .
The Axiom of Choice is The Axiom of Choice; it enters through the structure theorem [L1].
is surjective with kernel a full lattice , and the induced map is a Lie-group isomorphism (Structure of compact connected abelian Lie groups).
A character is a continuous homomorphism , a cocharacter a continuous homomorphism , and the pairing is the integer with (Character and cocharacter lattices).
Every continuous homomorphism from a finite-dimensional real vector space has a unique form for some . Indeed, after choosing a basis it is enough to treat a continuous homomorphism . A continuous argument with exists on a small interval. Whenever lie in a sufficiently small interval, is a continuous -valued function that vanishes at , hence is zero. The continuous local Cauchy equation gives there, and for arbitrary , choosing with in that interval gives . Combining the coordinates proves existence; uniqueness follows by restricting to each basis line. A continuous homomorphism has the form for a unique by Character and cocharacter lattices.
Proof
Let . The composite is a continuous homomorphism, so [L3] gives a unique with . Put and extend it -linearly to . If , then , so ; the map is injective because is surjective.
Choose a -basis of the full lattice . By [L1], is a Lie-group isomorphism. If is a cocharacter, each coordinate of is for a unique by [L3]. Thus, with one has and . Conversely every with gives the well-defined cocharacter . Hence is identified with , and the displayed formula also shows that .
Conversely let satisfy . Since the lattice basis in step 1.2 spans over , the restriction of to takes values in . Therefore takes values in and is well defined: if then , so . It is a continuous homomorphism , so it is a character, and its differentiated weight is ; hence the constructions are mutually inverse bijections.
Pairing: with and related as in step 1.1 and with as in step 1.2, one has , so the integer with is ; it is an integer because and , so that .
Perfectness and freeness: choosing a -basis of identifies , hence also , while the characters correspond to the dual basis: is determined by the integers , and conversely every integer vector gives such a by linear extension, because the basis spans over . Hence is free of rank , the pairing is the dot product in these coordinates, and it is perfect.
Depends on
Used by
- Character lattices of SU(2) and SO(3) Example
- Fourier series on a torus as Peter–Weyl Example
- Peter–Weyl decomposition of L2(SU(2)) Example
- Peter–Weyl gives density, not finite equality False statement
- Central quotients and intermediate character lattices Proposition
- Differentiation and integration of highest weights Proposition
- Root and weight lattice sandwich Proposition
- Compact connected Lie groups are classified by root data Theorem
- Highest weights for compact connected groups Theorem
- Weyl character formula for compact connected groups Theorem
Dependency tree · two levels
11 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
- Brian Conrad and Aaron Landesman, Compact Lie Groups (standard reference, not scraped)
- Anthony W. Knapp, Lie Groups Beyond an Introduction, 2nd ed. (standard reference, not scraped)