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.
Hg toolkit gromov sequences and boundary product
Definition
Fix a nonempty metric space , a basepoint , and a product constant as in Hg toolkit slim triangles products and four point constants. Indices below are positive integers. A sequence is Gromov if for every real there is such that whenever . Write when for every some satisfies for all . This is joint divergence, not merely diagonal divergence.
For a nonnegative double sequence set Each inner set is nonempty and bounded below. Its infimum exists by the real completeness convention; the increasing family of infima has its supremum if bounded, and otherwise we assign . No subtraction of infinite values is intended.
Once the equivalence relation has been proved, the Gromov-sequence boundary is the set of equivalence classes of Gromov sequences. Until then all expressions are indexed by sequences themselves. For classes define the extended boundary product by For any fixed pair of classes the set in braces is nonempty, since each class contains a representing sequence, and its nonnegative supremum is interpreted as above. The quotient is a set, being a subset of the power set of ; defining it does not select representatives for a family of classes. The boundary can be empty, for instance for a bounded space: products are bounded by distances from , so no Gromov sequence exists. No properness, geodesicity or AC is assumed here.
Depends on
Used by
Dependency tree · two levels
3 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
- Druţu–Kapovich §9.9 ray-boundary treatment; sequence comparison expanded locally (standard reference, not scraped)