Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Dedania–Patel Spatial Numerical Range Convexity Refutation

Abstract

A three-dimensional complex normed algebra has two spatial numerical range points whose midpoint is absent.

Dedania–Patel, arXiv:2306.16172v1, §1, p. 2, definition verbatim: “Let be the unit sphere in . Let be the Banach space dual of . Let for each . Further, let for and . Then is the spatial numerical range (SNR)”

Definition 1.1 (Spatial numerical range).

Formalization. D5/S3/Analytic/NumericalRange/SpatialNumericalRangeNonconvex.spatialNumericalRange (✓ std3).

Citation. H. V. Dedania and A. B. Patel (2024). Spatial numerical range in non-unital, normed algebras and their unitizations. URL: https://arxiv.org/abs/2306.16172v1.

Commentary.

Formal encoding of the quoted definition: for a complex normed algebra A, spatialNumericalRange a consists of the values φ(a*x), where x is a unit vector and φ is a continuous complex-linear functional with norm one and φ(x)=1. The algebra has NonUnitalNormedRing, NormedSpace ℂ, IsScalarTower ℂ A A and SMulCommClass ℂ A A instances; convexity is over ℝ.

Definition 1.2 (Universal spatial convexity).

Formalization. D5/S3/Analytic/NumericalRange/SpatialNumericalRangeNonconvex.claim (✓ std3).

Citation. H. V. Dedania and A. B. Patel (2024). Spatial numerical range in non-unital, normed algebras and their unitizations. URL: https://arxiv.org/abs/2306.16172v1.

Commentary.

Dedania and Patel ask in Section 1, page 2: “It is still open problem wether V_A(a) is always convex? This problem is discussed in [5].” The formal claim quantifies over every complex normed algebra with the four indicated instances and every element a, and asserts Convex ℝ (spatialNumericalRange a). It assumes neither completeness nor commutativity.

Theorem 1.3 (An absent midpoint).

Proof. Machine-checked in Lean as D5/S3/Analytic/NumericalRange/SpatialNumericalRangeNonconvex.result (✓ std3). ∎

Resolves. Problems/dedania-patel-2024-spatial-numerical-range-convexity (refuted) by D5/S3/Analytic/NumericalRange/SpatialNumericalRangeNonconvex.result.

Source. Repository-derived.

Acknowledgement. H. V. Dedania and A. B. Patel (2024). Spatial numerical range in non-unital, normed algebras and their unitizations. URL: https://arxiv.org/abs/2306.16172v1.

Commentary.

Let P=(1/5)[[1,2],[2,4]] and give ℂ⊕ℂ² the product (α,x)(β,y)=(αβ,αPy+βx) and norm max(3|α|,‖x‖∞). The Lean coordinates use u₀=3α and e=(3,0). Idempotence of P gives associativity, and the multiplication is submultiplicative. The two norming pairs with vectors (0,(1,i)) and (0,(i,1)) and coordinate functionals give z₁=1/5+2i/5 and z₂=4/5+2i/5. For any norm-one functional, the sum of coefficient norms is at most one. The norming equation makes the diagonal products real; attaining imaginary height 2/5 forces the cross products to be purely imaginary. At the midpoint 1/2+2i/5 both coefficient norms would be 1/2, contradicting the identity between the products of the diagonal and cross terms. Thus the midpoint is absent and the universal convexity assertion is false.

References