Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Root sign coherence and the action of simple reflections on positive roots

Statement

Let S be a finite set, m a Coxeter matrix, W the presented group (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), V=RS with Coxeter form B, the reflections ra (The real Coxeter form, its radical, reflections, and form-preserving maps), the canonical reflection homomorphism ρ:W→GL(V), the root system Φ={ρ(w)es}, the reflections T, and the positive cone V+={∑sλses:λs≥0} (The canonical reflection homomorphism, roots, reflections, and the positive cone); every root satisfies B(α,α)=1 (Descent of the reflection representation, unit root norms, and conjugation of reflections (3)). Let C,C∘ be the chamber and its interior of the dual action and put Bs:={f∈V∗:f(es)>0} (The dual action, chambers, faces, and root hyperplanes).

(1) Sign criterion for the cone. For v∈V: v∈V+∖{0} if and only if f(v)>0 for every f∈C∘.

(2) Roots have a sign. Every root α∈Φ lies in V+∖{0} or in −V+∖{0}, and not in both. Hence, with Φ+:=Φ∩V+,Φ−:=Φ∩(−V+), one has Φ=Φ+⊔Φ−, Φ−=−Φ+, es∈Φ+ for every s∈S, and for every w∈W and s∈S ρ(w)es∈Φ+  ⟺  w−1C∘⊆Bs,ρ(w)es∈Φ−  ⟺  w−1C∘⊆sBs. In particular f(α)>0 for all f∈C∘ when α∈Φ+, and f(α)<0 for all f∈C∘ when α∈Φ−.

(3) Simple reflections act on positive roots. For every s∈S, rs(Φ+∖{es})=Φ+∖{es},rses=−es,rsΦ=Φ; equivalently rsΦ+=(Φ+∖{es})∪{−es}.

Facts & Assumptions

Given: a finite set S, a Coxeter matrix m, the presented group W with its universal property, the space V=RS with its canonical basis (es)s∈S, the Coxeter form B, the canonical reflection homomorphism ρ with root system Φ and reflection set T, the positive cone V+ and the negative cone −V+, and the dual action on V∗ with chamber C, interior C∘ and root hyperplanes Hα.

[F1]

For every w∈W and s∈S, exactly one of wC∘⊆Bs and wC∘⊆sBs holds, and in the second case ℓ(sw)=ℓ(w)−1; equivalently, wC∘⊆sBs if and only if ℓ(sw)<ℓ(w) (The rank-two half-space alternative and the chamber-length induction (Pn), (Qn)).

[F2]

The reflections ra are defined for B(a,a)≠0 by ra(v)=v−2B(v,a)B(a,a)a; one has B(es,es)=1 and rs(es)=−es, and the assignment s↦rs induces the homomorphism ρ:W→GL(V) (The real Coxeter form, its radical, reflections, and form-preserving maps, Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order).

[F3]

The root system is Φ={ρ(w)es:w∈W, s∈S}, every root satisfies B(α,α)=1, the set Φ is invariant under every ρ(w), and ρ(w)es=−ρ(ws)es for all w∈W, s∈S (The canonical reflection homomorphism, roots, reflections, and the positive cone, Descent of the reflection representation, unit root norms, and conjugation of reflections).

[F4]

The dual action is given by (w⋅f)(v)=f(ρ(w)−1v); the closed chamber is C={f∈V∗:f(es)≥0 for all s}, its interior is C∘={f∈V∗:f(es)>0 for all s} and is nonempty, Bs={f∈V∗:f(es)>0} and sBs={f∈V∗:f(es)<0} are disjoint open half-spaces, and the dual basis functionals fs∈V∗ satisfy fs(et)=δst and f(es)≥0 for every f∈C (The dual action, chambers, faces, and root hyperplanes, The dual action, the faces, and the rank-two chamber tiling).

[F5]

On the finite-dimensional real vector space V with basis (es): every v∈V has unique coordinates v=∑sv(s)es with v(s)∈R, evaluation f↦f(v) is linear in v for fixed f∈V∗, and sums and nonnegative multiples of elements of V+ lie in V+ (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, Linear combination of a finite list, and the span span⁡(S) as the smallest linear subspace containing S, Linear functionals and the algebraic dual V∗=L(V,F)).

Proof

technique · direct
1.1F2F3F4given

