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 of a split torus
Statement
Let be a split torus over , so that for a free abelian group of finite rank (Groups of multiplicative type and tori, Diagonalizable groups and their character modules). Then the character group is canonically isomorphic to , the cocharacter group is canonically isomorphic to the dual lattice , and the pairing , , defined by , is a perfect -bilinear pairing identifying with . Both lattices are free of finite rank equal to , and the identifications and the pairing commute with extension of scalars. In particular and are -vector spaces in perfect duality.
Facts & Assumptions
Given: A field , a free abelian group of finite rank, and a split torus with an isomorphism over .
The diagonalizable group has and , and characters are the homomorphisms (Diagonalizable groups and their character modules).
For abelian groups there are natural identifications , via , and (Split diagonalizable groups are dual to abelian groups).
A torus is split when it is isomorphic over to for some (Groups of multiplicative type and tori). Its coordinate ring is ; it has dimension by A polynomial ring in n variables over a field has dimension n: localization cannot increase prime-chain length, and the chain survives this localization.
Proof
By [F3] the split torus is isomorphic over to with , and by [F1]; the given isomorphism and [F2] therefore identify with . Applying [F2] to and to gives and . Both are free abelian of rank ; the identifications are induced by the anti-equivalence and are compatible with any change of the splitting isomorphism, which only renames by the induced automorphism.
For and the composite is a homomorphism, and [F1] identifies by [F2]; so is an integer and composition of homomorphisms is -bilinear. Under the identifications of step 1.1, an element of is an element and an element of is a homomorphism , and the corresponding composite is : is evaluation of the character at the cocharacter. Therefore the map , , is exactly the identity and hence an isomorphism, so the pairing is perfect and identifies with .
Let be a field extension. Base change of group algebras identifies , and [F2] applied over the field gives and with the same evaluation pairing, so the two identifications of step 1.1 commute with extension of scalars. For free lattices of finite rank the dual of a base change is the base change of the dual, so tensoring the perfect pairing of step 2.1 with exhibits and gives a perfect -bilinear pairing of with .
Depends on
Used by
- Abstract root data and their Weyl groups Definition
- Roots and root groups of a split reductive group Definition
- Split reductive groups Definition
- The root datum of a split reductive group Definition
- Weights, dominant weights and the highest-weight order of a rational representation Definition
- Central characters and descent along a central isogeny Lemma
- Dominant characters of a torus times a split semisimple group are primitive weights Lemma
- Every dominant character of a split reductive group is a highest weight Lemma
- Structure of SL₂ and root coordinates Lemma
- Cocharacter limit subgroups Theorem
- Weight subgroups of a torus action Theorem
Dependency tree · two levels
9 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
- J. S. Milne, Algebraic Groups (corrected 2022 printing, Cambridge University Press) (standard reference, not scraped)
- Florian Herzig, Linear Algebraic Groups (University of Toronto lecture notes, 2013) (standard reference, not scraped)