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.

Borel, opposite unipotent groups and root coordinates

Statement

Assume the Axiom of Choice. Let G be the connected simply connected complex semisimple affine algebraic group with maximal torus T, root system Φ and positive system Φ+ fixed in Complex semisimple algebraic group, Borel, and flag variety, and for α∈Φ+ let uα:Ga→Uα be the root subgroup constructed in Algebraic root subgroups from root exponentials. Fix a total order α1,…,αm of Φ+ compatible with heights, that is ht⁡(αi)≤ht⁡(αj) whenever i<j.

Then the following hold.

(i) The product map ∏i=1mUαi⟶G,(g1,…,gm)⟼g1g2⋯gm, is an isomorphism of varieties onto a closed connected unipotent subgroup U⊆G with Lie⁡U=n+ and dim⁡U=∣Φ+∣; explicitly (z1,…,zm)↦uα1(z1)⋯uαm(zm) is an isomorphism Am→U whose inverse is polynomial. The same statements hold for every order of Φ+ compatible with heights.

(ii) U is normalized by T, T∩U=1, and B=T⋅U=T⋉U is a closed connected solvable subgroup with Lie⁡B=b=h⊕n+ and unipotent radical U. It is maximal connected solvable: every connected solvable closed subgroup of G containing B equals B.

(iii) Repeating the construction with the negative roots produces the closed connected unipotent subgroup U− with Lie⁡U−=n− and the closed connected solvable subgroup B−=T⋅U−=T⋉U− with Lie⁡B−=h⊕n−.

(iv) The restriction of characters is an isomorphism X∗(B)→X∗(T), χ↦χ∣T.

Facts & Assumptions

Given: the group G, its maximal torus T, the root system Φ with positive system Φ+, the root subgroups Uα of Algebraic root subgroups from root exponentials, and a height-compatible order α1,…,αm of Φ+.

[F1]

For each root α and nonzero eα∈gα there is an isomorphism of algebraic groups uα:Ga→Uα, uα(z)=exp⁡G(zeα), onto a closed connected one-dimensional subgroup with Lie⁡Uα=gα, and t uα(z) t−1=uα(α(t)z) for all t∈T. (Algebraic root subgroups from root exponentials)

[F2]

For every root α there are eα∈gα and fα∈g−α with [eα,fα]=hα≠0 and [hα,eα]=2eα. (The root sl_2 triple)

[F3]

n± are nilpotent Lie subalgebras, b is a Lie subalgebra, for roots α,γ with α+γ a root one has ht⁡(α+γ)=ht⁡(α)+ht⁡(γ), and the lower central series of n+ satisfies γk(n+)⊆span⁡{gγ:γ∈Φ+,ht⁡(γ)≥k}. (Positive and negative nilpotent subalgebras and the Borel)

[F4]

For a finite-dimensional real Lie group with Lie algebra g and a chosen local logarithm there is a neighborhood W of (0,0) in g×g on which Dynkin's series converges and log⁡G(exp⁡GXexp⁡GY)=BCH⁡(X,Y). (Baker–Campbell–Hausdorff theorem)

[F5]

BCH⁡(X,Y) is the Dynkin series, a formal series of Lie polynomials in X and Y. (Baker–Campbell–Hausdorff series)

[F6]

Every morphism of classical varieties over an algebraically closed field sends constructible subsets to constructible subsets. (Chevalley: images of constructible sets are constructible)

[F7]

Every finite-type affine algebraic group over C admits a finite-dimensional rational representation whose comorphism is surjective. (A finite-type affine algebraic group has a faithful rational representation)

Proof

1.1F1F3F7givenconstruct

By [F7] fix a faithful rational closed immersion G↪GL(V). Restrict the rational representation to T≅(Gm)r. Its coaction is a finite Laurent-polynomial sum, so comparison of coefficients in the coaction identity decomposes V as the direct sum of finitely many character weight spaces Vμ. For eα∈gα and v∈Vμ, differentiating teαt−1=α(t)eα from [F1] gives eαv∈Vμ+α. Choose a real linear functional on the character lattice that is positive on every simple root, hence every positive root, and order the finitely many weights of V by its value. Every X∈n+=⨁α>0gα strictly raises this common filtration, so Xdim⁡V=0. This proves nilpotence of every sum of positive-root operators, not merely of the individual root vectors.

