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

Finiteness criterion: W is finite exactly when the Coxeter form is positive definite

Statement

Let S be a finite set with Coxeter matrix m, presented group W, length function ℓ and diagram Γ (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, Coxeter diagrams: edges, labels, components and finite type); let V=RS carry the Coxeter form B with reflections ra (The real Coxeter form, its radical, reflections, and form-preserving maps), let ρ:W→GL(V) be the canonical reflection homomorphism (The canonical reflection homomorphism, roots, reflections, and the positive cone), and let V∗ be the algebraic dual with its dual action, the closed chamber C and its interior C∘ (The dual action, chambers, faces, and root hyperplanes, The dual action, the faces, and the rank-two chamber tiling).

(1) Finiteness criterion. W is finite if and only if B is positive definite (Positive and negative definiteness, the inertia (p,q,r), rank p+q, and signature p−q of a real symmetric bilinear or quadratic form).

(2) The dual form. Assume B is positive definite. Then b:V→V∗, b(v):=B(v,⋅), is a linear isomorphism, and B∗(f,g):=B(b−1f,b−1g) defines a positive definite symmetric bilinear form B∗ on V∗; for every w∈W the dual map ρ∗(w) preserves B∗: B∗(w⋅f,w⋅g)=B∗(f,g) for all f,g∈V∗.

(3) Isolation of the identity and discreteness. For every f∈C∘ the set Ωf:={h∈GL(V∗):h⋅f∈C∘} is an open neighbourhood of idV∗ in GL(V∗) and Ωf∩ρ∗(W)={id}. Consequently ρ∗(W) is a discrete subgroup of GL(V∗), and ρ(W) is a discrete subgroup of GL(V). This clause uses no positive definiteness of B.

Facts & Assumptions

Given: A finite set S with Coxeter matrix m, the presented group W with length ℓ, the diagram Γ, the space V=RS with Coxeter form B, the canonical homomorphism ρ, the dual space V∗ with the dual action, the chambers C,C∘ and the sets S(f)={s∈S:f(es)=0}.

[F1]

If W is finite then B is positive definite (Disconnected diagrams, direct products, and comparison of invariant forms (4)).

[F2]

B is the unique symmetric bilinear form on V with B(es,es)=1 and B(es,et)=−cos⁡(π/m(s,t)) for finite m(s,t), respectively B(es,et)=−1 for m(s,t)=∞ (The real Coxeter form, its radical, reflections, and form-preserving maps).

[F3]

