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.

Disconnected diagrams, direct products, and comparison of invariant forms

Statement

Let S be a finite set with Coxeter matrix m, presented group W and length function ℓ (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), with diagram Γ (Coxeter diagrams: edges, labels, components and finite type), and let V=RS carry the Coxeter form B with canonical reflection homomorphism ρ:W→GL(V) (The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone). Let the connected components of Γ have the nonempty pairwise disjoint vertex sets S1,…,Sk of S; put Wi:=WSi and Vi:=span{es:s∈Si}. Allow k=1 when Γ is connected and k=0 when S=∅, with the empty product equal to the trivial group and the empty direct sum equal to {0}.

(1) Direct product and length. The subgroups Wi commute elementwise, Wi∩Wj={1} for i≠j, and the multiplication map μ:W1×⋯×Wk→W, μ(w1,…,wk)=w1⋯wk, is an isomorphism of groups (Group isomorphisms, automorphisms and the set Aut⁡(G), The external direct product G×H with componentwise multiplication). Moreover ℓ(w1⋯wk)=ℓ(w1)+⋯+ℓ(wk) for all wi∈Wi, the lengths on the right being those of the factors, which agree with the restriction of ℓ (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2)).

(2) Orthogonal decomposition. B(vi,vj)=0 for all vi∈Vi, vj∈Vj, i≠j; hence V=V1⊕⋯⊕Vk is a B-orthogonal direct sum, each ρ(Wi) preserves Vi and fixes every Vj (j≠i) pointwise, and with Bi:=B∣Vi×Vi the form is B=B1⊕⋯⊕Bk.

(3) Invariant forms. Let β be a symmetric bilinear form on V invariant under ρ(W), i.e. β(ρ(w)u,ρ(w)v)=β(u,v) for all w∈W and u,v∈V.

(i) For every s∈S one has β(es,⋅)=λs B(es,⋅) with λs:=β(es,es); in particular β(es,et)=λsB(es,et) for all s,t∈S.

(ii) λs=λt whenever s and t lie in the same component of Γ. Consequently there are λ1,…,λk∈R with β∣Vi×Vi=λiBi for every i, that is, β=λ1B1⊕⋯⊕λkBk; if Γ is connected then β=λB for a single λ∈R.

(iii) If in addition β 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), then λi=β(es,es)>0 for every i and every s∈Si, and B is positive definite.

(4) Finite groups have positive definite form. If W is finite then B is positive definite.

Facts & Assumptions

Given: A finite set S with Coxeter matrix m, the presented group W with length ℓ, the diagram Γ with components S1,…,Sk, the space V=RS with the Coxeter form B and the canonical reflection homomorphism ρ; and, when a form β is mentioned, a symmetric bilinear form β invariant under ρ(W).

[F1]

The relators of the presentation are s2 (s∈S) and (st)m(s,t) (s≠t, m(s,t)<∞); every map S→G into a group sending these relators to 1 extends uniquely to a homomorphism W→G. For J⊆S, WJ=⟨J⟩ is the group presented by the restricted matrix m∣J×J under the canonical map, and WJ={w:S(w)⊆J}, where S(w)⊆J means that w has a reduced expression with all letters in J; hence WI∩WJ=WI∩J and W∅={1} (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification).

[F2]

The components of Γ partition S and are connected; distinct components are joined by no edge, so for s∈Si, t∈Sj with i≠j one has m(s,t)=2, and within a component two vertices are joined exactly when m(s,t)≥3 (Coxeter diagrams: edges, labels, components and finite type).

[F3]

B(es,es)=1 and B(es,et)=−cos⁡(π/m(s,t)) for finite m(s,t), while B(es,et)=−1 when m(s,t)=∞; also cos⁡(π/2)=0, and cos⁡(π/m)>0 for finite m≥3 by strict decrease of cosine on [0,π] (Signs, monotonicity intervals, and ranges of sine and cosine). For a∈V with B(a,a)≠0 the reflection ra(v)=v−2B(v,a)B(a,a)a is linear, ra2=idV, ra(a)=−a, ker⁡B(−,a) is a hyperplane fixed pointwise by ra, and B(rau,raw)=B(u,w) (The real Coxeter form, its radical, reflections, and form-preserving maps, Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order, Quarter-turn values and shifts by pi/2 and pi).

[F4]

ρ:W→GL(V) is a group homomorphism with ρ(s)=res for every s∈S, and B(ρ(w)u,ρ(w)w′)=B(u,w′) 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).

