Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
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.

Root reflections are induced by inner automorphisms

Statement

Assume the Axiom of Choice. Let α be a root of the finite-dimensional complex semisimple Lie algebra g with respect to a Cartan subalgebra h (Root and root space), let eα,fα,hα be the triple of The root sl_2 triple, and let G be a connected simply connected real Lie group with Lie algebra g. Then

τα:=AdexpG(eα)AdexpG(fα)AdexpG(eα)

is an inner automorphism of g with τα(h)=h, τα(hα)=hα, τα(x)=x for xkerα, and τα(gβ)=gsα(β) for every root β; thus τα induces the reflection sα of Root reflection defined by a coroot on the root system.

Facts & Assumptions

Given: The Axiom of Choice, such g,h, a root α, the triple (eα,fα,hα), and a connected simply connected group G with Lie algebra g.

[A1]

The Axiom of Choice is The Axiom of Choice; it implies the countable choice used by [L3] and [L4] through The Axiom of Countable Choice (ACω).

[L1]

The triple satisfies [eα,fα]=hα, [hα,eα]=2eα, [hα,fα]=2fα, and α(hα)=2 (The root sl_2 triple, Coroot of a Lie-algebra root).

[L2]

The root spaces are the eigenspaces of adh, [gγ,gδ]gγ+δ, and h=g0=Cg(h) is a maximal toral subalgebra, in particular abelian (Root and root space, Brackets of root spaces, Root-space decomposition, Cartan subalgebras are exactly maximal toral subalgebras, Toral and maximal toral subalgebras).

[L3]

Under countable choice, a connected simply connected real Lie group G with Lie algebra g exists (Lie's third fundamental theorem, The Axiom of Countable Choice (ACω)).

[L4]

Under countable choice, Ad:GGL(g) is a smooth homomorphism with Adgh=AdgAdh, Ade=I, values in the automorphisms of g, and AdexpGX=eadX, where etB denotes the unique solution of E=BE, E(0)=I; moreover d(Ad)eX=adX (Adjoint exponential identity, The differential of Ad is ad, Adjoint is a smooth Lie-group representation, Conjugation and the adjoint representation of a Lie group, The Axiom of Countable Choice (ACω)).

[L5]

Linear initial-value problems have unique solutions (Linear matrix ODEs have unique global solutions on a fixed interval).

Proof

technique · direct
1.1

First, a vanishing criterion: if X,xg satisfy [X,x]=0, then AdexpGX(x)=x. Indeed the curve tAdexpG(tX) is a homomorphism in t with derivative satisfying U(t)=adXU(t), by [L4] and the chain rule, and U(0)=I; hence u(t)=U(t)x solves u=adXu with u(0)=x, and so does the constant curve x because [X,x]=0. Uniqueness [L5] gives AdexpGX(x)=x.

L4L5algebra
1.2

Similarly, if adX is nilpotent and (adX)n=0, then AdexpGX=eadX=k<n(adX)kk!. Indeed the polynomial curve E(t)=k<ntk(adX)kk! satisfies E(t)=adXE(t) and E(0)=I by termwise differentiation. Uniqueness [L5] therefore identifies it with etadX, and setting t=1 gives the displayed formula.

L4L5algebra
1.3

τα is an inner automorphism: by [L4] each factor AdexpG(±eα), AdexpG(fα) is an automorphism of g, and Ad is multiplicative, so τα=Adg for g=expG(eα)expG(fα)expG(eα)G.

L4algebra
2.1

If xkerαh, then [eα,x]=α(x)eα=0 and [fα,x]=α(x)fα=0 by [L2], so step 1.1 applied to X=eα,fα gives τα(x)=x.

L1L2step 1.1algebra
2.2

The operator adeα is nilpotent on ChαCeα: indeed [eα,hα]=2eα and [eα,eα]=0 by [L1]; likewise adfα is nilpotent on ChαCfα. Using step 1.2 we compute AdexpG(eα)(hα)=hα2eα, then AdexpG(fα)(hα2eα)=hα2eα from [fα,hα]=2fα and [fα,eα]=hα, and finally AdexpG(eα)(hα2eα)=hα; hence τα(hα)=hα.

L1L5step 1.2algebra
3.1

Consequently τα preserves h=kerαChα: it fixes kerα pointwise by step 2.1 and negates hα by step 2.2. For a root β and xgβ, the element τα(x) satisfies [H,τα(x)]=τα([τα1(H),x])=β(τα1(H))τα(x) for Hh; since τα1h=ταh is the identity on kerα and negation on hα, the functional Hβ(τα1(H)) agrees with β on kerα and takes the value β(hα) at hα, hence equals ββ(hα)α=sα(β) because α(hα)=2 and α vanishes on kerα. Therefore τα(gβ)gsα(β), and since τα is an automorphism and sα is an involution, dimensions agree and equality holds; the Axiom of Choice was used only through [L3] and [L4], that is, through [A1].

A1L1L2step 2.1step 2.2algebra

Depends on

Used by

Dependency tree · two levels

89 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