s can be covered by at most N balls with radius r.
- mk {X : Type u_1} [PseudoMetricSpace X] {s : Set X} {n : ℕ} {r : ℝ} (balls : Finset X) (card_balls : balls.card ≤ n) (union_balls : s ⊆ ⋃ x ∈ balls, Metric.ball x r) : CoveredByBalls s n r
Instances
Balls of radius r in X are covered by n balls of radius r'
Equations
- BallsCoverBalls X r r' n = ∀ (x : X), CoveredByBalls (Metric.ball x r) n r'
Instances For
For all r, balls of radius r in X are covered by n balls of radius a * r
Equations
- AllBallsCoverBalls X a n = ∀ (r : ℝ), BallsCoverBalls X (a * r) r n
Instances For
Prove AllBallsCoverBalls only for balls of positive radius.
A pseudometric space is second countable if, for every ε > 0 and every ball B
with natural number radius around a given point x₀,
there is a countable set which is ε-dense in B.
A pseudometric space is second countable if, for every ε > 0 and every ball B,
there is a countable set which is ε-dense in B.
A pseudometric space is second countable if, for every ε > 0 and every ball B is covered
by finitely many balls of radius ε.
A pseudometric space is second countable if every ball of radius a * r is covered by
b many balls of radius r.