Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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.

Algebraic root subgroups from root exponentials

Statement

Assume the Axiom of Choice. Let G be the connected simply connected complex semisimple affine algebraic group with maximal torus T and root system Φ fixed in Complex semisimple algebraic group, Borel, and flag variety, and let α∈Φ be a root with root space gα (Root and root space). Since gα is stable under Ad⁡(T), the torus T acts on it by a character; write α(t) for its value at t∈T, so that Ad⁡(t)(x)=α(t)x for x∈gα and the differential of that character at the identity is the functional α∈h∗.

For every nonzero eα∈gα the exponential curve z↦exp⁡G(zeα) is given by polynomial matrix coefficients, and there is an isomorphism of algebraic groups uα:Ga⟶G,uα(z)=exp⁡G(zeα), onto a closed connected one-dimensional subgroup Uα⊆G whose differential at 0 is the isomorphism C→gα, 1↦eα. The subgroup Uα is normalized by T, and t uα(z) t−1=uα(α(t)z)for all t∈T, z∈C. Replacing eα by ceα with c∈C× replaces uα by z↦uα(cz) and leaves Uα unchanged, so Uα depends only on the root α and not on the chosen root vector.

If fα∈g−α and hα satisfy [eα,fα]=hα, [hα,eα]=2eα and [hα,fα]=−2fα as in The root sl_2 triple, then the span of eα,fα,hα is a Lie subalgebra of g isomorphic to sl2; applying the construction to the opposite root −α and the vector fα gives the opposite closed subgroup U−α with Lie⁡U−α=g−α.

Facts & Assumptions

Given: the group G, its maximal torus T, the root system Φ and its root spaces as fixed in the standing definition; a root α∈Φ and a nonzero root vector eα∈gα.

[F1]

Every finite-type affine algebraic group over C admits a finite-dimensional rational representation whose comorphism is surjective, so that G is isomorphic to a closed subgroup scheme of some GL(V). (A finite-type affine algebraic group has a faithful rational representation)

[F2]

For a root α there are eα∈gα and fα∈g−α with [eα,fα]=hα, [hα,eα]=2eα and [hα,fα]=−2fα, where hα is the coroot element; the span of the three is a copy of sl2 inside g. (The root sl_2 triple)

[F3]

Every root space of a finite-dimensional complex semisimple Lie algebra with respect to a Cartan subalgebra is one-dimensional. (Root spaces of a complex semisimple Lie algebra are one-dimensional)

[F4]

