Documentation

LeanPool.OperatorTheory.Operator.Crouzeix.Palencia

Crouzeix--Palencia assembly from auxiliary-operator bounds #

This file isolates two algebraic routes to the Crouzeix--Palencia constant. The project-specific sharp-product route assumes that, for F = p(A), an auxiliary operator G satisfies

then the C⋆-identity gives the quadratic inequality ‖F‖² ≤ 2m‖F‖ + m², hence ‖F‖ ≤ (1 + √2)m.

This sharp product bound is not the invariant used in the published 2017 proof. The Crouzeix--Palencia argument, in the shorter Ransford--Schwenninger formulation, instead combines a contractive scalar Cauchy-transform companion with an a priori finite norm K for the whole functional calculus. Its fourth-power bootstrap gives K⁴ ≤ 2K³ + K², hence the same constant. Both algebraic endpoints are formalized below; their distinct analytic hypotheses remain explicit.

Main declarations #

theorem norm_le_one_add_sqrt_two_mul_of_auxiliary_bounds {B : Type u_1} [NonUnitalNormedRing B] [StarRing B] [CStarRing B] (F G : B) {m : ℝ} (hsymm : ‖F + star G‖ ≤ 2 * m) (hprod : ‖F * G‖ ≤ m ^ 2) :
‖F‖ ≤ (1 + √2) * m

The algebraic core of the Crouzeix--Palencia estimate. The identity F F⋆ = F (F + G⋆)⋆ - F G, the C⋆-identity, and the two assumed auxiliary bounds give a quadratic inequality whose positive root is (1 + √2) m.

theorem mul_adjoint_fourth_power_eq_symmetrized_sub_triple {B : Type u_1} [NonUnitalNormedRing B] [StarRing B] (F G : B) :
F * star F * F * star F = F * star (F + star G) * F * star F - F * G * F * star F

The exact C⋆-identity behind the short Ransford--Schwenninger version of the Crouzeix--Palencia argument. In the intended application F = f(A) and G = g(A), so multiplicativity identifies F * G * F with (f g f)(A).

The norm form of the Ransford--Schwenninger fourth-power identity. It replaces a sharp standalone bound on F * G by control of the multiplicative triple F * G * F, which is what a global functional-calculus norm supplies.

theorem norm_fourth_power_le_of_companion_calculus_bounds {B : Type u_1} [NonUnitalNormedRing B] [StarRing B] [CStarRing B] (F G : B) {K m : ℝ} (hK : 0 ≤ K) (hm : 0 ≤ m) (hsymm : ‖F + star G‖ ≤ 2 * m) (hF : ‖F‖ ≤ K * m) (htriple : ‖F * G * F‖ ≤ K * m ^ 3) :
‖F‖ ^ 4 ≤ (2 * K ^ 3 + K ^ 2) * m ^ 4

If a functional calculus has an a priori norm bound K, the companion is symmetrically bounded by 2m, and multiplicativity plus companion contraction bound F G F by K m³, then the published fourth-power estimate follows. Taking K to be the best global calculus constant yields K⁴ ≤ 2K³ + K², whose positive fixed point is 1 + √2.

Polynomial multiplicative triples #

Polynomial sup norms are submultiplicative on compact sets. Compactness supplies the boundedness needed to compare each point evaluation with the conditionally complete supremum used by polynomialSupNorm.

The compact-set sup norm of the multiplicative triple p*q*p is at most ‖p‖²‖q‖.

theorem le_one_add_sqrt_two_of_fourth_le_two_mul_cube_add_sq {K : ℝ} (hK : 0 ≤ K) (hfour : K ^ 4 ≤ 2 * K ^ 3 + K ^ 2) :
K ≤ 1 + √2

The nonnegative fixed point of the Ransford--Schwenninger fourth-power bootstrap is at most 1 + √2.

A global polynomial-calculus bound controls the evaluated multiplicative triple by the product of the three compact-set polynomial sup norms. This is the algebraic approximation bridge needed when the scalar Cauchy companion has itself been represented by a polynomial.