[F5]

The external direct product W1×⋯×Wk is a group under componentwise operations; a homomorphism on each factor with pairwise commuting images defines a homomorphism of the product, and a bijective homomorphism is an isomorphism. For J⊆S, the finite words in J form a subgroup (inverses reverse words because s−1=s) containing J and contained in every subgroup containing J; thus they constitute WJ (The external direct product G×H with componentwise multiplication, G×H is a group with identity (eG,eH), coordinatewise inverses, and homomorphic coordinate projections, Monoid homomorphism and group homomorphism, Group isomorphisms, automorphisms and the set Aut⁡(G), The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups, Group and abelian group, Internal direct products of finitely many normal subgroups).

[F7]

A symmetric bilinear form is positive definite when its quadratic form is >0 on every nonzero vector; a positive multiple of a positive definite form is positive definite, as is its restriction to a subspace (Positive and negative definiteness, the inertia (p,q,r), rank p+q, and signature p−q of a real symmetric bilinear or quadratic form).

[F8]

The standard inner product β0(u,v)=∑s∈Su(s)v(s) is a symmetric positive definite bilinear form on V, every u≠0 has β0(u,u)>0, finite sums may be reindexed by a bijection of the finite index set (enumerate that set; adjacent swaps preserve the sum by associativity and commutativity, and every finite permutation is obtained by such swaps), and a finite set has a cardinality (Real and complex inner-product spaces and their induced length, Finite sums and finite products, by recursion, Laws of finite sums and finite products, The cardinality ∣A∣ of a finite set).

Proof

technique · direct; universal properties for the group statements and a proportionality argument for the forms
1.1F1F2F5algebra

(Commuting factors and trivial intersections.) If S=∅, all four clauses hold: W={1}, V={0}, the product and sums are empty, and positive definiteness is vacuous. Hence assume S≠∅ for the remaining argument. Let s∈Si, t∈Sj with i≠j; by [F2] m(s,t)=2, so (st)2 is a relator and st=ts in W by [F1]; since the s∈Si generate Wi [F1, F5], the subgroups Wi,Wj commute elementwise. For the intersection, Wi∩Wj=WSi∩WSj=WSi∩Sj=W∅={1} by the support description of [F1], because Si∩Sj=∅ [F2].

1.2F2F3F4F5F6algebra

(Orthogonal decomposition.) For s∈Si and t∈Sj with i≠j, m(s,t)=2 [F2] and hence B(es,et)=−cos⁡(π/2)=0 by [F3]; by bilinearity [F6] this gives B(Vi,Vj)=0. Since the es form a basis of V and the Si partition it, grouping the unique basis expansion by its supports Si gives a unique decomposition into vectors of the Vi, so V=V1⊕⋯⊕Vk is a B-orthogonal direct sum and B=B1⊕⋯⊕Bk with Bi=B∣Vi×Vi [F6]. For the action, the reflection formula gives reset=et−2B(et,es)es: for t∈Si this lies in Vi, while for t∈Sj, j≠i, it equals et because B(et,es)=B(es,et)=0; hence ρ(s) preserves Vi and fixes each Vj with j≠i pointwise, and the same holds for every ρ(w) with w∈Wi since these are products of such generators [F4, F5].

1.3F3F4F6algebra

(Proportionality on one generator.) Fix s∈S and put H={v:B(v,es)=0}; by [F3] H is a hyperplane fixed pointwise by res=ρ(s) and reses=−es. For v∈H, invariance of β under ρ(s) gives β(es,v)=β(ρ(s)es,ρ(s)v)=β(−es,v)=−β(es,v), so β(es,v)=0; thus the linear functional β(es,⋅) vanishes on H, as does B(es,⋅), which is nonzero because B(es,es)=1 [F3]. Any linear functional ψ vanishing on H=ker⁡φ is a multiple of the nonzero functional φ: if φ(v0)≠0, then u−(φ(u)/φ(v0))v0∈H for every u, so ψ(u)=(ψ(v0)/φ(v0))φ(u). Hence β(es,⋅)=λsB(es,⋅) with λs:=β(es,es), and evaluating at et gives β(es,et)=λsB(es,et) for all t.

2.1F1F4F5step 1.1algebra

