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.

The geometric inversion set N(w) of an element of a Coxeter group

Definition

Let S be a finite set, m a Coxeter matrix, W the presented group with length function ℓ (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), V=RS with Coxeter form B and canonical reflection homomorphism ρ:W→GL(V) (The canonical reflection homomorphism, roots, reflections, and the positive cone), and let Φ=Φ+⊔Φ− be the signed root system (Root sign coherence and the action of simple reflections on positive roots).

(1) Definition. For w∈W the inversion set of w is N(w):={α∈Φ+:ρ(w)α∈Φ−}=Φ+∩ρ(w)−1Φ−. Its elements are the roots inverted by w. This is a subset of Φ+, defined before any finiteness or independence assertion; by construction ρ(w)N(w)⊆Φ−, and N(w) is determined by the linear map ρ(w).

(2) Elementary identities. N(1)=∅; for every w∈W N(w−1)=−ρ(w) N(w), and consequently ∣N(w−1)∣=∣N(w)∣ whenever one of the two sets is finite. For every u∈W and s∈S, with sN(u):={ρ(s)β:β∈N(u)}, ℓ(us)>ℓ(u) ⟹ N(us)={es}⊔sN(u),ℓ(us)<ℓ(u) ⟹ N(us)=s (N(u)∖{es}); in the first case sN(u)⊆Φ+∖{es} and es∉N(u), so the union is disjoint.

The identities are elementary: N(1)=∅ because ρ(1)=idV would force α∈Φ+∩Φ− for α∈N(1), and Φ+,Φ− are disjoint. For the second identity let α∈Φ+: then α∈N(w−1) means ρ(w)−1α∈Φ−, and with β:=−ρ(w)−1α one has β∈Φ+ and ρ(w)β=−α∈Φ−, so β∈N(w) and α=−ρ(w)β; conversely α=−ρ(w)β for some β∈N(w) gives α∈Φ+ because Φ−=−Φ+, and ρ(w)−1α=−β∈Φ−, so α∈N(w−1). Since β↦−ρ(w)β is a bijection, the cardinality statement follows. For the recursion, let β∈Φ+; then ρ(us)β=ρ(u)ρ(s)β, and ρ(s) maps Φ+∖{es} bijectively onto itself while ρ(s)es=−es (Root sign coherence and the action of simple reflections on positive roots (3)), so β↦ρ(s)β is a bijection of Φ+∖{es} that carries N(us)∖{es} onto N(u)∖{es}. By the root-length criterion (The root-length criterion and faithfulness of the canonical reflection representation (1)) one has es∈N(u)  ⟺  ρ(u)es∈Φ−  ⟺  ℓ(us)<ℓ(u) and es∈N(us)  ⟺  ρ(u)ρ(s)es=−ρ(u)es∈Φ−  ⟺  ρ(u)es∈Φ+  ⟺  ℓ(us)>ℓ(u). If ℓ(us)>ℓ(u) this gives es∈N(us), es∉N(u) and hence N(us)={es}⊔sN(u) with sN(u)⊆Φ+∖{es}; if ℓ(us)<ℓ(u) it gives es∉N(us), es∈N(u) and hence N(us)=s(N(u)∖{es}).

(3) Convention on reduced words. We keep the left action ρ of W on V. If w=s1⋯sn is a reduced expression, then the suffix roots ρ(si+1⋯sn)−1esi (1≤i≤n) are elements of N(w), and the prefix roots ρ(s1⋯si−1)esi are elements of N(w−1). That these lists are exactly N(w) and N(w−1), that their elements are pairwise distinct positive roots, and that in particular ∣N(w)∣=ℓ(w), is proved in The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange ↗; no finiteness or independence beyond the identities of (2) is asserted here.

For the two membership statements put wi−1:=s1⋯si−1 and αi:=ρ(si+1⋯sn)−1esi. Since ℓ(wi−1si)=i>ℓ(wi−1)=i−1 by reducedness of the expression, the root-length criterion gives γi:=ρ(wi−1)esi∈Φ+ and also, applied to the reversed reduced expression of w−1=sn⋯s1, gives αi∈Φ+. Moreover (s1⋯sn)(si+1⋯sn)−1=s1⋯si, so ρ(w)αi=ρ(s1⋯si)esi=−ρ(wi−1)esi=−γi∈Φ−, which shows αi∈N(w); and (sn⋯s1)(s1⋯si−1)=sn⋯si, so ρ(w−1)γi=ρ(sn⋯si)esi=−ρ(sn⋯si+1)esi=−αi∈Φ−, which shows γi∈N(w−1).

Depends on

Used by

Dependency tree · two levels

65 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