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.

Positive radical, corank one, positive definiteness of proper submatrices, and domination exclusions

Statement

Let S be a finite set with Coxeter matrix m, let W be the presented group (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), let Γ be its diagram (Coxeter diagrams: edges, labels, components and finite type), and let V=RS carry the Coxeter form B (The real Coxeter form, its radical, reflections, and form-preserving maps). Assume that Γ is connected, that B(es,et)≤0 for distinct s,t, and that B is positive semidefinite (Positive and negative definiteness, the inertia (p,q,r), rank p+q, and signature p−q of a real symmetric bilinear or quadratic form) with rad⁡(B)≠{0}. These are the raw hypotheses; no corank-one condition is assumed.

(1) Positive radical and corank one. If x=∑sxses∈rad⁡(B) and x≠0, then xs≠0 for every s∈S. The set of x∈rad⁡(B) with xs>0 for all s is nonempty and consists of the positive multiples of one vector δ; in particular dim⁡rad⁡(B)=1 and rad⁡(B)=Rδ. [No Perron-Frobenius theorem is used.]

(2) Proper principal submatrices and parabolics. For every proper subset T⊊S, the principal submatrix (B(es,et))s,t∈T is positive definite, with the T=∅ case vacuous. For nonempty T, the standard parabolic WT:=⟨s:s∈T⟩ (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups) has the Coxeter presentation with restricted matrix m∣T×T (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2)); its Coxeter form is the displayed principal submatrix, so WT is finite by Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1). For T=∅, WT={1} is finite by definition.

(3) Domination. Let T⊆S and let Γ′ be a Coxeter diagram on T, with edge labels in {3,4,… }∪{∞}, whose underlying graph is a subgraph of the induced subdiagram ΓT and whose retained edge labels are no larger than the corresponding labels of ΓT. For a nonedge use label 2; put m′(s,s)=1, and let BΓ′ be the symmetric form on RT 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)=∞. Thus nonedges have entry 0. If Γ′≠ΓT (a strict instance of the usual label/subgraph domination relation), then its cosine matrix is positive definite. Here the relation is applied to ΓT even when it is disconnected; when T=S, it is the relation of [Davis, Appendix C.3]. Consequently, if the cosine matrix of some such Γ′ is not positive definite - for instance if it has a nonzero vector v with BΓ′(v,v)≤0, or, when T≠∅, if its determinant is ≤0 while some proper principal submatrix is positive definite (Sylvester's criterion: a real symmetric n×n matrix with n≥1 is positive definite if and only if all leading principal minors are positive, For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix) - then ΓT cannot strictly dominate Γ′.

(4) Use. Clauses (1)-(3) supply the positive-radical structure and domination exclusion used to enumerate connected diagrams of the affine form type defined in Irreducible affine Coxeter type: the corank-one form, the radical quotient, and the affine slice (1). This reference supplies terminology only: the hypotheses above are raw and the proof does not assume corank one.

Facts & Assumptions

Given: A finite set S with Coxeter matrix m, presented group W, diagram Γ (connected) and the form B on V=RS, with B(es,es)=1, B(es,et)≤0 for s≠t and B(es,et)=−1 exactly when m(s,t)=∞; B is positive semidefinite, B(v,v)≥0 for all v, and rad⁡(B)≠{0}.

[F1]

B is symmetric and bilinear, with B(es,es)=1, the stated cosine entries, and the given inequalities B(es,et)≤0 for s≠t (The real Coxeter form, its radical, reflections, and form-preserving maps, Bilinear forms, and symmetric, skew-symmetric, and alternating bilinear forms). The coordinate functions es form a basis of V=RS: each u is ∑su(s)es, and evaluation at each index gives uniqueness.

[F2]

The radical rad⁡(B)={v:B(v,w)=0 for all w∈V} is closed under linear combinations by bilinearity, hence is a linear subspace; B vanishes on rad⁡(B)×V (The real Coxeter form, its radical, reflections, and form-preserving maps, The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space, Linear subspace of a vector space).

[F3]

By the hypothesis of positive semidefiniteness, B(v,v)≥0 for every v; positive definiteness means B(v,v)>0 for every v≠0 (Positive and negative definiteness, the inertia (p,q,r), rank p+q, and signature p−q of a real symmetric bilinear or quadratic form).

[F4]

Two vertices s≠t of Γ are adjacent exactly when m(s,t)≥3 (Coxeter diagrams: edges, labels, components and finite type).

[F5]

For a real symmetric n×n matrix with n≥1, positive definiteness is equivalent to positivity of all leading principal minors; in particular, a nonpositive determinant rules out positive definiteness (Sylvester's criterion: a real symmetric n×n matrix with n≥1 is positive definite if and only if all leading principal minors are positive, For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix).

[F7]

Cosine is strictly decreasing on [0,π] (Signs, monotonicity intervals, and ranges of sine and cosine).

[F9]

The standard parabolic is WT=⟨s:s∈T⟩ (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups); ⟨∅⟩={1} (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups); and the group presented by the restricted matrix maps isomorphically to WT, making (WT,T) a Coxeter system (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2)).

[F10]

For a Coxeter system, its group is finite if and only if its Coxeter form is positive definite (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1)).

