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 spherical radius estimate, the quadrilateral separation constant, and the finite midpoint-operation comparison disk

Statement

(i) Spherical radius estimate. Let Z be a CAT(1) space (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles) and let γ be a closed rectifiable curve of length 2r with 0<2r<2π. Split γ at points y,z into two subarcs of length r, and let a be the midpoint of the geodesic [y,z] (which exists because d(y,z)≤r<π). Then for every point x of γ, cos⁡d(a,x) ≥ cos⁡d(x,y)+cos⁡d(x,z)2cos⁡(d(y,z)/2) ≥ cos⁡(r/2), and the image of γ is contained in the closed ball Bˉ(a,r/2); with η:=12(π−r)>0 one has r/2=π/2−η.

(ii) Quadrilateral separation. There is a function δ on {(η,μ):0<μ<2η<π} with values δ(η,μ)>0, continuous on every compact subset of its domain, such that: if a,x,y,z are points of a CAT(1) space with d(a,x)≤π/2−η, d(x,y)=d(x,z)=μ and d(a,y),d(a,z)≤d(a,x), then d(y,z) ≤ 2μ−δ(η,μ). The estimate is intrinsic: the two spherical comparison triangles of (a,x,y) and (a,x,z) are glued along their common side [a,x], and a shortest path in the resulting quadrilateral Q either stays in one triangle or crosses the common side; the ambient spherical chord need not lie in Q and is not used. The bound is uniform on the compact family of configurations with 0<μ<2η, including degenerate comparison triangles by continuity; equality of either radial distance with d(a,x) is also allowed; the equality corner is excluded by μ<2η, and the degenerate case d(a,x)=0 is impossible for a nonconstant configuration.

(iii) The midpoint-operation disk (assuming the Axiom of Choice). Let x∈Ch0(n) and choose m≥1 with L(fmx)<2l (Uniform local radii, cyclic small-mesh polygons, mesh, length, energy, the midpoint operation and the zero-limit basin). Assume that every comparison triangle used below is nondegenerate, i.e. its three side lengths satisfy the strict triangle inequalities. Build the finite cellulation G(m,n) from the nested midpoint polygons of a regular Euclidean n-gon: its ears have principal vertices v(i,j),v(i+1,j−1),v(i+1,j) for 0≤i<m, and its final fan has triangles v(m,1),v(m,j−1),v(m,j) for 3≤j≤n. Row-i edges are subdivided at their row-(i+1) midpoints. Assign v(i,j) the point (fix)j of X and give each face the spherical comparison metric of its assigned triple (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences). The ambient space need only have the uniform CAT(1) radius l; its compactness is not used in this finite construction. Then:

(a) every face has perimeter <2l<π and is nondegenerate;

(b) the vertexwise map extends along each edge to a map g ⁣:K1(G)→X of the 1-skeleton, and ρ(u,v)≥d(gu,gv) for all skeleton points u,v, where ρ is the disk's intrinsic polyhedral metric;

(c) every interior vertex of the disk has cone angle at least 2π;

(d) the boundary vertices are exactly V(0)∪V(1); those in V(1) have boundary angle at least π, and those in V(0) have boundary angle <π;

(e) the disk contains no simple closed local geodesic: successive ear removal forces such a curve into the final fan, where the spherical radial maximum argument excludes it;

(f) consequently the disk, with the polyhedral metric, is a CAT(1) space (Compact geodesic locally CAT(1) spaces are CAT(1) exactly when they contain no short circle, Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences).

(iv) Quantitative output (assuming the Axiom of Choice). In the situation of (iii), assume also 0<L(x)<2π and put r=L(x)/2, ξi=d(xi,xi+1), ζi=d(fxi,fxi+1), η=(π−r)/2 and μ=min⁡{r/(2n),η}. If ξi≥r/n for all i (the case produced by the variance estimate used later on this page), then there is an index k with ζk ≤ ξk+ξk+12−δ(η,μ). The index k is adjacent to a first-row boundary vertex b of maximally possible distance from the radius center a supplied by (i); the two outgoing subarcs at b are cut at distance μ, perimeters satisfy 2R+μ<π with R=π/2−η, and the intrinsic quadrilateral estimate (ii) applied in the disk, together with ρ≥d∘(g×g) of (b), gives the displayed deficit for equal cut segments; longer unequal midpoint segments are handled by taking initial equal μ-pieces and adding the remaining lengths.

Facts & Assumptions

