Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 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.

The angular link of a vertex of the Davis complex is the large metric flag nerve

Statement

Let (S,m) be a Coxeter matrix with S finite, W the presented group with length function ℓ (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), V=RS carrying the Coxeter form B with B(es,es)=1, B(es,et)=−cos⁡(π/m(s,t)) for m(s,t)<∞ and B(es,et)=−1 for m(s,t)=∞, and the canonical reflection representation ρ (The real Coxeter form, its radical, reflections, and form-preserving maps (1), The canonical reflection homomorphism, roots, reflections, and the positive cone). Let S be the set of spherical subsets with nerve L (Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (1)), let Σ be the Davis realization with its cellulation by the cells wWT (T∈S) and its chain metric d (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (1),(2)), and let CT=conv⁡(WTxT), xT=∑s∈Tdsvs(T), with its faces and face isometries be the Coxeter cell of Finite Coxeter orbit polytopes, face isometries and their cocycle for a fixed tuple of positive numbers (ds)s∈S. Assume the Axiom of Choice (The Axiom of Choice); it is used in the proof only through Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas (iii) and Finite large metric flag complexes are CAT(1).

(1) Edge directions at a vertex. Let T∈S and let wWT be a cell, identified with CT so that the 0-cell wW∅={w} corresponds to xT. For every s∈T the only 1-face of CT through xT with type {s} is the segment [xT,sxT], and sxT−xT=−2B(xT,es) es=−2ds es, because xT=∑t∈Tdtvt(T) and vt(T) is the B-dual basis of VT (Finite Coxeter orbit polytopes, face isometries and their cocycle (1),(2), The finite-type Coxeter cell: exposed faces and normal cones (5)). The tangent cone TxTCT (the cone of inward directions at the vertex, in the sense of Spherical Gram simplices and angular links of Euclidean faces) is the simplicial cone generated by the vectors −es, s∈T: it equals {y∈VT:B(vs(T),y)≤0 for all s∈T}, cut out by the facets through the vertex, and each −es is an extreme ray, since a nonnegative combination ∑t≠sλt(−et) has B(⋅,es)-pairing ≥0>−1=B(−es,es) and cannot equal −es (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas (v); VT carries the inner product BT, Real and complex inner-product spaces and their induced length, Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric).

(2) Edge lengths. For distinct s,t∈T the subgroup W{s,t} is finite because it is contained in the finite group WT, so m(s,t)<∞. In the spherical simplex Σ(BT) of (3), the edge joining the directions R≥0(−es) and R≥0(−et) has its prescribed spherical length arccos⁡B(es,et)=arccos⁡(−cos⁡(π/m(s,t)))=π−π/m(s,t) ≥ π/2 (The real Coxeter form, its radical, reflections, and form-preserving maps, Principal inverse sine and inverse cosine, Signs, monotonicity intervals, and ranges of sine and cosine). This is the local edge-cell length measured in that spherical simplex; no global shortest-path distance between these vertices in the whole link is asserted (Abstract isometric polyhedral gluings and the chain metric).

(3) The vertex link is the nerve. For every spherical T the link Lk⁡(xT,CT) of the vertex is isometric to the spherical simplex Σ(BT) with vertex set {−es:s∈T} and cosine matrix BT=B∣VT×VT, realized by the Gram construction of Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas (i),(ii) and Spherical Gram simplices and angular links of Euclidean faces, and for U⊆T the face of Σ(BT) belonging to the face conv⁡(WUxT) is Σ(BU), the vertex map being −es↦−es. Gluing over T∈S along these faces, the angular link Lk⁡Σ(w) of any 0-cell {w}, with its truncated angular metric, is canonically isometric to the finite spherical complex X:=∣L∣B built on the nerve L with the Gram matrices BT (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas (iii),(v),(vi), Abstract isometric polyhedral gluings and the chain metric); the direction of the 1-cell wW{s} corresponds to the vertex s of L, and the identification preserves the weak topologies and the truncated angular metrics.

