Theorems · Theorem · number theory
AbsoluteValue.IsAdmissible.exists_approx_aux
∀ {R : Type u_1} [inst : EuclideanDomain R] {abv : AbsoluteValue R ℤ} (n : ℕ) (h : abv.IsAdmissible) {ε : ℝ},
0 < ε →
∀ {b : R},
b ≠ 0 →
∀ (A : Fin (h.card ε ^ n).succ → Fin n → R),
∃ i₀ i₁, i₀ ≠ i₁ ∧ ∀ (k : Fin n), ↑(abv (A i₁ k % b - A i₀ k % b)) < abv b • εAny large enough family of vectors in R^n has a pair of elements
whose remainders are close together, pointwise.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 97 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- EuclideanDomain
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites24
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Realstatement and proof · cited by 25,697
- Finsetproof · cited by 13,712
- Finset.univproof · cited by 3,473
- Finset.cardproof · cited by 2,327
- pow_zeroproof · cited by 1,094
- Finset.filterproof · cited by 949
- AbsoluteValuestatement and proof · cited by 363
- Fintype.card_finproof · cited by 270
- pow_succ'proof · cited by 228
- Finset.mem_filterproof · cited by 185
- Classical.decEqproof · cited by 134
Cited by1
Results whose statement or proof uses this declaration.
- AbsoluteValue.IsAdmissible.exists_approxproof · cited by 1