Set-up. Every f∈C∘ satisfies f(es)>0 for all s∈S, so that C∘⊆Bs and C∘⊆Bs∩Bt for all s≠t; moreover C∘≠∅. Every root is of the form ρ(w)es with B(ρ(w)es,ρ(w)es)=1, hence nonzero, and −ρ(w)es=ρ(ws)es is again a root, so Φ=−Φ.

1.2F4F5given

The sign criterion, forward direction. Let v=∑sλses∈V+∖{0}, so all λs≥0 and some λr>0. For f∈C∘ linearity gives f(v)=∑sλsf(es)≥λrf(er)>0, since all summands are nonnegative and the summand at r is positive.

1.3F4F5algebra

The sign criterion, converse direction. Let v∉V+∖{0}. If v=0 then f(v)=0 for every f, so assume v∉V+; then some coordinate λr=v(r) is negative. Let g:=fr+ε∑sfs with ε>0 so small that ε ∣∑sv(s)∣<∣λr∣. Then g(et)=δrt+ε>0 for every t∈S, so g∈C∘, and g(v)=λr+ε∑sv(s)<0. Hence some element of C∘ evaluates v negatively, and the criterion of (1) holds in both directions.

2.1step 1.2step 1.3

The equivalence of the two criteria. By 1.2 and 1.3, for every v∈V: v∈V+∖{0} if and only if f(v)>0 for every f∈C∘.

3.1step 2.1F1F3algebra

Roots have a sign. Fix w∈W and s∈S. For f∈V∗ one has (w−1⋅f)(es)=f(ρ(w−1)−1es)=f(ρ(w)es); by [F1] applied to the element w−1 either w−1C∘⊆Bs or w−1C∘⊆sBs. In the first case f(ρ(w)es)>0 for every f∈C∘, so ρ(w)es∈V+∖{0} by 2.1 and hence in Φ+; in the second case f(ρ(w)es)<0 for every f∈C∘, so −f(ρ(w)es)=f(−ρ(w)es)>0 for every f∈C∘, whence −ρ(w)es∈V+∖{0} by 2.1 and ρ(w)es∈−V+∖{0}, so it lies in Φ−. The two alternatives are exclusive because V+∩(−V+)={0} while ρ(w)es≠0 by 1.1. Since every root is some ρ(w)es and −ρ(w)es=ρ(ws)es is a root, this gives Φ=Φ+⊔Φ− and Φ−=−Φ+; taking w=1 gives es=ρ(1)es∈V+∖{0} and hence es∈Φ+. Reading the two cases displayed above as equivalences with 2.1 gives ρ(w)es∈Φ+  ⟺  w−1C∘⊆Bs and ρ(w)es∈Φ−  ⟺  w−1C∘⊆sBs, and with 2.1 the last sentence of (2) follows.

4.1step 3.1F2F3algebra∎

Simple reflections act on positive roots. Fix s∈S. That rses=−es is [F2]. Let α∈Φ+∖{es}. Since rs=ρ(s) and Φ is ρ(W)-invariant by [F3], rsα∈Φ, so by 3.1 either rsα∈Φ+ or rsα∈Φ−. Suppose rsα∈Φ−, that is rsα∈−V+∖{0}, and write rsα=α−2B(α,es)es by [F2] with B(es,es)=1. In coordinates: (rsα)(r)=α(r) for r≠s and (rsα)(s)=α(s)−2B(α,es). Since α∈V+∖{0} all coordinates α(r) are nonnegative and not all vanish, and since rsα∈−V+∖{0} all its coordinates are nonpositive; for r≠s both statements apply to α(r), so α(r)=0 for all r≠s, that is α=α(s)es with α(s)>0. Then 1=B(α,α)=α(s)2B(es,es)=α(s)2, so α(s)=1 and α=es, contradicting the choice of α. Hence rsα∈Φ+; moreover rsα≠es, because rses=−es and rs is an involution, so rsα=es would give α=−es∉Φ+. Thus rs(Φ+∖{es})⊆Φ+∖{es}, and applying the involution rs once more gives equality. Finally rsΦ=Φ: indeed rs=ρ(s) maps Φ into Φ by [F3], and rs2=id by [F2], so this map is a bijection of Φ; consequently rsΦ+=(Φ+∖{es})∪{−es}. This is (3), while (1) is 2.1 and (2) is 3.1.

Depends on

Used by

Dependency tree · two levels

81 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