Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 F be a nonempty subset of a pseudometric space (T,d), with covering and packing numbers as in Covering, packing, bracketing numbers, and metric entropy. For every ϵ>0,

N(ϵ,F,d)≤D(ϵ,F,d)≤N(ϵ/2,F,d).

The packing convention is strict separation d(f,g)>ϵ; covers use closed balls of radius at most ϵ centered in F.

Facts & Assumptions

Given: A nonempty subset F of a pseudometric space and ϵ>0.

[F1]

N(ϵ,F,d) is the least number of closed radius-ϵ balls centered in F covering F, while D(ϵ,F,d) 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.

1.1F1given

Suppose a cover of F by k<∞ closed balls of radius ϵ/2 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 k, and D(ϵ,F,d)≤k. Taking the least such k proves D(ϵ,F,d)≤N(ϵ/2,F,d); if no finite cover exists the inequality is automatic.

1.2F1given

If D(ϵ,F,d)=+∞, then N(ϵ,F,d)≤D(ϵ,F,d) 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 G⊆F.

2.1F1step 1.2∎

Maximality of G means each f∈F has d(f,g)≤ϵ for some g∈G; if all distances were greater, adding f would make a larger separated subfamily. Thus the balls centered at G with radius ϵ cover F, so N(ϵ,F,d)≤∣G∣=D(ϵ,F,d).

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