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.
Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas
Statement
Let be a real symmetric positive-definite matrix with diagonal , and let , , , be as in Spherical Gram simplices and angular links of Euclidean faces.
(i) Existence and uniqueness of the Gram realisation. The vectors are unit vectors with , they are linearly independent and span , and every other family of unit vectors in a Euclidean space with is the image of under a linear isometry of onto the span of the . Hence is well-defined up to an isometry of mapping vertices to vertices.
(ii) Hemisphere, radial coordinates and bi-Lipschitz comparison. The linear functional determined by for all satisfies ; consequently on and is contained in the open hemisphere . Radial normalisation restricts to a bijection , where , with inverse ; every point of therefore has unique barycentric ray coordinates with . Moreover and satisfy the explicit Lipschitz estimates and , proved directly from the formulas without differentiability; here for the unique coordinate vector with . Hence the round metric on is bi-Lipschitz equivalent to the Euclidean metric of the compact convex cell carried by (on a subset of the unit sphere the round distance and the chord distance satisfy ).
(iii) Finite spherical complexes. Let be a finite abstract simplicial complex (An abstract simplicial complex) whose nonempty simplices carry positive-definite Gram matrices of diagonal , compatible with faces. Form by gluing the spherical simplices along their vertex-wise face identifications. On each component define the chain metric as the infimum of over finite chains in common cells, with the angular metric of that cell; equivalently it is the infimum of lengths of continuous paths. Between different components this infimum is , auxiliary notation rather than a metric value (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric). The inverse cellwise radial maps descend to a homeomorphism , where is the Euclidean gluing with cells ; it is bi-Lipschitz on every component. Each component of is a compact proper complete length space whose metric topology is the weak topology, and is a finite disjoint union of these components. For the empty complex, . Under the Axiom of Choice (The Axiom of Choice), every two points in a component are joined by a minimizing geodesic of length , in particular every pair at distance . The proper-target argument is written locally below, using Length in a metric target: lower semicontinuity and arc-length reparametrization and Under the Axiom of Choice, a pointwise bounded equicontinuous sequence on a nonempty compact metric domain into a proper metric target has a uniformly convergent subsequence; compare Under the Axiom of Choice, proper polyhedral spaces admit minimizing geodesics.
(iv) Vertex and face links by Schur complements. The normal link of a nonempty spherical face spanned by vertices indexed by consists of the unit tangent directions perpendicular to that point into at a relative interior point of the face. For and put . The link of the vertex in is the spherical simplex with vertices , and its Gram matrix is which is positive definite: the projection formula follows by expanding , and positivity follows from the positive definiteness of the unnormalised Schur complement , whose quadratic form is for the nonzero vector . Iterating the formula over the vertices of a face of gives the link of that face; the result is independent of the order of iteration, and the link of a face of a link is the link of a higher face. If no vertices remain, the link is empty; in particular the vertex link for is empty. More generally, for a nonempty proper vertex set , let , and for . These are the orthogonal projections onto , with ; the face-link Gram matrix is .
(v) Angular links of Euclidean faces. For a compact convex polyhedral cell and a face as in Spherical Gram simplices and angular links of Euclidean faces, with direction space and normal cone , after constant defining inequalities are discarded, the two descriptions of the tangent cone agree: for every in the relative interior of , and for the inward unit normals of the active defining hyperplanes; the tangent cone and the normal cone depend only on . The cone is pointed, and is closed under nonnegative combinations, so for the shorter great-circle arc between them stays in and realises as an intrinsic path in the link; conversely every path in has length at least the round distance of its endpoints. Hence the angular distance of Spherical Gram simplices and angular links of Euclidean faces is the intrinsic path metric of the round sphere restricted to , it is a metric of diameter at most , and the links of the cells containing a face of an isometric polyhedral gluing depend only on , so their quotient is well defined up to canonical isometry.
(vi) Disconnected components. If the angular link of a face of a complex is disconnected, the componentwise path distance is between distinct components; this value is auxiliary notation only and is truncated in the cone formulas of The angular path metric, the Euclidean cone and spherical joins.
Facts & Assumptions
Given: A real symmetric positive-definite matrix with diagonal , its Cholesky factor , the vectors , the cone and simplex of Spherical Gram simplices and angular links of Euclidean faces; in clauses (iii) and (vi) additionally a finite abstract simplicial complex with compatible Gram matrices as in the Statement.
A real symmetric positive-definite matrix has a unique Cholesky factorisation with lower triangular and positive diagonal; then is invertible and is its own real case (A matrix admits a Cholesky factorisation with positive diagonal exactly when it is Hermitian positive definite, and that factor is unique, Hermitian positive-definite matrices and Cholesky factorisation A = LL* with positive diagonal).
In a real inner-product space, is bilinear and symmetric, is a norm, with equality exactly for linearly dependent , every finite-dimensional subspace has an orthogonal complement and orthogonal projection by For a subspace of a finite-dimensional inner product space, and The orthogonal projection is the -component in , the unit sphere is (Euclidean spheres and closed balls as subspaces of ), and is the inverse of the strictly decreasing restriction of to , continuous on (Principal inverse sine and inverse cosine, The induced length is a norm, Real and complex inner-product spaces and their induced length, Cauchy–Schwarz: , with equality exactly for dependent pairs).
and for all real (The addition formulas for sine and cosine); and (The derivatives of sine and cosine are cosine and minus sine); , , and (Quarter-turn values and shifts by pi/2 and pi); and (Parity and the Pythagorean identity for sine and cosine); is strictly decreasing on , and is strictly increasing on (Signs, monotonicity intervals, and ranges of sine and cosine); for one has , and , so is strictly decreasing on and (Sine is positive and cosine is strictly decreasing on (0,2), with cos 2 at most -1/3); (The limit of sin x divided by x at zero is one); and for , since for the mean value theorem gives for some with (The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with ).
A continuous real function on an interval assumes every value between its endpoint values (Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and ).
A compact convex polyhedral cell is given by finitely many affine inequalities ; its nonempty faces arise by turning some of them into equalities, and each nonempty face is the cell itself or its intersection with a supporting hyperplane (Finite convex cell complex and linear subdivision).
A finite abstract simplicial complex has a compact Hausdorff geometric realization, and a closed subspace of a compact space is compact (A finite simplicial complex has a compact Hausdorff realization, A closed subset of a compact metric space is compact, An abstract simplicial complex).
For an isometric polyhedral gluing: the cells are compact convex polyhedral cells, the face relation and gluing isometries satisfy the cocycle and intersection conditions, the topology is the weak topology, and the chain metric is the infimum of chain lengths over points lying in common cells; its metric axioms, the agreement of its topology with the weak topology and properness and completeness under (H1)-(H3) are the conclusions of The chain metric is a metric, its topology is the weak topology, and the space is proper and complete, the proper-target geodesic argument is recorded in Under the Axiom of Choice, proper polyhedral spaces admit minimizing geodesics, and arc-length reparametrisation together with lower semicontinuity of length under uniform convergence is Length in a metric target: lower semicontinuity and arc-length reparametrization (Abstract isometric polyhedral gluings and the chain metric).
Assume the Axiom of Choice; the proper-target Ascoli theorem states that a pointwise bounded equicontinuous sequence of continuous maps from a nonempty compact metric space into a proper metric space has a uniformly convergent subsequence, and a compact metric space is proper because its closed balls are closed, hence compact (The Axiom of Choice, Under the Axiom of Choice, a pointwise bounded equicontinuous sequence on a nonempty compact metric domain into a proper metric target has a uniformly convergent subsequence, Open cover, subcover, compact metric space, and compact subset of a metric space, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, Pointwise convergence, uniform convergence, and the uniformly Cauchy condition for sequences of real-valued functions, Bilipschitz embeddings and bilipschitz equivalences of metric spaces, Complete metric space: every Cauchy sequence converges in the space, Geodesics and geodesic metric spaces, Upper bound, least upper bound, and strict upper bound, as the set of functions , and , , are metrics on it).
A continuous real-valued function on a nonempty compact metric space attains its minimum and maximum, without Choice (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).
Proof
Gram realisation. By [F1], with invertible, so the rows of satisfy , in particular , and they are linearly independent because . If is any family of unit vectors of a Euclidean space with and , then , so ; the two families therefore obey the same linear relations, the map sending to is a well-defined linear isomorphism of their spans, and it preserves inner products because these are given by the Gram matrices on both sides; extends to a linear isometry of onto the span of the , which carries onto the cone generated by the and onto its unit section.
The two tangent-cone descriptions. Let be given by the nonconstant inequalities after the discarding prescribed in the definition, and let lie in the relative interior of the face , with the set of with and inward. If satisfies for all , then for small the point satisfies for and for by continuity and , so and is a limit of vectors with . Conversely, for and the affine identity gives , so every with lies in the closed cone ; the two cones agree, and since an affine function nonnegative on vanishes at a relative interior point exactly when it vanishes throughout , the active set does not depend on , and the tangent cone does not depend on the chosen point of the relative interior. The common kernel of the active gradients is : it contains because the active functions vanish on ; conversely, for a vector in that kernel, sufficiently small displacements remain in and satisfy all active equalities, hence belong to by [F5], so .
The angular distance is a metric. For unit vectors the number is well defined by [F2], is symmetric, vanishes exactly when , i.e. , and is at most . If are unit, and satisfy , write (trivially if or ) and with unit and orthogonal to by [F2]; then by [F2] and [F3], so because is the inverse of the strictly decreasing on ; if the same inequality is trivial. So is a metric of diameter at most on every set of unit vectors.
The hemisphere functional. Since is a basis of by step 1.1, there is a unique linear functional with for all , and for all . If with , then some , so ; hence and , which is the set of convex combinations with , . In standard coordinates for a unique nonzero vector ; [F2] gives , with equality at , so is the finite operator norm.
Schur complements. Since for by [F2] and the linear independence of of step 1.1, the vectors are well defined; they satisfy and , and expanding gives , in particular . Writing for , the vector is nonzero and, with , ; the quadratic form on the right is that of the unnormalised Schur complement , so is positive definite, and with the positive diagonal is positive definite as well.
The intrinsic path metric of a link. For a continuous path in write for the supremum of over finite partitions of its parameter interval, and for let be the infimum of over continuous paths in from to . Let . The cone is pointed: a vector and its negative lying in it satisfy every active facet equality, hence lie in the direction space of the affine hull of , namely ; orthogonality to then forces the vector to be zero. Thus distinct unit directions are never antipodal and . If , pick a unit with and put for ; then because is a nonnegative combination of for , and for every partition while the uniform partition into parts has sum as by [F3]; hence and . Conversely let be any continuous path from to and let , a continuous function with and ; for each successively applying [F4] on gives with , and then with by step 1.3 and [F2]; since and is strictly increasing on , each term is at least , so and ; for both numbers are . Hence on , the link has diameter at most , and is the intrinsic path metric of the round unit sphere restricted to the link.
Links of gluings. Let be an isometric polyhedral gluing with cells and let be a face. By step 1.2 the tangent cone and the angular link depend only on , and for the isometry maps onto , so its linear part maps isometrically into and maps its normal section onto the corresponding link face that is compatible with the cocycle condition; the intersection condition makes the intersections of the resulting images correspond to the common faces, so the cell links glue to a well-defined quotient , and replacing the point of changes nothing by step 1.2. The normal sections in cofaces inherit their polyhedral face incidences; when is simplicial these correspond to the simplices of its combinatorial link. A general polyhedral face link need not itself be simplicial.
Radial coordinates. For the vector lies in , and for , written with , the number is positive, the point lies in and normalises back to ; so is an inverse of and is a bijection . It is injective because gives with . The coefficients of a point of in the basis are unique, so every point of has unique barycentric ray coordinates with .
Iterated links and face compatibility. Let be a nonempty proper set of vertices (if it is the full set, the normal link is empty), put , and write . The orthogonal projection of onto is : pairing with each gives zero, while the subtracted vector lies in . Consequently , the Schur complement of , and is positive definite since for nonzero on the complementary indices, , where . In particular all are nonzero; normalising them gives the diagonal- Gram matrix . These projected rays describe the normal link: at an interior point of the face, coefficients of the face vertices can vary in both directions, whereas coefficients of the remaining vertices must be nonnegative; quotienting out the face span therefore leaves exactly the cone generated by the . For iteration, after removing a vertex, project the remaining vectors onto the perpendicular of its residual projected direction, not onto the perpendicular of the original vector. For a relative interior point of the spherical face, is a positive combination of its face vertices. A tangent vector with points into the simplex exactly when its coefficients outside are nonnegative: for small , the vector retains positive coefficients in , and its normalisation has initial direction , as . Removing the tangent face directions leaves and the projected rays , proving the asserted geometric link identification. Those residual directions obtained from an ordering of are orthogonal and span (each new residual is orthogonal to the preceding span and is nonzero by independence); their successive perpendicular projections therefore equal the single orthogonal projection onto . Intermediate normalisations only rescale rays by positive factors, so the final normalised Gram matrix is the same in every order. Restricting to a subface retains the corresponding subset of remaining rays, while linking a further face enlarges and repeats this operation.
Lipschitz estimates and the chord bound. is a nonempty compact convex cell and avoids by step 2.1 and [F5]. The reverse norm triangle inequality makes continuous, so [F9] gives an attained minimum , and for the estimate holds. On one has and (because with and ), so writing gives . For unit vectors put ; then by [F3], so the chord length is , the last step because for by [F3]. For the reverse comparison note first that : for the mean value theorem gives with , and because is strictly decreasing on [F3], so and ; the restriction of to is strictly decreasing with and by [F2] and [F3], so and is the unique point of with , lying in ; the function therefore has by [F3], positive on and negative on . The mean value theorem [F3] gives on and on (with ), that is, on . Applied to this gives , so the chord and round distances satisfy .
The finite spherical complex and the descent map. By steps 1.1 and 3.2 the identifications for are well-defined isometries onto faces, so is a well-defined quotient of the finite disjoint union of the compact simplices by finitely many face identifications. Let be the corresponding isometric polyhedral gluing with cells ; the cell maps , , agree on identified faces, because takes the value on all vertices in and hence restricts to ; so the descend to a bijection .
The link of a face of a finite spherical complex. Let be a finite spherical complex and let be the face corresponding to a nonempty simplex . The cells of are the links of the spherical simplices containing ; by step 3.2 each is again a spherical simplex, with Gram matrix obtained by iterating the Schur complements of step 2.2 over the vertices of , and these matrices are positive definite of diagonal and compatible with faces, because passing to a smaller coface retains a subset of the projected rays, while linking a further face enlarges the projected-out span; the identifications are those induced by and are isometric by step 2.4. Hence is again presented as a finite spherical complex, and clauses (i)-(v) apply to it.
Bi-Lipschitz equivalence of the model and its spherical simplex. With and the operator norm , steps 3.1 and 4.1 give for , the bounds and , so is a bi-Lipschitz equivalence between the Euclidean metric of and the round metric of with the constant .
The radial map is bi-Lipschitz for the chain metrics. If has no nonempty simplex then and there are no distance estimates to check. Otherwise, by step 5.1 each is bi-Lipschitz with constant , and the finitely many simplices of give finite maxima and . Every chain in maps under to a chain in whose one-step Euclidean distances are at most times the angular distances of the original chain, so ; likewise every chain in is the image of a chain in with angular steps at most times the Euclidean steps, so . Hence is a bi-Lipschitz equivalence of the chain metrics.
Component metrics and topology. The classes under being joined by a chain are finite in number. Each is a union of whole cells: any two points of one cell are joined by a single chain step. The trace of a class on every cell is therefore the entire cell or empty, so every class is weakly open and closed; each class is path connected by cell arcs, hence is a connected component. The corresponding component of satisfies (H1)-(H3), so [F7] supplies its metric, weak topology, properness and completeness; step 6.1 transfers these properties to the component of . Each component is compact as a quotient of finitely many compact cells. Its chain metric is a length metric: a chain can be replaced by cell arcs, whose -length is at most its chain length because on a cell, while every path has length at least the distance of its endpoints. Cellwise radial homeomorphisms descend to a homeomorphism for the quotient (weak) topologies, and the components are open and closed, so and are compact finite disjoint unions of the component metric spaces. Distances between distinct components remain auxiliary infinities; no real-valued global chain metric is asserted. The empty case is vacuous.
Minimizing geodesics (AC). Assume AC, fix in one component and put . AC selects, for each , a chain of length ; the infimum definition gives . Replace its steps by cell arcs, traversed at angular speed on (use the constant path for ). Each arc lies in its cell by the nonnegative-combination argument of step 2.3 applied to , and the triangle inequality gives , hence . The paths are equicontinuous and pointwise bounded in the compact proper component of step 7.1. The domain is compact as a nonempty bounded one-dimensional polyhedral cell by [F5]; with AC it satisfies [F8], giving a uniformly convergent subsequence with continuous limit and endpoints . Since , lower semicontinuity [F7] gives , while the endpoint partition gives the reverse bound. Reparametrise by arc length using [F7]. For , the resulting path is -Lipschitz, and forces ; thus equality holds and is a minimizing geodesic. AC is used for the sequence selection and for Ascoli.
The convention. Let be a face of a finite spherical complex . By step 4.3 the angular link is a finite spherical complex, so step 7.1 applies to it: being joined by a chain of directions inside common cells is reflexive (singleton chains), symmetric (reverse a chain) and transitive (concatenate chains), hence an equivalence relation on ; the infimum is finite whenever a chain from to exists and is a metric on each class by step 7.1, while for in different classes no chain joins them and . This infinite value is auxiliary notation, not an ordinary distance of the metric-space definition, and it is replaced by in the truncated metric of The angular path metric, the Euclidean cone and spherical joins.
Remarks
- Choice. In step 8.1 the Axiom of Choice selects the sequence of near-minimizing chains and supplies the hypothesis of the proper-target Ascoli theorem; clauses (i), (ii), (iv), (v) and (vi), and the metric/topology conclusions of (iii), are choice-free; the geodesic conclusion of (iii) assumes AC.
- The two model metrics. Steps 4.1 and 5.1 compare the round metric of with the Euclidean metric of through the chord metric; the constants are explicit ( for round versus chord, in step 5.1) and are not asserted to be optimal.
- No curvature claim. The link metric is proved to be a metric and the intrinsic metric of the round sphere; no CAT(1) assertion is made here, and the -geodesic convention remains a hypothesis of The angular path metric, the Euclidean cone and spherical joins and The cone and join metrics and the local product chart of a polyhedral gluing.
Depends on
- A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value
- Spherical Gram simplices and angular links of Euclidean faces
- Hermitian positive-definite matrices and Cholesky factorisation A = LL* with positive diagonal
- A matrix admits a Cholesky factorisation with positive diagonal exactly when it is Hermitian positive definite, and that factor is unique
- Real and complex inner-product spaces and their induced length
- The induced length is a norm
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
- The orthogonal projection $P_Wv$ is the $W$-component in $V=W\oplus W^\perp$
- For a subspace $W$ of a finite-dimensional inner product space, $V=W\oplus W^\perp$
- Euclidean spheres and closed balls as subspaces of $\mathbb{R}^n$
- Principal inverse sine and inverse cosine
- $\mathbb{R}^n$ as the set of functions $n \to \mathbb{R}$, and $d_1$, $d_2$, $d_\infty$ are metrics on it
- Finite convex cell complex and linear subdivision
- An abstract simplicial complex
- A finite simplicial complex has a compact Hausdorff realization
- Bilipschitz embeddings and bilipschitz equivalences of metric spaces
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- Open cover, subcover, compact metric space, and compact subset of a metric space
- Complete metric space: every Cauchy sequence converges in the space
- Geodesics and geodesic metric spaces
- Upper bound, least upper bound, and strict upper bound
- Pointwise convergence, uniform convergence, and the uniformly Cauchy condition for sequences of real-valued functions
- The Axiom of Choice
- Under the Axiom of Choice, a pointwise bounded equicontinuous sequence on a nonempty compact metric domain into a proper metric target has a uniformly convergent subsequence
- Abstract isometric polyhedral gluings and the chain metric
- The chain metric is a metric, its topology is the weak topology, and the space is proper and complete
- Under the Axiom of Choice, proper polyhedral spaces admit minimizing geodesics
- Length in a metric target: lower semicontinuity and arc-length reparametrization
- The addition formulas for sine and cosine
- Signs, monotonicity intervals, and ranges of sine and cosine
- Sine is positive and cosine is strictly decreasing on (0,2), with cos 2 at most -1/3
- The limit of sin x divided by x at zero is one
- Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on $[a,b]$ takes every value between $f(a)$ and $f(b)$
- A closed subset of a compact metric space is compact
- Parity and the Pythagorean identity for sine and cosine
- The mean value theorem, as the case $g(x) = x$ of Cauchy's: for $f$ continuous on $[a,b]$ with $a < b$ and differentiable on $(a,b)$ there is $c \in (a,b)$ with $f(b) - f(a) = f'(c)(b-a)$
- The derivatives of sine and cosine are cosine and minus sine
- Quarter-turn values and shifts by pi/2 and pi
Used by
- The Coxeter nerve is CAT(1), and its girth and the girths of all its links are at least 2π Corollary
- Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles Definition
- Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links Definition
- The angular path metric, the Euclidean cone and spherical joins Definition
- The Coxeter nerve and its Moussong metric Definition
- A spherical simplex from a Gram matrix and its vertex-link Schur complement Example
- The all-right triangle must be filled; the disconnected universal-Coxeter nerve is CAT(1) vacuously Example
- The disconnected universal-Coxeter nerve and the angular truncation convention Example
- Face links of large metric flag complexes, and the inductive local CAT(1) criterion Lemma
- Minimum nonshrinkable loops, radial vertex cones, and the excursion of length π Lemma
- The angular link of a vertex of the Davis complex is the large metric flag nerve Lemma
- The factorization criterion, linear independence of the faces, and the geometric simplicial structure of X(sigma) Lemma
- Berestovskii's cone criterion and the polyhedral link criterion Theorem
- Finite large metric flag complexes are CAT(1) Theorem
- Nonshrinkable edge loops of length <2π have three edges, and the finite locally CAT(1) large metric flag complex is CAT(1) Theorem
- The cone and join metrics and the local product chart of a polyhedral gluing Theorem
Cited to discharge well-definedness by Spherical Gram simplices and angular links of Euclidean faces.
Dependency tree · two levels
152 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
- Martin R. Bridson and Andre Haefliger, Metric Spaces of Non-Positive Curvature (Springer Grundlehren 319, 1999; author-hosted PDF) (standard reference, not scraped)
- Michael W. Davis, The Geometry and Topology of Coxeter Groups (first-edition author manuscript, 2007-2008) (standard reference, not scraped)