[F11]

Connectedness of Γ means its underlying graph is connected (Coxeter diagrams: edges, labels, components and finite type).

[F12]

Proof

technique · direct; the $|x|$ trick replaces Perron-Frobenius, and the domination clause is the equality case of a three-term comparison. All sums and choices are finite; no choice principle is used
1.1F1algebra

(The absolute-value inequality.) For x=∑sxses∈V put q(x):=B(x,x) and y:=∑s∣xs∣es. Expanding in the basis (es), q(x)−q(y)=2∑{s,t}∈(S2)B(es,et)(xsxt−∣xs∣∣xt∣), where the sum runs over unordered pairs of distinct indices. Each summand is ≥0 because B(es,et)≤0 and xsxt≤∣xsxt∣=∣xs∣∣xt∣; hence q(y)≤q(x) [F1].

1.2F2F3F1algebra

(The radical of a positive semidefinite form.) If q(v)=0 then v∈rad⁡(B): for every w∈V and every t∈R one has 0≤q(v+tw)=2tB(v,w)+t2q(w). If q(w)>0 then choosing t=−B(v,w)/q(w) gives −B(v,w)2/q(w)≥0, so B(v,w)=0; if q(w)=0 then 2tB(v,w)≥0 for every t, so again B(v,w)=0.

1.3F1F2F4F7F11F12algebra

(Propagation of zeros along the diagram.) Let y=∑syses∈rad⁡(B) with ys≥0 for all s, and suppose yi=0 for some i∈S. Since B is symmetric and y is radical, 0=B(ei,y)=∑tB(ei,et)yt [F1, F2]. Each summand is ≤0: this follows from yt≥0 and B(ei,et)≤0 for t≠i, while the t=i term is 1⋅0=0 [F1]. Hence every summand is 0; in particular yj=0 for every neighbour j of i, because neighbours have B(ei,ej)<0 by [F1, F4, F7, F12]. Iterating along the connected diagram Γ [F11] gives yt=0 for all t∈S.

2.1F3step 1.1step 1.2step 1.3algebra

(Full support of nonzero radical vectors.) Let x=∑sxses∈rad⁡(B), x≠0, and put y:=∑s∣xs∣es. By step 1.1, q(y)≤q(x)=0, and by positive semidefiniteness q(y)≥0, so q(y)=0 [F3]; by step 1.2, y∈rad⁡(B), and y≠0 because x≠0. If some xi were 0, then yi=0 and step 1.3 would give y=0, a contradiction. Hence xs≠0 for every s∈S.

3.1F1F2step 2.1step 1.3algebra