(4) Large metric flag. X=∣L∣B is a finite large metric flag complex in the sense of Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links: by (2) every edge has length π−π/m(s,t)≥π/2. If T is a pairwise adjacent set of vertices of L, its cosine matrix CT is BT, since each edge entry is the local length from (2). The parabolic presentation theorem identifies (WT,T) with the Coxeter system for the restricted matrix m∣T, which is the induced labelled subdiagram (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2), Coxeter diagrams: edges, labels, components and finite type). Hence the finite-type criterion gives BT positive definite exactly when WT is finite (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1), Positive and negative definiteness, the inertia (p,q,r), rank p+q, and signature p−q of a real symmetric bilinear or quadratic form). By the definition of L, this is exactly when T spans a simplex. The associated almost-negative matrix has entry −1 on non-edges and cosine of the prescribed edge length on edges, so it is exactly B: a pair is an edge precisely when m(s,t)<∞, and then cos⁡(π−π/m(s,t))=B(es,et); for a non-edge m(s,t)=∞ and B(es,et)=−1.

(5) Higher links. For every spherical U and every w∈W the angular link Lk⁡Σ(wWU) of the cell wWU is canonically isometric to the link Lk⁡X(U) of the face U in X: its vertices are exactly the s∉U for which U∪{s} is spherical, its cells are the sets T′ with U∪T′ spherical, and its Gram matrices are the iterated Schur complements of B along U (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas (iv)). The direct Schur-complement argument in step 4.1 shows that every such link is again a finite large metric flag complex. For every point p of the relative interior of wWU, some metric ball B(p,ε) is isometric to the ball of radius ε about (0,o) in R∣U∣×C(Lk⁡Σ(wWU)) (The cone and join metrics and the local product chart of a polyhedral gluing).

(6) CAT(1) links. Every vertex link Lk⁡Σ(w)=X and, by (5), every link Lk⁡Σ(wWU) is CAT(1) for its truncated angular metric (Finite large metric flag complexes are CAT(1), Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles (3),(4)); truncation means dπ=min⁡{π,dpath}, including distance π across distinct components or when no path exists (The angular path metric, the Euclidean cone and spherical joins (2),(4)).

(7) Abstentions. Nothing is asserted here about CAT(0)-ness, contractibility, properness of the action or fixed points of finite subgroups; those are proved in the later items of this page. The link computation is independent of the choice of the distances ds; the cell metrics of Σ are not, and no claim is made here about them beyond The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K). No Choice is used in (1)-(5) beyond the referenced construction of the spherical complex.

Facts & Assumptions

Given: The Axiom of Choice, a finite Coxeter matrix (S,m), the presented group W with length ℓ, the Coxeter form B on V=RS, the canonical reflection representation ρ, a fixed tuple (ds)s∈S of positive real numbers, and the associated cells CT, T∈S.

[F1]

The Coxeter form satisfies B(es,es)=1, B(es,et)=−cos⁡(π/m(s,t)) for finite m(s,t) and B(es,et)=−1 for m(s,t)=∞, and each generator acts by the reflection ρ(s)=res, ρ(s)v=v−2B(v,es)es; the map ρ is a homomorphism (The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone). Its B-invariance is the local reflection-form calculation in step 1.3, followed by composition along a word for u.

[F2]

W is the group presented by (S,m); for T⊆S the standard parabolic is WT=⟨s:s∈T⟩, and T is spherical exactly when WT is finite, so that the simplices of the nerve L are the nonempty spherical subsets and L is finite (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (1)).

[F3]

Restricting the Coxeter matrix to T⊆S gives the induced labelled subdiagram; finite type means that the Coxeter group of the indicated system is finite (Coxeter diagrams: edges, labels, components and finite type).

[F4]

For spherical T the restriction BT is an inner product on VT, the vectors vs(T) (s∈T) form the B-dual basis, CT=conv⁡(WTxT) is a compact convex polyhedral cell of dimension ∣T∣ with 0 in its interior, and its nonempty faces are exactly the sets conv⁡(uWUxT), u∈WT, U⊆T, each occurring for exactly one coset uWU, with dim⁡conv⁡(uWUxT)=∣U∣ (Finite Coxeter orbit polytopes, face isometries and their cocycle).

[F5]

