Theorems · Theorem · commutative algebra
FractionalIdeal.count_pow
∀ {R : Type u_1} [inst : CommRing R] (K : Type u_2) [inst_1 : Field K] [inst_2 : Algebra R K]
[inst_3 : IsFractionRing R K] [inst_4 : IsDedekindDomain R] (v : IsDedekindDomain.HeightOneSpectrum R) (n : ℕ)
(I : FractionalIdeal (nonZeroDivisors R) K), FractionalIdeal.count K v (I ^ n) = ↑n * FractionalIdeal.count K v IFor every n ∈ ℕ and every ideal I, val_v(I^n) = n*val_v(I).
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 153 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- CommRingstatement and proof · cited by 17,173
- Algebrastatement and proof · cited by 11,388
- Fieldstatement and proof · cited by 7,404
- Nat.cast_oneproof · cited by 2,501
- MulZeroClass.mul_zeroproof · cited by 2,091
- le_antisymmproof · cited by 2,068
- le_reflproof · cited by 2,061
- MulZeroClass.zero_mulproof · cited by 1,625
- pow_zeroproof · cited by 1,094
- le_transproof · cited by 985
- nonZeroDivisorsstatement and proof · cited by 895
- IsFractionRingstatement and proof · cited by 738
Cited by2
Results whose statement or proof uses this declaration.
- FractionalIdeal.count_zpowproof · cited by 3
- FractionalIdeal.count_pow_selfproof · cited by 0