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.

Circumcenters of bounded sets and fixed sets of isometries in complete CAT(0) spaces

Statement

Let X be a CAT(0) space (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles (3)) and let Y⊆X be a nonempty subset that is bounded, meaning that Y⊆B‾(x0,R) for some x0∈X and R>0 (Open ball, closed ball and sphere in a metric space); thus X is nonempty throughout. The radius function rY ⁣:X→[0,∞),rY(x):=sup⁡{ d(x,y):y∈Y } is finite-valued (Upper bound, least upper bound, and strict upper bound, Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric, The Cauchy-sequence reals have the least-upper-bound property, Epsilon characterisation of the supremum). The infimum a:=inf⁡XrY exists by Every nonempty set bounded below has an infimum and has the approximation property of Epsilon characterisation of the infimum. Assume the Axiom of Choice (The Axiom of Choice); it is used in clause (1) exactly to extract a minimizing sequence for rY, and clause (5) records that in the proper case no Choice is needed.

(1) The center of a bounded set (complete case). If X is complete (Complete metric space: every Cauchy sequence converges in the space) then rY is continuous and its infimum a:=inf⁡XrY is attained at a unique point c∈X, the center of Y; moreover a equals the radius of Y, the infimum of the numbers r>0 with Y⊆B‾(x,r) for some x∈X, and d(c,y)≤a for every y∈Y. For finite Y the supremum defining rY is a maximum (Every nonempty finite set of reals has a maximum and a minimum).

(2) Isometric invariance. If an isometry φ of X satisfies φ(Y)=Y (Isometry, isometric embedding, and the subspace metric on a subset) then rY∘φ=rY, hence φ permutes the set of minimizers of rY and, whenever the center of (1) exists, fixes it: φ(c)=c. In particular, if G is a group of isometries of a complete CAT(0) space with a bounded orbit Y=Gx0, then every g∈G fixes the center c of Y, so G has a nonempty fixed set; every finite group of isometries has a bounded orbit (because X≠∅) and hence a fixed point.

(3) Fixed sets are closed and convex. For every isometry φ of X the fixed set Fix⁡(φ) is closed (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement) and convex -- convex meaning that it contains, with any two of its points, every geodesic segment of X joining them (Geodesics and geodesic metric spaces) -- and for every family (φi)i∈I of isometries the common fixed set C=⋂i∈IFix⁡(φi) is closed and convex. If C≠∅, then C with the induced metric is a CAT(0) space: it is convex, so the unique geodesic segment of X between two of its points lies in C and the comparison inequality is inherited; if in addition X is complete then C is complete (Closed subspaces of complete metric spaces are complete; the converse under countable choice), being a closed subset of the complete space X. For every p∈C the geodesic contraction H ⁣:C×[0,1]→C,Ht(x):=the point of [p,x] at distance t d(p,x) from p, is well defined and continuous, satisfies H0≡p, H1=id⁡C and d(Ht(x),Ht(y))≤t d(x,y) for all x,y∈C; in particular C is contractible (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences (iv)(a),(b), A nonempty space is contractible if and only if its identity map is nullhomotopic, Nullhomotopic maps and contractible spaces).

(4) Finite subgroups of isometries. If G is a finite group acting on a complete CAT(0) space X by isometries, or more generally a group of isometries of a complete CAT(0) space with a bounded orbit, then Fix⁡(G)=C is nonempty by (1),(2), and by (3) it is closed, convex, complete and CAT(0) in the induced metric and contractible. In particular C is a geodesic space and every two of its points are joined by a unique geodesic of X lying in C.

(5) Choice-free proper case. If X is proper -- every closed bounded subset is compact (Open cover, subcover, compact metric space, and compact subset of a metric space) -- then for every nonempty bounded Y the center of (1) exists and is unique without the Axiom of Choice: for x0∈X the set K:={x∈X:rY(x)≤rY(x0)} is closed and bounded, hence compact, a=inf⁡KrY, and the sets Kn:={x∈K:rY(x)≤a+1/n} (n≥1) form a family of closed subsets of the compact space K with the finite intersection property, so ⋂nKn≠∅ by the compactness criterion for such families (Finite intersection property); any point of the intersection is a minimizer, and (6) gives uniqueness. Consequently, if X is proper, then the conclusions of (1)-(4) hold with no use of Choice.

