Theorems · Definition · field theory
LaurentPolynomial.trunc
{R : Type u_1} → [inst : Semiring R] → LaurentPolynomial R →+ Polynomial Rtrunc : R[T;T⁻¹] →+ R[X] maps a Laurent polynomial f to the polynomial whose terms of
nonnegative degree coincide with the ones of f. The terms of negative degree of f "vanish".
trunc is a left-inverse to Polynomial.toLaurent.
- Defined in
- Mathlib.Algebra.Polynomial.Laurent
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 89 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.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Semiringstatement and proof · cited by 13,802
- Polynomialstatement · cited by 5,681
- AddMonoidHomstatement · cited by 3,230
- RingEquiv.symmproof · cited by 567
- AddMonoidHom.compproof · cited by 339
- LaurentPolynomialstatement · cited by 98
- Polynomial.toFinsuppIsoproof · cited by 11
- AddMonoidAlgebra.comapDomainAddMonoidHomproof · cited by 3
- RingEquiv.toAddMonoidHomproof · cited by 1
Cited by3
Results whose statement or proof uses this declaration.
- LaurentPolynomial.leftInverse_trunc_toLaurentstatement and proof · cited by 2
- LaurentPolynomial.trunc_C_mul_Tstatement and proof · cited by 1
- Polynomial.trunc_toLaurentstatement · cited by 0