ρ:W→GL(V) is a homomorphism with ρ(s)=res, and B(ρ(w)u,ρ(w)u′)=B(u,u′) for all w∈W (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 (w⋅f)(v)=f(ρ(w)−1v); the closed chamber is C={f:f(es)≥0 ∀s}, its interior is C∘={f:f(es)>0 ∀s}, and S(f)={s:f(es)=0} (The dual action, chambers, faces, and root hyperplanes).

[F5]

The dual action is an action by linear maps, and every face of C is nonempty; in particular C∘≠∅ (The dual action, the faces, and the rank-two chamber tiling).

[F6]

ρ is injective, the dual action W→GL(V∗) is injective, and if w≠1 there is s∈S with ρ(w)es negative in the root decomposition (The root-length criterion and faithfulness of the canonical reflection representation (3)).

[F7]

If f,g∈C, w∈W and w⋅f=g, then f=g and w∈WS(f); moreover Stab⁡W(f)=WS(f) for f∈C (Chamber collisions, point stabilizers, and the intersection rule (3),(4)).

[F10]

On RN the open sets are the metric-topology open sets, and a map is continuous exactly when preimages of open sets are open; finite unions and intersections of open sets are open; sums and products of continuous real maps are continuous, and composites of continuous maps are continuous because (g∘f)−1(U)=f−1(g−1(U)); a subset of RN is compact exactly when it is closed and bounded; Rn carries the metrics d1,d2,d∞ of Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it and any two norms on it are equivalent (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement, Open ball, closed ball and sphere in a metric space, Continuity of a map between metric spaces, at a point and globally, in the ε-δ form, Metric continuity characterisations, with countable choice for the sequential converse, Open cover, subcover, compact metric space, and compact subset of a metric space, Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line, Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed, A subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, Sums, products, absolute values, finite maxima and minima, and quotients of continuous real-valued maps on a topological space are continuous where defined, A norm on a real vector space, the induced metric, and the dictionary with the metric axioms, Equivalent norms, and the dictionary with equivalent metrics, For n≥1 all norms on Rn are equivalent, Coordinate columns [v]B and matrices [T]BC of linear maps relative to ordered bases, The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset).

[F11]

In an orthonormal basis of a finite-dimensional inner product space every vector is ∑j⟨v,φj⟩φj, the inner-product norm is a norm, and ∣⟨u,v⟩∣≤∥u∥ ∥v∥ with equality exactly for linearly dependent vectors; the matrix A of an isometry satisfies ATA=I, and the adjugate formula gives A−1=det⁡(A)−1adj⁡(A) for invertible matrices (The norm ∥v∥=⟨v,v⟩ induced by a real or complex inner product, The inner-product norm is definite, homogeneous, and satisfies the triangle inequality, Every finite-dimensional real or complex inner product space has an orthonormal basis, Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors, If det⁡(A) is a unit, then A−1=det⁡(A)−1adj⁡(A)). Determinants and cofactors are polynomials in the entries by induction using Laplace expansion computes the determinant along every row and every column over a commutative ring.

Proof

technique · direct; positive definiteness makes $B$ an inner product, and finiteness is read off a compact orthogonal group and an isolated identity
1.1F2F3F4F8F9algebra

(The dual form.) The case S=∅ is trivial: then V={0}, W={1} is finite by [F12] and B is positive definite vacuously, so assume S≠∅ and put n:=∣S∣≥1. Assume B positive definite. If B(v,x)=0 for all x then B(v,v)=0, so v=0 by [F8]; hence the linear map b:V→V∗, b(v):=B(v,⋅) [F9], has kernel {0} and, since dim⁡V∗=dim⁡V=n is finite, it is a linear isomorphism [F9]. The form B∗(f,g):=B(b−1f,b−1g) is symmetric and bilinear, and positive definite because f≠0 gives b−1f≠0 and B∗(f,f)=B(b−1f,b−1f)>0 [F8]. For w∈W and v∈V the two functionals b(ρ(w)v) and w⋅b(v) agree: at x both take the value B(ρ(w)v,x)=B(v,ρ(w)−1x), by [F3] applied to the pair ρ(w)−1x and by the dual-action formula [F4]; hence b−1(w⋅f)=ρ(w)b−1f and B∗(w⋅f,w⋅g)=B(ρ(w)b−1f,ρ(w)b−1g)=B(b−1f,b−1g)=B∗(f,g) for all f,g, so the dual action preserves B∗ [F3]. This is clause (2).

1.2F4F5F7F9F10F12algebra

(Isolation of the identity.) Let f∈C∘, nonempty by [F5], and put Ωf:={h∈GL(V∗):h(f)∈C∘} and Ωf′:={g∈GL(V):f∘g∈C∘}. C∘ is open in V∗: it is the finite intersection of the sets {f′:f′(es)>0} [F4], each the preimage of the open interval (0,∞)⊆R under the coordinate functional f′↦f′(es), which is continuous since its difference is bounded by the maximum coordinate difference [F10]; the maps h↦h(f) and g↦f∘g are linear on the finite-dimensional spaces End(V∗) and End(V) and hence continuous (each coordinate is a finite sum of matrix entries multiplied by fixed coordinates) [F9, F10], so Ωf and Ωf′ are open neighbourhoods of the identities, because f∈C∘. If ρ∗(w)∈Ωf, that is w⋅f=ρ∗(w)f∈C∘, then f∈C and w⋅f∈C, and the collision theorem [F7] gives w∈WS(f) with S(f)=∅ because f∈C∘; as W∅={1} [F12], w=1 and Ωf∩ρ∗(W)={id}. If instead ρ(w)∈Ωf′, then w−1⋅f=f∘ρ(w)∈C∘ by [F4], so the same argument with w−1 gives w−1∈WS(f)={1} and ρ(w)=idV; hence Ωf′∩ρ(W)={idV}. No positive definiteness is used in this step.

1.3F1

(Finite groups have positive definite form.) If W is finite then B is positive definite by [F1]; this proves the finite-W to positive-definite-B direction of (1), and no other argument is needed for it.

2.1F9F10F11step 1.1algebra

(Closedness and boundedness of O(B∗).) Assume B positive definite and let B∗ be the form of step 1.1; put O(B∗):={h∈GL(V∗):B∗(hφ,hψ)=B∗(φ,ψ) ∀φ,ψ∈V∗}. Identify End(V∗) with Rn2 by the dual basis (fs) of [F9] [F10]. For each pair i,j the function h↦B∗(hfi,hfj) is a finite sum of products ∑p,qhpihqjB∗(fp,fq) of entries of h with constants, hence continuous [F10]; Any endomorphism preserving B∗ is injective: hφ=0 implies B∗(φ,φ)=0 and hence φ=0; it is invertible by rank-nullity in finite dimension [F9]. Thus O(B∗) is exactly the preimage of the single point (B∗(fi,fj))ij under a continuous map End(V∗)→Rn2, hence closed [F10]. For boundedness fix an orthonormal basis (φ1,…,φn) of V∗ for B∗ [F11]; if h∈O(B∗) and hφi=∑jajiφj, then aji=B∗(hφi,φj) by the orthonormal expansion [F11], so ∣aji∣≤∥hφi∥ ∥φj∥=1 by Cauchy-Schwarz because B∗(hφi,hφi)=B∗(φi,φi)=1 [F11]; hence all matrix entries in this orthonormal basis are bounded by 1. A change to the fixed dual basis expresses each new entry as a finite linear combination of these entries with fixed coefficients; its absolute value is bounded by the sum of the absolute values of those coefficients. Therefore O(B∗) is bounded in the original Rn2 coordinates [F10].

2.2F10step 1.2algebra

(Discreteness of both images.) Let γ∈ρ∗(W). The set γΩf={h∈GL(V∗):γ−1h∈Ωf} is open in GL(V∗) as the preimage of the open set Ωf under the continuous map h↦γ−1h [F10], and it contains γ; if w=γh∈ρ∗(W) with h∈Ωf, then h=γ−1w∈ρ∗(W) (a subgroup) and step 1.2 forces h=id, so w=γ. Hence γΩf∩ρ∗(W)={γ} for every γ, so each point of ρ∗(W) is open in the subspace topology and ρ∗(W) is discrete [F10]. The same translation argument with Ωf′ shows that each point of ρ(W) is isolated, so ρ(W) is discrete as well. This proves clause (3), and no positive definiteness was used.

2.3F10F11step 1.2algebra

(Continuity of the operations, and a symmetric neighbourhood squaring into Ωf.) With End(V∗)≅Rn2 and End(V)≅Rn2 as in [F10], matrix multiplication has entries that are finite sums of products of entries of the factors, hence is continuous [F10], and the entries of the inverse are given by the adjugate formula h−1=det⁡(h)−1adj⁡(h) [F11], a polynomial in the entries divided by the continuous function det⁡, which is nonzero on GL [F10]; hence multiplication and inversion are continuous on the general linear groups [F10], and GL(V∗) is open in End(V∗) as the preimage of R∖{0} under det⁡ [F10, F11]. Since multiplication sends (id,id) to id∈Ωf with Ωf open [step 1.2], there are open neighbourhoods V1,V2⊆GL(V∗) of id with m(V1×V2)⊆Ωf: the open preimage m−1(Ωf) contains a maximum-coordinate ball around (id,id) in the paired matrix coordinates, and such a ball is a product of two balls about id [F10]; then U:=V1∩V2∩V1−1∩V2−1 (where W−1:={h−1:h∈W}) is an open symmetric neighbourhood of id in GL(V∗), since U=U−1, with U⋅U⊆V1⋅V2⊆Ωf [F10].

3.1F10step 2.1

(Compactness of O(B∗).) By step 2.1, O(B∗) is a closed and bounded subset of End(V∗)≅Rn2; by the Heine-Borel theorem a subset of Rn2 is compact if and only if it is closed and bounded [F10], so O(B∗) is compact.

4.1F6F10F11step 1.1step 1.2step 1.3step 2.2step 2.3step 3.1algebra∎

(Positive definite B gives finite W; conclusion.) Assume B positive definite and S≠∅ as in step 1.1; put Γ:=ρ∗(W), a subgroup of GL(V∗) that is contained in O(B∗) by the invariance proved in step 1.1 [step 1.1]. Let f∈C∘ and let U be the open symmetric neighbourhood of id with U⋅U⊆Ωf from step 2.3 [step 2.3]. Each hU (h∈O(B∗)) is open in End(V∗), being the image of the open set U under the linear isomorphism u↦hu with inverse k↦h−1k [F10, F11], so the family {hU∩O(B∗):h∈O(B∗)} is an open cover of the compact space O(B∗) from step 3.1 [step 3.1]; choose a finite subcover, say O(B∗)=⋃i=1N(hiU∩O(B∗)) [F10]. Each hiU contains at most one element of Γ: if w1=hiu1 and w2=hiu2 with u1,u2∈U and w1,w2∈Γ, then w2−1w1=u2−1u1∈U⋅U⊆Ωf because U=U−1, and w2−1w1∈Γ, so step 1.2 gives w2−1w1=id and w1=w2 [step 1.2]. Hence Γ has at most N elements, and faithfulness of the dual action [F6] gives ∣W∣=∣Γ∣≤N<∞. Therefore W finite if and only if B is positive definite, which is (1); clause (2) is step 1.1, clause (3) is steps 1.2 and 2.2, and the finite-W direction of (1) is step 1.3.

Depends on

Used by

Cited to discharge well-definedness by Coxeter diagrams: edges, labels, components and finite type.

Dependency tree · two levels

206 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