Theorems · Inductive type · order theory
IsAbsoluteValue
{S : Type u_5} → [Semiring S] → [PartialOrder S] → {R : Type u_6} → [Semiring R] → (R → S) → PropA function f is an absolute value if it is nonnegative, zero only at 0, additive, and
multiplicative.
See also the type AbsoluteValue which represents a bundled version of absolute values.
- Cited by
- 160 results in Mathlib
- Foundations
- Depth 1 from the axioms, rests on 3 definitions · uses no axioms
- Assumes
- SemiringPartialOrderSemiring
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.
- Semiringstatement · cited by 13,802
- PartialOrderstatement · cited by 6,410
Cited by175
Results whose statement or proof uses this declaration.
- CauSeq.Completion.Cauchystatement and proof · cited by 62
- CauSeq.conststatement and proof · cited by 58
- CauSeq.limstatement and proof · cited by 35
- CauSeq.Completion.mkstatement and proof · cited by 24
- CauSeq.IsCompletestatement · cited by 21
- CauSeq.equiv_limstatement and proof · cited by 15
- CauSeq.Completion.ofRatstatement and proof · cited by 15
- IsAbsoluteValue.toAbsoluteValuestatement and proof · cited by 12
- IsAbsoluteValue.abv_addstatement and proof · cited by 11
- IsAbsoluteValue.abv_nonnegstatement and proof · cited by 9
- CauSeq.invstatement and proof · cited by 8
- CauSeq.lim_eq_of_equiv_conststatement and proof · cited by 8