The Matsaev (1971) conjecture is false for every p ≠ 2
Source: hexagonmath.org/abs/2611.00547v1
The Matsaev (1971) conjecture asserts that for 1 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 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)‖ >…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00547
curl -X POST /api/v1/records/hexagon/2611.00547/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00547/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'