(6) The midpoint inequality and uniqueness. Let y,y′∈X, let m be the midpoint of a geodesic segment [y,y′] and let z∈X. Then d(z,m)2≤12(d(z,y)2+d(z,y′)2)−14d(y,y′)2 (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences (iv)(d)). Consequently two minimizers c,c′ of rY, both of value a, satisfy for m the midpoint of [c,c′] and every z∈Y d(c,c′)2≤2(d(z,c)2+d(z,c′)2)−4d(z,m)2≤4a2−4d(z,m)2; the right-hand side is at least d(c,c′)2 for every z∈Y, so d(c,c′)2 is at most its infimum over z∈Y, which is 4a2−4rY(m)2 by the supremum approximation property (Epsilon characterisation of the supremum); since rY(m)≥a, this gives d(c,c′)2≤0. Hence the center is unique; and in (5) the point of ⋂nKn has rY=a, so by the same computation it is the unique minimizer.

(7) Scope. The completeness hypothesis must remain: `CAT(0)' alone does not give the center, and the statement is not asserted for unbounded Y or for non-isometric group actions. No statement about G beyond (2)-(4) is made.

Facts & Assumptions

Given: The Axiom of Choice, a CAT(0) space X, a nonempty bounded subset Y⊆X with Y⊆B‾(x0,R); in (5) the space X is also proper.

[F1]

X is geodesic, and the CAT(0) comparison inequality holds for every geodesic triangle of X: a metric space X is CAT(0) if it is geodesic and for every geodesic triangle in X and all points x,y of that triangle, d(x,y)≤d2(xˉ,yˉ) (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles).

[F2]

In a CAT(0) space geodesic segments between two points are unique and vary continuously with their endpoints, so the point of [p,x] depends continuously on the pair; if γ,δ are geodesics with a common initial point and proportional parametrizations, then d(γ(t),δ(t))≤(1−t)d(γ(0),δ(0))+t d(γ(1),δ(1)) for t∈[0,1] (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences).

[F3]

For every pair y,y′ in a CAT(0) space, every midpoint m of a geodesic segment [y,y′] and every z satisfy the midpoint inequality d(z,m)2≤12(d(z,y)2+d(z,y′)2)−14d(y,y′)2 (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences).

[F4]

In ZF, without a choice axiom: if (X,d) is complete and A is closed in (X,d), then the subspace (A,dA) is complete (Closed subspaces of complete metric spaces are complete; the converse under countable choice).

[F5]

A metric space is compact if and only if every family of its closed subsets with the finite intersection property has nonempty intersection (A metric space is compact if and only if every family of closed subsets with the finite intersection property has nonempty intersection).

[F6]

A subset A of a metric space X is a compact subset of X when the metric subspace (A,dA) is a compact metric space, dA being the restriction of d to A×A (Open cover, subcover, compact metric space, and compact subset of a metric space). Accordingly proper means, as in clause (5), that every closed bounded subset of X is a compact subset in this sense.

[F7]

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

[F8]

The real numbers used as metric values are the Cauchy-sequence reals and have the least-upper-bound property (The real numbers, The Cauchy-sequence reals have the least-upper-bound property). Every nonempty bounded-below subset of R has an infimum (Every nonempty set bounded below has an infimum); the epsilon characterisations of supremum and infimum supply values arbitrarily close to those bounds (Epsilon characterisation of the supremum, Epsilon characterisation of the infimum).

[F9]

Every nonempty finite subset of R has a maximum and a minimum (Every nonempty finite set of reals has a maximum and a minimum).

[F10]

For every real ε>0 some natural n≥1 satisfies 1/n<ε (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε); in particular 1/(n+1)→0 and 2/n→0.

[F11]

Every nonempty subset of N has a least element (The well-ordering principle).

Proof

Given: The Axiom of Choice, a CAT(0) space X, and a nonempty bounded subset Y⊆X with Y⊆B‾(x0,R); in clause (5), X is also proper.

Proof technique: direct.

1.1F8F9givenalgebra

For every x∈X and y∈Y, the triangle inequality gives d(x,y)≤d(x,x0)+d(x0,y)≤d(x,x0)+R. The nonempty set of distances defining rY(x) is therefore bounded above, so [F8] gives its finite supremum and rY(x)≤d(x,x0)+R. If Y is finite, the nonempty finite image {d(x,y):y∈Y} has a maximum by [F9], so its supremum is attained for every x. Also ∣d(x,y)−d(x′,y)∣≤d(x,x′) for every y∈Y, so taking suprema in both directions gives ∣rY(x)−rY(x′)∣≤d(x,x′) (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric, Upper bound, least upper bound, and strict upper bound); hence rY is continuous (Continuity of a map between metric spaces, at a point and globally, in the ε-δ form). The range {rY(x):x∈X} is nonempty because Y≠∅ implies X≠∅, and it is bounded below by 0, so [F8] gives a:=inf⁡XrY and 0≤a≤rY(x0). For fixed x and r>0, Y⊆B‾(x,r) iff rY(x)≤r (Open ball, closed ball and sphere in a metric space); thus rY(x) is the infimum of the admissible positive radii at x, since every such radius is at least rY(x) and every rY(x)+ε (ε>0) is admissible. Let R:={r>0:∃x∈X, Y⊆B‾(x,r)}. For every r∈R, a≤rY(x)≤r for its witnessing x, so a is a lower bound of R. Conversely, for ε>0, [F8] gives x with rY(x)<a+ε/2; then r:=rY(x)+ε/2>0 is admissible and r<a+ε. Hence inf⁡R=a, the radius of Y.

1.2F7F8choose

Assume the Axiom of Choice. For each n∈N, the set An:={x∈X:rY(x)<a+1/(n+1)} is nonempty by the infimum approximation property [F8]; a choice function for (An)n∈N yields a sequence (xn)n∈N with rY(xn)<a+1/(n+1) for every n.

1.3F1F2F3F8algebra

Midpoint inequality and uniqueness (clause (6)). Let y,y′∈X, let m be a midpoint of a geodesic segment [y,y′] and let z∈X; [F3] gives the stated inequality. For any q∈X put r:=rY(q). The nonnegative distances d(z,q), z∈Y, have supremum r, and their squares have supremum r2: if r=0 they all vanish; if r>0, for any ε>0 use [F8] to find z with r−δ<d(z,q)≤r, where δ:=ε/(2r+1), and then 0≤r2−d(z,q)2<2rδ<ε. Now let c,c′ be minimizers with value a, and let m be the midpoint of their unique geodesic segment, which exists by [F1] and [F2]. For every z∈Y, [F3] gives d(c,c′)2≤2(d(z,c)2+d(z,c′)2)−4d(z,m)2≤4a2−4d(z,m)2. The infimum over z∈Y of the last right-hand side is 4a2−4rY(m)2 by the square-supremum fact just proved; since rY(m)≥a, this gives d(c,c′)2≤0. Thus c=c′, so any minimizer is unique.

1.4F2given

Fixed sets (clause (3), first part). Let φ be an isometry of X (Isometry, isometric embedding, and the subspace metric on a subset). If φ(x)≠x, put δ:=d(φ(x),x)/3>0. For every x′ with d(x,x′)<δ, the reverse triangle inequality and isometry property give d(φ(x′),x′)≥d(φ(x),x)−d(φ(x),φ(x′))−d(x,x′)=d(φ(x),x)−2d(x,x′)>0. Thus a ball about each point outside Fix⁡(φ) lies in its complement, which is open by The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement; hence the fixed set is closed. The same argument applies to C=⋂iFix⁡(φi): if x∉C, some i has φi(x)≠x, and the ball just constructed avoids C; if the family is empty then C=X. Now if x,y∈Fix⁡(φ) and γ is a geodesic segment from x to y (Geodesics and geodesic metric spaces), then φ∘γ is another geodesic from x to y, so it equals γ by uniqueness [F2]; hence Fix⁡(φ) is convex. Every common fixed set is an intersection of convex sets and is therefore convex.

1.5givenalgebra

Isometric invariance (clause (2), first part). Let φ be an isometry of X with φ(Y)=Y (Isometry, isometric embedding, and the subspace metric on a subset). Then φ−1(Y)=Y, so for every x∈X the substitution z:=φ−1(y) gives rY(φ(x))=sup⁡{d(φ(x),y):y∈Y}=sup⁡{d(x,φ−1(y)):y∈Y}=sup⁡{d(x,z):z∈Y}=rY(x); hence φ maps the set of minimizers of rY onto itself.

1.6F5F6F10F11algebra

Proper spaces are complete. Let (zn)n∈N be a Cauchy sequence in a proper space X (Cauchy sequence in a metric space). For each k≥1, the Cauchy condition makes the set of indices N satisfying d(zm,zn)≤1/k for all m,n≥N nonempty; let Nk be its least member, which exists by [F11] and requires no choice. Then Nk≤Nj for k≤j. Every closed ball Bˉ(q,r) is closed: if d(q,x)>r, the radius δ:=(d(q,x)−r)/2>0 gives d(q,x′)≥d(q,x)−d(x,x′)>r whenever d(x,x′)<δ, so the complement is open (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement, Open ball, closed ball and sphere in a metric space). Hence the closed balls Gk:=Bˉ(zNk,1/k) and E:=Bˉ(zN1,2) are closed and bounded, thus compact by properness [F6]. Each Gk lies in E: d(zNk,zN1)≤1, so d(x,zN1)≤d(x,zNk)+d(zNk,zN1)≤2 for x∈Gk. The sets Gk∩E={x∈E:d(zNk,x)≤1/k} are closed in (E,d) by the same ball argument and have the finite intersection property: the empty finite intersection is E, which contains zN1, and for any nonempty finite subfamily, if K is its largest index then zNK∈Gk∩E for every index k≤K. By [F5] applied in (E,d) there is p∈⋂k≥1Gk. For n≥Nk, d(p,zn)≤d(p,zNk)+d(zNk,zn)≤2/k; given any rational ε>0, [F10] supplies k with 2/k<ε, so zn→p (Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R) and X is complete (Complete metric space: every Cauchy sequence converges in the space).

2.1F6F8F9given

Proper case, compactness (clause (5), first part). Assume now that X is proper, and fix x0∈X. For any real b, the sublevel set {x:rY(x)≤b} is closed: if rY(x)>b, continuity from step 1.1 gives δ>0 such that d(x,x′)<δ implies ∣rY(x′)−rY(x)∣<(rY(x)−b)/2, and then rY(x′)>b; its complement is therefore open (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement). In particular K:={x∈X:rY(x)≤rY(x0)} is closed. It is bounded: for a fixed y0∈Y, every x∈K satisfies d(x,y0)≤rY(x)≤rY(x0), so K⊆B‾(y0,rY(x0)+1) (Open ball, closed ball and sphere in a metric space). Hence K is compact by properness [F6]. If rY(x0)=a, then x0∈K and inf⁡KrY=a. If rY(x0)>a, then for every ε>0 put η:=min⁡{ε,rY(x0)−a}>0; by the infimum approximation property [F8] there is x∈X with rY(x)<a+η≤rY(x0) and rY(x)<a+ε, so x∈K. Thus inf⁡KrY≤a+ε for every ε>0, while a≤inf⁡KrY since K⊆X; hence a=inf⁡KrY.

2.2F1F2F3F10step 1.2step 1.3algebra

The minimizing sequence is Cauchy (clause (1), first part). For m,n∈N, let mmn be the midpoint of the unique geodesic from xm to xn ([F1], [F2]). Applying [F3] to each z∈Y and using the square-supremum fact from step 1.3 gives rY(mmn)2≤12(rY(xm)2+rY(xn)2)−14d(xm,xn)2. Hence d(xm,xn)2≤2(rY(xm)2+rY(xn)2)−4rY(mmn)2≤2((a+1/(m+1))2+(a+1/(n+1))2)−4a2, since rY(mmn)≥a and step 1.2 bounds the selected radii. The final expression tends to 0 as m,n→∞ by [F10], so (xn) is Cauchy (Cauchy sequence in a metric space).

2.3F2F4step 1.4

The fixed set is CAT(0) and carries a contraction (clause (3), second part). Let C≠∅ be the common fixed set of a family of isometries. By convexity from step 1.4, the unique geodesic of X between two points of C lies in C (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles, Geodesics and geodesic metric spaces), so C with the induced metric is geodesic and inherits the CAT(0) comparison inequality; if X is complete, then C is closed by step 1.4 and complete by [F4]. For p∈C, define Ht(x) to be the point at fraction t of the unique geodesic from p to x. Convexity makes Ht(x)∈C, and H0 is constant at p while H1=id⁡C. For x,y∈C and s,t∈[0,1], [F2] gives d(Ht(x),Ht(y))≤t d(x,y) and the geodesic parametrization gives d(Ht(y),Hs(y))=∣t−s∣d(p,y); therefore d(Ht(x),Hs(y))≤t d(x,y)+∣t−s∣d(p,y), which proves joint continuity at every (x,t). Thus H is a homotopy from the constant map at p to the identity, and C is contractible by A nonempty space is contractible if and only if its identity map is nullhomotopic and Nullhomotopic maps and contractible spaces.

3.1F5F10step 1.3step 2.1

Proper case, the center without Choice (clause (5), second part). In the notation of step 2.1, the sets Kn:={x∈K:rY(x)≤a+1/n}, n≥1, are closed subsets of compact K by the sublevel-set argument of step 2.1, and are nested. Each is nonempty because a=inf⁡KrY; the empty finite intersection is K, which contains x0, and any nonempty finite intersection is the set with the largest index in it. Thus (Kn) has the finite intersection property (Finite intersection property). By [F5] there is c∈⋂n≥1Kn. If rY(c)>a, choose n with 1/n<rY(c)−a using [F10]; then rY(c)≤a+1/n<rY(c), a contradiction. Since rY(c)≥a, we get rY(c)=a, and step 1.3 gives uniqueness. The family (Kn) is defined by a formula, so this proper-space argument uses no choice principle.

3.2F10step 1.1step 2.2given

Attainment in the complete case (clause (1), second part). If X is complete, the Cauchy sequence (xn) from step 2.2 converges to some c∈X (Complete metric space: every Cauchy sequence converges in the space, Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R); continuity of rY from step 1.1 gives rY(c)=lim⁡nrY(xn)=a, because a≤rY(xn)<a+1/(n+1) and [F10] makes the error tend to 0. Thus the infimum is attained.

4.1F9step 1.1step 1.3step 3.2algebra

Clause (1) concluded. Assume X complete; let c be the point of step 3.2 and a the infimum. Then d(c,y)≤rY(c)=a for every y∈Y; step 1.1 identifies a with the radius of Y. If Y is finite, its nonempty finite image under y↦d(c,y) has a maximum by [F9], so the supremum defining rY(c) is that maximum; uniqueness follows from step 1.3. This proves (1).

5.1F2F9step 1.5step 2.3step 4.1

Clauses (2) and (4) concluded. Let X be complete and let c be the center of Y as in step 4.1, and let φ be an isometry with φ(Y)=Y; by step 1.5 the isometry φ permutes the minimizers of rY, and since c is the unique minimizer by step 4.1, φ(c)=c. Hence a group G of isometries with bounded orbit Y=Gx0 has Fix⁡(G)≠∅, because every g∈G satisfies g(Y)=Y and fixes c. A finite group has a finite nonempty orbit, and its finite set of distances from any point has a maximum by [F9], so that orbit is bounded and it too has a fixed point. By step 2.3 the set C=Fix⁡(G) is closed, convex, complete and CAT(0) in the induced metric, and contractible; it is a geodesic space whose points are joined by the geodesic segments of X lying in C, unique by [F2]. This proves (2) and (4).

6.1F7step 1.3step 1.6step 3.1step 2.3step 5.1∎

Clause (5) concluded, and the proof. Let X be proper. By steps 2.1 and 3.1 the center of every nonempty bounded Y⊆X exists and is unique, produced by the finite intersection property and not by the sequence of step 1.2, so no Choice is used; by step 1.6 a proper space is complete. Hence the assertions of (1) hold for X with no use of Choice, by the argument of step 4.1 with the center of step 3.1 in place of the attained minimizer of step 3.2, and the assertions of (2), (3) and (4) follow by the same steps 1.4, 1.5 and 2.3, none of which uses Choice: the only use of the Axiom of Choice in this proof is the extraction of the minimizing sequence in step 1.2, which is needed only when X is complete but not proper. Thus the conclusions of (1)-(4) hold for proper X without Choice.

Depends on

Used by

Dependency tree · two levels

95 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