(The multiplication map is an isomorphism.) Every relator of (S,m) is mapped to 1 by the assignment s↦(1,…,s,…,1)∈W1×⋯×Wk placing s in the factor Wi with s∈Si: the relators s2 and (st)m(s,t) with s,t in one component hold in that factor because they hold in W, and for s∈Si, t∈Sj with i≠j the two images have disjoint supports, hence commute and are involutions, so the image of (st)2 is 1; by the universal property [F1] there is a homomorphism φ:W→W1×⋯×Wk with φ(s)=(1,…,s,…,1). Conversely the inclusions Wi→W are homomorphisms [F1] with pairwise commuting images by step 1.1, so (w1,…,wk)↦w1⋯wk is a homomorphism ψ:W1×⋯×Wk→W [F5]. The two are mutually inverse: ψφ and the identity of W are homomorphisms agreeing on the generating set S, and φψ and the identity of W1×⋯×Wk are homomorphisms agreeing on each coordinate generating set Wi (a generator s∈Si of the i-th factor is sent by φψ to φ(s)=(1,…,s,…,1)); hence μ=ψ is an isomorphism [F5].

2.2F2F3F6step 1.3algebra

(The scalars are constant on components.) For s≠t in the same component, step 1.3 gives β(es,et)=λsB(es,et) and, by symmetry of β and B, β(es,et)=β(et,es)=λtB(et,es)=λtB(es,et); since s,t lie in one component and are joined by a path, it suffices to treat adjacent pairs, where B(es,et)≠0: indeed for finite labels the cosine is positive when m(s,t)≥3, while an infinite label has B(es,et)=−1 [F3]; thus B(es,et)=0 forces m(s,t)=2, i.e. no edge [F2]. For such a pair (λs−λt)B(es,et)=0 gives λs=λt, and equality propagates along the edges of the connected component [F2], so there is λi with λs=λi for all s∈Si. Evaluating β on pairs of basis vectors of Vi step 1.3 then gives β∣Vi×Vi=λiBi for every i, that is, β=λ1B1⊕⋯⊕λkBk [F6]; if k=1 this is β=λB.

3.1F1F5step 1.1step 2.1algebra

(Length additivity.) Let wi∈Wi. Choosing a reduced expression of each wi, concatenation represents w1⋯wk with ∑iℓ(wi) letters, so ℓ(w1⋯wk)≤∑iℓ(wi). For the reverse inequality let w1⋯wk=s1s2⋯sℓ be a reduced expression of length ℓ=ℓ(w1⋯wk), with letters sj∈S; letters lying in distinct components commute in W by step 1.1, so we may reorder the sj within this word so that the letters of each Si become consecutive (the value in W is unchanged), obtaining w1⋯wk=w1′⋯wk′ with wi′ a product of ni letters from Si and ∑ini=ℓ. By the isomorphism of step 2.1 the projection W→Wi is the restriction of the inverse map and is a homomorphism [F5], so it sends w1⋯wk to wi and w1′⋯wk′ to wi′; hence wi′=wi and ℓ(wi)≤ni for each i; summing, ∑iℓ(wi)≤ℓ.

3.2F6F7step 2.2algebra

(Positive definite invariant forms give positive definite B.) Assume β positive definite. By step 2.2 β=λ1B1⊕⋯⊕λkBk, and each λi=β(es,es)>0 for s∈Si because es≠0 and β is positive definite [F7]. Hence Bi=λi−1β∣Vi×Vi is a positive multiple of the restriction of a positive definite form and is positive definite [F7]; a B-orthogonal direct sum of positive definite forms is positive definite, since a nonzero vector has some nonzero component vi and B(v,v)≥Bi(vi,vi)>0 [F6, F7]. Thus B=B1⊕⋯⊕Bk is positive definite, which is (3)(iii).

4.1F4F8step 3.2algebra∎

(Finite W has positive definite B.) Assume W finite and define β(u,v):=∑w∈Wβ0(ρ(w)u,ρ(w)v), a finite sum over the finite set W [F8] of symmetric bilinear terms, hence a symmetric bilinear form. It is ρ(W)-invariant: for g∈W, substituting w′=wg and using that w↦wg is a bijection of the finite set W [F8] gives β(ρ(g)u,ρ(g)v)=∑wβ0(ρ(wg)u,ρ(wg)v)=∑w′β0(ρ(w′)u,ρ(w′)v)=β(u,v). It is positive definite: every summand is ≥0 by [F8] and the summand with w=1 equals β0(u,u)>0 for u≠0, so β(u,u)>0. Applying step 3.2 to this β gives that B is positive definite, which is (4).

Depends on

Used by

Dependency tree · two levels

124 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