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

Reflection cardinalities of the three connected finite rank-three types

Statement

For a Coxeter system of type A3, B3 or H3, let T={wsw−1:w∈W, s∈S} be its set of Coxeter reflections, using Coxeter-system, roots, length and weak-order conventions. Then ∣T∣ is respectively 6, 9 or 15.

Facts & Assumptions

[F1]

∣T∣=∣Φ+∣ for a finite Coxeter system (The longest element as the opposition of the chamber, and longest elements of finite parabolics, part (1)(ii)).

[F2]

For irreducible finite type of rank n≥2 and bipartite Coxeter element of order h, ∣Φ+∣=nh/2 (The Coxeter plane, ordered-root enumeration, and invertibility of the Coxeter action minus the identity, part (3)).

[F3]

For the bipartite Coxeter element c, the complexified canonical operator ρC(c) has exact order n+1 in type An (n≥1) and 2n in type Bn (n≥2) (The Coxeter elements of the classical types Aₙ, Bₙ, Dₙ and I₂(m): characteristic polynomials, orders and spectral exponents from their reflection models, Statement). The real canonical operator ρ(c) has exact order 10 in type H3 (The six exceptional Coxeter spectra: characteristic polynomials, orders and spectral exponents from exact matrices, Statement, H3 case).

[F4]

The standard diagrams A3, B3 and H3 are three-vertex paths with successive edge labels (3,3), (3,4) and (3,5), respectively; each defines a finite irreducible Coxeter system (Classification of finite Coxeter systems, including the H and dihedral families, part (1)).

[F5]

For a Coxeter system with finite S, its canonical reflection homomorphism ρ is injective (The root-length criterion and faithfulness of the canonical reflection representation, part (3)).

Proof

Given: A Coxeter system of one of the stated rank-three types, its canonical representation ρ, roots Φ and reflection set T as in Coxeter-system, roots, length and weak-order conventions. Goal: Evaluate ∣T∣ using exact supplier statements.

Proof technique: direct.

1.1givenF4algebra

By [F4] each diagram is connected with three vertices, and its Coxeter group is finite. Thus the system is irreducible finite type with n=3≥2. Number the path vertices 1,2,3 in order. The classes J={s1,s3} and K={s2} form a bipartition. Since the endpoints are not joined, m(s1,s3)=2 and the Coxeter relations give s1s3=s3s1. Hence c=(s1s3)s2 is a bipartite Coxeter element in the convention of the spectrum and root-enumeration suppliers. Reversing the two classes replaces ab by ba=a−1(ab)a, so it does not change the order.

2.1step 1.1F3F5algebra

The operators in [F3] therefore have exact orders q=4,6,10, respectively. For the classical cases, complexification has the same real matrix entries in the simple-root basis, so ρC(c)k=I if and only if ρ(c)k=I for every positive integer k. For all three cases, ∣S∣=3 permits [F5], and injectivity gives ρ(c)k=I if and only if ck=1. Consequently the group element has exact order h=ord⁡(c)=q, namely 4, 6 or 10.

3.1step 1.1step 2.1F1F2algebra∎

By [F1] and [F2], ∣T∣=∣Φ+∣=3h/2. Substitution gives 3⋅4/2=6, 3⋅6/2=9 and 3⋅10/2=15. The use of canonical roots only evaluates the abstract conjugate set T; it does not assume an unproved identification of the original arrangement with a canonical representation.

Depends on

Used by · 1

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.