Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-08
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.

Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups

Definition

Let S be a finite set and let m:S×S→{1,2,3,… }∪{∞} satisfy m(s,s)=1 for all s∈S and m(s,t)=m(t,s)∈{2,3,… }∪{∞} for all s≠t. Such an m is a Coxeter matrix on S.

The presented group. Let R⊆F(S) be the set of relators R:={s2:s∈S}∪{(st)m(s,t):s,t∈S, m(s,t)<∞}, where F(S) is the free group on S (Free group on a set of generators, Reduced words form the free group on an alphabet) and (st)k is the k-fold product (Powers gn: natural exponents in a monoid and integer exponents in a group, with g0=e), and let N:=⟨ ⁣⟨R⟩ ⁣⟩F(S) be the normal closure of R in F(S) (The normal closure of a subset of a group, The normal closure of R is the set of finite products of conjugates of elements of R and their inverses). Define W:=F(S)/N, and write s (as well as sN) for the image of s∈S in W (The quotient group G/N and coset product (gN)(hN)=ghN, Group and abelian group).

Universal property. For every group G and every map f:S→G with f(s)2=1 for all s∈S and (f(s)f(t))m(s,t)=1 in G for all s≠t with m(s,t)<∞, there is a unique group homomorphism φ:W→G with φ(s)=f(s) for all s∈S (Monoid homomorphism and group homomorphism, A homomorphism that kills a normal subgroup factors uniquely through the quotient group, Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group, Group presentation by generators and relations, Relators and relations; finitely generated, finitely related, and finite presentations, In ⟨X∣R⟩, the words u and v represent the same element if and only if u−1v∈⟨ ⁣⟨R⟩ ⁣⟩).

Length and reduced words. For w∈W put ℓ(w):=min⁡{k∈N: there exist s1,…,sk∈S with w=s1⋯sk}. The minimum exists: every element of the free group F(S) is represented by a finite word in S∪S−1 (Words in an alphabet with formal inverses, elementary cancellation, and reduced words), and s−1=s in W because s2∈R, so every element of W is the value of a finite word in S; the set of admissible k∈N is therefore nonempty and has a least element by the well-ordering principle (The well-ordering principle, The natural numbers N (von Neumann)). A word (s1,…,sk) in S is a reduced expression of w when w=s1⋯sk and k=ℓ(w), and nonreduced otherwise. The empty word (  ) is a word in S of length 0, and ℓ(1)=0; it is the reduced expression of 1.

Terminology. The pair (W,S) is the Coxeter system presented by the Coxeter matrix (S,m); when s↦s is understood, we also say that W is the Coxeter group presented by (S,m).

Standard parabolic subgroups. For J⊆S put WJ:=⟨{s:s∈J}⟩≤W (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups).

Conventions. m(s,t) is declared to be the order of st in W; a value m(s,t)=∞ imposes no relator on s,t. This definition asserts no finiteness, faithfulness, or completeness property of the presentation: the statements that the elements s∈S are pairwise distinct in W (so that S may be viewed as a labelled subset of W), that ℓ(s)=1, that a word is reduced exactly when it admits no two-letter deletion, and that (WJ,J) is the Coxeter system presented by the restricted matrix m∣J with intrinsic length equal to the ambient length are recorded with their justifiers below and are not used before those results.

Remarks

The properties announced in the Conventions paragraph are supplied later in this pair: pairwise distinctness of the simple generators, ℓ(s)=1, and the deletion characterisation of reduced words in Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action ↗; the intrinsic presentation and length of the standard parabolic subgroups in Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification ↗. Until those results are available, W and ℓ are to be read exactly as constructed above.

No form of choice is used in the construction: W is the quotient of the free group on the finite set S by an explicitly generated normal closure, and the only minimisation in the definition is over a nonempty set of natural numbers.

Depends on

Used by

…and 126 more results.

Dependency tree · two levels

53 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources