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.

Face links of large metric flag complexes, and the inductive local CAT(1) criterion

Statement

Let X be a finite large metric flag complex (Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links).

All CAT(1) assertions for a possibly disconnected complex use the truncated angular metric dπ; local balls of radius less than π/2 use the componentwise chain metric, which agrees with dπ there.

(i) Links stay large and metric flag. For every face F of X, Lk⁡X(F) is a finite large metric flag complex; for F=∅ this is X. For nonempty F, the face-link entries are obtained by deleting the vertices of F one at a time using Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(iv). At each deletion of a vertex v, the normalized off-diagonal entry becomes (cst−csvctv)/(1−csv2)(1−ctv2)≤0, because the current entries csv,ctv are nonpositive and the denominator is positive. Thus every simplex link matrix is positive definite with diagonal 1 and nonpositive off-diagonal entries. If T is pairwise adjacent in the link, then F∪T is pairwise adjacent in X, and the link cosine matrix on T is the diagonally normalized Schur complement of CF in the principal cosine matrix CF∪T. Since CF is positive definite, the block Schur-complement identity gives that this link matrix is positive definite exactly when CF∪T is; metric flagness of X makes the latter equivalent to F∪T being a simplex, which is equivalent to T being a simplex of the link (Positive and negative definiteness, the inertia (p,q,r), rank p+q, and signature p−q of a real symmetric bilinear or quadratic form).

(ii) Local models. Let F be a nonempty face, put k:=dim⁡F, and let p∈relint⁡F. The unit directions in the tangent cone at p form the spherical join Lk⁡X(p)=Sk−1∗Lk⁡X(F), where Sk−1 is the round sphere of unit directions tangent to F, Lk⁡X(F) consists of the normal directions, and S−1=∅ when F is a vertex (The angular path metric, the Euclidean cone and spherical joins(5), The cone and join metrics and the local product chart of a polyhedral gluing(3)). There is ε>0 such that the cellwise radial map identifies the open ball B(p,ε) isometrically with the open ball of radius ε about the pole in the spherical cone {p}∗Lk⁡X(p). For x≠p in this ball the radial coordinate is the chain distance θ=d(p,x) and the direction u∈Lk⁡X(p) is unique; at θ=0 all directions represent the pole. In a cell containing p, the map is the spherical polar chart and its distance formula is cos⁡dσ(x,y)=cos⁡θcos⁡θ′+sin⁡θsin⁡θ′cos⁡dLk⁡σ(p)(u,u′). For a vertex v, cellwise radial coordinates are defined throughout St⁡(v), and B(v,π/2) is exactly the open radial cone with 0≤θ<π/2 on Lk⁡X(v). If Lk⁡X(F) is CAT(1) (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles(3)), then Lk⁡X(p) and its spherical cone are CAT(1) (Products of CAT(0) spaces, joins of CAT(1) spaces, and round spheres(ii),(iii)). For every 0<r<min⁡{ε,π/2}, the closed ball Bˉ(p,r) is isometric to the closed radius-r ball in that cone, hence is convex and CAT(1) with its induced metric (Open ball, closed ball and sphere in a metric space, Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences(v)).

(iii) The inductive local-curvature implication. Assume that every finite large metric flag complex of dimension <d is CAT(1). Then every d-dimensional finite large metric flag complex X is locally CAT(1): for each nonempty face F, Lk⁡X(F) is a finite large metric flag complex of dimension at most d−dim⁡F−1<d by (i), with the empty link assigned dimension −1; it is CAT(1) by hypothesis or by (iv). Clause (ii) then applies at every point because the relative interiors of the nonempty faces partition X. This is the induction step only; it is not an unconditional lemma about X.

(iv) Dimension zero and truncation. A 0-dimensional finite large metric flag complex is a finite set of isolated vertices; with the truncated metric distinct vertices are at distance π, there are no distinct pairs at distance <π and every triangle of perimeter <2π is constant, so the CAT(1) tests hold vacuously, and the empty link is CAT(1) vacuously with one-point cone (The angular path metric, the Euclidean cone and spherical joins(3)). More generally, every dπ-triangle of perimeter <2π in a finite spherical complex has all three sides <π and lies in one component, where the sides equal the componentwise intrinsic path distances; its comparison test is therefore unchanged by truncation (The cone and join metrics and the local product chart of a polyhedral gluing(1), Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles(4)).

Facts & Assumptions

Given: A finite large metric flag complex X with its vertex complex K (Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links), a face F of X, and, in clause (iii), a dimension bound d.

[F1]