(Existence, uniqueness and full span of the positive radical vector.) Replacing any nonzero x∈rad⁡(B) by y=∑s∣xs∣es gives a nonzero radical vector with nonnegative coordinates; step 1.3 shows every coordinate is positive. Thus the positive radical set is nonempty. If x,x′ both belong to it and were linearly independent, let t∗:=min⁡sxs/xs′>0 and w:=x−t∗x′. Bilinearity shows w∈rad⁡(B); some coordinate of w is 0, and w≠0, contradicting step 2.1. Hence any two positive radical vectors are positive scalar multiples. Fix one such vector δ. For an arbitrary z=∑szses∈rad⁡(B), if some zs<0 put M:=∑zs<0(−zs/δs)>0 and ε:=1/(2M); otherwise put ε:=1. In either case every coordinate of δ+εz is positive. Bilinearity puts this vector in rad⁡(B), so the uniqueness just proved gives δ+εz=tδ for some t>0. Therefore z=((t−1)/ε)δ. This proves rad⁡(B)=Rδ and dim⁡rad⁡(B)=1 by [F8].

3.2F1F3step 1.2step 2.1algebra

(Proper principal submatrices are positive definite.) Let T⊊S and let u∈RT be nonzero. Pad its coordinates by zero to obtain u~∈V. Since B is positive semidefinite, B(u~,u~)≥0. If equality held, step 1.2 would put u~ in rad⁡(B); it is nonzero and has a zero coordinate outside T, contradicting step 2.1. Hence B(u~,u~)>0 for every nonzero u, exactly positive definiteness of the principal submatrix. If T=∅, this condition is vacuous and the zero-dimensional form is positive definite by definition.

3.3F1F2F3F4F7step 1.2step 2.1algebra

(Domination.) Let Γ′, T and BΓ′ be as in (3), and write A′ for its cosine matrix. Let A be the matrix of B; after reordering the vertices so that T comes first, A′ is indexed by the same first ∣T∣ vertices. For an edge of Γ′ with label m′≤m, the entry is −cos⁡(π/m′)≥−cos⁡(π/m) by [F7]; if the labels differ, the inequality is strict, including the convention π/∞=0. For a pair not joined in Γ′, its entry is 0≥Ast. Thus Ast≤Ast′≤0 for all distinct s,t∈T, while both diagonals are 1 [F1, F4]. Suppose A′ is not positive definite. By [F3], some nonzero x∈RT satisfies xTA′x≤0. Pad z:=(∣xs∣)s∈T by zero outside T. Then 0≤zTAz≤∑s,t∈TAst′∣xs∣∣xt∣≤xTA′x≤0. The first inequality is positive semidefiniteness; the second follows termwise from Ast≤Ast′ and nonnegative coordinate products; the third follows termwise because Ast′≤0 off the diagonal and xsxt≤∣xs∣∣xt∣. Equality throughout gives B(z,z)=0, so z∈rad⁡(B) by step 1.2. Since z≠0, step 2.1 forces every coordinate of z to be nonzero, hence T=S and every xs≠0. Equality in the second inequality then forces Ast=Ast′ for every distinct pair, so the strict monotonicity in [F7] gives the same edges and labels: Γ′=ΓT, contrary to the hypothesis. Therefore A′ is positive definite.

4.1F1F9F10step 3.2algebra

(The proper standard parabolics are finite.) Let T⊊S. If T≠∅, step 3.2 makes its restricted Coxeter form positive definite, and [F9] identifies (WT,T) as a Coxeter system with that restricted form; [F10] then gives that WT is finite. If T=∅, [F9] gives WT={1}, also finite.

5.1F3F5step 3.3algebra∎

(The exclusion consequence.) If A′ has a nonzero vector v with BΓ′(v,v)≤0, then it is not positive definite by definition [F3]. If T≠∅ and det⁡A′≤0, then its last leading principal minor is nonpositive, so A′ is not positive definite by Sylvester's criterion [F5]; this also covers the statement's example that additionally assumes a proper principal submatrix is positive definite. By step 3.3, neither obstruction is compatible with strict domination.

Depends on

Used by

Cited to discharge well-definedness by Irreducible affine Coxeter type: the corank-one form, the radical quotient, and the affine slice.

Dependency tree · two levels

136 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