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.
Scaling distinguishes sublinear minsize from a fixed perimeter cutoff
Example
Let be a nonempty geodesic metric space with . If tends to zero and with , then . A fixed bound on the unscaled perimeters also forces vanishing after rescaling, even without sublinearity, but gives no conclusion for perimeters of order . The Euclidean right triangles of scale at display this distinction for every , including .
Facts & Assumptions
Given: Fix positive scales tending to zero; for the first assertion assume the displayed sublinearity and bounded rescaled perimeters.
For perimeter at most , every admissible side triple has diameter at most , so . (Real trees, tripod triangles, slimness and minsize).
An ordinarily convergent bounded real sequence has that value as its ultralimit for every free ultrafilter. (Free tail ultrafilters and bounded real ultralimit calculus).
The Euclidean distance on is the square root of the sum of squared coordinate differences. ( as the set of functions , and , , are metrics on it).
Nonnegative square roots exist and are unique, including . (Square roots exist: a unique with ; the positives are ).
Verification
Put . Given , sublinearity supplies with whenever . For , F1 gives . Separating these cases for each yields the single bound There is no assumption that tends to infinity.
For each in , take vertices . The axis-side parameterizations and for have distance . The third parameterization for has squared distance . Thus these really are geodesic triangles and their perimeters are .
To make the last expression less than any , first take , obtain its , and then take so large that . This proves ordinary convergence to zero, and also ultralimit zero for any free ultrafilter by F2. If instead for a fixed finite , the simpler bound works without sublinearity.
For any triple , , on these sides, the diameter is at least : the two terms are lower bounds for and respectively. Conversely the triple has diameter . At the rescaled minsize of these triangles therefore lies in , and their rescaled perimeter is the constant . They do not vanish, whereas any fixed triangle in the very same plane has both its perimeter and its minsize multiplied by and tending to zero. This is the claimed witness that controlling only a fixed unscaled perimeter cutoff cannot establish sublinear behavior at the moving scale.
Depends on
- Real trees, tripod triangles, slimness and minsize
- Free tail ultrafilters and bounded real ultralimit calculus
- $\mathbb{R}^n$ as the set of functions $n \to \mathbb{R}$, and $d_1$, $d_2$, $d_\infty$ are metrics on it
- Square roots exist: a unique $\sqrt{a} \ge 0$ with $(\sqrt{a})^2 = a$; the positives are $\{x^2 : x \neq 0\}$
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
39 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.