Every simplex Gram matrix is positive definite with diagonal 1; largeness means its off-diagonal entries are nonpositive; metric flagness says a pairwise adjacent vertex set spans a simplex exactly when its cosine matrix is positive definite; and the cells of Lk⁡X(F) are the sets T for which F∪T is a simplex. The empty matrix is positive definite by convention. (Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links)

[F2]

The link Gram matrix of a spherical simplex is obtained by the normalized Schur complement, is positive definite, and iteration over a face gives the face link and agrees with orthogonal projection off the linear span of that face; spherical simplices are convex and have unique barycentric ray coordinates. (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(ii),(iv))

[F3]

A symmetric matrix is positive definite when its quadratic form is positive on every nonzero vector. (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]

A spherical simplex is a convex subset of a unit sphere; its cell distance is the round distance, its short radial geodesics satisfy the spherical cosine formula, and its face-link cells are the normal direction sections given by the Schur-complement projection in [F2]. The finite complex is glued along isometric faces and its componentwise chain distance is the infimum of finite cell-chain lengths. (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(ii),(iv), Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links(1), Subcomplexes, closures, stars, and links in a simplicial complex)

[F5]

CAT(1) uses geodesics for pairs at distance <π and spherical comparison for geodesic triangles of perimeter <2π; local CAT(1) means every point has a CAT(1) closed ball. The truncated angular metric is dπ=min⁡{π,d}, with infinite componentwise distances replaced by π. (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles(3),(4), Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links(1))

[F6]

Every round sphere Sk is CAT(1) with diameter at most π; the join of CAT(1) spaces of diameter at most π is CAT(1), and the one-point spherical cone {p}∗L is CAT(1) when L is CAT(1). These are the claims of Products of CAT(0) spaces, joins of CAT(1) spaces, and round spheres(ii),(iii); the consumer uses are verified in steps 3.2 and 4.1.

[F7]

The truncated angular metric is dπ=min⁡{π,dpath}, and the spherical join distance is given by cos⁡d=cos⁡θcos⁡θ′cos⁡dπ1+sin⁡θsin⁡θ′cos⁡dπ2, with L∗∅=L; the product-cone isometry identifies the join metric on joined cells with the intrinsic face metric. (The angular path metric, the Euclidean cone and spherical joins(2),(5), The cone and join metrics and the local product chart of a polyhedral gluing(3))

[F8]

In a CAT(1) space every closed ball of radius <π/2 is convex, and a convex subset with its induced metric is CAT(1). (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences(v), Products of CAT(0) spaces, joins of CAT(1) spaces, and round spheres(iii))

[F9]

Every closed ball in a round sphere of radius less than π/2 is geodesically convex. (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences(ii))

[F10]

B(p,r) denotes the open metric ball of radius r and Bˉ(p,r) the closed ball. (Open ball, closed ball and sphere in a metric space)

Proof

1.1F3algebra

If M is positive definite with diagonal 1 and off-diagonal entries at most 0, deleting its vertex 0 gives the Schur complement mij′=mij−mi0mj0. For any nonzero vector x on the remaining indices, the vector w=(−∑i≠0m0ixi,x) is nonzero and satisfies wTMw=xTM′x>0; hence M′ is positive definite. In particular, testing a coordinate vector gives 1−mi02>0 on each diagonal. The off-diagonal entries are nonpositive because mi0mj0≥0; normalizing by D=diag⁡((1−mi02)−1/2) preserves positive definiteness and gives diagonal 1 with off-diagonal entries mij′/(1−mi02)(1−mj02)≤0.

1.2F3algebra

For a symmetric block matrix A=(PQQTR) with P positive definite, P is invertible: Pv=0 for nonzero v would contradict vTPv>0. Put S=R−QTP−1Q. For x=(y,z), xTAx=(y+P−1Qz)TP(y+P−1Qz)+zTSz. Thus A is positive definite if S is, and if A is positive definite then testing y=−P−1Qz for each nonzero z shows that S is positive definite.

1.3F2algebra

Fix a spherical simplex σ and p in the relative interior of its face F. In the barycentric ray coordinates of [F2], the local inequalities for σ at p are λ˙j≥0 for vertices j∉F and no sign restriction on the face-coordinate variations, subject to ∑iλ˙i=0. The radial normalization chart and its inverse y↦y/φ(y) are smooth, so their differentials identify these coordinate tangent cones with the tangent cone in the sphere; its lineality is exactly the subspace with all λ˙j=0 outside F, namely U:=TpF. Since U and −U lie in the convex cone Tpσ, subtracting the orthogonal projection onto U shows Tpσ=U⊕(Tpσ∩U⊥).

