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.

Root bases and nonnegative matrices for chamber labels

PDF p. 16: Proposition 4.6(1), proof

Statement

Let (W,S) be a finite-rank Coxeter system with vertex set Γ0, canonical geometric representation V=⨁i∈Γ0Rαi, and positive roots Φ+. For I⊆Γ0, put VI=span⁡R{αi:i∈I} and let ΦI+ be the positive roots of the standard parabolic subgroup WI. Fix J⊆Γ0 and (y,K)∈Cham(J); explicitly, WJy=yWK and y has minimum length in yWK.

Then y−1αj∈ΦK+ for every j∈J, and yαk∈ΦJ+ for every k∈K. The maps y:VK→VJ and y−1:VJ→VK are inverse isomorphisms. Their matrices in the indicated simple-root bases are entrywise nonnegative and are permutation matrices. Consequently y{αk:k∈K}={αj:j∈J}. The assertions include empty J and K; neither W nor the parabolic subgroups are assumed finite.

Facts & Assumptions

[F1]

The geometric representation has symmetric bilinear form B with B(αi,αi)=1 and si(v)=v−2B(v,αi)αi. Its roots are the W-translates of simple roots, and positivity means nonnegative simple-root coordinates. Coxeter-system, roots, length and weak-order conventions

[F2]

The label condition is WJy=yWK, with y of minimum length in this common set. The standard parabolic WI is generated by the si for i∈I, and ΦI consists of their translates of the simple roots indexed by I. Algebraic chamber-label set Standard parabolic subgroups and parabolic roots

[F3]

For finite rank, Φ∩VI=ΦI. A minimum d in dWI sends ΦI+ into Φ+, and a minimum d in WId has d−1ΦI+⊆Φ+. Parabolic root subsystems and unique coset minima

[F4]

An invertible real square matrix whose entries and inverse entries are nonnegative is a product of a permutation matrix and a strictly positive diagonal matrix; the empty matrix is included. Nonnegative inverse matrices preserve extremal basis rays

[F5]

Relative to ordered domain and codomain bases, the column indexed by a domain basis vector is the coordinate column of its image under the linear map; empty bases give the corresponding zero-sized matrices. Coordinate columns [v]_B and matrices [T]_B^C of linear maps relative to ordered bases

Proof

Given: The finite-rank Coxeter system, J, and label (y,K) in the Statement.

Proof technique: direct.

Goal: Prove the two positive parabolic-root inclusions and the permutation-matrix conclusion.

1.1F1F2

For any subset I, each generator si with i∈I acts as the identity modulo VI, by the reflection formula. The same is therefore true of every element of WI. From WJy=yWK, we have y−1WJy=WK and yWKy−1=WJ. Fix j∈J and put β=y−1αj. The element y−1sjy∈WK sends β to −β; since it is the identity modulo VK, its difference on β shows 2β∈VK. Thus y−1VJ⊆VK. Interchanging J and K and replacing y by y−1 gives yVK⊆VJ. Applying y to the first inclusion shows that both inclusions are equalities, so the restrictions of y and y−1 are inverse isomorphisms.

2.1F1F2F3F5step 1.1

Each y−1αj is a root in VK, hence belongs to ΦK by [F3]. Since y is minimum in WJy, [F3] also makes it positive. Similarly, each yαk is a root in VJ and is positive because y is minimum in yWK. This proves both parabolic-root inclusions. Their nonnegative simple-root coordinates are precisely the columns of the respective matrices of the inverse isomorphisms in 1.1.

3.1F1F4F5step 1.1step 2.1∎

Choose orderings of the two finite simple-root bases. Their cardinalities agree by 1.1, and the two matrices are inverse and entrywise nonnegative by steps 1.1 and 2.1. By [F4], the matrix of y is a permutation matrix times a strictly positive diagonal matrix. Thus each yαk is a positive scalar multiple cαj of one simple root, with the indices matched by a permutation. The reflection formula and B(αi,αi)=1 show by expansion that each si preserves B; hence every element of W preserves B, and every root has self-pairing 1. Consequently 1=B(yαk,yαk)=c2, so c=1. The matrix of y is therefore a permutation matrix, as is its inverse, and the displayed equality of simple-root sets follows. For empty bases the same conclusion is vacuous and the matrices are the unique 0×0 matrices.

Depends on

Used by · 1

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