Given: A CAT(1) space Z and a closed rectifiable curve γ of length 2r, 0<2r<2π, split at y,z into two subarcs of length r; configurations a,x,y,z as in (ii); a compact locally CAT(1) space X, a uniform radius l<π/2, a fixed n≥3 and a tuple x∈Ch0(n) as in (iii) with all ξi≥r/n.

[F1]

Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles: CAT(1) and locally CAT(1) spaces; dS(x,y)=arccos⁡(x⋅y) on S2; local geodesics; the CAT(1) inequality for all pairs of points of a triangle of perimeter <2π.

[F2]

Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences: comparison triangles of perimeter <2π exist and are unique up to isometry and the comparison map on them is distance-nonincreasing; the spherical cosine rule and the midpoint identity cos⁡dS(x,a)=(cos⁡dS(x,y)+cos⁡dS(x,z))/(2cos⁡(dS(y,z)/2)); balls of radius <π/2 in a CAT(1) space are convex with unique geodesics.

[F3]

Short local geodesics in a CAT(1) space are geodesics, and closed local geodesics have length at least 2π: unique short geodesics with continuous dependence on endpoints; local geodesics of length ≤π are geodesics.

[F4]

Uniform local radii, cyclic small-mesh polygons, mesh, length, energy, the midpoint operation and the zero-limit basin and Existence of the uniform radius, continuity of the midpoint operation, the energy drop, its equality case, and convergence of zero-limit polygons: mesh, L, E, the midpoint operation f and its continuity, the zero-limit basin Ch0(n), the invariance mesh⁡(fx)≤mesh⁡(x), and the pointwise bound d(fxi,fxi+1)≤(ξi+ξi+1)/2.

[F9]

Finite comparison-cell construction: take the spherical comparison triangles supplied by [F2] and identify their prescribed corresponding edges by length-preserving maps. This is the definition of the quotient cellulation used in (iii); an arbitrary edge identification is not an application of the triangle-gluing or patchwork lemma, and no global angle comparison follows from the identification alone.

[F10]

Compact geodesic locally CAT(1) spaces are CAT(1) exactly when they contain no short circle: a compact, geodesic, locally CAT(1) space is CAT(1) if and only if it contains no isometrically embedded circle of length <2π.

[F11]

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: the compact short-circle criterion of [F10] consumes AC through its Arzelà–Ascoli path; the radius estimate, the separation constant, the disk construction are choice-free; clauses (iii)(f) and (iv) consume that criterion and hence assume AC.

[F12]

Upper bound, least upper bound, and strict upper bound defines upper bounds and suprema. By A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value, a continuous real-valued function on a nonempty compact metric space is bounded and attains its supremum and infimum; nonemptiness and continuity must be checked for each application.

Proof

technique · direct
1.1F1F2F5F7F8algebra

Radius estimate (i). Let x be a point of γ; it lies on one of the two subarcs between y and z, so writing b:=d(x,y), d:=d(x,z), c:=d(y,z) we have b+d≤r (the two pieces of that subarc dominate the two distances), ∣b−d∣≤c (triangle inequality) and c≤r<π. The triangle (x,y,z) of Z has perimeter b+d+c≤2r<2π, so a comparison triangle exists in the round sphere S2 of [F7] and the CAT(1) inequality of [F1] applied to the pair (a,x) gives d(a,x)≤dS(aˉ,xˉ), where aˉ is the comparison point of the midpoint a of [y,z]. The midpoint identity of [F2] gives cos⁡dS(aˉ,xˉ)=(cos⁡b+cos⁡d)/(2cos⁡(c/2)), and the addition formula ([F8]) turns this into cos⁡((b+d)/2)cos⁡((b−d)/2)/cos⁡(c/2); since ∣b−d∣≤c and cos⁡ decreases on [0,π] with cos⁡(c/2)>0, this is at least cos⁡((b+d)/2), which is at least cos⁡(r/2) because b+d≤r and r/2<π. Hence cos⁡d(a,x)≥cos⁡(r/2) with both arguments in [0,π], so d(a,x)≤r/2: the image of γ is contained in the closed ball of radius r/2 about a, and r/2=π/2−η for η=(π−r)/2.

1.2F1F2F5F8F9F12algebra

Quadrilateral separation (ii). Let a,x,y,z satisfy the hypotheses, and consider the two comparison triangles Tˉy=(aˉ,xˉ,yˉ) and Tˉz=(aˉ,xˉ,zˉ) of the triangles (a,x,y) and (a,x,z) in S2; both are admissible because their perimeters are at most 2d(a,x)+μ≤2(π/2−η)+μ<2π. Glue them along the common side [aˉ,xˉ] on opposite sides, obtaining an abstract spherical quadrilateral Q (two triangles joined along the isometric side [aˉ,xˉ]) with intrinsic distance dQ; the corresponding boundary maps agree on the common side because the geodesic [a,x] is unique (d(a,x)<π, [F3]); comparison on each triangle boundary, followed by the triangle inequality at the crossings of the common side, gives d(y,z)≤dQ(yˉ,zˉ). Write ϑ for the angle at xˉ between [xˉ,aˉ] and [xˉ,yˉ] inside Tˉy and ϑ′ analogously in Tˉz; by the cosine rule and d(a,y)≤d(a,x), cos⁡ϑ=(cos⁡d(a,y)−cos⁡d(a,x)cos⁡μ)/(sin⁡d(a,x)sin⁡μ)≥(cos⁡d(a,x)−cos⁡d(a,x)cos⁡μ)/(sin⁡d(a,x)sin⁡μ)=cot⁡d(a,x)tan⁡(μ/2), and since d(a,x)≤π/2−η gives cot⁡d(a,x)≥tan⁡η, we get cos⁡ϑ≥tan⁡ηtan⁡(μ/2) and likewise cos⁡ϑ′≥tan⁡ηtan⁡(μ/2); as the right-hand side is positive and μ>0, both ϑ,ϑ′ are strictly less than π/2, so with ψ:=arcsin⁡(tan⁡ηtan⁡(μ/2))>0 the angle Φ:=ϑ+ϑ′ satisfies Φ≤π−2ψ<π. Put q:=min⁡{1/2,tan⁡ηtan⁡(μ/2)} and ψ:=arcsin⁡q, so the preceding angle bounds still give Φ≤π−2ψ. The triangle inequality gives μ=d(x,y)≤d(a,x)+d(a,y)≤2d(a,x), hence the common side has length at least μ/2. Cut both outgoing edges at distance e:=μ/4 from xˉ. The short spherical chord joining the cutpoints lies in the wedge of angle Φ<π and in the convex closed ball Bˉ(xˉ,e), since e<π/4. The other two edges are outside this small ball: for p∈[aˉ,yˉ], writing t=d(a,x), the triangle inequality gives dS(xˉ,p)≥max⁡{μ−dS(p,yˉ),t−dS(p,aˉ)}≥(μ+t−d(a,y))/2≥μ/2, and likewise for [aˉ,zˉ]. It meets the common radial side before its far endpoint (at distance at most e<μ/2); each half lies in the corresponding convex spherical triangle. Thus this chord really is a path in Q, irrespective of whether the chord joining yˉ,zˉ lies in Q. Its length is at most ℓe:=arccos⁡(cos⁡2e+sin⁡2ecos⁡(π−2ψ))<2e. Adding the two remaining edge pieces gives dQ(yˉ,zˉ)≤2(μ−e)+ℓe=2μ−δ(η,μ), with δ(η,μ):=2e−ℓe>0. This formula is continuous on the whole stated parameter domain, including parameter values for which no configuration exists; the clamp in q keeps the inverse sine defined there. Degenerate comparison triangles, with a zero angle at xˉ, give the same chord shortcut directly; equality of radial distances was already included in the cosine bound; d(a,x)=0 would give μ=d(x,y)≤d(x,a)+d(a,y)≤0, contradicting μ>0.

1.3F2F4F5F7F8F9algebraconstruct

The finite disk and its face bounds (iii)(a). In the Euclidean plane take a regular n-gon P0, and let Pi+1 be its midpoint polygon; it is a regular n-gon, rotated through π/n and scaled by cos⁡(π/n)>0. The difference between Pi and Pi+1 consists of the n ears T(i,j) with principal vertices v(i,j),v(i+1,j−1),v(i+1,j); their radial sides meet at the row-i vertices, while each row-i side is subdivided at v(i+1,j). The ears for 0≤i<m and the n−2 triangles T(m,j)=(v(m,1),v(m,j−1),v(m,j)), 3≤j≤n, of a diagonal fan triangulate the closed disk P0. Thus the prescribed edge identifications yield a topological disk, with boundary vertices V(0)∪V(1) and interior vertices V(2)∪⋯∪V(m); the row-i polygon is the boundary of the remaining disk after the first i ear layers are removed. Assigning spherical metrics leaves this topology unchanged, since the strict triangle inequalities make each face a nondegenerate closed triangle. The ear sides are ξj−1(i)/2, ξj(i)/2 and d(v(i+1,j−1),v(i+1,j)) in X, so by [F4] their perimeter is at most ξj−1(i)+ξj(i)≤2h<2l<π. For a cap triangle, the three consecutive subarcs of the last-row loop between its three assigned vertices have total length L(fmx)<2l and dominate its three distances; hence its perimeter is also <2l<π. Every face is therefore contained in an open spherical hemisphere and has angles <π.

