Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

A transported simple root lies in the positive span of the simple root and the inversion roots

Statement

Let S be a finite set, m a Coxeter matrix, W the presented group with length ℓ, V=RS with Coxeter form B and canonical reflection representation ρ, root system Φ=Φ+⊔Φ− with the reflection dictionary α↦tα, and inversion sets N(w)={α∈Φ+:ρ(w)α∈Φ−} (The canonical reflection homomorphism, roots, reflections, and the positive cone, Root sign coherence and the action of simple reflections on positive roots, The geometric inversion set N(w) of an element of a Coxeter group). For x=∑r∈Sarer∈V write supp⁡S(x):={r∈S:ar≠0}. Let s∈S and w∈W with s∉S(w), so that w∈WS∖{s} (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (1)). Fix a reduced expression w=r1⋯rk and let ti:=r1⋯ri−1riri−1⋯r1 be its prefix reflections, with corresponding positive roots βi:=ρ(r1⋯ri−1)eri∈Φ+; then N(w−1)={β1,…,βk} (The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (2)). Then:

(1) ρ(w)es=es+∑i=1kciβi with ci≥0 for every i; in particular ρ(w)es∈Φ+, which also gives ℓ(ws)>ℓ(w) (The root-length criterion and faithfulness of the canonical reflection representation (1)).

(2) Every coefficient of ρ(w)es in the simple basis (er)r∈S is nonnegative, the coefficient of es is 1, and supp⁡S(ρ(w)es)⊆S(w)∪{s}.

(3) The conclusions of (1) and (2) hold for every u∈W with s∉S(u) and every reduced expression of u; in particular u↦ρ(u)es maps WS∖{s} into Φ+.

Facts & Assumptions

Given: A finite set S, a Coxeter matrix m on S, the presented group W with length function ℓ, the space V=RS with Coxeter form B, the canonical reflection representation ρ:W→GL(V), the root system Φ=Φ+⊔Φ−, an element s∈S and an element w∈W with s∉S(w), and a reduced expression w=r1⋯rk with prefix reflections ti=r1⋯ri−1riri−1⋯r1 and prefix roots βi:=ρ(r1⋯ri−1)eri.

[F1]

The real Coxeter form, its radical, reflections, and form-preserving maps: B is the unique symmetric bilinear form with B(es,es)=1, B(es,et)=−cos⁡(π/m(s,t)) for finite m(s,t) and B(es,et)=−1 when m(s,t)=∞; for a∈V with B(a,a)≠0 the reflection with normal a is ra(v)=v−2B(v,a)B(a,a)a, so rer1(v)=v−2B(v,er1)er1.

[F2]

The canonical reflection homomorphism, roots, reflections, and the positive cone: ρ is the group homomorphism with ρ(s)=res for every s∈S, and Φ={ρ(w)es:w∈W, s∈S}.

[F3]

Root sign coherence and the action of simple reflections on positive roots: (2) Φ=Φ+⊔Φ− with Φ±=Φ∩(±V+) and V+={∑s∈Sλses:λs≥0}; (3) rs(Φ+∖{es})=Φ+∖{es} for every s∈S.

[F4]

The geometric inversion set N(w) of an element of a Coxeter group: for u∈W, N(u)={α∈Φ+:ρ(u)α∈Φ−}.

[F5]

The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (2): if u=s1⋯sm is a reduced expression, then N(u−1)={ρ(s1⋯si−1)esi:1≤i≤m}, these elements being pairwise distinct positive roots.

[F6]

Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (1): S(u) is the support of u, independent of the reduced expression, and S(r1u′)={r1}∪S(u′) for a reduced expression r1u′.

[F7]

The root-length criterion and faithfulness of the canonical reflection representation (1): for all u∈W, t∈S, ℓ(ut)>ℓ(u)  ⟺  ρ(u)et∈Φ+ and ℓ(ut)<ℓ(u)  ⟺  ρ(u)et∈Φ−.

[F8]

Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives (2): for I⊆S one has VI=span⁡{es:s∈I} and ΦI={ρ(v)es:v∈WI, s∈I}=Φ∩VI.

Proof

technique · Induction on $\ell(u)$, over a statement that also records the support of the transported root
1.1giveninduction

We prove the following statement P(ℓ) for every ℓ≥0: for every u∈W with ℓ(u)=ℓ, every t∉S(u) and every reduced expression u=s1⋯sℓ with prefix roots γi:=ρ(s1⋯si−1)esi, one has ρ(u)et=et+∑i=1ℓciγi with ci≥0 for all i. For the given pair (w,s) we have ℓ(w)=k by the reducedness of w=r1⋯rk, so clause (1) is the instance u=w, t=s of P(k), clause (3) is the same statement quantified over all pairs (u,s) with s∉S(u), and clause (2) is obtained from it in the last steps.

