Theorems · Theorem · measure theory
Besicovitch.SatelliteConfig.exists_normalized
∀ {E : Type u_1} [inst : NormedAddCommGroup E] [NormedSpace ℝ E] {N : ℕ} {τ : ℝ}
(a : Besicovitch.SatelliteConfig E N τ),
a.c (Fin.last N) = 0 →
a.r (Fin.last N) = 1 →
1 ≤ τ →
∀ (δ : ℝ),
τ ≤ 1 + δ / 4 → δ ≤ 1 → ∃ c', (∀ (n : Fin N.succ), ‖c' n‖ ≤ 2) ∧ Pairwise fun i j => 1 - δ ≤ ‖c' i - c' j‖- Cited by
- 1 results in Mathlib
- Foundations
- Depth 158 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites23
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Realstatement and proof · cited by 25,697
- NormedAddCommGroupstatement and proof · cited by 15,752
- NormedSpacestatement and proof · cited by 12,499
- Norm.normstatement and proof · cited by 5,413
- LE.le.transproof · cited by 3,151
- zero_smulproof · cited by 716
- Pairwisestatement · cited by 516
- norm_zeroproof · cited by 366
- le_or_gtproof · cited by 269
- div_zeroproof · cited by 251
- norm_smulproof · cited by 242
- norm_normproof · cited by 113
Cited by1
Results whose statement or proof uses this declaration.
- Besicovitch.isEmpty_satelliteConfig_multiplicityproof · cited by 0