1.4F1F2F3F4F5F9construct

The skeleton map dominates the ambient distance (iii)(b). Map each edge at constant speed to the corresponding unique short geodesic of X. This is consistent with subdivision: the row-(i+1) vertex on a row-i side is its assigned midpoint by [F4]. Each ear has all assigned vertex distances ≤h<l, and each cap face has all such distances ≤L(fmx)/2<l. Thus each assigned triple lies in a radius-l CAT(1) ball; its three geodesic sides lie there by comparison convexity. The CAT(1) inequality gives d(gu,gv)≤dT(u,v) for any two points of the boundary of its spherical comparison face T. The intrinsic path metric of the finite complex is the infimum of lengths of chains of face segments; for skeleton endpoints, each segment of such a chain begins and ends on the boundary of its face (split at successive face crossings). Applying the boundary comparison to these segments and the triangle inequality in X gives d(gu,gv)≤ the chain length; the infimum gives d(gu,gv)≤ρ(u,v). No extension of g to face interiors is needed.

1.5F2F8algebra

Shortest paths through a vertex span at least π on each side (cone lemma). Let W be a polyhedral surface with an interior vertex v at which the total cone angle is Θ, let u1,u2 be points on two edges issuing from v at positive distance from v, and suppose the concatenation of the two segments [u1,v], [v,u2] is a shortest path from u1 to u2 in W. Then the two sectors of W at v cut out by the segments have angles at least π, so Θ≥2π. Indeed, if a sector had angle φ<π, then in that sector (a sufficiently small spherical wedge of angle <π, hence convex) the two points at equal small distance ε from v on the two edges would be joined by a path of length strictly less than 2ε: the spherical cosine rule gives cos⁡ℓ=cos⁡2ε+sin⁡2εcos⁡φ>cos⁡(2ε) for φ<π, so ℓ<2ε, and adding the remaining pieces gives a strictly shorter path, contradicting minimality. At a boundary vertex the same shortcut applies to its one available disk-side sector and forces that sector to have angle at least π; no second sector or 2π bound is asserted there.

2.1step 1.3step 1.5F2F7F8

Ear removal. Let Di be the closed disk remaining after removal of ear layers 0,…,i−1, with D0=D. Suppose a simple closed local geodesic γ of D lies in Di, i<m. It is also locally shortest among paths in Di. At a tip v(i,j) the only incident face of Di is the ear T(i,j), whose angle is <π; the shortcut argument of step 1.5 excludes passage through that tip. At an interior point of a boundary side of Di, the local space is a spherical half-disk and a local geodesic meeting that boundary must follow its great-circle side. Continuing toward the adjacent tip would reach v(i,j) before any other vertex, which is impossible. Therefore γ avoids all boundary side interiors of Di. A component of its intersection with an ear interior must consequently enter and leave through that ear's base, possibly at its endpoints: the other two sides are boundary sides of Di. Inside the ear the arc is a great-circle arc contained in an open hemisphere; its length is <π, so it cannot meet the same short great-circle base twice unless it coincides with that base. Nor can a whole closed great circle lie in the ear's hemisphere. Thus γ misses the ear interiors and lies in Di+1. Induction forces γ into the final fan Dm.

2.2step 1.3step 1.4step 1.5F1F4algebra

Interior cone angles (iii)(c). Let u=v(i,j) with 2≤i≤m and let w1:=v(i−1,j), w2:=v(i−1,j+1) be the endpoints of the row-(i−1) edge whose midpoint is u; the two radial edges [w1,u] and [u,w2] are sides of the ears T(i−1,j) and T(i−1,j+1) and have ρ-length equal to the X-distances ξj(i−1)/2=d(gw1,gu)=d(gu,gw2). Since gu is the midpoint of the geodesic [gw1,gw2], d(gw1,gw2)=d(gw1,gu)+d(gu,gw2)=ρ(w1,u)+ρ(u,w2), while ρ(w1,w2)≥d(gw1,gw2) by (iii)(b) and ρ(w1,w2)≤ρ(w1,u)+ρ(u,w2) by the triangle inequality; hence equality holds and the concatenation [w1,u]∪[u,w2] is a shortest path. By the cone lemma of step 1.5 the cone angle of D at u is at least 2π. (The cap supplies the inner sector when i=m.)

