Refutation of Herrera’s function-approximation conjecture
Abstract
A positive-Fourier defect dilation and a three-point certificate refute Herrera’s operator-monotone function-approximation conjecture.
Theorem 1.1 (Sine at a natural multiple).
Proof. Machine-checked in Lean as D5/S3/Fourier/PositiveFourierApproximationRefutation.abs_sin_nat_mul_le (✓ std3). ∎
Source. Repository-derived.
Commentary.
The absolute sine of a natural multiple is bounded by that multiple times the absolute sine of the original angle.
Definition 1.2 (Admissible positive-Fourier approximants).
Formalization. D5/S3/Fourier/PositiveFourierApproximationRefutation.IsAdmissible (✓ std3).
Citation. D. Herrera (2023). On the commutator modulus of continuity for operator monotone functions. URL: https://arxiv.org/abs/2311.17448v1.
Commentary.
The admissible class is the source’s C1 functions whose derivative is the Fourier transform of a finite positive Borel measure; the integral uses the stated complex exponential convention.
Definition 1.3 (Approximation cost).
Formalization. D5/S3/Fourier/PositiveFourierApproximationRefutation.approxCost (✓ std3).
Citation. D. Herrera (2023). On the commutator modulus of continuity for operator monotone functions. URL: https://arxiv.org/abs/2311.17448v1.
Commentary.
The cost is the oscillation of f-g on the nonnegative half-line plus c times the derivative at zero.
Definition 1.4 (Function-approximation functional).
Formalization. D5/S3/Fourier/PositiveFourierApproximationRefutation.approxError (✓ std3).
Citation. D. Herrera (2023). On the commutator modulus of continuity for operator monotone functions. URL: https://arxiv.org/abs/2311.17448v1.
Commentary.
The infimum ranges over admissible g for which the approximation error has bounded upper and lower ranges.
Definition 1.5 (Operator monotonicity on positive semidefinite matrices).
Formalization. D5/S3/Fourier/PositiveFourierApproximationRefutation.OperatorMonotoneOn (✓ std3).
Citation. D. Herrera (2023). On the commutator modulus of continuity for operator monotone functions. URL: https://arxiv.org/abs/2311.17448v1.
Commentary.
The matrix order condition is imposed at every finite dimension for positive semidefinite A and B.
Definition 1.6 (Herrera’s Conjecture 2).
Formalization. D5/S3/Fourier/PositiveFourierApproximationRefutation.claim (✓ std3).
Citation. D. Herrera (2023). On the commutator modulus of continuity for operator monotone functions. URL: https://arxiv.org/abs/2311.17448v1.
Commentary.
The source sentence is verbatim (arXiv v1, p. 7): “Let f be a non-negative function that is operator monotone on [0, ∞). Then E_f(c) ≤ Cf(c) holds for all c > 0 when C = 1.” This is Conjecture 2, numbered 1.10 in print; the formula binds the Lean encoding of f, operator monotonicity, c and positivity.
Theorem 1.7 (The conjecture is refuted).
Proof. Machine-checked in Lean as D5/S3/Fourier/PositiveFourierApproximationRefutation.result (✓ std3). ∎
Resolves. Problems/herrera-2023-function-approximation-conjecture (refuted) by D5/S3/Fourier/PositiveFourierApproximationRefutation.result.
Source. Repository-derived.
Acknowledgement. D. Herrera (2023). On the commutator modulus of continuity for operator monotone functions. URL: https://arxiv.org/abs/2311.17448v1.
Commentary.
The witness is f(x)=x/(1+x) at c=1. Positive Fourier structure gives a cubic defect-dilation bound, and the three-point comparison forces every admissible approximant to have cost at least 1153/2304, while f(1)=1/2. The function is nonnegative and operator monotone by the resolvent formula.
The source’s bound C<1.01975 remains an upper bound for this function. The optimal constant is open between 1153/1152 and 1.01975; the paper’s commutator Conjectures 1 and 3 remain open because the implication from Conjecture 2 is not reversible.
References
- Truth anchor:
D5/S3/Fourier/PositiveFourierApproximationRefutation.IsAdmissible - Truth anchor:
D5/S3/Fourier/PositiveFourierApproximationRefutation.OperatorMonotoneOn - Truth anchor:
D5/S3/Fourier/PositiveFourierApproximationRefutation.abs_sin_nat_mul_le - Truth anchor:
D5/S3/Fourier/PositiveFourierApproximationRefutation.approxCost - Truth anchor:
D5/S3/Fourier/PositiveFourierApproximationRefutation.approxError - Truth anchor:
D5/S3/Fourier/PositiveFourierApproximationRefutation.claim - Truth anchor:
D5/S3/Fourier/PositiveFourierApproximationRefutation.result