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.
Packing and covering numbers with explicit radius conventions
Statement
Let be a nonempty subset of a pseudometric space , with covering and packing numbers as in Covering, packing, bracketing numbers, and metric entropy. For every ,
The packing convention is strict separation ; covers use closed balls of radius at most centered in .
Facts & Assumptions
Given: A nonempty subset of a pseudometric space and .
is the least number of closed radius- balls centered in covering , while is the largest size of a finite subfamily with pairwise distances strictly greater than (Covering, packing, bracketing numbers, and metric entropy).
Proof
Given: The class, pseudometric, and radius in the statement.
Suppose a cover of by closed balls of radius is given. Two points in the same ball have distance at most by the triangle inequality, so an -separated subfamily contains at most one point from each ball. Hence every finite separated subfamily has size at most , and . Taking the least such proves ; if no finite cover exists the inequality is automatic.
If , then is immediate. Otherwise the finite separated cardinalities are a nonempty bounded subset of the natural numbers, so a largest size is attained by some finite separated subfamily .
Maximality of means each has for some ; if all distances were greater, adding would make a larger separated subfamily. Thus the balls centered at with radius cover , so .
Depends on
Used by
Cited to discharge well-definedness by Covering, packing, bracketing numbers, and metric entropy.
Dependency tree · two levels
7 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
- David Pollard, Empirical Processes: Theory and Applications, Chapter 3, Definition 3.3 (standard reference, not scraped)
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, Definition 3.3 (standard reference, not scraped)