3.1step 1.3step 1.5step 2.2F1F2F8algebra

Boundary angles (iii)(d). The boundary of D is the subdivided row-0 polygon. At a first-row vertex v(0,j) exactly the ear T(0,j) is incident, so the boundary angle is the angle of its spherical comparison triangle at v(0,j); the comparison triangle is nondegenerate with perimeter <2h<2π, and all angles of a nondegenerate spherical triangle of perimeter <2π are strictly less than π (an angle ≥π would force the opposite side to be at least the sum of the other two by the cosine rule, contradicting strictness), so ∠(∂D,v(0,j))<π. At the boundary vertex v(1,j) of the last row of the first strip, the incident faces are T(0,j), T(0,j+1) and the faces on the remaining-disk side; the concatenation [v(0,j),v(1,j)]∪[v(1,j),v(0,j+1)] is a shortest path by the argument of step 2.2 with w1=v(0,j), w2=v(0,j+1), using only the disk-side sector of the shortcut argument, so by step 1.5 the sector of D at v(1,j) that lies on the disk side of the path -- which is exactly the disk's sector at its boundary vertex -- has angle at least π, i.e. ∠(∂D,v(1,j))≥π; equivalently the row-0 polygon is locally geodesic at v(1,j).

3.2step 1.3step 1.5step 2.1F2F6F7F8algebra

The final fan excludes a closed local geodesic (iii)(e). Write c=v(m,1). On each cap face define R(p) as its spherical distance to c. These functions agree on fan diagonals, hence define a continuous function on Dm; each face lies in the convex spherical ball of radius L(fmx)/2<l<π/2 about c, so R<π/2. Suppose the curve forced into Dm by step 2.1 exists, and let p maximize R on it. Its maximum is positive, so p≠c. If p is in a face interior or a fan diagonal interior, unfold the adjacent faces into S2: the common radial segment to c agrees in the unfolding, and the local geodesic is a great-circle segment. At its radial maximum its two outgoing directions are perpendicular to the radial direction, so the cosine rule gives cos⁡R(γ(t))=cos⁡R(p)cos⁡t<cos⁡R(p) for small nonzero t, contradicting maximality. The same argument applies at a boundary side interior if the curve follows that side. At a remaining boundary vertex p≠c, the one or two incident cap faces form a sector, split by the radial diagonal to c when there are two. If an outgoing direction has angle α to the radial direction, the cosine rule reads cos⁡R(γ(t))=cos⁡R(p)cos⁡t+sin⁡R(p)sin⁡tcos⁡α. Maximality implies cos⁡α≥0, hence both outgoing directions make angles at most π/2 with the radial direction. The sector between them consequently has angle at most π; local minimality requires angle at least π by step 1.5. Equality forces both angles to be π/2, and the same displayed cosine rule again increases R for small positive t, a contradiction. Thus no simple closed local geodesic exists in D.

4.1step 1.3step 2.2step 3.1F1F2algebraconstruct

Local CAT(1) via a spherical cone chart. At a vertex let J be its angular link with metric truncated at π: an interior link is a circle of circumference Θ≥2π, and a boundary link is an interval of its finite boundary angle. Both are CAT(1). For the circle use F2; truncation changes neither short segments nor triangles of perimeter <2π. For the interval every tested triangle lies in a subinterval of length <π and is degenerate. Let p be a one-point space. The Euclidean cone criterion Berestovskii's cone criterion and the polyhedral link criterion makes C(J) CAT(0). The product [0,∞)×C(J) is CAT(0), by adding the squared vertex-to-side inequalities of F2. The join–product isometry The cone and join metrics and the local product chart of a polyhedral gluing (3) identifies it with C({p}∗J); the same cone criterion now makes {p}∗J CAT(1). Its polar metric about p is cos⁡d=cos⁡tcos⁡t′+sin⁡tsin⁡t′cos⁡dJ(u,u′), by The angular path metric, the Euclidean cone and spherical joins. On each angular subinterval of length <π this is exactly the spherical sector metric, and these sectors glue in the same order as the incident faces of D. Thus their polar charts identify a sufficiently small neighborhood of the vertex with a neighborhood of p in the join, preserving lengths. This also identifies the induced distances on smaller balls: choose an outer chart radius σ<π/2 within every incident face; a path leaving it between points of radii at most σ/4 has length at least 3σ/2, whereas the path through the vertex has length at most σ/2. Shorter paths remain in the chart. The join's smaller closed balls are convex and CAT(1), so their corresponding balls in D are CAT(1). Face and edge interiors have spherical disk or half-disk charts, which have convex small CAT(1) balls. Hence D is locally CAT(1), including boundary angles greater than π.

