Proof development and originating-assistant audit
Date: 17 September 2026. Reviewer: the same OpenAI Codex assistant that wrote the proof. This is a self-audit, not independent review. The consolidated proof is in manuscript.
Dependency map
- Integral equation and energy: global regular IVP, simple zeros, finite negative-energy witnesses.
- Last-lobe lemma: a trajectory with finitely many zeros either has a negative-energy witness or decays exponentially. This avoids relying on a global finite-node theorem in the uniqueness argument.
- Variation Wronskian: at least one simple variation zero on every monotone part of a bound state, including the last part.
- Uniform parameter dependence: every nearby pair intersects on each corresponding part. No assertion that the variation has exactly one zero is used.
- Planar identities:
, and the weighted-energy derivative for . - Transfer lemma: ordered maxima and common-level
data imply oppositely ordered minima and the next extremal data. - Reflection: extrema inherit the required ordering through every finite part.
- Tail gap:
, incompatible with two decaying endpoints. - Local shooting separation: below a bound-state parameter, the shot is trapped after exactly the same number of nodes; above it, another node occurs.
- Interval topology: turns this local fact into uniqueness and ordered thresholds.
- External prescribed-node existence: CGY arXiv:1208.0017v2, Theorem 1.1, with every nontrivial growth hypothesis checked in the manuscript.
Adversarial checks performed
| Possible failure | Resolution in the current draft |
|---|---|
| Only |
|
| Singular coefficient at |
The integral kernel has norm |
| Initial strict |
Equation (5.4) compares at |
| Division by |
|
| Inverse derivatives are singular at extrema | Identities are used in open branches; |
| A crossing of |
Fixed radii around a reference variation zero stay inside both corresponding parts by continuous dependence. |
| First intersection might have the wrong slope order | The initial radius order and first-contact derivative give |
| Strict comparison through |
|
| The first minimum could be the wrong solution's endpoint | If |
| Reflection might reverse the wrong comparison quantity | |
| Infinite radius invalidates a strict limit inequality | The proof uses |
| A nearby branch could stop before the tail comparison | Loss of energy, a positive minimum, a positive asymptote, and a zero endpoint are treated separately in Proposition 6.1. |
| Local uniqueness need not imply global uniqueness | The interval partition is open on the two sides, and each bound-state point has a prescribed orientation. Components cannot have a finite endpoint of the opposite orientation. |
| Existence theorem might exclude |
Its statement permits |
| Existence theorem's |
Ground-state existence is obtained independently from the nonempty first-crossing set and a negative-energy interval near |
| Infinitely many zeros of general shots are tacitly ruled out | The uniqueness proof needs no such assertion. The added Lemma 8.1 separately proves finite nodal count for every shot by treating positive and zero limiting energy. It then justifies |
| Novelty is inferred from Tang's conjecture | Explicitly disallowed: CGY11 already states the whole-plane target. |
No unresolved mathematical step was identified in this originating-assistant pass. That statement is limited to this audit and is not a certificate of correctness. The highest-value independent checks are the uniform nearby-pair formulation of Lemma 5.1 and the stopping alternatives in Proposition 6.1.
Scope deliberately not inferred
The proof supplies no finite-disk uniqueness, no radial nondegeneracy, no exact count of variation zeros, and no stability theorem. These are not automatic consequences of uniqueness. The current paper is one connected proof reconstruction, not several papers.
Algebra check
With Python and SymPy installed, run from this paper folder:
python3 checks/check_identities.py
The original four identities and three classification identities are now checked. No floating-point shooting computation has been used as evidence for the theorem.
Classification extension audit
Lemma 8.1 treats
Post-publication correction
Version 0.2.1 restricts