1.2F2F3given

The solvable subalgebra b is maximal solvable: if s⊇b is a solvable subalgebra and s≠b, then g=n−⊕b and h⊆b is ad⁡-stable, so s contains a nonzero weight component s∩gα0 with α0∈Φ−; write g−=−α0∈Φ+, so that gα0⊆s and g−α0⊆n+⊆s; by [F2] applied to the root −α0 there are e−α0∈g−α0 and f−α0∈gα0 with [e−α0,f−α0]=h−α0≠0, so s contains the copy of sl2 spanned by these three elements, contradicting solvability of s because sl2 is not solvable.

2.1F3F4F5step 1.1

By [F3] the Lie algebra n+ is nilpotent, say γc+1(n+)=0, so the Lie subalgebra generated by any two elements of n+ is nilpotent of class at most c and every Dynkin term of [F5] with more than c nested brackets vanishes identically on n+×n+; hence the series of [F4] truncates to a polynomial map P:n+×n+→n+. Applying [F4] to the real Lie group GL(V) with nilpotent elements X,Y∈n+⊆gl(V) gives exp⁡(X)exp⁡(Y)=exp⁡(P(X,Y)) on a neighborhood of (0,0); both sides are holomorphic functions of (X,Y) on the complex vector space n+×n+, so by the identity theorem the identity holds for all X,Y∈n+.

3.1F3step 2.1

Fix nonzero eαi∈gαi and define F:Am→n+ by F(z)=z1eα1∗⋯∗zmeαm, the iterated polynomial group law X∗Y=P(X,Y) of step 2.1, so that uα1(z1)⋯uαm(zm)=exp⁡(F(z)) by step 2.1 and [F1]. In the basis eα1,…,eαm of n+ ordered by increasing height, the bracket of two basis elements is a combination of basis elements of strictly larger height by [F3], so expanding P and the iterated product gives Fk(z)=zk+Qk(z1,…,zk−1) with Qk polynomial; such a map is a bijection with polynomial inverse, defined recursively by z1=F1, zk=Fk−Qk(z1,…,zk−1).

4.1F1step 2.1step 3.1construct

Define θ:Am→G by θ(z)=exp⁡(F(z)), which by the preceding step equals uα1(z1)⋯uαm(zm) and is therefore a morphism of varieties into G. Since F is a bijection, θ is injective, and θ(Am)=U is an abstract subgroup of G: because F is a bijection, for x,y∈n+ the elements exp⁡(x) and exp⁡(y) satisfy exp⁡(x)exp⁡(y)=exp⁡(x∗y)=exp⁡(P(x,y)) with P(x,y)∈n+ by step 2.1, and exp⁡(x)−1=exp⁡(−x) follows from the same identity with y=−x.

5.1F6step 4.1algebra

U is a closed subgroup of G. The morphism θ:Am→G has irreducible image and its closure K is an irreducible closed subgroup, since multiplication and inverse carry the dense subgroup U into itself. By [F6], U is constructible, so its density in K gives a nonempty open subset O⊆U. For any k∈K, the two nonempty opens kO−1 and O of the irreducible variety K meet; writing ko1−1=o2 yields k=o2o1∈U. Thus K=U. The coordinate inverse is established separately below.

6.1F1step 1.1step 3.1step 4.1step 5.1algebra

