Theorems · Inductive type · number theory
AbsoluteValue.IsAdmissible
{R : Type u_1} → [inst : EuclideanDomain R] → AbsoluteValue R ℤ → TypeAn absolute value R → ℤ is admissible if it respects the Euclidean domain
structure and a large enough set of elements in R^n will contain a pair of
elements whose remainders are pointwise close together.
- Cited by
- 18 results in Mathlib
- Foundations
- Depth 39 from the axioms · uses propext
- Assumes
- EuclideanDomain
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- AbsoluteValuestatement · cited by 363
- EuclideanDomainstatement · cited by 124
Cited by33
Results whose statement or proof uses this declaration.
- ClassGroup.finsetApproxstatement and proof · cited by 9
- AbsoluteValue.IsAdmissible.cardstatement and proof · cited by 5
- ClassGroup.cardMstatement and proof · cited by 4
- ClassGroup.distinctElemsstatement and proof · cited by 4
- ClassGroup.prod_finsetApprox_ne_zerostatement and proof · cited by 2
- ClassGroup.exists_mem_finsetApproxstatement and proof · cited by 1
- ClassGroup.exists_mem_finset_approx'statement and proof · cited by 1
- ClassGroup.exists_mk0_eq_mk0statement and proof · cited by 1
- AbsoluteValue.IsAdmissible.exists_approxstatement and proof · cited by 1
- AbsoluteValue.IsAdmissible.exists_approx_auxstatement and proof · cited by 1
- AbsoluteValue.IsAdmissible.exists_partitionstatement and proof · cited by 1
- AbsoluteValue.IsAdmissible.exists_partition'statement and proof · cited by 1