theorem norm_fourth_power_le_of_polynomial_companion_calculus_bounds {E : Type u} [NormedAddCommGroup E] [InnerProductSpace ℂ E] [CompleteSpace E] (A : E →L[ℂ] E) {K m : ℝ} (hK : 0 ≤ K) (hm : 0 ≤ m) {S : Set ℂ} (hS : IsCompact S) (hcalc : ∀ (r : Polynomial ℂ), ‖(Polynomial.aeval A) r‖ ≤ K * polynomialSupNorm r S) (p q : Polynomial ℂ) (hp : polynomialSupNorm p S ≤ m) (hq : polynomialSupNorm q S ≤ m) (hsymm : ‖(Polynomial.aeval A) p + star ((Polynomial.aeval A) q)‖ ≤ 2 * m) :
‖(Polynomial.aeval A) p‖ ^ 4 ≤ (2 * K ^ 3 + K ^ 2) * m ^ 4

The published fourth-power estimate specialized to a polynomial companion q. A global calculus constant bounds both p(A) and the multiplicative triple (p*q*p)(A); compact-set sup-norm submultiplicativity and ‖p‖ₛ,‖q‖ₛ ≤ m give the required K m³ bound.

The analytic Crouzeix--Palencia companion need not be a polynomial, so using this theorem for that companion still requires a norm-preserving polynomial approximation argument.

theorem norm_triple_le_of_tendsto_polynomial_companions {E : Type u} [NormedAddCommGroup E] [InnerProductSpace ℂ E] [CompleteSpace E] (A : E →L[ℂ] E) {K m : ℝ} (hK : 0 ≤ K) {S : Set ℂ} (hS : IsCompact S) (hcalc : ∀ (r : Polynomial ℂ), ‖(Polynomial.aeval A) r‖ ≤ K * polynomialSupNorm r S) (p : Polynomial ℂ) (hp : polynomialSupNorm p S ≤ m) (G : E →L[ℂ] E) (q : ℕ → Polynomial ℂ) (hq : ∀ (n : ℕ), polynomialSupNorm (q n) S ≤ m) (hlim : Filter.Tendsto (fun (n : ℕ) => (Polynomial.aeval A) (q n)) Filter.atTop (nhds G)) :

Polynomial companion estimates pass to an operator-norm limit. If q n (A) → G and every q n has sup norm at most m, then the global polynomial-calculus bound controls p(A) G p(A) by K m³.

This statement isolates the exact approximation interface required for a holomorphic Cauchy companion: construction of the approximants and their uniform scalar bound are analytic inputs, while the limiting operator estimate is purely functional-analytic.

theorem norm_fourth_power_le_of_tendsto_polynomial_companions {E : Type u} [NormedAddCommGroup E] [InnerProductSpace ℂ E] [CompleteSpace E] (A : E →L[ℂ] E) {K m : ℝ} (hK : 0 ≤ K) (hm : 0 ≤ m) {S : Set ℂ} (hS : IsCompact S) (hcalc : ∀ (r : Polynomial ℂ), ‖(Polynomial.aeval A) r‖ ≤ K * polynomialSupNorm r S) (p : Polynomial ℂ) (hp : polynomialSupNorm p S ≤ m) (G : E →L[ℂ] E) (q : ℕ → Polynomial ℂ) (hq : ∀ (n : ℕ), polynomialSupNorm (q n) S ≤ m) (hlim : Filter.Tendsto (fun (n : ℕ) => (Polynomial.aeval A) (q n)) Filter.atTop (nhds G)) (hsymm : ‖(Polynomial.aeval A) p + star G‖ ≤ 2 * m) :
‖(Polynomial.aeval A) p‖ ^ 4 ≤ (2 * K ^ 3 + K ^ 2) * m ^ 4

The published fourth-power estimate for an operator companion obtained as the operator-norm limit of uniformly sup-norm-bounded polynomial companions. This packages the limiting step needed after a norm-preserving polynomial approximation theorem for the scalar Cauchy companion.

A nonnegative global polynomial-calculus constant satisfying the Ransford--Schwenninger fourth-power inequality is at most 1 + √2, and hence gives the exact Crouzeix--Palencia polynomial spectral-set conclusion.

