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 outside roots give a finite complementary parabolic

Statement

Use the arbitrary-rank geometric representation of Coxeter-system, roots, length and weak-order conventions and the orbit definition ΦL={wαi:w∈WL,i∈L} from Standard parabolic subgroups and parabolic roots. Let I⊆Γ0, a∉I, K=[I,a], J=K∖{a}, VL=span⁡R{αi:i∈L} and D=ΦI+a∖ΦI, with connected-component notation from Connected component notation [I,a]. Vectors have finite support, even if the vertex set is infinite. If D is finite, then K is finite and WJ is finite.

Facts & Assumptions

Given: the objects of Coxeter-system, roots, length and weak-order conventions, Standard parabolic subgroups and parabolic roots and Connected component notation [I,a], and finite D. [F1] The set D is WI-invariant by Outside parabolic roots form an invariant set, and its span contains VK by Connected propagation spans the component. [F2] For any finite set of simple generators, its restricted Coxeter presentation embeds in the ambient group by Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank, part 1. [F3] The canonical representation of a Coxeter system on finitely many generators is faithful by The root-length criterion and faithfulness of the canonical reflection representation, part 3.

[F4]

For any set X, Sym⁡(X) is the set of bijections X→X, with operation (f∘h)(x)=f(h(x)) and identity idX, as in The symmetric group Sym(X): the bijections of a set X under composition.

Proof

Given: the objects of Coxeter-system, roots, length and weak-order conventions, Standard parabolic subgroups and parabolic roots and Connected component notation [I,a], and finite D. [F1] The set D is WI-invariant by Outside parabolic roots form an invariant set, and its span contains VK by Connected propagation spans the component. [F2] For any finite set of simple generators, its restricted Coxeter presentation embeds in the ambient group by Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank, part 1. [F3] The canonical representation of a Coxeter system on finitely many generators is faithful by The root-length criterion and faithfulness of the canonical reflection representation, part 3.

[F4] For any set X, Sym⁡(X) is the set of bijections X→X, with operation (f∘h)(x)=f(h(x)) and identity idX, as in The symmetric group Sym(X): the bijections of a set X under composition.

Goal: Establish the assertion in the Statement.

Proof technique: direct.

1.1F1given

Each element of the finite set D has finite support. Let F be the union of those supports; it is finite, and span⁡D⊆VF. By [F1], VK⊆VF, hence K⊆F by linear independence of the simple-root basis. Thus K and J are finite.

2.1F1F2F3F4step 1.1algebra∎

Since J⊆I, [F1] gives a map π:WJ→Sym⁡(D) defined by π(g)(β)=gβ for β∈D, using [F4]. Each such map is a bijection with inverse π(g−1), and the geometric action gives π(gh)=π(g)∘π(h) and π(1)=idD. If π(g)=idD, then g fixes span⁡D, hence fixes VK and in particular VJ by [F1]. By [F2] applied to finite J, the group WJ is the Coxeter group on the restricted matrix. Its restriction to VJ is exactly the canonical representation, since the generator formulas coincide. Faithfulness [F3] gives g=1. If π(g)=π(h), the composition identities give π(h−1g)=idD, so g=h; thus π is injective. The set Sym⁡(D) is finite: every map D→D is determined by one image in the finite set D for each of its finitely many elements, so there are finitely many such maps and hence finitely many bijections. Therefore WJ is finite. For J=∅ the subgroup is the identity and the same conclusion holds.

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.