Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Arbitrary-rank Coxeter presentations, length, reflections, and Bruhat order

Definition

Let S be any set, possibly infinite, and let m:S×S→{1,2,3,…}∪{∞} be a Coxeter matrix: m(s,s)=1, and for distinct s,t, m(s,t)=m(t,s)∈{2,3,…}∪{∞}. Let F(S) be the free group on S, let N be the normal closure of

{s2:s∈S}∪{(st)m(s,t):s≠t, m(s,t)<∞},

and define W=F(S)/N. The image of s∈S in W is also denoted s. This is the Coxeter group presented by (S,m).

For w∈W, define its length by

ℓ(w)=min⁡{k∈N:w=s1⋯sk for some s1,…,sk∈S}.

The set is nonempty because every element of the quotient has a finite word in S∪S−1 and the relators give s−1=s; its minimum exists by the well-ordering principle. A word of length ℓ(w) for w is a reduced expression; the empty word is the reduced expression of 1.

Define the reflection set T={xsx−1:x∈W, s∈S}. Write u→v if v=ut for a reflection t∈T and ℓ(v)>ℓ(u). Define the reflection-chain Bruhat order by u≤v if there is a finite chain u=u0→u1→⋯→uk=v; the empty chain is allowed. Length strictly increases on each nonempty chain, so this relation is a partial order. The exact reduced-subword description and finite-interval consequence needed below are established in Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank ↗.

When S is finite, the presentation and length agree with Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, and the reflection-chain order agrees with The Bruhat graph by length-increasing reflection chains, the Bruhat order, inversion symmetry, and reflection parity. No exchange, standard-parabolic, reduced-subword, or interval-finiteness property is included in this definition; those properties are justified separately.

Depends on

Used by

Dependency tree · two levels

44 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