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.
Reducible positive semidefinite forms: factorwise treatment and the square alcove
Example
Let be a Coxeter system with finite and disconnected diagram , whose connected components have nonempty vertex sets (Coxeter diagrams: edges, labels, components and finite type (2)); let , , , and let be the Coxeter form on (The real Coxeter form, its radical, reflections, and form-preserving maps). Here positive semidefinite means for every , corank means , and indefinite means the form takes both positive and negative values. Write and . Then:
(i) Factorwise structure. The form is the orthogonal direct sum on , and with length additive (Disconnected diagrams, direct products, and comparison of invariant forms (1)-(2)). The form is positive semidefinite if and only if every is; it is positive definite if and only if every is; and , so .
(ii) The corank-one criterion. The form is positive semidefinite of corank one if and only if exactly one component form is positive semidefinite of corank one and every other component form is positive definite. The unique corank-one block has connected diagram, hence affine form type by Irreducible affine Coxeter type: the corank-one form, the radical quotient, and the affine slice (1); each positive-definite component is finite by Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1) applied to its restricted Coxeter system. Thus reducible corank-one semidefinite forms consist of one affine component and finitely many finite components.
(iii) Two computations. For with , the block matrix is , its quadratic form is , and it has the positive radical vector . With an additional one-generator component , the block is and the full form has corank one with kernel . With a second two-generator component and , the full radical is , so the corank is two and , where is the infinite dihedral group (The standard affine diagrams A-tilde, B-tilde, C-tilde, D-tilde, E-tilde, F-tilde and G-tilde (1)).
(iv) The square chamber. Let with its Euclidean metric and . Let be reflection in the vertical sides , and reflection in the horizontal sides . The group is isomorphic to : the two parallel pairs give the two infinite-dihedral factors, and reflections from different pairs commute and have product of order two. The resulting Coxeter diagram is . The -translates of the closed square are all unit grid squares; they cover and have pairwise disjoint interiors. Moreover every -orbit meets in exactly one point, so is a strict fundamental domain in this stated sense. Its four walls form two parallel pairs, and its interior angle at each vertex is .
(v) Consequences. The connected-matrix affine classification applies factorwise: in the positive-semidefinite corank-one case there is exactly one affine component and all remaining components are finite. Any component on which takes a negative value makes indefinite: each component has a vertex with . Two components with nonzero radicals force . No connected affine-form-type condition is imposed on a reducible matrix as a whole.
Facts & Assumptions
Given: A finite-rank Coxeter system , its disconnected diagram with connected components , the coordinate subspaces and Coxeter form as above. In the square calculation, has distance .
For disconnected , commute, their product map is an isomorphism, length is additive, and is an orthogonal direct sum for (Disconnected diagrams, direct products, and comparison of invariant forms (1)-(2)). This is an in-run supplier whose current proof decision is still open; its use is provisional pending that item audit.
The component vertex sets are nonempty and partition , and is spanned by the coordinate vectors indexed by (Coxeter diagrams: edges, labels, components and finite type (2), The real Coxeter form, its radical, reflections, and form-preserving maps). The Coxeter form has and is symmetric bilinear.
The subgroup with generating set is the Coxeter system for the restricted matrix on (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2)); for a Coxeter system, its group is finite exactly when its Coxeter form is positive definite (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1)). Both are current in-run suppliers; their uses remain provisional until their item decisions are reconciled.
The radical consists of vectors annihilating every vector, and corank is its dimension (The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space).
A finite set of coordinate vectors is a basis of its coordinate span , a subspace of a finite-dimensional space is finite-dimensional, and dimensions of a finite internal direct sum add (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, Linear combination of a finite list, and the span as the smallest linear subspace containing , Linear subspace of a vector space, Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis, If and is a linear subspace of , then is finite-dimensional, , and if and only if , Internal direct sum : the sum is everything and each summand meets the sum of the others only in , The sum of two linear subspaces and the sum of a finite family, If with every finite-dimensional, then is finite-dimensional and ; in particular ).
A Coxeter group is the quotient by the relators and for finite labels ; its universal property extends a generator assignment satisfying these relators to a homomorphism (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
The external direct product has coordinatewise multiplication and is a group; a group isomorphism is a bijective group homomorphism; and a generated subgroup is the smallest subgroup containing its stated generators (The external direct product with componentwise multiplication, is a group with identity , coordinatewise inverses, and homomorphic coordinate projections, Group isomorphisms, automorphisms and the set , Monoid homomorphism and group homomorphism, The subgroup generated by a subset, the cyclic subgroup , and cyclic groups, Group and abelian group).
A Euclidean isometry is a bijective distance-preserving map (Isometry, isometric embedding, and the subspace metric on a subset); in particular the coordinate reflections and the explicit maps computed below are checked against the Euclidean distance directly.
The standard diagram is the two-vertex diagram with its single edge labelled (The standard affine diagrams A-tilde, B-tilde, C-tilde, D-tilde, E-tilde, F-tilde and G-tilde (1)).
Positive definiteness means for every nonzero (Positive and negative definiteness, the inertia , rank , and signature of a real symmetric bilinear or quadratic form).
Affine form type requires a connected diagram and a positive-semidefinite form of corank one (Irreducible affine Coxeter type: the corank-one form, the radical quotient, and the affine slice (1)).
Every real has a unique integer with (Integer part: for every real there is exactly one integer with ).
Verification
(Definiteness is blockwise.) By [F1], if with , then . If is positive semidefinite, taking supported in one block shows each is positive semidefinite; conversely, if every block is positive semidefinite, every term in the sum is nonnegative. The same one-block test proves that positive definiteness of implies positive definiteness of each ; conversely, if each is positive definite and , at least one , so the corresponding term is positive and all other terms are nonnegative.
(Radicals and coranks add.) Bilinearity and orthogonality give for every . Thus exactly when for every , and the direct decomposition of makes . The vectors for are linearly independent by their coordinates and span by definition, so is finite-dimensional. Each radical is a linear subspace because its annihilation conditions are linear by bilinearity, hence it is finite-dimensional by the subspace dimension theorem. Applying the finite direct-sum dimension formula to these radical subspaces gives . This also covers : then and both sides are zero.
(Group and length factorization.) The factorwise group isomorphism and length-additivity assertion are precisely F1; their current supplier proof remains open for this run, so this citation is used provisionally and is recorded as an open obligation.
(The line reflection factors.) In define , , and . The identity, composites and inverses of bijective distance-preserving maps are again bijective and distance-preserving, so is a group under composition; the four displayed maps are involutive isometries by the coordinate distance formula. Put and . The maps in are exactly with and : composition sends parameters to , the identity has parameters , and the inverse of has parameters , so these maps form a subgroup. The translation is , and its powers, followed by , give every displayed map. By [F6], sending the two Coxeter generators of to defines a homomorphism to : both images are involutions, and the infinity label supplies no further relator. Every word in reduces by to an alternating word, hence to or for some . Their images are respectively and , which are pairwise distinct and exhaust the displayed maps, so the homomorphism is bijective and . The same coordinate calculation gives .
(Corank one.) Suppose first that is positive semidefinite with . Step 1.1 makes every positive semidefinite, and step 1.2 says the nonnegative integers sum to one; hence exactly one is one and all others are zero. For any positive-semidefinite block with zero radical, if , then for every and every real , ; if , sufficiently small of the opposite sign makes the right-hand side negative, a contradiction. Therefore such is in the radical, so zero radical implies for every nonzero , i.e. is positive definite. Conversely, if exactly one block is positive semidefinite of radical dimension one and all others are positive definite, step 1.1 gives positive semidefinite and step 1.2 gives radical dimension one. The forms are symmetric bilinear and the component diagrams are connected by Fact F2. Thus the unique block is of affine form type by Fact F11; the other blocks are finite type by Fact F3.
(The two block examples.) For , the defining entries of give , so it is positive semidefinite with positive radical vector and radical . A one-generator block has matrix , hence is positive definite and has zero radical; with this block the full radical is spanned by . With two blocks, the orthogonal sum has radical spanned by and and has corank two by step 1.2. The group factorization from step 1.3 and the identification in step 1.4 give .
(The square group and its product map.) Let . The groups and from step 1.4 commute elementwise because they act on separate coordinates, their intersection is the identity because a map acting trivially on both coordinates is the identity, and they generate . The map , , is a homomorphism by commutation, is surjective by generation, and is injective since implies . Thus it is an isomorphism by [F7], and step 1.4 identifies both factors with . Within either parallel pair the product is a nonzero translation by two units and has infinite order; across the pairs the reflections commute, and their product is a nonidentity involution because a vertical reflection moves some first coordinate while a horizontal reflection fixes every first coordinate. The products therefore give the disconnected diagram .
(Grid and strict fundamental domain.) The orbit of under is , exactly the unit intervals ; [F12] applied to each real gives , proving coverage of , and the interval interiors are pairwise disjoint. The corresponding statement holds for , so the -translates of are exactly all grid squares, covering with pairwise disjoint interiors. To prove the stronger orbit assertion including boundary points, apply [F12] to and put , ; then and . Its orbit under is ; if , its unique value in is : among the values only qualifies, and among the only possible additional values occur at or and equal that same point. If , the unique value there is . Applying this independently to both coordinates shows every -orbit meets in exactly one point.
(The remaining geometric and factorwise conclusions.) The four side walls are , , , and ; at each of the four vertices one vertical and one horizontal wall meet, so the interior angle is . Step 3.1 proves the precise closed-square tiling and orbit statement in (iv), including boundary points. Clauses (i)-(ii) give the positive-semidefinite corank-one factorization in (v); if one block has a vector of negative quadratic value, the same vector in shows that is indefinite, and if two blocks have nonzero radicals, step 1.2 gives radical dimension at least two. If , then and , so both sides of the equivalence in (ii) are false and the empty direct sums in (i) have value zero. All arguments use finite sums and explicit constructions, so no Choice is used.
Depends on
- Irreducible affine Coxeter type: the corank-one form, the radical quotient, and the affine slice
- The standard affine diagrams A-tilde, B-tilde, C-tilde, D-tilde, E-tilde, F-tilde and G-tilde
- Disconnected diagrams, direct products, and comparison of invariant forms
- Coxeter diagrams: edges, labels, components and finite type
- Finiteness criterion: W is finite exactly when the Coxeter form is positive definite
- The real Coxeter form, its radical, reflections, and form-preserving maps
- 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
- The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space
- Positive and negative definiteness, the inertia $(p,q,r)$, rank $p+q$, and signature $p-q$ of a real symmetric bilinear or quadratic form
- Linear subspace of a vector space
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- Linear combination of a finite list, and the span $\operatorname{span}(S)$ as the smallest linear subspace containing $S$
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
- Internal direct sum $V = \bigoplus_{i<n} U_i$: the sum is everything and each summand meets the sum of the others only in $0_V$
- The sum $U + W$ of two linear subspaces and the sum $\sum_{i<n} U_i$ of a finite family
- If $V = \bigoplus_{i<n} U_i$ with every $U_i$ finite-dimensional, then $V$ is finite-dimensional and $\dim_F V = \sum_{i<n} \dim_F U_i$; in particular $\dim_F(U \oplus W) = \dim_F U + \dim_F W$
- If $\dim_F V = n$ and $U$ is a linear subspace of $V$, then $U$ is finite-dimensional, $\dim_F U \le n$, and $\dim_F U = n$ if and only if $U = V$
- Group and abelian group
- The subgroup $\langle S \rangle$ generated by a subset, the cyclic subgroup $\langle g \rangle$, and cyclic groups
- Monoid homomorphism and group homomorphism
- The external direct product $G\times H$ with componentwise multiplication
- $G\times H$ is a group with identity $(e_G,e_H)$, coordinatewise inverses, and homomorphic coordinate projections
- Group isomorphisms, automorphisms and the set $\operatorname{Aut}(G)$
- Isometry, isometric embedding, and the subspace metric on a subset
- Integer part: for every real $x$ there is exactly one integer $m$ with $m \le x < m + 1$
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
160 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
- M. W. Davis and G. Moussong, Notes on nonpositively curved polyhedra (Turan Workshop lecture notes, 1998/1999; 65 PDF pages) (standard reference, not scraped)