theorem isKPolynomialSpectralSet_of_finite_global_bound_of_uniform_fourth_power_improvement {E : Type u} [NormedAddCommGroup E] [InnerProductSpace ℂ E] (A : E →L[ℂ] E) (S : Set ℂ) (hspectrum : spectrum ℂ A ⊆ S) (hfinite : ∃ (K : ℝ), 0 ≤ K ∧ ∀ (p : Polynomial ℂ), ‖(Polynomial.aeval A) p‖ ≤ K * polynomialSupNorm p S) (hfour : ∀ (K : ℝ), 0 ≤ K → (∀ (p : Polynomial ℂ), ‖(Polynomial.aeval A) p‖ ≤ K * polynomialSupNorm p S) → ∀ (p : Polynomial ℂ), ‖(Polynomial.aeval A) p‖ ^ 4 ≤ (2 * K ^ 3 + K ^ 2) * polynomialSupNorm p S ^ 4) :

On any control set containing the spectrum, a finite polynomial-calculus bound together with a uniform fourth-power improvement closes the best-constant bootstrap. The proof takes the supremum of all normalized polynomial-calculus ratios, proves that this supremum is itself an admissible global constant, and applies the improvement at that exact constant.

A finite polynomial-calculus bound on the closed numerical range, together with a uniform fourth-power improvement, gives the exact Crouzeix--Palencia conclusion.

theorem isKPolynomialSpectralSet_of_finite_global_bound_of_tendsto_polynomial_companions {E : Type u} [NormedAddCommGroup E] [InnerProductSpace ℂ E] [CompleteSpace E] (A : E →L[ℂ] E) (S : Set ℂ) (hS : IsCompact S) (hspectrum : spectrum ℂ A ⊆ S) (hfinite : ∃ (K : ℝ), 0 ≤ K ∧ ∀ (p : Polynomial ℂ), ‖(Polynomial.aeval A) p‖ ≤ K * polynomialSupNorm p S) (hcompanion : ∀ (p : Polynomial ℂ), ∃ (G : E →L[ℂ] E) (q : ℕ → Polynomial ℂ), (∀ (n : ℕ), polynomialSupNorm (q n) S ≤ polynomialSupNorm p S) ∧ Filter.Tendsto (fun (n : ℕ) => (Polynomial.aeval A) (q n)) Filter.atTop (nhds G) ∧ ‖(Polynomial.aeval A) p + star G‖ ≤ 2 * polynomialSupNorm p S) :

On a compact control set containing the spectrum, a finite global polynomial-calculus bound and uniformly contractive polynomial approximants to each auxiliary companion imply the (1 + √2) spectral-set bound.

A finite global polynomial-calculus bound and uniformly contractive polynomial approximants to each auxiliary companion imply the exact Crouzeix--Palencia conclusion. The operator-norm limit supplies the multiplicative triple estimate, while the preceding best-constant bootstrap globalizes its per-polynomial fourth-power improvement.

The Hermitian part of an auxiliary product is exactly the difference between the squared symmetric and antisymmetric components. This is the operator-vector form of the polarization identity 4 Re(FG) = (F† + G)†(F† + G) - (F† - G)†(F† - G); it requires no commutation hypothesis.

theorem two_smul_remainder_add_adjoint_eq_main_sub_symmetric_sq_add_skew_sq {E : Type u} [NormedAddCommGroup E] [InnerProductSpace ℂ E] [CompleteSpace E] (F G H Q : E →L[ℂ] E) (hdecomp : F * G = H - Q) :
2 • (Q + star Q) = 2 • (H + star H) - (F + star G) * (star F + G) + (F - star G) * (star F - G)

If an auxiliary product is separated as F G = H - Q, then twice the Hermitian remainder is exactly twice the Hermitian main term, minus the symmetric square, plus the antisymmetric square. Thus positivity of the double-layer/Kadison part and control of the skew part are distinct pieces; no triangle inequality or commutation hypothesis enters this identity.