Applied to the finite-type system (WT,T) and the point xT with cs:=B(vs(T),xT)>0 (where ds=B(es,xT) denotes the mirror distance): every point of WTxT is a vertex of CT; conv⁡(wWUxT)⊆conv⁡(w′WU′xT) holds exactly when wWU⊆w′WU′; and CT={v∈VT:B(wvs(T),v)≤cs for all w∈WT, s∈T} with 0 in the interior (The finite-type Coxeter cell: exposed faces and normal cones (4),(5)).

[F6]

For a compact convex polyhedral cell with direction space V and a face F, the tangent cone is TFC={ξ∈V:⟨ξ,nj⟩≥0 for all facets j containing F}, equivalently the closure of {λ(x−p):x∈C, λ≥0}, and, with U(F)=span⁡(F−F), its normal face link Lk⁡C(F)=(TFC∩U(F)⊥)∩S(V) carries the angular distance dang(ξ,η)=arccos⁡⟨ξ,η⟩; for a vertex F, U(F)={0} and this link is TFC∩S(V); the spherical simplex Σ(C) of a positive-definite Gram matrix C with diagonal 1 is built from the cone on the unit vertices realizing C (Spherical Gram simplices and angular links of Euclidean faces).

[F7]

For each T⊆S, Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2) identifies (WT,T) with the Coxeter system for the restricted matrix m∣T, whose Coxeter form is BT; Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1) therefore gives BT positive definite if and only if WT is finite. The Davis complex Σ has one cell wWT for each w∈W and T∈S, its 0-cells are the elements w, and the cell wWT is identified with CT so that the 0-cell wW∅={w} corresponds to xT (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (1),(2)).

[F8]

The spherical simplex Σ(C) is realized by the Gram construction, uniquely up to a linear isometry (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas (i),(ii)).

[F9]

An isometric polyhedral gluing is the quotient of the disjoint union of its cells along face isometries satisfying the cocycle condition, and it carries the chain metric and its angular links (Abstract isometric polyhedral gluings and the chain metric).

[F10]

A finite spherical complex is large when all edge lengths are at least π/2; for a large complex the associated almost-negative matrix has off-diagonal entries the cosines of the edge lengths for adjacent vertices and −1 for non-adjacent ones; the complex is metric flag when a pairwise adjacent set of vertices spans a simplex exactly when its cosine matrix is positive definite; and the link of a face carries the iterated Schur-complement Gram matrices (Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links (1)-(4), Positive and negative definiteness, the inertia (p,q,r), rank p+q, and signature p−q of a real symmetric bilinear or quadratic form).

[F11]

Under AC, every finite large metric flag complex is CAT(1) for its truncated angular metric. The proof uses compact geodesic components with their untruncated intrinsic spherical length metrics, then transfers the short comparison tests to the truncation (Finite large metric flag complexes are CAT(1)).

[F12]

At a point p in the relative interior of a face F, for some ε>0 the metric ball B(p,ε) is isometric, preserving intrinsic lengths, to the ball of radius ε about (0,o) in Rdim⁡F×C(Lk⁡X(F)) (The cone and join metrics and the local product chart of a polyhedral gluing (4)).

[F13]

The face link has angular metric dπ=min⁡{π,dpath}, with dpath=+∞ across components (The angular path metric, the Euclidean cone and spherical joins (2),(4)). CAT(1) requires geodesics only for pairs at distance <π and spherical comparison only for geodesic triangles of perimeter <2π (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles (3)); all sides of such a triangle are <π, by the triangle inequality.

[F14]

The principal inverse cosine satisfies arccos⁡(−cos⁡(π/m))=π−π/m for every integer m≥2, and cos⁡ is strictly decreasing on [0,π] (Principal inverse sine and inverse cosine, Signs, monotonicity intervals, and ranges of sine and cosine).

[F15]

The inner product BT determines the distances on VT (Real and complex inner-product spaces and their induced length); a metric space and its isometries are as in the metric conventions, so a distance-preserving identification of two angular links is an isometry (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric, Isometry, isometric embedding, and the subspace metric on a subset).

[F16]