The common filtration of step 1.1 bounds the nilpotence index of every X∈n+ by D=dim⁡V, so the matrix logarithm L(g)=∑j=1D−1(−1)j+1(g−I)j/j is a regular polynomial map G→End⁡(V), even though its value need not be a Lie-algebra element for arbitrary g. Choose a linear projection p:End⁡(V)→n+ that is the identity on n+, and define r(g)=F−1(p(L(g)))∈Am, using the polynomial inverse from step 3.1. For g=θ(z)=exp⁡(F(z)), finite formal logarithm and exponential are inverse in the nilpotent algebra generated by F(z), so r(θ(z))=z as a polynomial identity. Therefore θ is a section of the separated morphism r:G→Am, hence a closed immersion with regular inverse r∣U. Its differential at zero is the identity n+→n+, so Lie⁡U=n+ and dim⁡U=m. The source Am is connected, and every exp⁡X∈U is unipotent by step 1.1. Thus the product map in the statement is an algebraic isomorphism onto the closed connected unipotent subgroup U.

7.1F1step 1.1step 6.1

The torus T normalizes U: for t∈T, conjugation by t is an automorphism of G with tUαit−1=Uαi by [F1], and since the product map of step 6.1 is onto U, tUt−1=∏itUαit−1=∏iUαi=U. Moreover T∩U=1: an element of T is diagonalisable as an endomorphism of V by step 1.1, an element of U=exp⁡(n+) is unipotent by step 6.1, and an endomorphism that is both diagonalisable and unipotent is the identity, so T∩U⊆{1}.

8.1F3F6step 5.1step 6.1step 7.1algebra

Hence B=TU is a semidirect product on complex points: T normalizes U and T∩U=1 by step 7.1. The multiplication morphism m:T×U→G has constructible image by [F6], an abstract subgroup because T normalizes U, and irreducible source. The same dense-open subgroup argument as step 5.1 makes its image a closed irreducible algebraic subgroup B; over C it is smooth. Its dimension is dim⁡T+dim⁡U because the point fibres of m are singletons by T∩U=1, so its Lie algebra is h⊕n+=b. At every point the differential of m is an isomorphism onto TbB: at the identity this is the direct sum of h and n+, and translations handle the other points. Thus m is étale. It is injective on complex points; the off-diagonal of (T×U)×B(T×U) is an open finite-type complex scheme with no complex points and hence empty, so m is a monomorphism. A surjective étale monomorphism is an isomorphism by fppf descent, proving that the inverse B→T×U is regular. Since T is abelian and U is normal unipotent, B is solvable with unipotent radical U.

9.1step 8.1step 1.2given

Every connected solvable closed subgroup S⊆G with S⊇B equals B: its Lie algebra Lie⁡S is a solvable subalgebra of g containing b (the Lie algebra of a closed subgroup is a subalgebra, and the derived series of Lie⁡S is contained in the Lie algebra of the derived series of S, which terminates), so Lie⁡S=b by step 1.2, whence dim⁡S=dim⁡Lie⁡S=dim⁡b=dim⁡B because connected algebraic groups over C of characteristic zero are smooth; an inclusion of irreducible closed subvarieties of the same dimension is an equality, so S=B.

9.2F1F3step 6.1step 8.1

The whole construction applied to the negative root system Φ− produces U−=exp⁡(n−) with Lie⁡U−=n−, its coordinate isomorphism, and B−=T⋉U− with Lie⁡B−=h⊕n−; the argument uses only the height function of [F3], which is defined on all roots, and the corresponding root subgroups Uα for α∈Φ− supplied by [F1].

10.1F1F2F3F4F7step 6.1step 8.1step 9.1discharge-construct∎

Finally X∗(B)→X∗(T) is bijective: a character χ of T extends to B=T⋉U by making it trivial on the normal subgroup U, so the restriction map is surjective, and it is injective because a character ψ of B with ψ∣T=1 is trivial on every Uα (a morphism Ga→Gm is given by a unit of C[z], hence is constant) and U=∏iUαi by step 6.1, so ψ is trivial on U and on BT. The Axiom of Choice is assumed; [F4] uses the countable-choice BCH interface, while the faithful-representation supplier [F7] is choice-free. The root suppliers [F2] and [F3] retain their stated hypotheses; steps 3.1 to 8.1 then select only finitely many data.

Depends on

Used by

Dependency tree · two levels

58 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