Submitted:
18 June 2026
Posted:
22 June 2026
You are already at the latest version
Abstract
Keywords:
1. Introduction
2. A Self-Contained Transformed Identity
- (i)
-
the fieldsinitially defined on , extend to compactly supported fields on Ω;
- (ii)
- s is a scalar function on Ω;
- (iii)
- the scalar function , initially defined on and extended by zero on , is a continuous compactly supported function ψ on Ω.
3. An Explicit Periodic Obstruction
4. The Exact Fourier Certificate
| Polynomial | Nonzero Fourier coefficients | Maximum coefficient |
|---|---|---|
| h |
Finite verification algorithm.
- (1)
- encode the three components in (16); differentiation multiplies the kth coefficient by , and multiplication is finite discrete convolution;
- (2)
- construct , , , , m, and over ;
- (3)
- read the four Gaussian-integer arrays, verify the fixed SHA-256 digest, required keys, degree, denominator, dimensions, and conjugate symmetry, and divide all coefficients by Q;
- (4)
- usewhere every sum is finite, to evaluate the linear and weighted-square terms in (22);
- (5)
5. Quantitative Localization to Compact Support
6. Reproducibility and Scope of the Computer-Assisted Step
- (i)
- certificate.npz, the fixed Gaussian-integer coefficient arrays;
- (ii)
- verify_certificate.py, the accelerated exact verifier with explicit failure checks;
- (iii)
-
a standalone arbitrary-precision integer reference verifier,verify_certificate_reference.py;
- (iv)
-
a convenience driver that checks file digests and runs both verifiers,verify_all.py;
- (v)
- certificate_coefficients.csv.gz, a readable coefficient export;
- (vi)
- export_certificate_csv.py, the export script;
- (vii)
- clean output logs for both verification scripts;
- (viii)
- a minimal Python dependency file, explicit licenses, repository metadata, and SHA-256 manifests for the supplementary files and full source package.
7. Concluding Remarks
Author Contributions
Funding
Institutional Review Board Statement
Informed Consent Statement
Data Availability Statement
Acknowledgments
Conflicts of Interest
References
- Cialdea, A.; Maz’ya, V. Criterion for the -dissipativity of second order differential operators with complex coefficients. J. Mathématiques Pures Appliquées 2005, 84, 1067–1100. [Google Scholar] [CrossRef]
- Cialdea, A.; Maz’ya, V. Criteria for the -dissipativity of systems of second order differential equations. Ric. Mat. 2006, 55, 233–265. [Google Scholar] [CrossRef]
- Cialdea, A.; Maz’ya, V. -dissipativity of the Lamé operator. Mem. Differ. Equ. Math. Phys. 2013, 60, 111–133. [Google Scholar]
- Cialdea, A.; Maz’ya, V. Semi-Bounded Differential Operators, Contractive Semigroups and Beyond; Operator Theory: Advances and Applications; Birkhäuser/Springer: Cham, 2014; Vol. 243. [Google Scholar] [CrossRef]
- Cialdea, A.; Maz’ya, V. A survey of functional and -dissipativity theory. Bull. Math. Sci. 2022, 12, 2230003. [Google Scholar] [CrossRef]
- Maz’ya, V. Seventy Five (Thousand) Unsolved Problems in Analysis and Partial Differential Equations. Integral Equ. Oper. Theory 2018, 90, 25. [Google Scholar] [CrossRef]
- Dindoš, M.; Li, J.; Pipher, J. The p-ellipticity condition for second order elliptic systems and applications to the Lamé and homogenisation problems. J. Differ. Equ. 2021, 302, 367–405. [Google Scholar] [CrossRef]
- Cialdea, A.; Maz’ya, V. Criterion for the functional dissipativity of the Lamé operator. Eur. J. Mechanics–A/Solids 2023, 100, 104522. [Google Scholar] [CrossRef]
- Gómez-Serrano, J. Computer-assisted proofs in PDE: a survey. SeMA J. 2019, 76, 459–484. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).