1.2baseF2

Base case ℓ=0: here u=1, the expression is empty, and the homomorphism property in [F2] gives ρ(1)et=et, which is the claimed identity with the empty sum.

1.3ihF6

Induction hypothesis: assume P(m) for all m≤ℓ−1 and let u=r1u′ be a reduced expression with u′=r2⋯rℓ, so ℓ(u′)=ℓ−1 and u′ inherits t∉S(u′) from t∉S(u)={r1}∪S(u′), using the support clause in F6.

2.1step 1.3F5

Applying the hypothesis of step 1.3 to the pair (u′,t) and the reduced expression r2⋯rℓ gives ρ(u′)et=et+∑i=2ℓciγi′ with ci≥0 and γi′:=ρ(r2⋯ri−1)eri the pairwise distinct prefix roots of u′; by the prefix-root formula [F5], N((u′)−1)={γ2′,…,γℓ′}.

2.2step 1.3F1F2algebra

By [F2], ρ(r1)=rer1; applying the reflection formula and Coxeter-form entries from [F1] gives ρ(r1)et=et−2B(et,er1)er1=et+c1er1 with c1:=−2B(et,er1)≥0: indeed t≠r1 because t∉S(u) and r1∈S(u), and every off-diagonal value of B is ≤0 since m(s,t)≥2 for s≠t gives cos⁡(π/m(s,t))≥0. Moreover er1=γ1 is the first prefix root of u.

3.1step 2.1F4F7F9

No prefix root γi′ of u′ equals er1: if γi′=er1, then er1∈N((u′)−1) by step 2.1; the inversion-set definition [F4] gives ρ((u′)−1)er1∈Φ−. The root-length criterion [F7] then gives ℓ((u′)−1r1)<ℓ((u′)−1), which by [F9] is ℓ(r1u′)<ℓ(u′), contradicting the reducedness of u=r1u′.

4.1step 2.1step 3.1F3algebra

For i≥2 we have γi′∈Φ+∖{er1} by steps 2.1 and 3.1, so the simple-reflection action in F3 gives ρ(r1)γi′∈Φ+∖{er1}; and ρ(r1)γi′=ρ(r1⋯ri−1)eri=γi is the i-th prefix root of u.

5.1step 2.1step 2.2step 4.1F2algebra

The homomorphism property in [F2] gives ρ(u)=ρ(r1)ρ(u′), so steps 2.1, 2.2 and 4.1 give ρ(u)et=et+c1γ1+∑i=2ℓciγi with all coefficients ≥0; this is P(ℓ).

6.1step 1.2step 1.3step 5.1discharge-induction

The base case of step 1.2 and the induction step, using step 1.3 to set up and step 5.1 to prove the inductive case, establish P(ℓ) for every ℓ≥0. In particular P(k) gives, for the given pair (w,s) and the reduced expression w=r1⋯rk, the expansion ρ(w)es=es+∑i=1kciβi with ci≥0 for all i.

7.1step 6.1F3F6F8

By the support clause F6, each prefix root βi=ρ(r1⋯ri−1)eri has r1⋯ri−1∈WS(w) and ri∈S(w); hence the parabolic root identity F8 gives βi∈ΦS(w)=Φ∩VS(w). By the sign split F3, each βi∈Φ+⊆V+ is a nonnegative combination of the simple roots er with r∈S(w) and has no es-coordinate, since s∉S(w). Therefore every simple coordinate of ρ(w)es is ≥0 by step 6.1, its es-coordinate equals 1, and its support satisfies supp⁡S(ρ(w)es)⊆S(w)∪{s}; this proves clause (2).

8.1step 6.1step 7.1F2F3F7

By the root-orbit definition [F2], ρ(w)es∈Φ; step 7.1 shows it lies in V+∖{0}, so the sign split F3 gives ρ(w)es∈Φ+. The root-length criterion F7 now gives ℓ(ws)>ℓ(w), completing clause (1).

9.1step 6.1step 7.1step 8.1F6discharge-induction∎

By the parabolic-support clause F6, the elements u with s∉S(u) are exactly WS∖{s}. For any such u, P(ℓ(u)) supplies the expansion of (1), step 7.1 gives the support statement of (2) with S(w) replaced by S(u), and step 8.1 gives ρ(u)es∈Φ+; hence u↦ρ(u)es maps WS∖{s} into Φ+.

Depends on

Used by

Dependency tree · two levels

49 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