1.4F2F4algebra

Work in the component of p, with its componentwise chain metric. Let St⁡(p) be the finite union of cells containing p. For each such spherical simplex σ, every face τ not containing p is compact and disjoint from p, so the minimum of dσ(p,y) over y∈τ is positive. Choose δ>0 below all these finitely many positive minima and with δ<π/2; if there are no such faces, choose any 0<δ<π/2. On St⁡(p) the cellwise radial function r(x)=dσ(p,x) is well defined and is 1-Lipschitz on every incident cell. A chain from p that leaves St⁡(p) first reaches a face τ of an incident cell not containing p; at that point its prefix has length at least the cellwise radius, which is at least δ. Thus if dX(p,x)<δ, every cell containing x contains p.

2.1F1F2step 1.1

Iterating step 1.1 over the vertices of any nonempty face F shows that every simplex of its face link has a positive-definite Gram matrix with diagonal 1 and nonpositive off-diagonal entries. The link is finite, so it is a finite large spherical complex.

2.2F2F4F7step 1.3algebra

In a simplex σ⊇F, the unit directions in U=TpF form Sk−1, while the directions in Tpσ∩U⊥ are the normal directions of F; their face-link Gram matrix is the Schur complement from [F2]. The orthogonal splitting of step 1.3 expresses each cell of the point link as the join of Sk−1 with the corresponding face-link cell. On each such cell, the inner-product formula is the spherical-join formula [F7], and the product-cone isometry identifies the induced face metrics with the intrinsic join metric [F7]. The identifications agree on common faces, so Lk⁡X(p)=Sk−1∗Lk⁡X(F) with the join metric. For a vertex F, the first factor is empty and the point link is the face link.

2.3F4F7F9step 1.4algebra

Choose 0<ε<min⁡{δ/4,π/4}. Map a cone point (θ,u) to the point at distance θ on the cellwise spherical geodesic from p in direction u; common-face identifications make this map Φ well defined. The radial path has length θ, while every chain staying in St⁡(p) has length at least the variation of r, and every chain leaving it has length at least δ. Hence the radial coordinate equals dX(p,x) for θ<ε, and Φ is a bijection from the cone ball onto B(p,ε), with all directions collapsed at the pole. If dπ(u,u′)<π and θ,θ′>0, then for every η>0 small enough there is a finite chain of link directions with consecutive directions in one link cell and total angle α<dpath(u,u′)+η<π. Unfold its spherical sectors about their common radial boundaries into a unit-sphere sector of angle α. Each sector map is an isometry by the spherical cosine formula, and the great-circle segment between radii θ,θ′<ε stays in the radius-ε cap by [F9]; subdividing at its finitely many sector crossings and mapping the pieces back gives a path in X of length arccos⁡(cos⁡θcos⁡θ′+sin⁡θsin⁡θ′cos⁡α). Letting η↓0 gives the upper distance bound by the cone formula. If either radius is 0, the radial segment gives equality; if dπ(u,u′)=π, the path through p has length θ+θ′, the cone distance. Conversely, let a chain from x to y have length L. If L≥2ε, then the cone distance is at most θ+θ′≤2ε≤L. If L<2ε, every point of the chain has distance from p less than 3ε<δ, so each common cell contains p; in that cell the two directions lie in one link cell. Their global truncated link distance is at most their spherical distance in this cell, since the cell segment is an admissible link chain. The cone cosine formula is nondecreasing in that angle, so Φ−1 does not increase this chain step. No global isometry of a link cell is assumed. The cone distance is therefore at most L. Taking infima proves the isometry of the open balls.

3.1F1F2F3step 1.2step 2.1

If F=∅, the link claim is the hypothesis on X; take F nonempty. Let T be pairwise adjacent in Lk⁡X(F). Then F∪T is pairwise adjacent in X. The diagonal link entries are 1, and each off-diagonal link entry for s,t∈T is the Schur-complement entry from the simplex F∪{s,t}; therefore the full link cosine matrix on T is the diagonally normalized Schur complement of CF in the principal cosine matrix CF∪T. Positive diagonal normalization preserves positive definiteness. Since CF is positive definite, step 1.2 says this link matrix is positive definite exactly when CF∪T is. Metric flagness of X makes that equivalent to F∪T being a simplex, which is equivalent to T being a simplex in the link. The empty set is covered by the empty-matrix convention in [F1], and simplex link matrices are positive definite by step 2.1; hence the link is metric flag and clause (i) follows.

