Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

The principal nilpotent Borel orbit by height elimination

Statement

Assume the Axiom of Choice and the setup of Complex semisimple algebraic group, Borel, and flag variety. For each simple root αi choose a nonzero root vector ei∈gαi and put e=∑iei. Write nj+=⨁ht⁡(α)=jgα. Then B⋅e={∑α∈Φ+cαeα∈n+:cαi≠0 for every simple root αi}, where one nonzero eα∈gα is fixed for each positive root. The right side is independent of the choices of those root vectors.

Facts & Assumptions

Given: A connected simply connected complex semisimple group G, Borel B=T⋉U, its positive root system, and nonzero simple-root vectors ei.

[F1]

The proof of The nilpotent central fiber is reduced and integral, step 1.2, constructs e=∑iei in a principal sl2 triple; the adjoint representation is a direct sum of strings of even highest weights 2mj>0, and ker⁡ad⁡e has dimension rank⁡G.

[F2]

B=T⋉U, U=exp⁡(n+), the positive root spaces are one-dimensional, and the simple roots form a basis of the root lattice (Complex semisimple algebraic group, Borel, and flag variety, Borel, opposite unipotent groups and root coordinates).

Proof

1.1F1F2algebra

On a principal sl2 string with highest weight 2m>0, ad⁡h has weights −2m,−2m+2,…,2m. For every j≥1, if weight 2j occurs then weight 2j−2 occurs, and the raising operator ad⁡e maps the latter one-dimensional weight space onto the former. Summing over the strings in [F1] gives [e,nj+]=nj+1+(j≥1), with zero spaces understood above the maximal root height.

2.1F1F2step 1.1chooseconstruct

Let x∈n+ have nonzero simple coefficients. The map T→(C×)r, t↦(αi(t))i, is an isogeny: its character-lattice map has image the full-rank root lattice. An isogeny of complex tori is surjective on complex points, so conjugation by one t∈T sets all simple coefficients of x to 1. Now suppose heights below j+1 already agree with those of e. Their height-(j+1) difference lies in nj+1+; by [step 1.1] choose uj∈nj+ whose bracket with e cancels that difference. The finite exponential exp⁡(ad⁡uj) changes no height at most j and changes height j+1 by [uj,e]; all its higher commutators have height at least j+2. Induction over the finitely many root heights conjugates x to e by U.

3.1F2step 2.1algebra∎

Conversely, conjugation by T scales each simple-root coefficient by a nonzero scalar. For u∈U, every commutator in exp⁡(ad⁡u)e−e has height at least two, because u has positive height and e has height one. Thus U fixes the simple-root coefficients, and B=TU preserves their nonvanishing. The inclusion in the right side and the reverse inclusion from step 2.1 prove the equality. The rank-zero case has n+=0, e=0 and both sides are the singleton {0}.

Depends on

Used by

Dependency tree · two levels

45 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