Theorems · Theorem · commutative algebra
seminormFromConst_apply_of_isMul
∀ {R : Type u_1} [inst : CommRing R] {c : R} {f : RingSeminorm R},
f 1 ≤ 1 → f c ≠ 0 → IsPowMul ⇑f → ∀ {x : R}, (∀ (y : R), f (x * y) = f x * f y) → seminormFromConst' c f x = f xIf x : R is multiplicative for f, then seminormFromConst' c f x = f x.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 159 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CommRing
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites19
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
- CommRingstatement and proof · cited by 17,173
- nhdsproof · cited by 5,554
- mul_oneproof · cited by 3,885
- Filter.Tendstoproof · cited by 3,814
- Filter.atTopproof · cited by 2,405
- pow_zeroproof · cited by 1,094
- div_oneproof · cited by 629
- tendsto_const_nhdsproof · cited by 330
- div_selfproof · cited by 237
- pow_ne_zeroproof · cited by 208
Cited by1
Results whose statement or proof uses this declaration.
- seminormFromConst_isMul_of_isMulproof · cited by 0