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

Normaliser action on labels, orbits and adjacency

PDF p. 12: Lemma 3.24

Statement

Let (W,S) be a finite-rank Coxeter system with vertex set Γ0 and fix J⊆Γ0. For I⊆Γ0, write WI for the standard parabolic subgroup generated by the simple reflections indexed by I, and let ℓ be Coxeter length. The chamber-label set Cham(J) consists of the pairs (x,I) such that WJx=xWI and x has minimum length in xWI. Write N(W,J)=Norm⁡W(WJ)/WJ for the normaliser quotient.

Under the chamber bijection (x,I)↦xCI, the quotient action on the relative cone induces an action on Cham(J). For gˉ∈N(W,J) and any representative g∈Norm⁡W(WJ), it is given by gˉ⋅(x,I)=(y,I), where y is the unique minimum-length element of gxWI. Any two labels with the same second component lie in the same orbit, and the action is free: a quotient element fixing a label is the identity.

If ωa,I(x,I)=(xva,I,K) is a simple wall crossing to an adjacent chamber, then ωa,I(gˉ⋅(x,I))=gˉ⋅ωa,I(x,I). Thus the action preserves adjacency and the crossing index a.

Facts & Assumptions

[F1]

A label (x,I) means WJx=xWI and x is the minimum of xWI. The quotient is formed from the normaliser by its normal subgroup WJ. Algebraic chamber-label set Normalisers and their quotients

[F2]

The map (x,I)↦xCI is a bijection from the label set to the relative chambers. The quotient acts on the relative cone and sends xCI to (gx)CI for any normaliser lift g. Labelling theorem for relative chambers Faithful normaliser-quotient action on the relative cone

[F3]

Every right coset of a standard parabolic has a unique minimum-length representative. Every element of WI fixes each point of the fundamental face CI. Parabolic root subsystems and unique coset minima Stabilizer of a fundamental parabolic face Parabolic coordinate subspaces and fundamental faces

[F4]

For an already adjacent pair with first label (x,I) and wall index a∉I, the adjacent-wall proposition gives the finite component required by the crossing definition and identifies the other label as (xva,I,K). The element va,I and subset K depend only on I and a. Adjacent chambers and inverse wall-crossing elements Simple wall-crossing elements and maps

[F5]

The roots are Φ={wαi:w∈W, i∈Γ0}, and the dual action is (gf)(v)=f(g−1v). Write E=ΘJ and T=Cone(J)∘, with interior taken in the coordinate Euclidean topology on E. The relative arrangement consists of the distinct proper traces Hα∩E, where Hα={f∈Θ:f(α)=0}; traces missing T are omitted when restricting to that domain. Coxeter-system, roots, length and weak-order conventions Tits cone intersections, relative roots and arrangements Labelling theorem for relative chambers

[F6]

A wall is an intersection of a chamber closure with an arrangement hyperplane whose affine dimension is one less than that of the chamber. Two distinct chambers are adjacent when they share a wall. Closures for the relative arrangement are taken in E. Chambers, walls and adjacency

[F7]

If the component required by the definition of ωa,I is finite, then for every label (x,I) the pair (xva,I,K) is itself a chamber label. This label assertion is supplied independently of the normaliser action. A finite connected component gives the opposite relative chamber Simple wall-crossing elements and maps

Proof

Given: The finite-rank Coxeter system, arbitrary subset J, chamber label and quotient element in the statement. No spherical-type hypothesis is assumed.

Given: A label (x,I) and a normaliser representative g as above.

Goal: Establish the action formula, its orbit and freeness assertions, and its compatibility with simple crossings.

1.1F1F2F3

Let y be the unique minimum of gxWI, so gx=yu for some u∈WI. Since u fixes CI pointwise, (gx)CI=yCI. Moreover WJgx=gWJx=gxWI=yWI, because g normalises WJ. Thus (y,I) is a label. By the chamber bijection and the quotient action on the cone, it is the label of the image chamber. This gives the formula and proves that it is independent of the representative g; the action laws follow from the quotient action on chambers.

2.1F2F5F6step 1.1

By [F2], the restriction of g is an invertible linear map of the finite-dimensional space E, hence a homeomorphism, and it preserves Cone(J) and therefore its interior T. By the root-orbit definition in [F5], gΦ=Φ. The dual-action formula gives (gf)(gα)=f(α), so gHα=Hgα. Since gE=E, it follows that g(Hα∩E)=Hgα∩E; properness of the trace and whether it meets T are preserved. Thus g permutes the relative arrangement on T. If chambers D,D′ share a wall F=D‾∩H=D′‾∩H′ with supporting relative hyperplanes H,H′, then gF=gD‾∩gH=gD′‾∩gH′, because a homeomorphism commutes with closure. An invertible linear map preserves affine dimension, and it keeps the two chambers distinct. Hence gF is a wall of both image chambers, proving preservation of adjacency without invoking any forward crossing assertion.

2.2F1F3step 1.1

If (x,I) and (z,I) are labels, set g=zx−1. Their defining equalities give gWJg−1=z(x−1WJx)z−1=zWIz−1=WJ. Thus g is in the normaliser, and gxWI=zWI has minimum z. Step 1.1 sends (x,I) to (z,I), proving transitivity within each fixed second component.

2.3F1step 1.1

If gˉ fixes (x,I), step 1.1 gives gxWI=xWI, hence g∈xWIx−1=WJ. Its quotient class is therefore the identity. This proves freeness.

2.4F1F4step 1.1

Suppose the crossing from (x,I) has target (xv,K), where v=va,I. Both are labels, so x−1WJx=WI and (xv)−1WJ(xv)=WK; consequently v−1WIv=WK. Write gx=yu as in step 1.1. Then gxv=yv(v−1uv) and v−1uv∈WK, so gxvWK=yvWK.

3.1F1F3F4F7step 1.1step 2.1step 2.4∎

The original adjacent pair in step 2.4 supplies the finite component for I,a by [F4]. The image label (y,I) has the same I, so the same finiteness condition holds and the crossing definition uses the same v=va,I and K. By [F7], (yv,K) is a label; in particular yv is the minimum of yvWK. Step 2.4 identifies that coset with gxvWK. The action formula in step 1.1 and uniqueness of its minimum therefore show that the image of (xv,K) is exactly (yv,K). Step 2.1 independently shows that this image chamber is adjacent to the chamber labelled (y,I). Thus the crossing at index a from the image label has precisely this adjacent target, and ωa,I(gˉ⋅(x,I))=gˉ⋅ωa,I(x,I). Every adjacent pair has a crossing description by [F4], completing all the assertions.

Source notes

The original article supplies attribution for the statement. The proof above uses the declared mathematical suppliers and the local arrangement-preservation argument; it does not use the article's assertion as a premise.

Depends on

Used by · 14

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.

Sources