The Axiom of Choice: every family of nonempty sets has a choice function (The Axiom of Choice).

[F17]

Each connected component of a finite spherical complex, with its chain metric, is a compact proper complete length space whose metric topology is the weak topology; under AC, every two points in a component are joined by a minimizing geodesic. Between distinct components the path distance is +∞, an auxiliary value replaced by π in the truncated angular metric (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas (iii),(vi)).

[F18]

Face links of spherical simplices are given by iterated normalized Schur complements; their angular metrics are the intrinsic round metrics, their face identifications are canonical, and distinct components use the auxiliary infinite path-distance convention before truncation (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas (iv)-(vi)).

Proof

Given: The Axiom of Choice, a finite Coxeter matrix (S,m), the presented group W with length ℓ, the Coxeter form B and the representation ρ on V=RS, a tuple (ds)s∈S of positive real numbers, and the spherical subsets S with their cells CT.

Proof technique: direct.

1.1F1F4

Fix T∈S and s∈T. The vectors vt(T) (t∈T) are the B-dual basis of VT and BT is an inner product, so B(xT,es)=∑t∈TdtB(vt(T),es)=ds; the reflection formula of [F1] gives ρ(s)xT=xT−2B(xT,es)es, that is sxT−xT=−2dses≠0. By [F4] the point xT is a vertex of the compact convex polyhedral cell CT of dimension ∣T∣, and the nonempty faces of CT are exactly the sets conv⁡(uWUxT), one for each coset uWU (u∈WT, U⊆T).

1.2F4F5

By the inclusion criterion of [F5] a face conv⁡(uWUxT) contains xT exactly when {xT}=conv⁡(W∅xT)⊆conv⁡(uWUxT), that is exactly when W∅⊆uWU, i.e. 1∈uWU, which forces uWU=WU. Hence the faces of CT through xT are precisely the sets conv⁡(WUxT), U⊆T, so the faces of type {s} through xT are precisely the segments conv⁡(W{s}xT)=[xT,ρ(s)xT], the straight segment from xT to ρ(s)xT because ρ(s)xT−xT=−2dses. In particular [xT,sxT] is the only 1-face of CT through xT of type {s}, as asserted in (1).

1.3F1F4F5F6

The reflection formula in [F1] gives, for x,y∈V and a=B(x,er), b=B(y,er), B(ρ(r)x,ρ(r)y)=B(x−2aer,y−2ber)=B(x,y)−2ab−2ab+4ab=B(x,y), since B(er,er)=1. Every u∈W is a finite word in the generators and ρ is a homomorphism, so composition proves B(ρ(u)x,ρ(u)y)=B(x,y). The facets of CT through xT are the faces Fs:=conv⁡(WT∖{s}xT) for s∈T, by 1.1, 1.2 and the dimension statement in [F4]. Fix s∈T. Each generator r∈T∖{s} fixes the quotient of VT by VT∖{s}: the reflection formula gives ρ(r)es−es∈VT∖{s} and ρ(r)VT∖{s}=VT∖{s}. Thus for every u∈WT∖{s}, ρ(u)−1es∈es+VT∖{s} and ρ(u)−1et∈VT∖{s} for t≠s. Pairing with the dual basis gives B(ρ(u)vs(T),et)=B(vs(T),ρ(u)−1et)=δst for every t∈T, so nondegeneracy of BT implies ρ(u)vs(T)=vs(T). Consequently B(vs(T),uxT)=B(vs(T),xT)=cs for every such u, and Fs lies in the supporting hyperplane B(vs(T),y)=cs; [F5] puts CT in the half-space B(vs(T),y)≤cs. Since Fs has dimension ∣T∣−1, it is exactly the equality face, and its inward normal is proportional to −vs(T). By [F6], TxTCT={ξ∈VT:B(vs(T),ξ)≤0 for every s∈T}. Writing ξ=∑t∈Tatet gives B(vs(T),ξ)=as, so this is cone⁡{−es:s∈T}; these generators are extreme because each nonnegative combination ∑t≠sλt(−et) has B(⋅,es)-pairing ∑t≠sλt(−B(et,es))≥0, whereas B(−es,es)=−1.

