Theorems · Theorem · commutative algebra
Polynomial.exists_degree_le_of_mem_span
∀ {R : Type u} [inst : Semiring R] {s : Set (Polynomial R)} {p : Polynomial R},
s.Nonempty → p ∈ Submodule.span R s → ∃ p' ∈ s, p.degree ≤ p'.degreeFor every polynomial p in the span of a set s : Set R[X], there exists a polynomial of
p' ∈ s with higher degree. See also Polynomial.exists_degree_le_of_mem_span_of_finite.
- Defined in
- Mathlib.RingTheory.Polynomial.Basic
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 98 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Semiring
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites21
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Semiringstatement and proof · cited by 13,802
- Submodulestatement · cited by 7,192
- Polynomialstatement and proof · cited by 5,681
- Set.Nonemptystatement and proof · cited by 2,627
- Submodule.spanstatement and proof · cited by 1,504
- WithBotstatement and proof · cited by 1,498
- Polynomial.natDegreeproof · cited by 1,105
- Polynomial.degreestatement and proof · cited by 643
- WithBot.someproof · cited by 541
- lt_of_lt_of_leproof · cited by 438
- SetLike.mem_coeproof · cited by 302
Cited by1
Results whose statement or proof uses this declaration.
- Polynomial.exists_degree_le_of_mem_span_of_finiteproof · cited by 1