Alphabeta Math
PropositionStatement: 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-sign and inversion-length facts

PDF p. 4: §2.2; PDF p. 8: Lemma 3.5 argument

Statement

Let (W,S) be the Coxeter system of the stated Coxeter diagram, with geometric representation on V=⨁i∈Γ0Rαi, roots Φ, positive roots Φ+=Φ∩∑iR≥0αi, negative roots Φ−=−Φ+, length ℓ, and contragredient action on the algebraic dual V∗. The index set may be infinite.

The roots decompose as Φ=Φ+⊔Φ−. The contragredient action faithfully realizes W as a group generated by linear reflections. For w∈W, ℓ(w)=∣{α∈Φ+:wα∈Φ−}∣=ℓ(w−1). If w−1αi∈Φ−, then ℓ(siw)=ℓ(w−1si)<ℓ(w).

Facts & Assumptions

[F1]

For a finite set of generators, roots have exactly one sign, the number of positive roots made negative by an element is its length, and length is invariant under inversion. If xαi is negative, then ℓ(xsi)<ℓ(x). Root signs, inversions and descent translation

[F2]

For a finite set of generators, the geometric representation is faithful. The root-length criterion and faithfulness of the canonical reflection representation

[F3]

In a finite Coxeter system, a standard parabolic subgroup has the Coxeter presentation restricted to its generating subset, and its intrinsic length agrees with ambient length. Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification

Proof

Given: The Coxeter presentation, geometric representation, roots, length and contragredient action in the Statement. Coxeter-system, roots, length and weak-order conventions

Proof technique: direct.

Goal: Prove the sign, reflection, inversion-count and descent assertions for the given system.

1.1F3given

Finite subsystems. For finite J⊆S, let WJ∗ be the group presented by the restricted Coxeter matrix, and let VJ be the span of its simple roots. The natural map WJ∗→W is injective: an equality of two finite J-words in the presentation of W has a derivation using finitely many defining relators and letters, all contained in some finite K⊇J; [F3] then gives the equality already in WJ∗. Similarly, the intrinsic length of an element of WJ∗ equals its length in W: any shorter ambient word and a finite derivation of its equality lie in some finite K, contradicting [F3]. The action of WJ∗ on VJ is its finite-rank geometric representation, because the defining reflection formulas restrict to those for J.

2.1F1step 1.1given

Root signs and inversion counts. Each root uαi belongs to a finite subsystem containing the letters of a word for u and si; [F1] therefore gives it exactly one sign in the full basis. Fix w, choose finite J containing a word for it, and write n=ℓ(w). By [F1] and 1.1 the subsystem on J supplies n distinct positive roots made negative by w. Conversely, any finite collection of such full-system roots, together with words representing them and w, is contained in a finite subsystem K. Their signs in that subsystem agree with their signs in the full basis, and [F1] and 1.1 show that at most n of them occur. Hence the full inversion set has exactly n elements. Reversing words in the involutory generators gives ℓ(w−1)=ℓ(w).

2.2F2step 1.1given

Faithful dual reflection action. If w≠1, choose finite J containing a word for w. By 1.1 its image in WJ∗ is nontrivial, so [F2] shows that w acts nontrivially on VJ, and hence on V. The algebraic dual separates vectors: a nonzero finite linear combination of basis vectors is detected by a coordinate functional. Thus a nonidentity invertible operator on V has nonidentity contragredient action on V∗. For each generator, the dual formula is (sif)(v)=f(v)−2B(v,αi)f(αi); it fixes pointwise the hyperplane f(αi)=0 and negates the nonzero functional B(−,αi), so it is a linear reflection. These generator actions faithfully realize W.

3.1F1step 1.1step 2.1step 2.2∎

Descent. If w−1αi is negative, take a finite subsystem containing si and a word for w. By [F1] its intrinsic lengths satisfy ℓ(w−1si)<ℓ(w−1); 1.1 transfers this inequality to W. Reversal of words gives ℓ(w−1si)=ℓ(siw) and ℓ(w−1)=ℓ(w). Together with 2.1 and 2.2, this proves every assertion.

Depends on

Used by · 3

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