5.1step 1.3step 3.2step 4.1F6F10F11

Global CAT(1) (iii)(f). The intrinsic finite spherical complex is compact, being a quotient of finitely many compact model triangles, and geodesic: a minimizing sequence of constant-speed paths has uniformly bounded speed, and compact Arzelà–Ascoli gives a uniformly convergent subsequence whose limit has length at most the infimum, by the finite-partition definition of length. This is the AC use of [F11]. Step 4.1 supplies local CAT(1), and step 3.2 excludes every simple closed local geodesic, hence every isometrically embedded circle of length <2π. The compact short-circle criterion [F10] now proves that D is CAT(1).

6.1step 1.1step 1.2step 1.4step 5.1F1F2F4F5algebra

Quantitative output (iv). Assume the situation of (iii) and (iv), and use (iii)(f), so that (D,ρ) is CAT(1); put 2r=L(x), η=(π−r)/2, μ=min⁡{r/(2n),η} and R=r/2=π/2−η. Apply the radius estimate (i) to the boundary curve ∂D, which has ρ-length L(x)=2r<2π; this gives a point a∈D with ∂D⊆Bˉ(a,π/2−η). Choose a maximum b of ρ(a,⋅) on ∂D. The boundary lies in a ball of radius R<π/2; on a short boundary segment a maximum cannot occur in its interior. Indeed, if its interior midpoint b maximized the distance, choose equal small offsets y,z on that segment. Its triangle with a is admissible, and the midpoint cosine inequality gives cos⁡ρ(a,b)≥(cos⁡ρ(a,y)+cos⁡ρ(a,z))/(2cos⁡(ρ(y,z)/2))>cos⁡ρ(a,b), since all three radial distances are at most R<π/2. Thus a maximum occurs at a boundary vertex. It cannot occur at a midpoint vertex of V(1): there the two boundary edges concatenate to a local geodesic (step 3.1), and the same cosine comparison on a short segment through that vertex excludes a maximum there. Thus b=v(0,k+1) for some k, and ρ(a,b)≤π/2−η and ρ(a,y)≤ρ(a,b) for every point y of ∂D. Let y1 and y2 be the points of the boundary edges [b,v(1,k)] and [b,v(1,k+1)] at distance exactly μ from b; these exist because those edges have ρ-length ξk/2 and ξk+1/2, and μ≤r/(2n)≤ξ/2 by hypothesis. Then ρ(b,y1)=ρ(b,y2)=μ, ρ(a,yi)≤ρ(a,b) since yi∈∂D, and μ<2η; the separation estimate (ii) in the CAT(1) space (D,ρ) gives ρ(y1,y2)≤2μ−δ(η,μ). Also ρ(v(1,k),y1)=ξk/2−μ and ρ(y2,v(1,k+1))=ξk+1/2−μ, because on the edge [b,v(1,k)] the two points y1 and v(1,k) lie on the same side of b at the stated distances. Since ρ≥d∘(g×g) by (iii)(b) and g(v(1,k))=(fx)k, g(v(1,k+1))=(fx)k+1, the triangle inequality in D gives ζk=d((fx)k,(fx)k+1)≤ρ(v(1,k),y1)+ρ(y1,y2)+ρ(y2,v(1,k+1))≤(ξk+ξk+1)/2−δ(η,μ), the displayed deficit, with the index k adjacent to the first-row vertex b; the triangles to which (ii) is applied have perimeter at most 2(π/2−η)+μ<2π as required there, and longer or unequal midpoint segments are handled by taking the initial equal μ-pieces and adding the remaining lengths, as stated.

7.1step 1.1step 1.2step 1.3step 1.4step 2.1step 2.2step 3.1step 3.2step 4.1step 5.1step 6.1F11∎

Conclusion. Steps 1.1 and 1.2 give (i) and (ii); steps 1.3, 1.4, 2.2 and 3.1 give (iii)(a)–(d). Ear removal and the final-fan radial maximum argument give (iii)(e), the local link test and compact criterion give (iii)(f), and step 6.1 gives (iv). AC enters through the compactness-of-paths argument and the compact short-circle criterion.

Depends on

Used by

Dependency tree · two levels

116 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