3.2F6F8F10step 2.2step 2.3

If Lk⁡X(F) is CAT(1), step 2.2 and [F6] show that Lk⁡X(p) is CAT(1), and the one-point join {p}∗Lk⁡X(p) is CAT(1) as well. For 0<r<min⁡{ε,π/2}, step 2.3 identifies BˉX(p,r) with the closed radius-r ball about the pole in that cone; [F8] makes this ball convex and CAT(1) with its induced metric. This proves the local CAT(1) conclusion at p.

3.3F1F2F4step 2.2algebra

Let v be a vertex. For a point x in a simplex containing v, its cellwise radial distance θ=dσ(v,x) and direction are defined throughout that simplex. If y lies in the opposite face τ not containing v, its barycentric ray coordinates involve only vertices t≠v, so ⟨v,y⟩ has the sign of ∑t≠vλtcvt≤0; hence dσ(v,y)≥π/2. The radial function is 1-Lipschitz on every cell containing v, so every chain leaving St⁡(v) has length at least π/2. For x∈St⁡(v) with cellwise radius θ<π/2, chains staying in the star have length at least θ, chains leaving have length at least π/2, and the radial segment has length θ; thus dX(v,x)=θ. If x∈St⁡(v) has cellwise radius θ≥π/2, chains staying in the star have length at least θ and chains leaving have length at least π/2, so dX(v,x)≥π/2; points outside the star also have distance at least π/2. Conversely, every unit link direction has a representation η=∑t≠vbt(ut−cvtv) with bt≥0 in an incident simplex. Its radial ray is cos⁡θ v+sin⁡θ η=(cos⁡θ−sin⁡θ∑t≠vbtcvt)v+sin⁡θ∑t≠vbtut; all coefficients are nonnegative for 0≤θ≤π/2. Hence every direction extends through that radius within the star, and B(v,π/2) is exactly the open radial cone on Lk⁡X(v).

4.1F1F5step 3.1step 3.2

Suppose every finite large metric flag complex of dimension less than d is CAT(1), and let X have dimension d. For each nonempty face F, clause (i) gives a finite large metric flag link with dim⁡Lk⁡X(F)≤d−dim⁡F−1<d; a nonempty link is CAT(1) by the hypothesis, and an empty link satisfies the CAT(1) tests vacuously by [F5]. Clause (ii), proved in step 3.2, then gives a CAT(1) neighborhood at every point of relint⁡F. These relative interiors partition X, so X is locally CAT(1), proving clause (iii).

5.1F5F7step 3.1algebra∎

A zero-dimensional finite large metric flag complex is a finite set of vertices with distinct vertices at truncated distance π. There are no distinct pairs at distance less than π, and every triangle with at least two distinct vertices has perimeter at least 2π, so the CAT(1) tests hold; the empty link is CAT(1) vacuously. More generally, if a triangle in a finite spherical complex has dπ-perimeter less than 2π, none of its sides can equal π because the triangle inequality would force the other two sides to sum to at least π. Each side is therefore the componentwise intrinsic distance, and all vertices lie in one component, so its comparison is unchanged when using the truncated metric. This proves clause (iv).

Remarks

  • Supplier review: Steps 3.2 and 4.1 use Products of CAT(0) spaces, joins of CAT(1) spaces, and round spheres(ii),(iii) for CAT(1) joins and the one-point spherical cone. The join lemma's steps 4.1 and 5.1 use clause (i) of Berestovskii's cone criterion and the polyhedral link criterion. The current cone-theorem text contains explicit large-perimeter and antipodal comparison arguments; those cases and the exact uses were checked against Bridson–Haefliger II.3.14, printed pp. 189–190. Its available item receipt has an older hash and remains escalated, so the owner must refresh that sibling decision for the current bytes. This item's claim and use are verified against the current supplier text; the stale receipt is recorded as a run-level owner obligation in the pair report.
  • Choice: No Axiom of Choice is used here. The finite chain arguments use the definition of an infimum one tolerance at a time, finite cell sets, and finite minima; they do not use the minimizing-geodesic conclusion of Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(iii), whose separate Ascoli argument explicitly assumes Choice.
  • Source check: Bridson–Haefliger I.7.14 defines the link of a point in a geodesic simplex, I.7.15 assembles point links with their intrinsic string metric, and I.7.16 proves the small-ball cone chart by finite-chain development. The local argument above follows that route in curvature 1 and proves the required chain-metric comparison explicitly.

Depends on

Used by

Dependency tree · two levels

68 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