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 . Let be a complete, connected, boundaryless Riemannian manifold of dimension with for a real number , let , let be the open metric ball and let be the saturated model ball volume of Model space radial area and ball volume. Then No compactness of is assumed, and no choice beyond the inherited is used.
Facts & Assumptions
Given: The inherited of [A1]; a complete, connected, boundaryless Riemannian manifold of dimension with ; a point ; the ball volume function ; and the saturated model volume .
The countable-choice premise is the inherited (The Axiom of Countable Choice ()), carried by the Bishop–Gromov comparison cited below.
Bishop–Gromov volume comparison (Bishop gromov volume comparison): under the stated hypotheses the Bishop–Gromov ratio is well defined, nonincreasing on and satisfies ; in particular for every .
Positivity of the model volume (Model space radial area and ball volume, Comparison sine, cosine and cotangent functions): the model radial area is and ; the comparison sine is positive on its positive domain for and for , and , so is positive there and for every (for by saturation at ).
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.
The ratio is at most one. [F1, given] Fix . By the monotonicity in [F1], implies . Choosing any sequence and using from [F1],
Conclusion. [F2, step 1.1] Multiplying the inequality of step 1.1 by the positive number [F2] gives which is the asserted bound. The value is excluded, where and ; for the bound is constant from the model pole onward, and for 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
- Ved Datar, Lectures on Riemannian Geometry (2025) (standard reference, not scraped)
- J.-H. Eschenburg, Comparison Theorems in Riemannian Geometry (standard reference, not scraped)