Mathlib Map

Theorems · Theorem · number theory

ClassGroup.mem_finsetApprox

∀ {R : Type u_1} {S : Type u_2} [inst : EuclideanDomain R] [inst_1 : CommRing S] [inst_2 : IsDomain S]
  [inst_3 : Algebra R S] {abv : AbsoluteValue R ℤ} {ι : Type u_5} [inst_4 : DecidableEq ι] [inst_5 : Fintype ι]
  (bS : Module.Basis ι R S) (adm : abv.IsAdmissible) [inst_6 : Infinite R] [inst_7 : DecidableEq R] {x : R},
  x ∈ ClassGroup.finsetApprox bS adm ↔
    ∃ i j, i ≠ j ∧ (ClassGroup.distinctElems bS adm) i - (ClassGroup.distinctElems bS adm) j = x
Defined in
Mathlib.NumberTheory.ClassNumber.Finite
Cited by
1 results in Mathlib
Foundations
Depth 196 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
EuclideanDomainCommRingIsDomainAlgebraDecidableEqFintypeInfiniteDecidableEq

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Cites20

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.