Alphabeta Math
LemmaStatement: AI-generatedProof: 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.

Finite roots and finite Coxeter groups at finite rank

Statement

In the arbitrary-rank setting of Coxeter-system, roots, length and weak-order conventions and Standard parabolic subgroups and parabolic roots, let L⊆Γ0 be finite. Then WL is finite if and only if ΦL is finite.

Facts & Assumptions

Given: finite L⊆Γ0, the root orbit ΦL of Standard parabolic subgroups and parabolic roots in the geometric representation of Coxeter-system, roots, length and weak-order conventions. Put VL=span⁡R{αi:i∈L}⊆V; the vectors αi for i∈L form a basis of VL.

[F1]

The Coxeter group presented on L with restricted matrix mL(i,j)=m(si,sj) is isomorphic to WL by the map sending its generator indexed by i to si, by Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank, part 1.

[F2]

The canonical reflection representation of a Coxeter group with finitely many generators is faithful, by The root-length criterion and faithfulness of the canonical reflection representation, part 3.

Proof

Given: finite L⊆Γ0, the root orbit ΦL of Standard parabolic subgroups and parabolic roots in the geometric representation of Coxeter-system, roots, length and weak-order conventions. Put VL=span⁡R{αi:i∈L}⊆V; the vectors αi for i∈L form a basis of VL.

[F1] The Coxeter group presented on L with restricted matrix mL(i,j)=m(si,sj) is isomorphic to WL by the map sending its generator indexed by i to si, by Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank, part 1.

[F2] The canonical reflection representation of a Coxeter group with finitely many generators is faithful, by The root-length criterion and faithfulness of the canonical reflection representation, part 3.

Goal: Establish the assertion in the Statement.

Proof technique: direct.

1.1given

If WL is finite, the expression ΦL={wαi:w∈WL,i∈L} exhibits ΦL as the image of the finite set WL×L. If L is empty, ΦL is empty and WL is the identity group, so both are finite.

1.2givenF1F2algebra

For i∈L and v∈VL, the ambient reflection formula gives siv=v−2B(v,αi)αi∈VL. Since si2=1, each such generator preserves VL bijectively, and hence WL acts on VL. The restricted form B∣VL×VL has exactly the Coxeter-form entries for mL. Under the basis identification sending the canonical vector indexed by i to αi, these generator actions are therefore the canonical simple reflections for mL. The isomorphism in [F1] consequently identifies the restricted action with that canonical representation on every group element. Since L is finite, [F2] makes the restricted action faithful.

2.1givenstep 1.1step 1.2algebra∎

Conversely, suppose ΦL is finite. For w,u∈WL and i∈L, one has w(uαi)=(wu)αi∈ΦL; applying the same observation to w−1 shows that w permutes ΦL. This gives a homomorphism from WL to the finite permutation group of ΦL. Every αi for i∈L belongs to ΦL, by taking u=1. An element of the kernel thus fixes the basis of VL pointwise and, by linearity, acts identically on VL. The faithfulness established in step 1.2 forces that element to be the identity. The permutation homomorphism is injective, so WL is finite. Together with step 1.1 this proves the equivalence.

Depends on

Used by · 2

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.