Theorems · Theorem · commutative algebra
seminormFromBounded_eq_zero_iff
∀ {R : Type u_1} [inst : CommRing R] {f : R → ℝ} {c : ℝ},
0 ≤ f → (∀ (x y : R), f (x * y) ≤ c * f x * f y) → ∀ (x : R), seminormFromBounded' f x = 0 ↔ f x = 0If f : R → ℝ is a nonnegative, multiplicatively bounded function, then
seminormFromBounded' f x = 0 if and only if f x = 0.
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 118 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.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Realstatement and proof · cited by 25,697
- CommRingstatement and proof · cited by 17,173
- MulZeroClass.mul_zeroproof · cited by 2,091
- LE.le.antisymmproof · cited by 507
- seminormFromBounded'statement and proof · cited by 17
- seminormFromBounded_nonnegproof · cited by 2
- seminormFromBounded_geproof · cited by 1
- seminormFromBounded_leproof · cited by 1
Cited by4
Results whose statement or proof uses this declaration.
- seminormFromBounded_kerproof · cited by 1
- seminormFromBounded_nonzeroproof · cited by 0
- seminormFromBounded_is_norm_iffproof · cited by 0
- seminormFromBounded_mulproof · cited by 0