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

Descent of the reflection representation, unit root norms, and conjugation of reflections

Statement

Let S, m, V, B, W, rs, ρ, Φ, T be as in The canonical reflection homomorphism, roots, reflections, and the positive cone.

(1) Relators and descent. For every s∈S one has rs2=idV, and for all s≠t with m(s,t)<∞ one has (rsrt)m(s,t)=idV. Consequently the assignment s↦rs sends every relator of the presentation to the identity, and by the universal property of Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups there is a unique group homomorphism ρ:W→GL(V) with ρ(s)=rs for all s∈S.

(2) ρ preserves the form. For every w∈W and all u,w′∈V, B(ρ(w)u,ρ(w)w′)=B(u,w′).

(3) Roots have unit norm. For every w∈W and s∈S, B(ρ(w)es,ρ(w)es)=1; hence every root α∈Φ satisfies B(α,α)=1≠0 and rα is defined.

(4) Conjugation of reflections. Let g∈GL(V) be B-preserving and let a∈V with B(a,a)≠0. Then grag−1=rga. In particular, for every w∈W and s∈S, ρ(wsw−1)=ρ(w)rsρ(w)−1=rρ(w)es, so every t=wsw−1∈T acts on V as the reflection in the root ρ(w)es∈Φ.

Facts & Assumptions

Given: a finite set S, a Coxeter matrix m, the space V=RS, the Coxeter form B, the reflections ra and the presented Coxeter group W with its universal property, all as in the Statement of The canonical reflection homomorphism, roots, reflections, and the positive cone; here rs:=res for s∈S.

[F1]

For a∈V with B(a,a)≠0 the map ra is linear, satisfies ra2=idV and B(rau,raw)=B(u,w) for all u,w∈V; and for distinct s,t∈S with m(s,t)<∞ the product A=rsrt satisfies Am(s,t)=idV (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order, clauses (2) and (3)(iv)).

[F2]

The Coxeter form satisfies B(es,es)=1 for every s∈S, the symbol rs abbreviates res, and a linear map g is B-preserving when B(gu,gw)=B(u,w) for all u,w∈V (The real Coxeter form, its radical, reflections, and form-preserving maps).

[F3]

A subset H of a group W that is closed under the group operation and under inverses and contains a generating set S equals W, because W=⟨S⟩ is the smallest subgroup containing S; a group homomorphism satisfies φ(gh)=φ(g)φ(h) and φ(g−1)=φ(g)−1 (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups, Group and abelian group, Monoid homomorphism and group homomorphism).

Proof

technique · verify the relators, descend through the presentation's universal property, and propagate the form preservation along the subgroup generated by the images of the generators
1.1givenF1F2F4

For every s∈S the map rs=res is linear, B-preserving and satisfies rs2=idV: these are the identities of [F1] for a=es, whose hypothesis B(es,es)≠0 holds by [F2]. Since rs2=idV, the map rs is invertible with rs−1=rs, so rs∈GL(V).

1.2givenF1F2

For all distinct s,t∈S with m(s,t)<∞ one has (rsrt)m(s,t)=idV, directly from the exact order statement of [F1] applied to the plane spanned by es and et: the product rsrt acts there with exact order m(s,t), so its m(s,t)-th power is the identity on V.

1.3givenF1F2algebra

Conjugation formula. Let g∈GL(V) be B-preserving and let a∈V with B(a,a)≠0. Then B(ga,ga)=B(a,a)≠0, and for every v∈V the B-preservation of g gives B(g−1v,a)=B(g(g−1v),ga)=B(v,ga). Substituting into the definition of rga and writing v=g(g−1v), rga(v)=g(g−1v)−2B(g−1v,a)B(a,a)ga=g(g−1v−2B(g−1v,a)B(a,a)a)=grag−1(v), so grag−1=rga.

2.1givenF4step 1.1step 1.2

Descent. The assignment s↦rs sends the relator s2 to rs2=idV by 1.1 and the relator (st)m(s,t) to (rsrt)m(s,t)=idV by 1.2; these are exactly the relators of the presented Coxeter group W of Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, and the images rs lie in the group GL(V). So the universal property of that presentation gives a unique group homomorphism ρ:W→GL(V) with ρ(s)=rs for every s∈S.

3.1givenF2F3step 1.1step 2.1

ρ preserves the form, and roots have unit norm. Let H:={w∈W:B(ρ(w)u,ρ(w)w′)=B(u,w′) for all u,w′∈V}. Every s∈S lies in H by 1.1, since ρ(s)=rs. If g,h∈H then B(ρ(gh)u,ρ(gh)w′)=B(ρ(g)ρ(h)u,ρ(g)ρ(h)w′)=B(ρ(h)u,ρ(h)w′)=B(u,w′), using the homomorphism property of 2.1 and the B-preservation of ρ(g) and then of ρ(h), so gh∈H; and if g∈H, then B(ρ(g−1)u,ρ(g−1)w′)=B(ρ(g)ρ(g−1)u,ρ(g)ρ(g−1)w′)=B(u,w′), so g−1∈H. Thus H is a subgroup containing S, and since every element of W is the value of a finite word in S (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), so that the images of the elements of S generate W, [F3] gives H=W. In particular B(ρ(w)es,ρ(w)es)=B(es,es)=1 for all w∈W and s∈S by [F2], so every root α∈Φ has B(α,α)=1≠0 and the reflection rα is defined.

4.1givenstep 1.3step 2.1step 3.1∎

Conjugation of reflections by ρ. Let w∈W and s∈S. By 3.1 the map ρ(w) is B-preserving, and rs=ρ(s) by 2.1; applying the conjugation formula 1.3 with g=ρ(w) and a=es therefore gives ρ(w) rs ρ(w)−1=rρ(w)es. Since ρ is a homomorphism, ρ(w)−1=ρ(w−1) and ρ(w)ρ(s)ρ(w)−1=ρ(wsw−1), so ρ(wsw−1)=rρ(w)es. Hence for every t=wsw−1∈T the element ρ(t) is the reflection in the root ρ(w)es∈Φ, as asserted.

Depends on

Used by

…and 6 more results.

Cited to discharge well-definedness by The canonical reflection homomorphism, roots, reflections, and the positive cone.

Dependency tree · two levels

63 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