Documentation

LeanPool.OperatorTheory.Operator.Crouzeix.AffinePolynomial

Affine changes of variables for complex polynomials #

This file records how evaluation, degree, and polynomialSupNorm behave when a complex polynomial is precomposed with the affine map z ↦ a * z + b.

Main declarations #

noncomputable def Polynomial.affineComposition (p : Polynomial ℂ) (a b : ℂ) :

Precomposition of a complex polynomial with the affine map z ↦ a * z + b.

Equations
Instances For
    @[simp]
    theorem Polynomial.eval_affineComposition (p : Polynomial ℂ) (a b z : ℂ) :
    eval z (p.affineComposition a b) = eval (a * z + b) p

    Evaluating an affine composition is evaluation after the corresponding scalar affine map.

    @[simp]
    theorem Polynomial.aeval_affineComposition {A : Type u_1} [Semiring A] [Algebra ℂ A] (p : Polynomial ℂ) (a b : ℂ) (x : A) :
    (aeval x) (p.affineComposition a b) = (aeval (a • x + b • 1)) p

    Algebra-valued evaluation commutes with affine precomposition.

    Affine precomposition cannot increase the natural degree of a polynomial.

    Precomposition by a nonconstant affine map preserves natural degree.

    The sup-norm of an affine composition on X is the original sup-norm on the affine image of X. This remains exact for unbounded sets: in that case both conditionally complete suprema use the same unbounded family of values.