Theorems · Theorem · number theory
AbsoluteValue.IsAdmissible.exists_approx
∀ {R : Type u_1} [inst : EuclideanDomain R] {abv : AbsoluteValue R ℤ} {ι : Type u_2} [inst_1 : Fintype ι] {ε : ℝ},
0 < ε →
∀ {b : R},
b ≠ 0 →
∀ (h : abv.IsAdmissible) (A : Fin (h.card ε ^ Fintype.card ι).succ → ι → R),
∃ i₀ i₁, i₀ ≠ i₁ ∧ ∀ (k : ι), ↑(abv (A i₁ k % b - A i₀ k % b)) < abv b • εAny large enough family of vectors in R^ι has a pair of elements
whose remainders are close together, pointwise.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 98 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- EuclideanDomainFintype
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites14
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
- Equivproof · cited by 8,337
- Fintypestatement and proof · cited by 7,736
- Equiv.symmproof · cited by 3,681
- Fintype.cardstatement and proof · cited by 1,386
- DFunLikeproof · cited by 576
- AbsoluteValuestatement and proof · cited by 363
- Equiv.symm_apply_applyproof · cited by 320
- EuclideanDomainstatement and proof · cited by 124
- Fintype.equivFinproof · cited by 51
- AbsoluteValue.IsAdmissiblestatement and proof · cited by 18
Cited by1
Results whose statement or proof uses this declaration.
- ClassGroup.exists_mem_finsetApproxproof · cited by 1