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

Dominant representatives, wall stabilizers and terminating reflection descent

Statement

An integral Weyl orbit meeting P+ has a unique dominant representative η. Its stabilizer is exactly StabW(η)=si:η(hi)=0. Starting at any weight in this orbit, repeatedly reflecting at any negative simple label terminates at η. Choosing the least negative-label index gives a deterministic procedure. No assertion is made that every integral Weyl orbit meets P+.

Facts & Assumptions

Given: An integral weight λ=wη with ηP+ and wW.

[F1]

Real coroots have one sign, si permutes the positive coroots other than hi, inversion sets are finite, and (wsi)<(w) iff whi<0 (Reduced words, root signs and finite coroot inversions).

[F2]

Dominant integral weights pair nonnegatively with each simple coroot (Kac moody integral and dominant integral weights).

[F3]

Reflection and duality formulas hold by Simple reflections and the kac moody weyl group.

Proof

1.1

For a positive real coroot β, if w1β is positive then λ(β)=η(w1β)0 by F2, since a positive coroot is a nonnegative integral combination of simple coroots. Hence N(λ)={β>0:λ(β)<0} is contained in Inv(w1), and is finite by F1. Each negative-label reflection keeps the weight integral: its new labels are λ(hj)λ(hi)aji by F3. It also stays in the same orbit, so finiteness persists.

F1F2F3given
1.2

Suppose η,ζ=wη are both dominant, and take a reduced expression w=si1sit. We prove by induction on t that ζ=η and this word is a product of zero-label reflections of η. For t=0 both conclusions are immediate. For t>0, canceling the last factor gives an expression of length t1 for wsit, so F1 gives whit<0. By duality and dominance, 0η(hit)=ζ(whit)0. Thus η(hit)=0, and F3 gives sitη=η. The prefix represents wsit and is reduced: a shorter prefix would shorten the original word after appending its last factor. The prefix still sends η to ζ, so the induction hypothesis proves both assertions, and the deleted last factor is also a zero-label reflection.

F1F2F3given
2.1

Suppose λ(hi)<0. On positive coroots other than hi, the bijection βsiβ identifies negative pairings for siλ with those for λ. The pairing at hi changes from negative to positive. Thus N(siλ)=N(λ)1. If no simple label is negative, every positive coroot pairs nonnegatively and the weight belongs to P+ by F2 and integrality. Therefore after at most N(λ) reflections any such process must stop at a dominant weight: a further negative label would require a negative integer cardinality. Selecting the least negative index specifies each finite step without AC.

F1F2F3step 1.1
3.1

Step 1.2 proves uniqueness of the dominant endpoint in 2.1. Applying it when wη=η proves that every stabilizing element belongs to the stated generated subgroup. Conversely, each displayed generator fixes η directly by F3, so every product does too. At a strictly positive-label weight the subgroup is trivial; at zero labels nontrivial stabilizers are permitted. If the starting weight is already dominant, N is empty and zero reflections are performed. Empty simple systems have trivial W. The zero weight is fixed by every simple reflection, giving stabilizer W. No choice axiom or reality assumption on complementary Cartan values was used.

F3step 2.1step 1.2

Depends on

Used by

Dependency tree · two levels

10 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