1.4F1F2F6F14

If distinct s,t∈T, then W{s,t}≤WT is finite, so the order m(s,t) of st is finite. The unit vectors −es,−et in the positive-definite plane V{s,t}⊆VT have inner product B(es,et)=−cos⁡(π/m(s,t)). Their local spherical edge length is therefore arccos⁡(−cos⁡(π/m(s,t)))=π−π/m(s,t)≥π/2, by [F1], [F2], [F6], [F14].

1.5F7

For spherical T, BT is an inner product by [F7], and the cell wWT of the Davis complex is identified with CT so that wW∅={w} corresponds to xT and the 1-cell wW{s}, s∈T, corresponds to the unique 1-face of type {s} through the vertex; the direction of this 1-cell at w is therefore the ray R≥0(ρ(s)xT−xT)=R≥0(−es) by 1.1.

1.6F4F6F7F8F15

By [F6] the angular link of the vertex is Lk⁡CT(xT)=TxTCT∩S(VT), the unit sphere in (VT,BT) (Real and complex inner-product spaces and their induced length); by 1.3 and 1.4 its vertices are the unit vectors −es with pairwise products B(−es,−et)=B(es,et), that is with Gram matrix BT. By the Gram construction [F8] the spherical simplex Σ(BT) built on the unit vertices realizing BT is unique up to a linear isometry of its ambient inner product space; a linear isometry carrying its vertices to the −es maps it onto Lk⁡CT(xT), and it preserves the angular distances arccos⁡⟨⋅,⋅⟩, so it is an isometry of angular links [F15]. Moreover, for U⊆T the face conv⁡(WUxT) has vertex xT, and by the same computation applied to the finite-type system (WU,U) its link at xT is Σ(BU), the face of Σ(BT) spanned by the vertices −es, s∈U, with the vertex map −es↦−es.

2.1F1F2step 1.4step 1.5

For distinct s,t∈S, every word in s,t reduces using s2=t2=1 to an alternating word; if m(s,t)<∞, each such word represents one of at most 2m(s,t) elements of the form (st)k or s(st)k, so W{s,t} is finite. If m(s,t)=∞, the element st has infinite order by the Coxeter-matrix convention, so W{s,t} is infinite. Hence {s,t} is an edge of L exactly when m(s,t)<∞. In that case its local edge-cell length is the value in 1.4; the direction of the 1-cell wW{s} at w is R≥0(−es) by 1.5. These rays and their local edge lengths are independent of the positive tuple (ds). No global shortest-path equality in the whole link is used.

2.2F7F9F15F16F17F18step 1.6

Fix w∈W. The cells of Σ containing w are the cells wWT, T∈S, and the link of w in wWT is Lk⁡CT(xT), identified with Σ(BT) in 1.6; for U⊆T the face wWU corresponds to the face conv⁡(WUxT) and its direction face at w is Σ(BU). The cellulation glues these spherical simplices along those faces by the identity vertex maps −es↦−es, compatible for all inclusions; [F17] gives a chain metric on each connected component, with the weak topology, and auxiliary path distance +∞ between components. Truncating at π gives a metric on the whole link with the same weak topology: balls of radius less than π are exactly the componentwise intrinsic balls. The angular-link gluing of [F9] identifies this glued link with Lk⁡Σ(w). By the cell statement in [F7], its cells are exactly the spherical subsets T∈S, with Gram matrices BT, glued along their common faces, so it is the finite spherical complex X=∣L∣B. The direction of wW{s} corresponds to vertex s of L, and the cellwise link isometries induce the isometry of the glued polyhedral complexes and their truncated angular metrics by [F18].

3.1F1F2F3F7F10step 2.1step 2.2

By 2.1 every edge of X has local length π−π/m(s,t)≥π/2, so X is large. For a pairwise adjacent set T of vertices of L, the cosine test matrix in [F10] is BT, including the empty matrix when T=∅. By [F7], BT is positive definite exactly when WT is finite, and by [F2] that is exactly when T spans a simplex of L. Thus X is metric flag. The almost-negative matrix of [F10] equals B: on edges its entry is cos⁡(π−π/m(s,t))=B(es,et) by 2.1 and [F1], while on non-edges m(s,t)=∞ by 2.1 and the entry is B(es,et)=−1. Therefore X is a finite large metric flag complex with associated matrix B.