Every finite-dimensional representation of a finite-dimensional semisimple Lie algebra over a characteristic-zero field is completely reducible. (Weyl's complete reducibility theorem)

[F5]

For a finite-dimensional sl2-module V≠0 the operator h acts diagonalisably with integer eigenvalues; on an irreducible V≠0 these eigenvalues are m,m−2,…,−m for some integer m≥0, each on a one-dimensional eigenspace. (Finite-dimensional representations of sl_2)

[F6]

If F:G→H is a homomorphism of finite-dimensional real Lie groups, then F(exp⁡GX)=exp⁡H(dFeX) for every X∈Lie⁡G. (Exponential map is natural for Lie-group homomorphisms)

[F8]

For λ∈h∗ the root space gλ consists of the x∈g with [H,x]=λ(H)x for all H∈h. (Root and root space)

Proof

1.1F1given

By [F1] fix a faithful finite-dimensional rational representation ρ:G→GL(V) whose comorphism is surjective and identify G with the closed subgroup scheme ρ(G)⊆GL(V); then g is a Lie subalgebra of gl(V) and dρe is the inclusion g↪gl(V), so we may regard eα∈g⊆gl(V) as an endomorphism of the finite-dimensional space V.

1.2F2F4F5algebra

The subalgebra of g spanned by eα,fα,hα is isomorphic to sl2 with standard basis (e,f,h) by [F2], so restriction makes V a finite-dimensional sl2-module; by [F4] it is a direct sum of irreducible submodules, and by [F5] the operator hα acts diagonalisably with integer eigenvalues on V and eα raises each eigenvalue by 2, while on an irreducible submodule the eigenvalue set is m,m−2,…,−m. Since V is a finite direct sum of such modules and the eigenvalues occurring are therefore bounded above and below, some positive power of eα annihilates V, that is eα is a nilpotent endomorphism of V.

2.1step 1.2construct

Because eα is nilpotent, say eαN=0, the series exp⁡(zeα)=∑k≥0zkeαk/k! is a finite sum, so each matrix entry of exp⁡(zeα) is a polynomial in z: the map z↦exp⁡(zeα) is a morphism of varieties A1→GL(V), and exp⁡(zeα) is a unipotent matrix for every z∈C.

2.2F1F6step 1.1

The closed-immersion representation ρ:G→GL(V) of step 1.1 is a homomorphism of finite-dimensional real Lie groups with dρe the inclusion g↪gl(V), so [F6] applied to X=zeα∈g gives ρ(exp⁡G(zeα))=exp⁡(zeα) for every real z; identifying G with its image in GL(V), this says that exp⁡(zeα)∈G for every real z.

3.1step 2.1step 2.2given

Choose polynomial functions f1,…,fm generating the vanishing ideal of the closed subvariety G⊆GL(V). Each composite z↦fi(exp⁡(zeα)) is a polynomial in z by step 2.1 and vanishes for every real z by step 2.2, hence is the zero polynomial; so exp⁡(zeα)∈G for every z∈C, and uα:A1→G, uα(z)=exp⁡(zeα), is a well-defined morphism of varieties.

4.1step 3.1given

The morphism uα is a group homomorphism: since [eα,eα]=0 the commuting elements zeα and weα satisfy exp⁡((z+w)eα)=exp⁡(zeα)exp⁡(weα), that is uα(z+w)=uα(z)uα(w), and uα(0)=1. Its differential at 0, computed through the closed embedding of step 1.1, sends the generator 1 of Lie⁡A1=C to eα≠0, so duα is injective.

4.2F6F8step 3.1algebra

For t∈T the conjugation map ct:G→G, ct(g)=tgt−1, is an automorphism of algebraic groups with dct=Ad⁡(t); by [F8] and the definition of the character α in the statement, Ad⁡(t) acts on gα as α(t), so [F6] applied to ct and X=zeα gives t uα(z) t−1=ct(exp⁡(zeα))=exp⁡(Ad⁡(t)(zeα))=exp⁡(α(t)zeα)=uα(α(t)z) for all t∈T and z∈C. Hence T normalizes and stabilizes Uα.

4.3F1step 1.1step 1.2step 3.1construct

Write E=dρe(eα), so EN=0 for some N≥2 by step 1.2 and E≠0 by faithfulness in step 1.1. Choose a linear functional ℓ:End⁡(V)→C with ℓ(E)=1. On all of G define the regular function r(g)=ℓ(∑j=1N−1(−1)j+1j(ρ(g)−I)j). This is a polynomial in the regular matrix entries of ρ(g). In the nilpotent algebra C[E]/(EN) the finite formal identities log⁡(exp⁡(zE))=zE hold, so r(uα(z))=ℓ(zE)=z for every z and, as a polynomial identity, for every test C-algebra. Thus r∘uα=id⁡A1 as morphisms of schemes.

5.1F1F3step 4.1step 4.3algebra

Since G is affine, the morphism r:G→A1 is separated. Its section uα, established in step 4.3, is therefore a closed immersion: the graph of the section is the inverse image of the diagonal of the separated scheme G under (id⁡G,uα∘r), and its image is exactly the equalizer of these two morphisms. Put Uα=uα(A1) with this closed subscheme structure. The restriction r∣Uα is a regular inverse to uα, so uα:Ga→∼Uα is an isomorphism of algebraic group schemes, not merely a bijection on complex points. By step 4.1 its differential takes 1 to eα, hence Lie⁡Uα=Ceα=gα by [F3].

6.1F2F6step 5.1discharge-construct∎

If eα is replaced by ceα with c∈C×, then exp⁡(zceα)=uα(cz) by the same exponential series, so the image subgroup Uα is unchanged; applying the construction of step 1.1 to the root −α and the vector fα∈g−α of [F2] produces the opposite closed subgroup U−α with Lie⁡U−α=g−α, and [F2] also gives that eα,fα,hα span a copy of sl2. The Axiom of Choice is assumed in the statement and supplies the countable-choice hypothesis for exponential naturality [F6] at steps 2.2 and 4.2; the finitely many choices of ρ, ℓ, f1,…,fm and fα add no choice principle.

Depends on

Used by

Dependency tree · two levels

46 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