Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-02
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.

Bishop volume upper bound

Statement

Assume the inherited Axiom of Countable Choice ACω. Let (M,g) be a complete, connected, boundaryless Riemannian manifold of dimension n≥2 with Ric⁡≥(n−1)k g for a real number k, let p∈M, let B(p,r)={q∈M:dg(p,q)<r} be the open metric ball and let Vk⋆ be the saturated model ball volume of Model space radial area and ball volume. Then vol⁡g(B(p,r))≤Vk⋆(r)for every r>0. No compactness of M is assumed, and no choice beyond the inherited ACω is used.

Facts & Assumptions

Given: The inherited ACω of [A1]; a complete, connected, boundaryless Riemannian manifold (M,g) of dimension n≥2 with Ric⁡≥(n−1)k g; a point p∈M; the ball volume function r↦vol⁡g(B(p,r)); and the saturated model volume Vk⋆.

[A1]

The countable-choice premise is the inherited ACω (The Axiom of Countable Choice (ACω)), carried by the Bishop–Gromov comparison cited below.

[F1]

Bishop–Gromov volume comparison (Bishop gromov volume comparison): under the stated hypotheses the Bishop–Gromov ratio Rp(r)=vol⁡g(B(p,r))Vk⋆(r),r>0, is well defined, nonincreasing on (0,∞) and satisfies lim⁡r↓0Rp(r)=1; in particular vol⁡g(B(p,r))≤Vk⋆(r) for every r>0.

[F2]

Positivity of the model volume (Model space radial area and ball volume, Comparison sine, cosine and cotangent functions): the model radial area is Ak(r)=ωn−1sn⁡k(r)n−1 and Vk(r)=∫0rAk(t) dt; the comparison sine is positive on its positive domain (0,π/k) for k>0 and (0,∞) for k≤0, and ωn−1>0, so Ak is positive there and Vk⋆(r)>0 for every r>0 (for k>0 by saturation at π/k).

Proof

Proof technique: direct: evaluate the Bishop–Gromov ratio against its limit one at the origin, using monotonicity along a sequence of radii decreasing to zero.

1.1F1given

The ratio is at most one. [F1, given] Fix r>0. By the monotonicity in [F1], 0<s<r implies Rp(r)≤Rp(s). Choosing any sequence sj↓0 and using lim⁡s↓0Rp(s)=1 from [F1], Rp(r)≤lim⁡s↓0Rp(s)=1.

2.1F2step 1.1∎

Conclusion. [F2, step 1.1] Multiplying the inequality of step 1.1 by the positive number Vk⋆(r) [F2] gives vol⁡g(B(p,r))=Rp(r) Vk⋆(r)≤Vk⋆(r), which is the asserted bound. The value r=0 is excluded, where B(p,0)=∅ and Vk⋆(0)=0; for k>0 the bound is constant from the model pole onward, and for k≤0 it is the genuine model volume. No step selects a direction, a sequence of directions, or a family of balls beyond the single radius sequence already carried by the limit in [F1], so no choice beyond [A1] is used.

Source locator

Datar §§27.2 and 28.1, pp.200–209, and Eschenburg §§4–5, pp.15–20, record the Bishop–Gromov ratio as nonincreasing with limit one at the origin, which is exactly the statement that the ball volume is bounded by the model volume. The proof above is the one-line unpacking of the in-run Bishop–Gromov theorem.

Depends on

Used by

Dependency tree · two levels

22 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