Theorems · Theorem · field theory
Polynomial.bUnion_roots_finite
∀ {R : Type u_1} {S : Type u_2} [inst : Semiring R] [inst_1 : CommRing S] [inst_2 : IsDomain S] [inst_3 : DecidableEq S]
(m : R →+* S) (d : ℕ) {U : Set R},
U.Finite → (⋃ f, ⋃ (_ : f.natDegree ≤ d ∧ ∀ (i : ℕ), f.coeff i ∈ U), ↑(Polynomial.map m f).roots.toFinset).FiniteThe set of roots of all polynomials of bounded degree and having coefficients in a finite set is finite.
- Defined in
- Mathlib.Algebra.Polynomial.Roots
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 130 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites23
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
- CommRingstatement and proof · cited by 17,173
- Semiringstatement and proof · cited by 13,802
- Finsetstatement · cited by 13,712
- RingHomstatement and proof · cited by 10,189
- SetLike.coestatement · cited by 8,199
- Polynomialstatement and proof · cited by 5,681
- Set.univproof · cited by 3,945
- Set.iUnionstatement · cited by 2,483
- IsDomainstatement and proof · cited by 2,196
- Set.Finitestatement and proof · cited by 1,814
- Polynomial.natDegreestatement and proof · cited by 1,105
Cited by3
Results whose statement or proof uses this declaration.
- NumberField.Embeddings.finite_of_norm_leproof · cited by 4
- NumberField.hermiteTheorem.finite_of_discr_bdd_of_isRealproof · cited by 1
- NumberField.hermiteTheorem.finite_of_discr_bdd_of_isComplexproof · cited by 1