4.1F4F5F6F10F12F18algebrastep 1.3step 2.1step 2.2step 3.1

Let U∈S and w∈W. For a spherical T⊇U, use the w-chart of its cell wWT, so wWU corresponds to FU:=conv⁡(WUxT). Its direction space is VU:=span⁡{eu:u∈U}: orbit differences lie in VU by the reflection formula, and the differences uxT−xT=−2dueu span it. The facets containing FU are exactly the Fs of step 1.3 with s∉U, by the face-inclusion criterion [F5]. Thus at a relative interior point of FU, [F6] gives TFUCT={ξ:B(vs(T),ξ)≤0 (s∈T∖U)}=VU+cone⁡{−es:s∈T∖U}. Let PU be the BT-orthogonal projection onto VU. Intersecting this cone with VU⊥ gives exactly the cone generated by −(es−PUes): projection gives one inclusion, and subtracting the VU component of any such nonnegative combination gives the other. Their normalized Gram matrix is the Schur complement along U from [F18], exactly the normal link of the face U in Σ(BT). In these w-charts the face maps of Finite Coxeter orbit polytopes, face isometries and their cocycle (3),(4) are v↦v+zT′,T for U⊆T⊆T′; their derivatives are inclusions, and the projection onto VU agrees on VT. Thus they preserve the projected rays, and their cocycle makes the identifications agree on common cofaces. Consequently the link of wWU is obtained by gluing these spherical face links for T⊇U; its vertices are exactly the s∉U for which U∪{s} is spherical, its cells are the T′ with U∪T′ spherical, and its simplex Gram matrices are the iterated normalized Schur complements of B along U, by [F10] and [F18]. This is the face link Lk⁡X(U). For U=∅ it is X, already finite large metric flag by step 3.1. For nonempty U, each link simplex Gram matrix is positive definite by the Schur-complement identity. Its off-diagonal entries are nonpositive: eliminating one vertex v from a current positive-definite Gram matrix with nonpositive off-diagonal entries replaces an off-diagonal entry cst by cst−csvctv≤0; its new diagonal entries 1−csv2 are positive by positive definiteness, and normalization by their positive square roots preserves signs. Repeating over the vertices of U proves largeness of every link. To check metric flagness, let Q be any pairwise adjacent set in Lk⁡X(U). Then U∪Q is pairwise adjacent in X. The link cosine matrix on Q is the positive-diagonal normalization of the Schur complement of BU in the matrix BU∪Q; this follows entrywise from orthogonal projection off VU and the link formula [F18]. Since BU is positive definite, the block Schur-complement identity makes this link matrix positive definite exactly when BU∪Q is. By step 3.1 the latter is positive definite exactly when U∪Q spans a simplex of X, which is exactly when Q spans a simplex of the link. The empty set passes the empty-matrix convention in [F10]. Thus every cell link is again finite large metric flag. Finally, [F12] identifies a sufficiently small ball at a point in the relative interior of wWU with the corresponding ball about (0,o) in R∣U∣×C(Lk⁡Σ(wWU)); the link computation is independent of (ds) because its directions are the rays in step 2.1.

5.1F11F13F16F17step 3.1step 4.1∎

By step 3.1 and step 4.1, X and every face link are finite large metric flag complexes. Under the stated AC assumption, [F11] therefore makes all these links CAT(1). Its compact short-loop argument uses the untruncated intrinsic geodesic metrics of the components supplied by [F17]. A pair at angular distance <π and every triangle of perimeter <2π lie in one such component; all triangle sides are <π by [F13]. Distances between side points are at most half that perimeter, hence also <π, so the spherical comparison tests agree before and after truncation. This reconciles clause (6) with the completed supplier. AC is used only through [F17] and [F11]; the direct calculations make no further choice selections. Together with the preceding calculations this proves clauses (1)–(6), with the scope of (7).

Depends on

Used by

Dependency tree · two levels

185 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