theorem re_inner_mul_lower_iff_norm_adjoint_sub_sq_le {E : Type u} [NormedAddCommGroup E] [InnerProductSpace ℂ E] [CompleteSpace E] (F G : E →L[ℂ] E) (x : E) (m : ℝ) :
-m ^ 2 ≤ RCLike.re (inner ℂ x ((F * G) x)) ↔ ‖(star F - G) x‖ ^ 2 ≤ ‖(star F + G) x‖ ^ 2 + 4 * m ^ 2

The one-sided product estimate used in the Palencia balance is exactly a relative bound on the antisymmetric auxiliary component.

theorem norm_le_one_add_sqrt_two_mul_of_auxiliary_re_inner_lower_bounds {E : Type u} [NormedAddCommGroup E] [InnerProductSpace ℂ E] [CompleteSpace E] (F G : E →L[ℂ] E) {m : ℝ} (hsymm : ‖F + star G‖ ≤ 2 * m) (hprod : ∀ (x : E), ‖x‖ = 1 → -m ^ 2 ≤ RCLike.re (inner ℂ x ((F * G) x))) :
‖F‖ ≤ (1 + √2) * m

The Crouzeix--Palencia balance only uses the lower real part of the auxiliary product. In the identity F F† = F (F + G†)† - F G, an upper bound for F F† requires only -m² ≤ re ⟪x, F G x⟫ on unit vectors. No bound on the modulus, numerical radius, or operator norm of F G is needed.

theorem norm_le_one_add_sqrt_two_mul_of_auxiliary_inner_bounds {E : Type u} [NormedAddCommGroup E] [InnerProductSpace ℂ E] [CompleteSpace E] (F G : E →L[ℂ] E) {m : ℝ} (hsymm : ‖F + star G‖ ≤ 2 * m) (hprod : ∀ (x : E), ‖x‖ = 1 → ‖inner ℂ x ((F * G) x)‖ ≤ m ^ 2) :
‖F‖ ≤ (1 + √2) * m

The Crouzeix--Palencia balance only needs the product estimate on unit-vector quadratic forms. Evaluating F F† = F (F + G†)† - F G at a unit vector bounds ‖F† x‖; normalization then recovers the operator norm. Thus a numerical-radius bound on F G is sufficient for the exact (1 + √2) constant.

theorem norm_le_one_add_sqrt_two_mul_of_auxiliary_skew_bounds {E : Type u} [NormedAddCommGroup E] [InnerProductSpace ℂ E] [CompleteSpace E] (F G : E →L[ℂ] E) {m : ℝ} (hsymm : ‖F + star G‖ ≤ 2 * m) (hskew : ∀ (x : E), ‖x‖ = 1 → ‖(star F - G) x‖ ^ 2 ≤ ‖(star F + G) x‖ ^ 2 + 4 * m ^ 2) :
‖F‖ ≤ (1 + √2) * m

A relative contraction of the antisymmetric auxiliary component is the exact extra input needed beyond the symmetrized bound. By the polarization identity above, bounding ‖(F† - G)x‖² by ‖(F† + G)x‖² + 4m² is equivalent to the signed product estimate used by the sharp Palencia balance.

If every polynomial admits an auxiliary operator with the symmetrized bound and the sharp product bound only on unit-vector quadratic forms, then the closed numerical range is a (1 + √2)-polynomial spectral set.

If every polynomial admits an auxiliary operator with the symmetrized bound and the sharp one-sided lower bound on the real part of its product, then the closed numerical range is a (1 + √2)-polynomial spectral set.

If every polynomial admits an auxiliary operator satisfying the two Crouzeix--Palencia bounds, then the closure of the numerical range is a (1 + √2)-polynomial spectral set. This is the sorry-free assembly consumed once L4.2c--e construct G and establish the bounds.

The L4.2d/e interface specialized to the contour operator from AuxOperator.lean: once its symmetrized and product bounds hold for every polynomial, the Crouzeix--Palencia spectral-set conclusion follows.

The Crouzeix--Palencia conclusion for a normal operator. In this branch the sharper constant 1 follows from the continuous functional calculus and the polynomial spectral mapping theorem; monotonicity then gives the stated 1 + √2 constant.