Matching works

2 works

math.FA — Functional Analysis

The Matsaev (1971) conjecture is false for every p ≠ 2, and other miscellanea

Contributed by Dave Goel

The Matsaev (1971) conjecture asserts that for 1 < p < ∞, every contraction T on an Lᵖ space and every polynomial P satisfy ‖P(T)‖ ≤ ‖P(S)‖, where S is the shift on ℓᵖ(ℕ). We prove that it fails for every p ∈ (1, ∞) ∖ {2}, already for a real 2×2 matrix and a real quadratic, without numerical computation, and that it holds for every quadratic whose constant and leading coefficients have equal modulus; these results and their proofs also form the short paper "The Matsaev (1971) conjecture is false for every p ≠ 2". This expanded version adds an explicit quadratic and an explicit family of scaled rotations that violate the conjecture on a whole punctured neighbourhood of p = 2, with a proof by hand; an exact rational re-proof of Drury's counterexample at p = 4; upper bounds, certified in exact rational arithmetic, for the shift norms of Drury's polynomial at p = 3, 4, 6, …, 20; explicit counterexamples, certified by computer, for every p ∈ [40/39, 40], p ≠ 2; and conditions that every 2×2 counterexample must satisfy.

Author comments: First version: October 28, 2026. This is the expanded version of the paper "The Matsaev (1971) conjecture is false for every p ≠ 2", which is at https://hexagonmath.org/2611.00547 on Hexagon. The ancillary files are at https://doi.org/10.5281/zenodo.24290033 on Zenodo.

A mix of human-written and AI-generated textHuman understanding: some partsBellman functionL^p spacesMatsaev's conjecturecontractionsshift operatorvon Neumann's inequality
Nov 17, 202637 pages
PDFView work

math.FA — Functional Analysis

The Matsaev (1971) conjecture is false for every p ≠ 2

Contributed by Dave Goel

The Matsaev (1971) conjecture asserts that for 1 < p < ∞, every contraction T on an Lᵖ space and every polynomial P satisfy ‖P(T)‖ ≤ ‖P(S)‖, where S is the right shift on ℓᵖ(ℕ); for p = 2 this is von Neumann's inequality. Drury (2011) disproved it for p = 4, and hence, by duality, for p = 4/3, with a computer-assisted example. We prove that it fails for every p ∈ (1, ∞) ∖ {2}, even with T a real 2×2 matrix and P a real quadratic polynomial. Let Pₐ(z) = 1 + az − Bz² with B > 0. For p ≠ 2 and small a > 0 we show that ‖Pₐ(S)‖ = ‖Pₐ(J)‖, where J is the rotation of ℓᵖ₂ (ℂ² with the ℓᵖ norm) by a right angle. For p > 2 the bound ‖Pₐ(S)‖ ≤ ‖Pₐ(J)‖ comes from a Bellman function: a function G of two real variables such that, for every real sequence x ∈ ℓᵖ(ℕ) (with x₋₁ = x₋₂ = 0) and every n ≥ 0, |(Pₐ(S)x)ₙ|ᵖ ≤ ‖Pₐ(J)‖ᵖ|xₙ|ᵖ + G(xₙ₋₁, xₙ₋₂) − G(xₙ, xₙ₋₁); the G terms cancel in the sum over n. For 1 < p < 2 the bound follows by duality. If B > 1, a rotation by an angle slightly larger than π/2, scaled down to a contraction, gives a real 2×2 matrix T with ‖Pₐ(T)‖ > ‖Pₐ(J)‖ = ‖Pₐ(S)‖. In the other direction, the conjecture holds for every quadratic whose constant and leading coefficients have equal modulus. An expanded version of this paper, with many other results, is posted on Zenodo: https://doi.org/10.5281/zenodo.23691816.

Author comments: First version: October 28, 2026. The expanded version of this paper is at https://doi.org/10.5281/zenodo.23691816 on Zenodo.

A mix of human-written and AI-generated textHuman understanding: some partsBellman functionL^p spacesMatsaev's conjecturecontractionsshift operatorvon Neumann's inequality
Nov 17, 202613 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations