Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 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.

Finite Weyl closed chambers and stabilizers

Statement

Every W-orbit in E has exactly one point in C. For ηC, its stabilizer is generated by those simple reflections si with (η,αi)=0. The group acts simply transitively on open chambers. There is a unique longest element w0, characterized by w0Φ+=Φ; it has length Φ+ and satisfies w02=1. In particular every weight orbit has a unique dominant weight. These assertions include rank zero and singular wall points, without AC.

Facts & Assumptions

Given: The root-system, lattice and chamber conventions of Finite Weyl root system, lattice and chamber conventions.

[F1]

Positive-root expansions, finiteness, simple generation and lattice preservation are proved in Finite Weyl positive roots and simple reflections.

[F2]

Length equals inversion count and reflection descent is determined by root sign, by Finite Weyl strong exchange and deletion.

Proof

1.1

Choose ρE with (ρ,αi)>0 for every i, by taking the sum of the basis dual to the simple roots; in rank zero use zero. For xE, the finite orbit Wx has a point η maximizing (ρ,η). If (η,αi)<0, then (ρ,siηη)=2(η,αi)(ρ,αi)/(αi,αi)>0, a contradiction. Thus ηC.

F1givenalgebra
1.2

Suppose λ,μC and λ=wμ. Choose among such w one of least word length. If nonidentity, write a reduced expression w=siv. By F2, w1αi<0. Since μ pairs nonnegatively with every positive root by F1, (λ,αi)=(μ,w1αi)0. Dominance of λ forces equality. Hence siλ=λ and vμ=siwμ=λ, contradicting minimal length. Thus w=1 and λ=μ. Lattice preservation then gives the unique dominant representative of each orbit in P.

F1F2givenalgebra
2.1

For ηC and any nonidentity w fixing it, write a reduced expression w=siv. The same scalar-product argument as in step 1.2 gives (η,αi)=0. Then si fixes η and v=siw does too, with smaller length. Induction writes w as a product of zero-label simple reflections. Conversely each of those reflections visibly fixes η, proving exactly the stabilizer assertion, including η=0.

step 1.2F1F2algebra
2.2

For any regular point, all roots have fixed nonzero signs on its connected component of the hyperplane complement, since a continuous real linear functional cannot change sign without vanishing. Conversely a nonempty prescribed sign region is an intersection of open linear halfspaces, hence convex and connected. Thus the chambers are exactly those sign regions. F1 gives C={x:(x,α)>0 for all αΦ+}. Step 1.1 sends every regular point into this region (its image remains regular), so W acts transitively on chambers. If wC=C, then w1 preserves positive roots by testing their signs on this chamber. F2 gives length zero, so w=1. This proves simple transitivity without a chamber-faithfulness assumption in the proof of exchange.

step 1.1F1F2given
3.1

The negative region C is a chamber, so step 2.2 gives a unique w0 sending C to it. Equivalently w01Φ+=Φ, hence also w0Φ+=Φ. F2 gives length Φ+, the largest possible inversion count. Any element of that length reverses all positive roots and hence has the same chamber image, so equals w0. Moreover w02 preserves the positive chamber and is therefore the identity. In rank zero the hyperplane complement and its unique chamber are the one-point space, all groups and stabilizer claims are trivial and w0=1.

step 2.2F1F2algebra

Depends on

Used by

Dependency tree · one level

3 results within one dependency step 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