Theorems · Definition · order theory
Finset.max
{α : Type u_2} → [LinearOrder α] → Finset α → WithBot αLet s be a finset in a linear order. Then s.max is the maximum of s if s is not empty,
and ⊥ otherwise. It belongs to WithBot α. If you want to get an element of α, see
s.max'.
- Defined in
- Mathlib.Data.Finset.Max
- Cited by
- 50 results in Mathlib
- Foundations
- Depth 23 from the axioms · uses propext, Quot.sound
- Assumes
- LinearOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- LinearOrderstatement and proof · cited by 8,572
- WithBotstatement · cited by 1,498
- WithBot.someproof · cited by 541
- Finset.supproof · cited by 530
Cited by54
Results whose statement or proof uses this declaration.
- Polynomial.degreeproof · cited by 643
- Finset.le_max'proof · cited by 33
- MonomialOrder.withBotDegreeproof · cited by 26
- Polynomial.degree_negproof · cited by 21
- Polynomial.degree_Cproof · cited by 20
- SimpleGraph.maxDegreeproof · cited by 19
- Polynomial.degree_add_leproof · cited by 14
- MonomialOrder.withBotDegree_eqproof · cited by 12
- Polynomial.degree_mul_leproof · cited by 10
- LaurentPolynomial.degreeproof · cited by 10
- Finset.exists_max_imageproof · cited by 8
- Polynomial.exists_degree_eq_of_mem_liftsproof · cited by 7