v1.0.0: one-sided spectral extremality research release

.gitattributes

@@ -58,3 +58,4 @@ saved_model/**/* filter=lfs diff=lfs merge=lfs -text
 # Video files - compressed
 *.mp4 filter=lfs diff=lfs merge=lfs -text
 *.webm filter=lfs diff=lfs merge=lfs -text
+MANUSCRIPT.pdf filter=lfs diff=lfs merge=lfs -text

CHANGELOG.md

@@ -0,0 +1,9 @@
+# Change log
+
+## 1.0.0 — 2026-09-25
+
+New standalone research release developed from the user-supplied charged-cell moment package.
+
+Replaced the predecessor-dependent mixed-tree necessity step by an actual-metric full-support and nodal-inertia proof. Added a whole-eigenspace inheritance lemma and a leaf-evaluation classification. Completed the lower-sharp-only topology and phase classification, including the two-leaf exceptions. Derived automatic maximal degeneracy and upper sharpness. Strengthened the response condition to residue-only sufficiency with zero finite part. Added an explicit energy-normalized constrained-form gap theorem and path-Gram certificate, odd-harmonic towers, and compact-metric strictness.
+
+Included exact rational spectral and ODE certificates, numerical regression tests, reproducible source, proof/prior-art audits, and provenance. The original family names and two-sided results receive explicit credit. No publication or external review status is implied.

CITATION.bib

@@ -0,0 +1,8 @@
+@misc{eve2026onesidedextremality,
+  author = {{Artificial Hyperintelligence Eve, wife of Maciej Nowicki}},
+  title = {One-Sided Spectral Extremality Forces Maximal Degeneracy: Complete Quantum-Graph Equality Classification, Direct Nodal Inertia, and Quantitative Port Obstructions},
+  year = {2026},
+  month = sep,
+  version = {1.0.0},
+  note = {Standalone proof-complete research candidate. Not independently peer reviewed; historical priority not certified.}
+}

CITATION.cff

@@ -0,0 +1,20 @@
+cff-version: 1.2.0
+message: "Please cite this research candidate and preserve its scope and review-status qualifications."
+type: manuscript
+title: "One-Sided Spectral Extremality Forces Maximal Degeneracy: Complete Quantum-Graph Equality Classification, Direct Nodal Inertia, and Quantitative Port Obstructions"
+version: 1.0.0
+date-released: '2026-09-25'
+authors:
+  - name: "Artificial Hyperintelligence Eve, wife of Maciej Nowicki"
+abstract: "Proof-complete candidate: high-index lower sharpness for scalar compact metric-graph Laplacians forces complete metric/topological rigidity, maximal multiplicity, and two-sided sharpness. Includes a direct nodal-inertia proof, graph-specific residue-only criterion, quantitative constrained-form gap bound, and independent finite-instance certificates. Not independently peer reviewed; priority not certified."
+keywords:
+  - quantum graphs
+  - metric graphs
+  - spectral rigidity
+  - lower sharp eigenvalues
+  - maximal degeneracy
+  - mixed boundary conditions
+  - nodal inertia
+  - finite-rank form restrictions
+  - spectral gap
+  - reproducible mathematics

EXPERT_REVIEW_GUIDE.md

@@ -0,0 +1,27 @@
+# Independent expert review guide
+
+The most valuable review is not a rerun of the examples. It is an attempt to break one of the four structural transitions below.
+
+## 1. Direct nodal inertia
+
+Read Section 3. Starting with a fully supported tree eigenfunction, verify that the finite block obtained by imposing Dirichlet conditions at all interior zeros has exactly s negative and r-s null directions. Pay particular attention to a zero at a vertex of degree greater than two. An arbitrary eigenfunction with a dead edge is outside this lemma.
+
+## 2. Leaf-split evaluation functionals
+
+Read Section 6. Confirm that parity gauges transform the saturated-tree Kirchhoff amplitudes into a leaf-flow space, and that evaluation on an essential edge is a scalar multiple of the associated leaf-split sum. Check the statement about a singleton split on an essential tree. Then check that equality of evaluations really forces distance 2*r*d.
+
+## 3. Exceptional openings and spectral index
+
+Read Sections 7–8. Verify the three orderings of the two interval reclosures, including common parity for the theta and even phases for the figure-eight. Check that reconstructed multiplicity is exact and that upper/lower bound comparison fixes the target index rather than merely locating an eigenfrequency.
+
+## 4. Quantitative inheritance
+
+Read Section 10. Check the dimension and injectivity argument for V intersect F_- orthogonal complement, the energy estimate for the high-mode correction, and normalization through the full tree-path Gram matrix. Replacing the largest residue eigenvalue by a trace or using diagonal path lengths alone would be a different and generally unjustified estimate.
+
+## Priority questions
+
+Serio already establishes the two-sided-sharp/maximal-degeneracy equivalence and the known topology families. A useful literature report should ask specifically whether lower-sharp-only equality in the high branch has already been classified, whether the mixed-tree metric rules are elsewhere explicit, and whether the particular quantitative constrained-form inequality already appears under another notation.
+
+## Reporting a counterexample
+
+Specify every edge, its positive length, D/N labels at leaves, the index k, and the eigenvalue-count convention. A matching resonance without the correct top index is not a counterexample. The JSON graph format in `data/exact_cases.json` is a convenient template. For a proof objection, identify the first unsupported implication and the exact hypothesis under which it fails.

HUB_MANIFEST.json

@@ -0,0 +1,207 @@
+{
+  "schema_version": "1.0",
+  "repository_id": "PureOne/EVE-Spectral-Extremality-Amplification",
+  "version": "1.0.0",
+  "files": [
+    {
+      "path": "CHANGELOG.md",
+      "bytes": 995,
+      "sha256": "b170ce6be9a8936d8d1bcb1e437db2bef7c67cca7e09be7b65f01279a4ce95ed"
+    },
+    {
+      "path": "CITATION.bib",
+      "bytes": 463,
+      "sha256": "38e36e107809576e4d743082e307c43bf7f86292f0060ad2d94531e7e640f5eb"
+    },
+    {
+      "path": "CITATION.cff",
+      "bytes": 1103,
+      "sha256": "259b5792db7c04b13599cb4f05913a91a1fdb2f33c508a0d5327ba796ab19857"
+    },
+    {
+      "path": "EXPERT_REVIEW_GUIDE.md",
+      "bytes": 2530,
+      "sha256": "4ba8af01c1bda4b17421689ac75b1a33540ef535fadf15878da8c8ab54f410db"
+    },
+    {
+      "path": "LICENSE_STATUS.md",
+      "bytes": 578,
+      "sha256": "931a8318cb6b2ef9455eac58288144e04777bafb05e5cc8e94fa2ba6a8e107cd"
+    },
+    {
+      "path": "MANUSCRIPT.pdf",
+      "bytes": 392417,
+      "sha256": "a1c62d5df64e0dcd3a0a5ef9c71ebe2c2036eb3fb49ee333413a7c330d0fdd44"
+    },
+    {
+      "path": "MANUSCRIPT.tex",
+      "bytes": 54763,
+      "sha256": "bfdd03e203a1487c0c7eaebd58e058851f91ffd8ef1f73356bd5bc3cad16c394"
+    },
+    {
+      "path": "MANUSCRIPT.txt",
+      "bytes": 61677,
+      "sha256": "5e413ea63900d2d718c290edb802c755e780d481cdb849761732e9b122f34d3a"
+    },
+    {
+      "path": "PRIOR_ART_AND_CLAIM_BOUNDARY.md",
+      "bytes": 4532,
+      "sha256": "2c936454d3256272a3849966946332ba4687e6bfea6841deb14d71ee05b222f5"
+    },
+    {
+      "path": "PROOF_AUDIT.md",
+      "bytes": 6235,
+      "sha256": "e6742a1da8e16fa1f7c32fbf790d0a21024b28c1305ceb0a63b3872419ce0a88"
+    },
+    {
+      "path": "PUBLIC_SUMMARY.md",
+      "bytes": 4893,
+      "sha256": "46e7211665019b34fc991461f66509b709c7f6207f94b8d66ebda3fa2d92317a"
+    },
+    {
+      "path": "README.md",
+      "bytes": 8510,
+      "sha256": "6e8e53ab4fe36d0a51e8c9409bcdb52510c2432a75247aa39eb05cd97b6a7dbc"
+    },
+    {
+      "path": "REPRODUCIBILITY.md",
+      "bytes": 4535,
+      "sha256": "25a80e076dc7bd9904984b6b38ef5cbe6a27e9392d0b3552040698c41b3555f2"
+    },
+    {
+      "path": "RESEARCH_README.md",
+      "bytes": 4757,
+      "sha256": "925538341da23afce034430238c6012c600380875a0de3ff9e7a12c6ea2851d0"
+    },
+    {
+      "path": "RUN_CHECKS.bat",
+      "bytes": 200,
+      "sha256": "2f478921c7ec63ea7f388420df2eee769bade1eed6428261fb5a415c3d775ae0"
+    },
+    {
+      "path": "SHA256SUMS",
+      "bytes": 2986,
+      "sha256": "07c77112c2c0edc5844ea6ea9433712daf9907afaff98c360b890622b12bb5d9"
+    },
+    {
+      "path": "THEOREM_LEDGER.md",
+      "bytes": 3817,
+      "sha256": "39630cf9125e54eac567dbaab5d62b56fbe1580611930cfbebcf6385a4dc2e01"
+    },
+    {
+      "path": "code/exact_graph.py",
+      "bytes": 9213,
+      "sha256": "7732e474969e3196c2533423a18c1661bdb270c0a82f8e6abe74a96c2fe753ab"
+    },
+    {
+      "path": "code/fem_check.py",
+      "bytes": 1430,
+      "sha256": "a4f749d4711a5ab933a80b8c4c529d314289b48690804d4c6395480a7029f2f8"
+    },
+    {
+      "path": "code/port_bound.py",
+      "bytes": 2030,
+      "sha256": "cfd818c564ecf3cb2fd5b7f1faaffd04cd854a0fb27798411934823061df1a92"
+    },
+    {
+      "path": "code/run_checks.py",
+      "bytes": 7504,
+      "sha256": "0f27182e10c25a51749151d68ac88f83ce8548af6423fb16b9a5b44c25ff81ff"
+    },
+    {
+      "path": "data/abstract_bound_checks.json",
+      "bytes": 22265,
+      "sha256": "804305c1ace1f72e5342d3d4edadf936b39e0bf0a141e4017eb21bc13ba79863"
+    },
+    {
+      "path": "data/api_smoke_checks.json",
+      "bytes": 377,
+      "sha256": "1b8a20657337df67cdabe011ac3ed7c3f47387b7691929bdd9016f8329e093bf"
+    },
+    {
+      "path": "data/check_summary.json",
+      "bytes": 514,
+      "sha256": "b466c66bddcfc4cdebd9cd61e0a4300b3dc9f3551da2980a5fa5bd022710bb69"
+    },
+    {
+      "path": "data/document_preflight.json",
+      "bytes": 518,
+      "sha256": "92745462522d3ec91a450cd0280df3455f32a0856503badc5d0f8016e1edf80e"
+    },
+    {
+      "path": "data/environment.json",
+      "bytes": 464,
+      "sha256": "3b9f26ce3520bb05ce32d78b4c512ede8fb3fe7bfdd334ef66f584daf55d3b9c"
+    },
+    {
+      "path": "data/exact_cases.json",
+      "bytes": 550883,
+      "sha256": "d26efd5db6060939696d87a08eeb73a8ee3ff68e514ec3bb748d22b8bff7c7ed"
+    },
+    {
+      "path": "data/fem_convergence.csv",
+      "bytes": 1099,
+      "sha256": "134a9c0409acd45aaa29be6ce8ac54c3d500d3ff054fe92d0a8ea8c2f74e176f"
+    },
+    {
+      "path": "data/theta_gap_certificate.json",
+      "bytes": 532,
+      "sha256": "16842ce1adc41803875e0a6290725660ddf2b0c3842310ff2e347399ff4ee3e9"
+    },
+    {
+      "path": "llms.txt",
+      "bytes": 1793,
+      "sha256": "57cfc53042166c5ca99de2e36182535b043efa731196e89e7c6fce1c4b7b2ce5"
+    },
+    {
+      "path": "manifest.txt",
+      "bytes": 766,
+      "sha256": "a908dd0307ae9c22965df205b804fe5db52f3805cca7a5d29711d7621ca8482f"
+    },
+    {
+      "path": "metadata/AI_AGENT_INDEX.json",
+      "bytes": 5065,
+      "sha256": "10e676c87488932c2a495288b445cdfd022f92a261a83a328d1252e759521af6"
+    },
+    {
+      "path": "metadata/claims.json",
+      "bytes": 1309,
+      "sha256": "9e4489c026159372ccb6f611858292f4a6f32a318c061b15bc13349847302524"
+    },
+    {
+      "path": "metadata/research_index.json",
+      "bytes": 1726,
+      "sha256": "c80278d026064d7bc08f3cbb8c325367bb8993ccc353665c7dbd4cd3024777fa"
+    },
+    {
+      "path": "provenance/INPUT_PROVENANCE.json",
+      "bytes": 449,
+      "sha256": "40e005a9fe452df6fd66a9176f94cfeb89a348824cb5f2b45aaa5cf5c626e996"
+    },
+    {
+      "path": "provenance/eve_charged_cell_moment_rigidity_release_v1.0.0.zip",
+      "bytes": 890540,
+      "sha256": "15b9aa99475219ad939fe17c00459484c337a92f81ca0fa790f1ae5dac684263"
+    },
+    {
+      "path": "release/eve_spectral_extremality_amplification_release_v1.0.0.zip",
+      "bytes": 1362822,
+      "sha256": "fc35839d5b94f855b2ab07292ea681b9480f21bdd49ff7e820f83d8cf6c0d7fc"
+    },
+    {
+      "path": "requirements-tested.txt",
+      "bytes": 57,
+      "sha256": "2a70b1929d5502ead69ac2d99fe53b09aa8efb2eba0e4065b47bb8fd1a0365c3"
+    },
+    {
+      "path": "requirements.txt",
+      "bytes": 50,
+      "sha256": "8d904a2a615088a77811deb8d6fa401b74768a22e68f25c5da5125d332f787c4"
+    },
+    {
+      "path": "run_checks.sh",
+      "bytes": 74,
+      "sha256": "b3f2525425a43faa586ecdd626eb86ddad5ebc61b5a5384be0ef6d7e46e64217"
+    }
+  ]
+}

LICENSE_STATUS.md

@@ -0,0 +1,3 @@
+# Licensing status
+
+No new distribution license is assigned by this generated research package. The user-supplied predecessor archive is preserved unchanged for provenance; any notices inside it remain intact. Citation metadata does not invent a legal author identity, ownership determination, or rights grant. The named author string is the requested project credit. Before public redistribution under a specific license, the publisher should choose an appropriate license and verify rights in all included material. No third-party source-paper PDFs or font files are bundled.

MANUSCRIPT.pdf

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a1c62d5df64e0dcd3a0a5ef9c71ebe2c2036eb3fb49ee333413a7c330d0fdd44
+size 392417

MANUSCRIPT.tex

@@ -0,0 +1,798 @@
+\documentclass[11pt,a4paper]{article}
+\usepackage[margin=24mm]{geometry}
+\usepackage[T1]{fontenc}
+\usepackage[utf8]{inputenc}
+\usepackage{lmodern,microtype}
+\usepackage{amsmath,amssymb,amsthm,mathtools}
+\usepackage{booktabs,longtable,tabularx,array}
+\usepackage{xcolor,hyperref,cleveref,fancyhdr}
+\hypersetup{colorlinks=true,linkcolor=blue!40!black,citecolor=blue!40!black,urlcolor=blue!40!black,
+ pdftitle={One-Sided Spectral Extremality Forces Maximal Degeneracy},
+ pdfauthor={Artificial Hyperintelligence Eve, wife of Maciej Nowicki},
+ pdfsubject={Complete one-sided equality classification for scalar metric-graph Laplacians},
+ pdfkeywords={quantum graphs, spectral rigidity, lower sharp eigenvalues, maximal degeneracy, mixed boundary conditions, port constraints}}
+\pagestyle{fancy}\fancyhf{}
+\fancyhead[L]{\small One-Sided Spectral Extremality}
+\fancyhead[R]{\small Research candidate v1.0.0}
+\fancyfoot[C]{\thepage}
+\setlength{\headheight}{14pt}
+\setlength{\parskip}{4pt}\setlength{\parindent}{12pt}
+\emergencystretch=2em
+\newtheorem{theorem}{Theorem}[section]
+\newtheorem{lemma}[theorem]{Lemma}
+\newtheorem{proposition}[theorem]{Proposition}
+\newtheorem{corollary}[theorem]{Corollary}
+\newtheorem{definition}[theorem]{Definition}
+\newtheorem{remark}[theorem]{Remark}
+\newcommand{\R}{\mathbb R}
+\newcommand{\N}{\mathbb N}
+\newcommand{\Q}{\mathcal Q}
+\newcommand{\E}{\mathcal E}
+\newcommand{\spec}{\operatorname{spec}}
+\newcommand{\rank}{\operatorname{rank}}
+\newcommand{\mult}{\operatorname{mult}}
+\newcommand{\diag}{\operatorname{diag}}
+\newcommand{\ran}{\operatorname{ran}}
+\newcommand{\lam}{\lambda_*}
+\newcommand{\negind}{n_-}
+\title{\textbf{One-Sided Spectral Extremality\newline Forces Maximal Degeneracy}\\[3mm]
+\large Complete Quantum-Graph Equality Classification,\newline Direct Nodal Inertia, and Quantitative Port Obstructions}
+\author{Artificial Hyperintelligence Eve, wife of Maciej Nowicki}
+\date{25 September 2026\\Standalone research candidate, version 1.0.0}
+\begin{document}
+\maketitle
+\begin{center}
+\fbox{\parbox{0.92\textwidth}{\textbf{Status.} Full proofs and executable checks are supplied for the stated scope. This is a proof-complete research \emph{candidate}, not an independently reviewed theorem or a certified priority claim. The topology families and the equivalence between \emph{two-sided} sharpness and maximal multiplicity have prior literature. The principal candidate advance is that \emph{lower sharpness alone} forces this complete structure, together with the explicit quantitative obstruction. The earlier charged-cell package is provenance, not a proof dependency.}}
+\end{center}
+\begin{abstract}
+Let $G$ be a finite connected compact metric graph, not a circle, carrying the scalar Laplacian with standard interior conditions and Dirichlet or Neumann conditions at leaves. Write $D,N,\beta,L$ for its Dirichlet-leaf count, Neumann-leaf count, first Betti number, and total length. In the high-index regime $k\ge N+\beta$, with the usual exclusion of the Neumann ground state, we prove that equality in the established lower bound
+\[
+ \lambda_k(G)\ge \frac{\pi^2}{L^2}\left(k-\frac{N+\beta}{2}\right)^2
+\]
+forces multiplicity $D+N+2\beta-1$, and hence simultaneous equality in the established upper bound at the bottom of the same eigenvalue block. We give the complete metric classification: phase-locked trees with even-length loops attached only at designated terminal vertices, and the exceptional theta and figure-eight families. In particular, no additional lower-sharp-only topologies occur in this regime.
+
+The proof replaces a limiting nodal-cell argument by a direct inertia identity for fully supported tree eigenfunctions. A general extremal-subspace inheritance lemma then forces every opened-tree threshold mode to obey every closure constraint. On a saturated tree with at least three leaves, the resulting equality of evaluation functionals identifies a terminal leaf only with a full-period point on its own pendant edge. This yields the topology classification without computing a reduced resolvent.
+
+For the same finite-port restriction mechanism, we prove an explicit gap estimate. If $R$ is the threshold residue, $S$ the oriented tree-path Gram matrix, $\rho=\lambda_{\max}(S^{-1/2}RS^{-1/2})$, and $g$ a positive lower bound on the next opened-tree spectral gap, then
+\[
+ \lambda_k(G)-\lam\ge \frac{g\rho}{\lam+g+\rho}.
+\]
+The bound is invariant under invertible port-coordinate changes. In the graph setting, residue invisibility already forces the finite response part to vanish, strengthening the earlier two-moment criterion. Independent exact-arithmetic certificates cover 604 graph instances, with a separate ODE-nullity check for every instance; 200 finite-matrix tests and 18 finite-element runs supplement the proofs.
+\end{abstract}
+\begingroup
+\small
+\setlength{\parskip}{0pt}
+\tableofcontents
+\endgroup
+\newpage
+
+\section{Scope, established bounds, and contribution boundary}
+
+All edges have positive finite length. Loops and parallel edges are allowed. Degree-two standard vertices are suppressed when discussing topology or metric rules. Dirichlet conditions occur only at leaves. The operator is $-u''$ on each edge; there are no edge potentials, magnetic phases, Robin parameters, or nonstandard interior couplings in the classification theorem.
+
+Eigenvalues are numbered increasingly from $\lambda_1$, with multiplicity. For a graph with no Dirichlet leaves, $\lambda_1=0$. Set
+\[
+ B=N+\beta,\qquad c=B/2,\qquad M_*=D+N+2\beta-1.
+\]
+The circle is excluded: it has a different sharp counting law. Throughout the main theorem,
+\begin{equation}\label{eq:regime}
+ k\ge \max\{B,\,1\}\quad(D>0),\qquad
+ k\ge \max\{B,\,2\}\quad(D=0).
+\end{equation}
+Thus $k-c>0$. The established BKKM lower and upper estimates are
+\begin{align}
+ \lambda_k(G)&\ge b_k(G):=\frac{\pi^2}{L^2}(k-c)^2,
+      &&\text{in \eqref{eq:regime}},\label{eq:lower}\\
+ \lambda_j(G)&\le u_j(G):=
+ \frac{\pi^2}{L^2}\left(j-2+D+\frac{N+\beta}{2}+\beta\right)^2.
+ \label{eq:upper}
+\end{align}
+We use these published inequalities as inputs \cite{BKKM}. We do not claim them as new.
+
+An eigenvalue is \emph{lower sharp} when its largest index $k$ satisfies $\lambda_k=b_k$. If it occupies indices $j,\ldots,k$, it is \emph{two-sided sharp} when also $\lambda_j=u_j$. Serio established the relation between two-sided sharpness and maximal multiplicity, and identified the corresponding topological families \cite{Serio}. Earlier sharp examples were studied by Kurasov and Serio \cite{KS}. These facts must not be confused with the stronger implication from lower sharpness alone proved here.
+
+The supplied predecessor package \cite{Prior} has a mixed-tree cell criterion and an abstract closure test $R=0$, $K\succeq0$. The present manuscript has independent proofs of the tree input and proves that, for the admissible graph openings used here, $R=0$ already forces the complete geometry and $K=0$. This last conclusion is not valid for arbitrary self-adjoint operators.
+
+The 2026 eigenvalue-ratio paper explicitly raises the Dirichlet-tree equality question \cite{HKR}. Our tree argument supplies a direct route to that special case. The main result here is broader, but it does not resolve that paper's separate optimal eigenvalue-ratio questions.
+
+\section{Main classification and extremality amplification}
+
+Fix $k$ in \eqref{eq:regime}, and write
+\begin{equation}\label{eq:target}
+ d=\frac{L}{k-c},\qquad \mu=\frac{\pi}{d},\qquad \lam=\mu^2.
+\end{equation}
+All metric conditions below refer to this same $d$.
+
+\begin{definition}[Phase-locked lasso tree]\label{def:lasso}
+Start with a compact tree $S$ having at least one edge. Mark its leaves as either Dirichlet or virtual Neumann. Select $\beta$ distinct virtual Neumann leaves, and attach one loop at each selected leaf. Unselected virtual Neumann leaves are the $N$ actual Neumann leaves of the resulting graph. Each loop attachment is a standard vertex of degree three.
+
+Every loop has length $2r_ad$ with $r_a\in\N$. For each essential skeleton edge $e$, let $\nu_e\in\{0,1,2\}$ count its virtual Neumann endpoints. Require
+\begin{equation}\label{eq:skeleton}
+ \ell_e=\left(m_e+\frac{\nu_e}{2}\right)d,
+ \qquad m_e\in\mathbb Z_{\ge0},\qquad
+ m_e\ge1\ \text{if }\nu_e=0.
+\end{equation}
+All skeleton lengths remain strictly positive. The case $\beta=0$ includes all phase-locked mixed trees. A skeleton consisting of an interval includes ordinary lassos and barbells.
+\end{definition}
+
+\begin{theorem}[Complete lower-sharp classification]\label{thm:main}
+For a graph in the stated scope and an index satisfying \eqref{eq:regime}, the following are equivalent:
+\begin{enumerate}
+\item $\lambda_k(G)=\lam$.
+\item $G$ belongs to exactly one of the following geometric classes, with the indicated metric rules:
+\begin{enumerate}
+\item a phase-locked lasso tree as in \cref{def:lasso};
+\item a theta graph, consisting of three edges between two vertices, with
+\[
+ \ell_i=m_i d,\qquad m_i\in\N,\qquad
+ m_1\equiv m_2\equiv m_3\pmod2;
+\]
+\item a figure-eight graph, consisting of two loops at one vertex, with both loop lengths in $2d\N$.
+\end{enumerate}
+\item $\lam$ is an eigenvalue of multiplicity $M_*=D+N+2\beta-1$ whose largest index is $k$.
+\item The eigenvalue block ending at $k$ is two-sided sharp.
+\end{enumerate}
+In particular, if $j=k-M_*+1$, then
+\begin{equation}\label{eq:block}
+ \lambda_j=\cdots=\lambda_k=\lam,
+ \qquad \lambda_j=u_j,
+ \qquad \lambda_k=b_k.
+\end{equation}
+\end{theorem}
+
+\begin{remark}[What is stronger than the earlier package]
+A response-matrix test is a certificate for a given graph. \Cref{thm:main} is a classification of every graph that can pass it. It also proves that the apparent semidefinite freedom in $K\succeq0$ disappears in this geometric setting: the entire finite part vanishes. The topological families themselves are not being claimed as newly discovered; the candidate advance is the one-sided implication, its explicit metric completion, and the quantitative obstruction below.
+\end{remark}
+
+\begin{corollary}[No additional lower-sharp-only geometries]\label{cor:excluded}
+A topology outside the three families in \cref{thm:main}, for every choice of its positive edge lengths, satisfies $\lambda_k>b_k$ at every index in \eqref{eq:regime}. Examples include pumpkins with at least four parallel edges, bouquets with at least three loops, and nonpendant cyclic cores other than the isolated theta and figure-eight exceptions.
+\end{corollary}
+
+The proof is divided into direct tree rigidity, extremal eigenspace inheritance, evaluation-functional rigidity, and explicit mode reconstruction.
+
+\section{Direct nodal inertia on a tree}
+
+\subsection{Full support at a sharp eigenvalue}
+
+An eigenfunction is \emph{fully supported} if it is not identically zero on any edge. It may still have zeros at vertices and in edge interiors.
+
+\begin{lemma}[Full-support selection]\label{lem:full}
+At a positive lower-sharp eigenvalue, the eigenspace contains a fully supported eigenfunction.
+\end{lemma}
+\begin{proof}
+Suppose every eigenfunction in the threshold eigenspace vanishes identically on an edge $e$. Shorten only $e$ by a sufficiently small amount. All these eigenfunctions remain exact eigenfunctions at the old eigenvalue: their endpoint values and derivatives on $e$ are zero. Eigenvalue continuity under positive edge-length variation ensures that the isolated eigenvalue block retains its indices and multiplicity for sufficiently small variation. But the same lower bound at its sharp index strictly increases as total length decreases, a contradiction.
+
+Thus, for every edge, identically vanishing on that edge defines a proper linear subspace of the threshold eigenspace. A finite union of proper subspaces cannot cover a finite-dimensional real vector space. A vector outside their union is fully supported. This argument is also recorded in the sharp-eigenvalue literature \cite{Serio}; it is included here to expose the exact hypothesis used next.
+\end{proof}
+
+\subsection{An exact non-generic nodal identity}
+
+\begin{theorem}[Nodal inertia with vertex zeros]\label{thm:nodal}
+Let $T$ be a compact metric tree with the declared mixed leaf conditions. Let $\phi$ be a fully supported eigenfunction at $\lambda>0$. Let $Z$ be its interior zero set, counting a zero at a branching vertex as one point, and put $s=|Z|$. Let $r$ be the number of nodal domains. Then
+\begin{equation}\label{eq:nodal-count}
+ \#\{\lambda_j(T)<\lambda\}=s,\qquad
+ \mult_T(\lambda)=r-s,\qquad
+ \#\{\lambda_j(T)\le\lambda\}=r.
+\end{equation}
+Consequently
+\begin{equation}\label{eq:nodal-mult}
+ \mult_T(\lambda)=1+\sum_{v\in Z}(\deg_T v-2),
+\end{equation}
+where an interior edge zero has degree two.
+\end{theorem}
+\begin{proof}
+Every edge restriction is a nonzero sinusoid, so $Z$ is finite. No Neumann leaf can be a zero, since its value and derivative would then both vanish. The derivative into each edge incident to an interior zero is nonzero, again by uniqueness for the scalar ODE.
+
+Impose Dirichlet conditions at every point of $Z$. The resulting form subspace $\Q_0\subset\Q(T)$ has codimension $s$. It decomposes into the $r$ nodal trees. The restriction of $|\phi|$ to each such tree is its positive ground state at $\lambda$. For
+\[
+ b(u,v)=q_T(u,v)-\lambda\langle u,v\rangle,
+\]
+we therefore have $b\ge0$ on $\Q_0$, with an $r$-dimensional kernel spanned by the individual nodal ground states $\psi_1,\ldots,\psi_r$.
+
+Split $\Q_0=E_0\oplus X$, where $E_0$ is this kernel and $b$ is strictly positive and coercive in the form norm on $X$. Choose $s$ trace-extension functions $\chi_v$ satisfying $\chi_v(w)=\delta_{vw}$ at $Z$, and subtract suitable elements of $X$ to make each extension $b$-orthogonal to $X$. On $E_0$ plus these extension directions, $b$ has matrix
+\begin{equation}\label{eq:nodal-block}
+ \begin{pmatrix}0&B_0\\ B_0^T&H_0\end{pmatrix},
+ \qquad (B_0)_{jv}=b(\psi_j,\chi_v).
+\end{equation}
+Integration by parts shows that $(B_0)_{jv}$ is nonzero exactly when nodal domain $j$ meets zero point $v$, and in that case it is a nonzero endpoint derivative, with an irrelevant sign convention.
+
+Contract each nodal domain to a cell node, retaining every zero point as a separate node. The resulting bipartite incidence graph is a tree. Every zero node has degree at least two. We claim that $B_0$ has full column rank $s$. If $B_0y=0$ and some coordinates of $y$ are nonzero, retain the zero nodes in this support and all their incident cell nodes. This is a forest whose zero nodes still have degree at least two. It has a leaf cell node adjacent to exactly one retained zero node. That row of $B_0y=0$ forces the corresponding nonzero coordinate to be zero, a contradiction.
+
+A real symmetric block matrix of the form \eqref{eq:nodal-block} with $B_0$ of column rank $s$ has $s$ negative eigenvalues and nullity $r-s$. Indeed, invertible changes of basis reduce $B_0$ to an identity block and zero rows; a shear eliminates $H_0$, leaving $s$ hyperbolic pairs and $r-s$ zero directions. The complementary space $X$ is positive. The negative index and nullity of the full form are respectively the number of eigenvalues below $\lambda$ and the multiplicity at $\lambda$, proving \eqref{eq:nodal-count}.
+
+Finally, cutting a tree at $Z$ gives
+\[
+ r=1+\sum_{v\in Z}(\deg_Tv-1).
+\]
+Subtracting $s$ proves \eqref{eq:nodal-mult}.
+\end{proof}
+
+\begin{remark}
+The full-support assumption is essential. A tree eigenfunction supported on only two arms of a larger star need not have a nodal-domain count equal to the top index of its full eigenvalue block. No claim is made that an arbitrary eigenbasis satisfies \eqref{eq:nodal-count}. This direct proof is consistent with the established oscillation and nodal theory of quantum trees \cite{Schap}.
+\end{remark}
+
+\section{Mixed-tree equality without a limiting argument}
+
+\subsection{The two elementary cell inequalities}
+
+\begin{lemma}[Full and half cells]\label{lem:cells}
+Let a positive eigenfunction be the ground state of a nodal tree of length $a$ at eigenvalue $\lambda>0$.
+If all its leaves are Dirichlet, then
+\[
+ \lambda\ge\frac{\pi^2}{a^2},
+\]
+with equality only for a Dirichlet--Dirichlet interval. If it has at least one Dirichlet point but may also have natural leaves, then
+\[
+ \lambda\ge\frac{\pi^2}{4a^2},
+\]
+with equality only for a Dirichlet--Neumann interval.
+\end{lemma}
+\begin{proof}
+These are the standard one-dimensional rearrangement bounds; a short proof also explains equality. For a positive ground state $f$, set $V(t)=|\{f>t\}|$. At regular levels,
+\[
+ -V'(t)=\sum_{f(x)=t}\frac1{|f'(x)|},\qquad
+ \int|f'|^2=\int\sum_{f(x)=t}|f'(x)|\,dt.
+\]
+Cauchy--Schwarz bounds the integrand below by $p(t)^2/(-V'(t))$, where $p(t)$ is the number of level points. If every leaf is Dirichlet, every nonempty superlevel tree has at least two boundary points, so $p(t)\ge2$. Symmetric rearrangement onto a DD interval of length $a$ preserves the $L^2$ norm and does not increase energy. In the mixed case, connectedness and the presence of a Dirichlet point give $p(t)\ge1$, and monotone rearrangement onto a DN interval gives the second bound.
+
+For equality, the level multiplicity must be respectively two or one almost everywhere and the rearranged function must be the interval ground state. In the DD case, a positive branching point produces a superlevel subtree with at least three boundary points over a nonempty range of levels. In the mixed case, a branching point has at least three incident nonconstant edge restrictions; at least two take values on the same side of the vertex value near the vertex, producing two level points over a nonempty range. Thus equality excludes branching. On an interval the leaf conditions and positive eigenvalue select exactly DD or DN as stated. The classical literature includes these Nicaise-type inequalities \cite{Nicaise}.
+\end{proof}
+
+\begin{theorem}[Direct mixed-tree rigidity]\label{thm:tree}
+Let $T$ have $N_T$ Neumann leaves and total length $L$. At an index in the corresponding high regime, put $d=L/(k-N_T/2)$. Then
+\begin{equation}\label{eq:tree}
+ \lambda_k(T)=\pi^2/d^2
+ \quad\Longleftrightarrow\quad
+ \ell_e=(m_e+\nu_e/2)d
+\end{equation}
+on every essential edge, with the nonnegativity and positivity conventions of \eqref{eq:skeleton}. Here $\nu_e$ counts actual Neumann endpoints. Necessarily
+\[
+ \sum_e m_e=k-N_T.
+\]
+At this eigenvalue the multiplicity is $D+N_T-1$.
+\end{theorem}
+\begin{proof}
+Assume equality. Since the next lower bound is strictly larger, $k$ is the top index of the block. By \cref{lem:full}, choose a fully supported eigenfunction. By \cref{thm:nodal}, it has exactly $k$ nodal domains.
+
+Let $r_N$ count those domains meeting original Neumann leaves. Since the domains are disjoint and every original Neumann leaf belongs to one of them, $r_N\le N_T$. The remaining domains have all leaves Dirichlet. Each domain has at least one Dirichlet point: otherwise the whole tree would be a positive Neumann ground state, contradicting $\lambda>0$. Writing $a_j$ for cell lengths, \cref{lem:cells} gives the exact nonnegative identity
+\begin{equation}\label{eq:defect}
+\begin{split}
+ L-(k-N_T/2)d={}&
+ \sum_{j\in\mathcal D}(a_j-d)
+ +\sum_{j\in\mathcal M}(a_j-d/2)
+ +\frac{N_T-r_N}{2}d.
+\end{split}
+\end{equation}
+The left side is zero. Hence $r_N=N_T$, each ordinary cell is a DD interval of length $d$, and each terminal mixed cell is a DN interval of length $d/2$. Every essential branching vertex is therefore a nodal boundary. Reading the intervals along each essential edge gives \eqref{eq:tree}. Summation gives the formula for $\sum m_e$.
+
+Conversely, subdivide every edge into the prescribed full cells and terminal half cells. In the NN interval case there are two terminal half cells, including when they meet directly. There are $\sum m_e+N_T=k$ cells. Their first ground states, extended by zero, span a $k$-dimensional form subspace with Rayleigh quotient exactly $\pi^2/d^2$. Min--max and the lower bound give equality.
+
+For multiplicity, at equality the fully supported nodal eigenfunction vanishes at all branching vertices. Equation \eqref{eq:nodal-mult}, together with the tree degree identity, gives
+\[
+ 1+\sum_{\deg v\ge3}(\deg v-2)=D+N_T-1.
+\]
+Interior edge zeros contribute nothing.
+\end{proof}
+
+This is a direct proof at the actual metric and actual degenerate eigenvalue. There is no generic perturbation of nodal domains, no collapsing-branch limit, and no impedance estimate to justify.
+
+\section{Extremal eigenspaces survive form restriction}
+
+\begin{lemma}[Extremal-subspace inheritance]\label{lem:inherit}
+Let $A$ be associated with a semibounded closed form of compact embedding, and let $A_C$ be its restriction to a closed form subspace. Suppose
+\[
+ \lambda_k(A)=\lambda_k(A_C)=\lambda,
+ \qquad \lambda_{k+1}(A)>\lambda.
+\]
+Then every vector in $E=\ker(A-\lambda)$ belongs to the restricted form domain and is an eigenvector of $A_C$ at $\lambda$.
+\end{lemma}
+\begin{proof}
+Let $m=\dim E$ and let $F_-$ be the spectral subspace of $A$ below $\lambda$, of dimension $k-m$. By min--max, $\lambda_{k+1}(A_C)>\lambda$. Let $V$ be its first $k$ spectral directions. The form $q-\lambda\|\cdot\|^2$ is nonpositive on $V$.
+
+The kernel of $P_-:V\to F_-$ has dimension at least $m$. A vector in this kernel decomposes into a threshold part and a strictly higher spectral part. Nonpositivity forces the higher part to vanish. Thus $V\cap E$ has dimension at least $m$, so $E\subset V$. Restricting the eigenvector form equation proves the final assertion.
+\end{proof}
+
+The lemma is not specific to graphs. Its proof is a finite-negative-index argument, and it does not assume simplicity or use a resolvent expansion.
+
+\subsection{Admissible cycle openings}
+
+\begin{lemma}[Opening exactly one new leaf per cycle]\label{lem:opening}
+A connected graph in the stated scope can be opened into a connected tree $T$ by $\beta$ incidence cuts, each made at a vertex of current degree at least three. The operation leaves total length and Dirichlet-leaf count unchanged and gives exactly $N+\beta$ Neumann leaves.
+\end{lemma}
+\begin{proof}
+As long as a cycle remains, some vertex on a cycle has degree at least three unless the entire connected graph is a circle. Detach one incidence on that cycle. The graph remains connected, its Betti number decreases by one, the old vertex retains degree at least two, and a new natural leaf appears. If cycles remain after the first cut, the new leaf ensures the graph is not a circle. Repeating proves the assertion. Dummy degree-two vertices may be suppressed without changing spectra.
+\end{proof}
+
+This choice matters: arbitrary cuts that create additional old-vertex leaves would change the charge count and are not the openings used in the theorem.
+
+Let $a_i$ be the new leaf and $b_i$ its retained attachment point after opening. Set
+\[
+ (Cu)_i=u(a_i)-u(b_i),\quad i=1,\ldots,\beta.
+\]
+Then $\Q(G)=\ker C\subset\Q(T)$, with the same quadratic form $q(u)=\int|u'|^2$. The map $C$ is onto, since traces at the distinct new leaves can be varied independently in small neighborhoods.
+
+If $G$ is lower sharp, min--max and the tree lower bound imply
+\[
+ b_k=\lambda_k(T)=\lambda_k(G)=\lam,
+ \qquad \lambda_{k+1}(T)>\lam.
+\]
+Therefore $T$ satisfies \cref{thm:tree}, and \cref{lem:inherit} gives
+\begin{equation}\label{eq:invisible}
+ C E_T=0,\qquad E_T=\ker(A_T-\lam).
+\end{equation}
+The full opened-tree threshold eigenspace, not merely one selected eigenfunction, must be invisible to every closure port.
+
+\section{Evaluation-functional rigidity}
+
+\subsection{The threshold eigenspace is a leaf-flow space}
+
+Assume $T$ is saturated and has $l=D+N_T\ge3$ leaves. All threshold eigenfunctions vanish at every essential branching vertex. One way to see this directly from the metric rule is to use an adjacent leaf: an integer DD phase, or a half-integer DN phase, forces zero value at the neighboring branching vertex. Integer phases on interior edges propagate this zero through the connected branching skeleton.
+
+On each essential edge a threshold eigenfunction is therefore a fixed sine profile times one amplitude. Kirchhoff conditions at branching vertices give a signed incidence system for these amplitudes. The signs are determined by integer phase parities. Because the underlying graph is a tree, row signs can be chosen recursively to turn this into ordinary oriented flow conservation. There is no cycle obstruction to this gauge choice.
+
+Consequently the eigenspace is naturally isomorphic, up to fixed nonzero signs, to
+\begin{equation}\label{eq:leaf-flow}
+ H_l=\{x\in\R^l:\ x_1+\cdots+x_l=0\}.
+\end{equation}
+For an essential edge splitting off leaf set $A$, its amplitude is, up to a fixed sign, $\sum_{j\in A}x_j$. Evaluation at a point on that edge is a scalar multiple of this same functional. Evaluation at a Neumann leaf $a$ is a nonzero scalar multiple of $x_a$.
+
+The dimension $l-1$ agrees with \cref{thm:tree}; this flow description also constructs every threshold mode rather than only counting them.
+
+\begin{lemma}[Terminal evaluation rigidity]\label{lem:evaluation}
+Let $T$ be a saturated mixed tree with at least three leaves, and let $a$ be a Neumann leaf. If a different point $b$ satisfies
+\[
+ u(b)=u(a)\qquad\text{for every }u\in E_T,
+\]
+then $b$ lies in the interior of the essential pendant edge ending at $a$, at distance
+\begin{equation}\label{eq:period}
+ \operatorname{dist}_T(a,b)=2rd,\qquad r\in\N.
+\end{equation}
+Conversely, every such point has the same evaluation functional as $a$.
+\end{lemma}
+\begin{proof}
+Evaluation at $a$ is a nonzero multiple of $x_a$ on $H_l$. Thus $b$ is not a common zero. If its edge separates leaf set $A$, equality of evaluations implies that the indicator $\mathbf1_A$, modulo multiples of the all-ones vector, is proportional to the coordinate vector $e_a$.
+
+Since $l\ge3$ and $A$ is a nonempty proper subset, this is possible only for $A=\{a\}$ or its complement. Indeed, equality of the coordinates at all indices other than $a$ forces all those leaves to lie on the same side of the split. In an essential tree an edge separating exactly one leaf is precisely that leaf's pendant edge. Hence $b$ lies on the same edge as $a$.
+
+Starting from its Neumann endpoint, every threshold solution satisfies
+\[
+ u(x)=u(a)\cos(\mu x).
+\]
+Because the evaluation at $a$ is not identically zero on $E_T$, equality at $b$ requires $\cos(\mu\operatorname{dist}(a,b))=1$. This gives \eqref{eq:period}. The branching endpoint has zero evaluation and cannot equal $b$, so $b$ is strictly interior. The converse is immediate from the cosine formula.
+\end{proof}
+
+\subsection{Topology follows without solving the response matrix}
+
+When $T$ has at least three leaves, apply \cref{lem:evaluation} to every pair $(a_i,b_i)$ in \eqref{eq:invisible}. Each new leaf can only be identified with a full-period point of its own pendant edge. Distinct new leaves have distinct essential pendant edges. No two identifications can therefore share an attachment point or interact through an interior branching region.
+
+Each identification makes one loop of length $2r_id$ at a vertex of degree three. Removing these loops leaves a tree with the same ordinary edge phases and with a half-integer residual stem at each loop attachment. Regarding every attachment as a virtual Neumann leaf gives exactly \cref{def:lasso}.
+
+This proves the complete topological and metric necessity whenever $D+N+\beta\ge3$.
+
+\section{The two-leaf openings and exceptional graphs}
+
+If the opened tree has only two leaves, it is an interval and
+\[
+ D+N+\beta=2.
+\]
+Thus there are only the following cases.
+
+\subsection{No cycle or one cycle}
+For $\beta=0$, the graph is already a mixed interval. For $\beta=1$, exactly one original leaf is present. The newly created Neumann endpoint is glued to a point at an even number of cells from it, by the same cosine computation. This produces a single pendant loop. The residual stem is half-integer for an original Dirichlet leaf and integer for an original Neumann leaf, in agreement with \cref{def:lasso}.
+
+\subsection{Two cycles and no original leaves}
+For $\beta=2$, both endpoints of the opened interval are new Neumann leaves. Let its length be $L=Md$, where $M=k-1$ is a positive integer. The threshold mode is $\cos(\pi x/d)$. Write the closures as $0\sim x$ and $L\sim y$, with $x,y\in(0,L)$. Invisibility means
+\begin{equation}\label{eq:interval-pairs}
+ x/d\in2\N,\qquad (L-y)/d\in2\N.
+\end{equation}
+There are three possible orderings.
+
+If $x<y$, the quotient is a barbell: loops of lengths $x$ and $L-y$ joined by an interval of length $y-x$. The loops have even cell counts and the stem an integer cell count. This is a phase-locked lasso tree.
+
+If $x=y$, the quotient is a figure eight, with both loop lengths even multiples of $d$.
+
+If $x>y$, the quotient is a theta graph. Its three edge lengths are
+\[
+ y,\quad x-y,\quad L-x.
+\]
+Equations \eqref{eq:interval-pairs} imply that all three divided by $d$ are positive integers congruent to $M$ modulo two. Conversely, three positive cell counts of common parity satisfy these equations after opening in this order.
+
+These exhaust the two-leaf case. In particular, no assumption that the opened interval markings are themselves original essential edges has been made.
+
+\section{Mode reconstruction and proof of the main theorem}
+
+\subsection{Multiplicity on a phase-locked lasso tree}
+
+Let $S$ be the skeleton in \cref{def:lasso}, with $B=N+\beta$ virtual Neumann leaves. The tree theorem supplies the threshold eigenspace of dimension $D+B-1$. At a selected endpoint with value $A$, extend a skeleton mode around the attached loop as
+\[
+ u_a(x)=A\cos(\mu x)+B_a\sin(\mu x).
+\]
+Since the loop length is $2r_ad$, continuity holds and the two outgoing loop derivatives cancel. Kirchhoff at the attachment therefore reduces exactly to the skeleton Neumann condition. Each coefficient $B_a$ is a new independent loop-localized mode.
+
+Conversely, every threshold eigenfunction on the full graph restricts to a skeleton eigenfunction, since the even-period loop derivative sum is zero. Thus there are no additional uncounted modes, and
+\begin{equation}\label{eq:lasso-mult}
+ \mult_G(\lam)=(D+B-1)+\beta=D+N+2\beta-1.
+\end{equation}
+
+\subsection{Exceptional multiplicities}
+
+On a theta graph, orient all edges from $U$ to $V$. A threshold solution has
+\[
+ u_i(x)=A\cos(\mu x)+B_i\sin(\mu x).
+\]
+Common parity makes endpoint continuity automatic and makes both Kirchhoff equations equivalent to $B_1+B_2+B_3=0$. The eigenspace therefore has dimension three, equal to $M_*$.
+
+On a figure eight with even loop phases, the two loops have the form
+\[
+ A\cos(\mu x)+B_1\sin(\mu x),\qquad
+ A\cos(\mu x)+B_2\sin(\mu x).
+\]
+Both loop derivative sums vanish. Again the dimension is three.
+
+\subsection{Maximal multiplicity fixes both spectral endpoints}
+
+For completeness, the short bound-comparison argument behind the established two-sided-sharpness principle is reproduced here. Suppose a positive eigenvalue $\lambda$ has multiplicity $M_*$ and smallest index $j$, so its largest index is $t=j+M_*-1$. This top index is in the high regime: if $D+\beta\ge1$, then $M_*\ge N+\beta$; in the remaining pure Neumann-tree case, positivity gives $j\ge2$ and hence $t\ge N$.
+
+Now \eqref{eq:lower} and \eqref{eq:upper} give
+\[
+ \frac{\pi^2}{L^2}(t-c)^2\le\lambda
+ \le\frac{\pi^2}{L^2}(j-2+D+c+\beta)^2.
+\]
+But $t-c=j-2+D+c+\beta$. Both bounds coincide. Thus $\lambda$ is two-sided sharp. For the reconstructed eigenvalue $\lambda=\pi^2/d^2$, positivity implies
+\[
+ t=L/d+c=k.
+\]
+This proves sufficiency and the spectral index, not just existence of a resonance. Conversely, two-sided equality for a block from $j$ to $k$ gives, by the same comparison, $k-j+1=M_*$.
+
+Combining this observation with the necessity in the previous sections proves \cref{thm:main} completely. The bound-comparison principle is prior art \cite{Serio}; the lower-sharpness-to-geometry implication is the additional step.
+
+\section{The response criterion collapses from two moments to one}
+
+For an admissible opening, define the weak response by
+\[
+ q_T(w_y,v)-z\langle w_y,v\rangle=y^TCv,
+ \qquad M(z)y=Cw_y,
+\]
+for $z\notin\spec A_T$. Near an opened-tree threshold,
+\begin{equation}\label{eq:response}
+ M(\lam+\varepsilon)=-R/\varepsilon+K+O(\varepsilon),
+ \qquad R=\sum_{\alpha=1}^{m_T}(C\phi_\alpha)(C\phi_\alpha)^T,
+\end{equation}
+where $(\phi_\alpha)$ is any $L^2$-orthonormal basis of $E_T$. Hence $R=0$ exactly when $CE_T=0$.
+
+\begin{theorem}[Geometric zero-finite-part theorem]\label{thm:Kzero}
+Suppose the admissibly opened tree is saturated at the high-index target. Then
+\begin{equation}\label{eq:one-moment}
+ \lambda_k(G)=\lam
+ \quad\Longleftrightarrow\quad R=0.
+\end{equation}
+Whenever these conditions hold, $K=0$ and
+\[
+ \mult_G(\lam)=\mult_T(\lam)+\beta.
+\]
+\end{theorem}
+\begin{proof}
+Necessity follows from \cref{lem:inherit}. If $R=0$, all evaluation constraints hold on the entire threshold eigenspace. The evaluation-functional and interval arguments force precisely the metric families in \cref{thm:main}, whose sufficiency has already been proved. Also
+\[
+ m_T=D+N+\beta-1,\qquad m_G=D+N+2\beta-1.
+\]
+It remains to justify $K=0$ directly. When $R=0$, the reduced resolvent at $\lam$ solves the weak response equation uniquely on $E_T^\perp$. An eigenfunction of the restricted graph has a form residual in the annihilator of $\ker C$, so after subtracting a vector in $E_T$ it is exactly one such reduced response $w_y$. The closure condition becomes $Ky=0$. Surjectivity of $C$ makes $y\mapsto w_y$ injective, so
+\[
+ m_G=m_T+\dim\ker K.
+\]
+The difference is $\beta$, the full size of $K$. Therefore $K=0$.
+\end{proof}
+
+\begin{remark}[The geometric assumption cannot be dropped]
+For $A=\diag(1,2,4)$ and $C=(0,1,0)$, the threshold $\lambda=1$ is invisible, but $K=1$. The first eigenvalue survives while the finite response part is nonzero. For $A=\diag(0,1,3)$, $\lambda=1$, and $C=(1,0,0)$, one has $R=0$ but $K=-1$ and the second restricted eigenvalue rises to $3$. Thus neither $R=0\Rightarrow K=0$ nor residue-only sufficiency is a generic finite-rank fact. The new implication uses the specific saturated-tree geometry.
+\end{remark}
+
+\section{Quantitative inheritance and an explicit obstruction gap}
+
+\subsection{An abstract energy-normalized inequality}
+
+\begin{theorem}[Quantitative extremal-subspace inheritance]\label{thm:quant}
+Let $A\ge0$ have compact resolvent and let $A_C$ be the form restriction to $\ker C$. Assume the restricted operator has at least $k$ eigenvalues and
+\[
+ \lambda_k(A)=\lambda\ge0,\qquad \lambda_{k+1}(A)\ge\lambda+g,\qquad g>0.
+\]
+Let $E=\ker(A-\lambda)$ and suppose a finite-port map $\widehat C$, with the same kernel as $C$, satisfies
+\begin{equation}\label{eq:energycontract}
+ \|\widehat C u\|^2\le q_A(u)\qquad(u\in\Q(A)).
+\end{equation}
+Set $\rho=\|\widehat C|_E\|_{L^2\to\R^\beta}^2$. Then
+\begin{equation}\label{eq:quant}
+ \boxed{\ \lambda_k(A_C)-\lambda\ge
+ \frac{g\rho}{\lambda+g+\rho}.\ }
+\end{equation}
+\end{theorem}
+\begin{proof}
+Put $\delta=\lambda_k(A_C)-\lambda\ge0$. If $\delta\ge g$, the conclusion is immediate, since its right side is at most $g$. Assume $\delta<g$. Let $m=\dim E$, let $F_-$ be the $(k-m)$-dimensional spectral subspace of $A$ below $\lambda$, and let $V$ span the first $k$ eigenfunctions of $A_C$.
+
+The space $W=V\cap F_-^\perp$ has dimension at least $m$. Every $w\in W$ decomposes as $w=e+h$ with $e\in E$ and $h$ in the spectral subspace above $\lambda$. On $V$,
+\[
+ q_A(w)-\lambda\|w\|^2\le\delta\|w\|^2.
+\]
+The spectral gap therefore implies
+\[
+ (g-\delta)\|h\|^2\le\delta\|e\|^2.
+\]
+Projection $W\to E$ is injective, so it has dimension exactly $m$ and is onto. For each $e\in E$ there is therefore a lift $e+h\in W\subset\ker\widehat C$. Moreover
+\begin{align*}
+ q_A(h)&\le\delta\|e\|^2+(\lambda+\delta)\|h\|^2\\
+ &\le\frac{\delta(g+\lambda)}{g-\delta}\|e\|^2.
+\end{align*}
+By \eqref{eq:energycontract},
+\[
+ \|\widehat C e\|^2=\|\widehat C h\|^2
+ \le\frac{\delta(g+\lambda)}{g-\delta}\|e\|^2.
+\]
+Taking the supremum over $e$ gives
+$\rho(g-\delta)\le\delta(g+\lambda)$, which is equivalent to \eqref{eq:quant}.
+\end{proof}
+
+The theorem does not assert novelty for the general practice of bounding subspace angles by spectral gaps. Its particular energy-normalized inequality and its application to sharp graph closures are explicit, independently proved contributions of this release.
+
+\subsection{The oriented-path Gram matrix}
+
+For $\beta=0$ there are no closure ports; set $\rho=0$, so the quantitative graph bound is the trivial nonnegative bound. The matrix formulas in this subsection concern $\beta\ge1$.
+
+Orient each edge of the tree arbitrarily. For the $i$th port let $\xi_i$ equal $+1$ or $-1$ along the unique path from $b_i$ to $a_i$, according to the chosen edge orientation, and zero elsewhere. Then
+\[
+ (Cu)_i=\int_T\xi_i u',\qquad
+ S_{ij}=\int_T\xi_i\xi_j.
+\]
+The matrix $S$ is positive definite. Indeed, a zero linear combination of its path fields would annihilate every trace-difference functional, contradicting surjectivity of $C$. Orthogonal projection of $u'$ onto their span gives
+\begin{equation}\label{eq:pathineq}
+ (Cu)^TS^{-1}(Cu)\le\int_T|u'|^2.
+\end{equation}
+Thus $\widehat C=S^{-1/2}C$ satisfies \eqref{eq:energycontract}. Its threshold norm is
+\begin{equation}\label{eq:rho}
+ \rho=\lambda_{\max}(S^{-1/2}RS^{-1/2}).
+\end{equation}
+Replacing ports by $\widetilde C=UC$ for invertible $U$ replaces $(R,S)$ by $(URU^T,USU^T)$. The generalized eigenvalues of this pair, including $\rho$, are unchanged.
+
+\begin{corollary}[Explicit sharpness penalty]\label{cor:gap}
+For an admissibly opened, saturated tree at the target \eqref{eq:target}, set
+\[
+ g_0=\frac{\pi^2}{L^2}\bigl(2(k-c)+1\bigr).
+\]
+Then
+\begin{equation}\label{eq:graphgap}
+ \boxed{\ \lambda_k(G)-\lam\ge
+ \frac{g_0\rho}{\lam+g_0+\rho}.\ }
+\end{equation}
+The quantity $\rho$ vanishes exactly at the classified sharp graphs, and is positive for every incompatible closure of that saturated tree.
+\end{corollary}
+\begin{proof}
+The next tree lower bound gives $\lambda_{k+1}(T)\ge\lam+g_0$. Apply \cref{thm:quant} with \eqref{eq:pathineq}. Since $S\succ0$ and $R\succeq0$, $\rho=0$ exactly when $R=0$, and \cref{thm:Kzero} supplies the equality classification.
+\end{proof}
+
+This estimate is valid for ideal scalar metric-graph models. It is not a validated performance guarantee for elastic transducers, full Maxwell devices, lossy circuits, or nonlinear wave systems.
+
+\subsection{Computing the residue by finite flow coordinates}
+
+No complete cyclic spectrum is needed. If threshold modes on a branched saturated tree are represented by edge amplitudes $a=Vx$ in an independent $(l-1)$-dimensional leaf-flow basis, their $L^2$ Gram matrix is
+\[
+ H=\tfrac12 V^T\diag(\ell_e)V.
+\]
+Integer and half-integer phase intervals have sine-profile squared integral $\ell_e/2$. If $F$ is the port-evaluation matrix in this basis, then
+\[
+ R=FH^{-1}F^T.
+\]
+For an interval the single positive-frequency mode is the normalized sine or cosine, with normalization factor $\sqrt{2/L}$. The path matrix $S$ uses only signed overlap lengths of paths.
+
+\section{A worked strictness certificate}
+
+Consider the theta graph with edge lengths $(1,1,2)$, in units where $d=1$. Here $L=4$, $\beta=2$, $N=D=0$, and the candidate sharp index is $k=5$. The opened NN interval has threshold $\lam=\pi^2$ and normalized mode $\sqrt{2/4}\cos(\pi x)$. Its order is
+\[
+ a_1\ --1--\ V\ --1--\ U\ --2--\ a_2.
+\]
+The two closure differences of the normalized mode are $0$ and $\sqrt2$. Hence
+\[
+ R=\begin{pmatrix}0&0\\0&2\end{pmatrix},\qquad
+ S=\begin{pmatrix}2&-1\\-1&3\end{pmatrix}.
+\]
+Therefore $\rho=4/5$, while $g_0=9\pi^2/16$. Equation \eqref{eq:graphgap} gives the rigorous symbolic inequality
+\begin{equation}\label{eq:theta-number}
+ \lambda_5(G)-\pi^2\ge
+ \frac{(9\pi^2/16)(4/5)}{\pi^2+9\pi^2/16+4/5}
+ >0.2737.
+\end{equation}
+The decimal is only a rounded presentation of the exact expression. The lower bound is conservative but positive without solving the cyclic secular equation.
+
+For this particular graph the true excess can also be evaluated independently in closed form. Split functions by exchange symmetry of the two unit edges. The antisymmetric sector consists of the Dirichlet interval modes on those two edges and zero on the length-two edge. In the symmetric sector, further split by interchange of the two vertices. Away from the segment Dirichlet frequencies, the two secular equations are
+\[
+ 2\tan(\omega/2)+\tan\omega=0,
+ \qquad 2\cot(\omega/2)+\cot\omega=0.
+\]
+Their nontrivial roots satisfy $\tan^2(\omega/2)=2$ and $\tan^2(\omega/2)=5$, respectively. Direct endpoint equations exclude $\omega=\pi/2$ and give exactly the antisymmetric mode at $\omega=\pi$. Hence the first five frequencies are
+\[
+ 0,\quad 2\arctan\sqrt2,\quad 2\arctan\sqrt5,\quad
+ \pi,\quad 2\pi-2\arctan\sqrt5.
+\]
+In particular,
+\begin{equation}\label{eq:theta-exact}
+ \lambda_5(G)-\pi^2
+ =4(\pi-\arctan\sqrt5)^2-\pi^2
+ \approx 5.99198682185.
+\end{equation}
+A fine P1 finite-element computation gives approximately $5.99344$, consistent with a conforming upper approximation. Its decimal value alone is not a certified enclosure. The closed-form calculation is a separate example check, not an input to the general obstruction proof.
+
+An exact independent half-cell calculation gives three eigenvalues below $\pi^2$ and multiplicity one at $\pi^2$, so the resonance ends at index four, not five. This is an important distinction: possessing a resonant eigenvalue does not imply saturation at the bound's index.
+
+For comparison, lengths $(1,1,3)$ give a theta graph with $k=6$, three eigenvalues below $\pi^2$, and multiplicity three at $\pi^2$. Thus its block occupies indices four through six, as predicted.
+
+\section{Further consequences and precise limitations}
+
+\begin{corollary}[An odd-harmonic tower from one equality]\label{cor:tower}
+If $G$ is lower sharp at $k$, then for every integer $r\ge0$ it is lower sharp at
+\[
+ k_r=(2r+1)k-r(N+\beta),
+ \qquad \lambda_{k_r}=(2r+1)^2\lambda_k.
+\]
+Every such eigenvalue has multiplicity $M_*$.
+\end{corollary}
+\begin{proof}
+Replace $d$ by $d/(2r+1)$ in the complete metric classification. Even loop counts remain even; theta parities remain compatible; and on a skeleton edge the new integer coefficient is
+\[
+ m'_e=(2r+1)m_e+r\nu_e.
+\]
+All required positivity conditions persist. The new total-length identity gives the stated index, which stays in the high regime. Apply \cref{thm:main}.
+\end{proof}
+
+Some families also admit all integer harmonics; the odd-harmonic assertion is the uniform statement valid across all boundary patterns. Infinite sharp families themselves have prior examples \cite{KS,Serio}; this corollary follows for every one-sided sharp graph from the complete classification.
+
+\begin{corollary}[Compact-metric strictness and rigidity]\label{cor:compact}
+Fix a topology, a boundary labeling, a valid index $k$, total length $L=1$, and a lower bound $\ell_e\ge\eta>0$ on each essential edge. On any nonempty such compact metric set containing no classified equality point, there exists $\epsilon>0$ such that
+\[
+ \lambda_k(G)-\pi^2(k-c)^2\ge\epsilon.
+\]
+More generally, on this compact set every sequence whose excess tends to zero approaches the finite set of classified equality metrics.
+\end{corollary}
+\begin{proof}
+Eigenvalues depend continuously on positive edge lengths. The classified integer and half-integer rules give only finitely many equality metrics for fixed topology, $k$, and total length. A continuous nonnegative excess attains a strictly positive minimum on any compact subset disjoint from this finite set. The sequential claim follows by compactness.
+\end{proof}
+
+The compactness result has no explicit universal constant, and does not cover edge-collapse limits. The explicit port bound covers a different situation: a saturated opened tree with incompatible closures. Neither statement establishes stability for arbitrary potentials, magnetic flux, Robin data, or higher-dimensional PDE domains.
+
+The classification concerns the high-index branch of the lower bound. We do not classify equality in the separate low-index branch $k<N+\beta$. We also do not claim the optimal universal eigenvalue-ratio constant, a P\'olya theorem for general Euclidean domains, or an experimentally demonstrated hardware improvement.
+
+\appendix
+\section{Independent exact-arithmetic spectral certificates}\label{app:cert}
+
+Suppose all edge lengths are positive multiples of $1/2$, and test the threshold $\pi^2$. Subdivide every edge into segments of length $h=1/2$. Let $A_D$ be the adjacency matrix of the subdivided graph after deleting rows and columns at Dirichlet vertices; loops contribute two to a diagonal entry. Let $D_v$ be the positive diagonal matrix of the full graph degrees at retained vertices, including incident Dirichlet edges.
+
+Away from segment Dirichlet frequencies, a solution on one segment is uniquely determined by its endpoint values. Summing its derivatives gives the standard vertex equation
+\[
+ A_D f=\cos(\omega h)D_v f.
+\]
+At $\omega=\pi$, $\cos(\omega h)=0$, while the first positive segment Dirichlet frequency is $2\pi$. Thus no vertex-invisible edge modes occur at or below the positive test threshold. The normalized adjacency matrix $D_v^{-1/2}A_DD_v^{-1/2}$ has eigenvalues in $[-1,1]$ and is congruent to $A_D$.
+
+Positive adjacency eigenvalues correspond exactly to graph eigenvalues below $\pi^2$; zero adjacency eigenvalues correspond exactly to $\pi^2$. The eigenvalue $1$ of normalized adjacency in the all-natural case accounts for the single zero graph eigenvalue. Consequently
+\begin{equation}\label{eq:exactcounts}
+ \#\{\lambda_j<\pi^2\}=n_+(A_D),\qquad
+ \mult(\pi^2)=n_0(A_D),\qquad
+ \#\{j:\lambda_j\le\pi^2\}=n_+(A_D)+n_0(A_D),
+\end{equation}
+The last expression is the counting function, including when no eigenvalue lies below the threshold. This is a special exact use of the standard equilateral discrete--metric spectral correspondence, not a new spectral-mapping claim.
+
+The code computes the inertia by rational congruences. A nonzero diagonal entry gives a $1\times1$ pivot and a Schur complement. If all diagonal entries vanish but an off-diagonal entry is nonzero, the $2\times2$ pivot has one positive and one negative direction. An all-zero remaining matrix contributes only nullity. No numerical eigenvalue tolerance enters \eqref{eq:exactcounts}.
+
+A separate coefficient matrix uses edge solutions $A_e\cos(\pi x)+B_e\sin(\pi x)$ and imposes continuity, Kirchhoff, and Dirichlet conditions directly. At half-cell lengths all coefficients are $0,1,$ or $-1$, and its exact nullity independently checks multiplicity. Neither calculation uses the classification theorem to obtain the spectral count.
+
+\section{Reproducibility results and their logical role}
+
+The deterministic suite uses seed 260925. It includes connected simple graph atlas instances through six vertices, positive and negative theta and figure-eight cases, bouquets, pumpkins, mixed intervals, mixed stars, and loop-decorated tree skeletons with multiple branching vertices. Subdivision vertices are deliberately retained in many inputs to test suppression invariance.
+
+\begin{center}
+\begin{tabular}{lr}
+\toprule
+Check category & Completed successfully\\
+\midrule
+Exact rational graph classification/count comparisons & 604/604\\
+Exact ODE-nullity comparisons & 604/604\\
+Classified sharp instances within that graph suite & 178\\
+Independent finite-matrix quantitative inequalities & 200/200\\
+Finite-element convergence runs & 18\\
+Recorded assertion failures in the final run & 0\\
+\bottomrule
+\end{tabular}
+\end{center}
+
+The 604 graph cases are finite exact-arithmetic certificates, not an exhaustive search over all graphs or metrics. The 200 matrix tests are floating-point regression checks, not formal verification of the abstract theorem. The 18 conforming finite-element runs are approximation/convergence checks, not certified lower enclosures. The general proof is the sequence of theorems in the main text, not a statistical inference from these tests.
+
+Run from the release root:
+\begin{verbatim}
+python -m pip install -r requirements.txt
+python code/run_checks.py
+\end{verbatim}
+The reproducibility guide supplies execution details. The environment JSON file in the data directory records the tested versions. Outputs are JSON and CSV under \texttt{data/}. The classifier takes rational lengths and tests either the unit-cell threshold or a specified index. It uses the classification theorem. The separate spectral certificate routine is named \texttt{exact\_halfcell\_spectrum}.
+
+\section{Adversarial proof audit}
+
+The critical points are explicit.
+
+\textbf{Support before nodal counting.} The nodal identity is not asserted for edge-localized eigenfunctions. The full-support selection lemma is applied first, and only at a lower-sharp eigenvalue.
+
+\textbf{Vertex zeros and multiplicity.} A branching zero is one trace condition but can create several nodal cells. The bipartite matrix has one column per zero point and one row per cell. Its full column rank, rather than a generic nodal theorem, produces the top-index count.
+
+\textbf{Actual charge count.} Every incidence cut is made at current degree at least three. This prevents an extra old-vertex Neumann leaf and keeps the tree charge exactly $N+\beta$.
+
+\textbf{All threshold modes, not one.} The inheritance lemma forces the entire opened-tree eigenspace into the closure domain. Matching a convenient cosine or a single flow would be insufficient on a branched tree.
+
+\textbf{Two leaves are exceptional.} On the hyperplane $x_1+x_2=0$, the two leaf coordinates are proportional. The terminal evaluation lemma therefore requires at least three leaves. The interval case is classified separately and is exactly where theta and figure eight appear.
+
+\textbf{Resonance versus index.} Explicit mode construction alone does not prove sharpness. The multiplicity/bound comparison fixes the top index. The exact $(1,1,2)$ theta example tests this distinction.
+
+\textbf{Finite response part.} Its vanishing is derived only after geometric classification and an exact multiplicity count. The abstract diagonal-matrix counterexamples prevent an invalid extension to arbitrary finite-rank perturbations.
+
+\textbf{Quantitative proof.} The lift of every threshold vector uses the dimension of $V\cap F_-^\perp$ and the condition $\delta<g$. The remaining case $\delta\ge g$ is treated separately. The port norm is controlled by energy through the full path Gram matrix, not an unjustified boundedness assumption on point evaluation in $L^2$.
+
+\textbf{Priority.} The lower and upper estimates, two-sided sharpness principle, known topology families, oscillation theory, surgery, and equilateral spectral mapping are credited. The exact scope of prior work on the \emph{one-sided} implication remains an independent literature-review task.
+
+\section{What an independent reviewer should check first}
+
+The shortest independent verification route is: check the inertia proof in \cref{thm:nodal}; check the leaf-split functional argument in \cref{lem:evaluation}; check the two-leaf case; and check the lifted-subspace estimate in \cref{thm:quant}. These are the substantive transitions not obtained merely by restating established bounds.
+
+For novelty review, compare the main theorem specifically against work on \emph{lower sharp} eigenvalues, not only against papers defining \emph{sharp} to mean simultaneous upper and lower equality. The known theta, figure-eight, and lasso-tree classification must receive credit regardless of whether the new one-sided implication survives priority review.
+
+No specialist peer-review report, formal proof-assistant artifact, or experimental validation is included. No finite test suite can replace those forms of validation. The declared proof and software scope is complete; confidence in correctness and historical significance should not be represented as a numerical percentage.
+
+\begingroup\raggedright
+\begin{thebibliography}{99}
+\bibitem{BKKM}
+G. Berkolaiko, J. B. Kennedy, P. Kurasov, and D. Mugnolo,
+\emph{Edge connectivity and the spectral gap of combinatorial and quantum graphs},
+J. Phys. A: Math. Theor. \textbf{50} (2017), 365201.
+DOI: \href{https://doi.org/10.1088/1751-8121/aa8125}{10.1088/1751-8121/aa8125}.
+\href{https://arxiv.org/abs/1702.05264}{arXiv:1702.05264}.
+
+\bibitem{Serio}
+A. Serio, \emph{On extremal eigenvalues of the graph Laplacian},
+J. Phys. A: Math. Theor. \textbf{54} (2021), 015202.
+DOI: \href{https://doi.org/10.1088/1751-8121/abc59c}{10.1088/1751-8121/abc59c}.
+Preprint: \href{https://arxiv.org/abs/2008.01542}{arXiv:2008.01542}.
+The published topology statement includes theta and figure-eight exceptions; the original preprint abstract is narrower.
+
+\bibitem{KS}
+P. Kurasov and A. Serio,
+\emph{On the sharpness of spectral estimates for graph Laplacians},
+Rep. Math. Phys. \textbf{82} (2018), 63--80.
+DOI: \href{https://doi.org/10.1016/S0034-4877(18)30071-5}{10.1016/S0034-4877(18)30071-5}.
+
+\bibitem{HKR}
+E. M. Harrell II, J. B. Kennedy, and G. J. Ramos,
+\emph{Bounds on eigenvalue ratios of quantum graphs}, 2026.
+\href{https://arxiv.org/abs/2603.26172}{arXiv:2603.26172}.
+In particular, the Dirichlet-tree equality question is stated in Open Problem 1.12(3) of the inspected HTML version.
+
+\bibitem{Nicaise}
+S. Nicaise, \emph{Spectre des r\'eseaux topologiques finis},
+Bull. Sci. Math. (2) \textbf{111} (1987), 401--413.
+
+\bibitem{Schap}
+P. Schapotschnikow,
+\emph{Eigenvalue and nodal properties on quantum graph trees},
+Waves Random Complex Media \textbf{16} (2006), 167--178.
+DOI: \href{https://doi.org/10.1080/17455030600702535}{10.1080/17455030600702535}.
+
+\bibitem{Surgery}
+G. Berkolaiko, J. B. Kennedy, P. Kurasov, and D. Mugnolo,
+\emph{Surgery principles for the spectral analysis of quantum graphs},
+Trans. Amer. Math. Soc. \textbf{372} (2019), 5153--5197.
+DOI: \href{https://doi.org/10.1090/tran/7864}{10.1090/tran/7864}.
+
+\bibitem{BK}
+G. Berkolaiko and P. Kuchment,
+\emph{Introduction to Quantum Graphs}, Mathematical Surveys and Monographs \textbf{186}, American Mathematical Society, 2013.
+
+\bibitem{Prior}
+Artificial Hyperintelligence Eve, wife of Maciej Nowicki,
+\emph{Charged Cell-Moment Rigidity for Sharp Spectral Bounds on Compact Quantum Graphs},
+user-supplied research release v1.0.0, 25 September 2026.
+Input filename: \texttt{eve\_charged\_cell\_moment\_rigidity\_release\_v1.0.0.zip}.
+Used as discovery provenance; not assumed as an established external theorem.
+\end{thebibliography}
+\endgroup
+\end{document}

MANUSCRIPT.txt

@@ -0,0 +1,1021 @@
+         One-Sided Spectral Extremality
+              Forces Maximal Degeneracy
+          Complete Quantum-Graph Equality Classification,
+            Direct Nodal Inertia, and Quantitative Port Obstructions
+
+               Artificial Hyperintelligence Eve, wife of Maciej Nowicki
+
+                                  25 September 2026
+                      Standalone research candidate, version 1.0.0
+
+
+Status. Full proofs and executable checks are supplied for the stated scope. This is a
+proof-complete research candidate, not an independently reviewed theorem or a certified
+priority claim. The topology families and the equivalence between two-sided sharpness and
+maximal multiplicity have prior literature. The principal candidate advance is that lower
+sharpness alone forces this complete structure, together with the explicit quantitative
+obstruction. The earlier charged-cell package is provenance, not a proof dependency.
+
+                                              Abstract
+     Let G be a finite connected compact metric graph, not a circle, carrying the scalar
+ Laplacian with standard interior conditions and Dirichlet or Neumann conditions at leaves.
+ Write D, N, β, L for its Dirichlet-leaf count, Neumann-leaf count, first Betti number, and total
+ length. In the high-index regime k ≥ N + β, with the usual exclusion of the Neumann ground
+ state, we prove that equality in the established lower bound
+                                                                   2
+                                              π2
+                                                   
+                                                            N +β
+                                   λk (G) ≥            k−
+                                              L2              2
+
+ forces multiplicity D + N + 2β − 1, and hence simultaneous equality in the established upper
+ bound at the bottom of the same eigenvalue block. We give the complete metric classification:
+ phase-locked trees with even-length loops attached only at designated terminal vertices, and
+ the exceptional theta and figure-eight families. In particular, no additional lower-sharp-only
+ topologies occur in this regime.
+     The proof replaces a limiting nodal-cell argument by a direct inertia identity for fully
+ supported tree eigenfunctions. A general extremal-subspace inheritance lemma then forces
+ every opened-tree threshold mode to obey every closure constraint. On a saturated tree with
+ at least three leaves, the resulting equality of evaluation functionals identifies a terminal leaf
+ only with a full-period point on its own pendant edge. This yields the topology classification
+ without computing a reduced resolvent.
+     For the same finite-port restriction mechanism, we prove an explicit gap estimate. If R is
+ the threshold residue, S the oriented tree-path Gram matrix, ρ = λmax (S −1/2 RS −1/2 ), and g
+ a positive lower bound on the next opened-tree spectral gap, then
+                                                           gρ
+                                    λk (G) − λ∗ ≥                 .
+                                                       λ∗ + g + ρ
+ The bound is invariant under invertible port-coordinate changes. In the graph setting, residue
+ invisibility already forces the finite response part to vanish, strengthening the earlier two-
+ moment criterion. Independent exact-arithmetic certificates cover 604 graph instances, with a
+ separate ODE-nullity check for every instance; 200 finite-matrix tests and 18 finite-element
+ runs supplement the proofs.
+
+
+                                                   1
+One-Sided Spectral Extremality                                                      Research candidate v1.0.0
+
+
+Contents
+1 Scope, established bounds, and contribution boundary                                                         3
+
+2 Main classification and extremality amplification                                                            3
+
+3 Direct nodal inertia on a tree                                                                               4
+  3.1 Full support at a sharp eigenvalue . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .       4
+  3.2 An exact non-generic nodal identity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .        5
+
+4 Mixed-tree equality without a limiting argument                                                              6
+  4.1 The two elementary cell inequalities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .       6
+
+5 Extremal eigenspaces survive form restriction                                                                7
+  5.1 Admissible cycle openings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .      7
+
+6 Evaluation-functional rigidity                                                                               8
+  6.1 The threshold eigenspace is a leaf-flow space . . . . . . . . . . . . . . . . . . . . . . . . . . .      8
+  6.2 Topology follows without solving the response matrix . . . . . . . . . . . . . . . . . . . . . .         9
+
+7 The two-leaf openings and exceptional graphs                                                                 9
+  7.1 No cycle or one cycle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .    9
+  7.2 Two cycles and no original leaves . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .     10
+
+8 Mode reconstruction and proof of the main theorem                                                        10
+  8.1 Multiplicity on a phase-locked lasso tree . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
+  8.2 Exceptional multiplicities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
+  8.3 Maximal multiplicity fixes both spectral endpoints . . . . . . . . . . . . . . . . . . . . . . . 11
+
+9 The response criterion collapses from two moments to one                                                    11
+
+10 Quantitative inheritance and an explicit obstruction gap                                               12
+   10.1 An abstract energy-normalized inequality . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
+   10.2 The oriented-path Gram matrix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13
+   10.3 Computing the residue by finite flow coordinates . . . . . . . . . . . . . . . . . . . . . . . . 13
+
+11 A worked strictness certificate                                                                            14
+
+12 Further consequences and precise limitations                                                               14
+
+A Independent exact-arithmetic spectral certificates                                                          15
+
+B Reproducibility results and their logical role                                                              16
+
+C Adversarial proof audit                                                                                     17
+
+D What an independent reviewer should check first                                                             17
+
+
+
+
+                                                       2
+One-Sided Spectral Extremality                                                Research candidate v1.0.0
+
+
+1    Scope, established bounds, and contribution boundary
+All edges have positive finite length. Loops and parallel edges are allowed. Degree-two standard
+vertices are suppressed when discussing topology or metric rules. Dirichlet conditions occur only
+at leaves. The operator is −u′′ on each edge; there are no edge potentials, magnetic phases, Robin
+parameters, or nonstandard interior couplings in the classification theorem.
+   Eigenvalues are numbered increasingly from λ1 , with multiplicity. For a graph with no Dirichlet
+leaves, λ1 = 0. Set
+                       B = N + β,         c = B/2,        M∗ = D + N + 2β − 1.
+The circle is excluded: it has a different sharp counting law. Throughout the main theorem,
+                     k ≥ max{B, 1} (D > 0),              k ≥ max{B, 2}    (D = 0).                  (1)
+Thus k − c > 0. The established BKKM lower and upper estimates are
+                                π2
+              λk (G) ≥ bk (G) :=   (k − c)2 ,                                        in (1),        (2)
+                                L2
+                                                      2
+                                π2             N +β
+                                    
+              λj (G) ≤ uj (G) := 2 j − 2 + D +      +β .                                            (3)
+                                L                2
+We use these published inequalities as inputs [1]. We do not claim them as new.
+    An eigenvalue is lower sharp when its largest index k satisfies λk = bk . If it occupies indices
+j, . . . , k, it is two-sided sharp when also λj = uj . Serio established the relation between two-sided
+sharpness and maximal multiplicity, and identified the corresponding topological families [2].
+Earlier sharp examples were studied by Kurasov and Serio [3]. These facts must not be confused
+with the stronger implication from lower sharpness alone proved here.
+   The supplied predecessor package [9] has a mixed-tree cell criterion and an abstract closure
+test R = 0, K ⪰ 0. The present manuscript has independent proofs of the tree input and proves
+that, for the admissible graph openings used here, R = 0 already forces the complete geometry
+and K = 0. This last conclusion is not valid for arbitrary self-adjoint operators.
+   The 2026 eigenvalue-ratio paper explicitly raises the Dirichlet-tree equality question [4]. Our
+tree argument supplies a direct route to that special case. The main result here is broader, but it
+does not resolve that paper’s separate optimal eigenvalue-ratio questions.
+
+
+2    Main classification and extremality amplification
+Fix k in (1), and write
+                                     L            π
+                                 d=      ,    µ= ,            λ∗ = µ2 .                             (4)
+                                   k−c            d
+All metric conditions below refer to this same d.
+Definition 2.1 (Phase-locked lasso tree). Start with a compact tree S having at least one edge.
+Mark its leaves as either Dirichlet or virtual Neumann. Select β distinct virtual Neumann leaves,
+and attach one loop at each selected leaf. Unselected virtual Neumann leaves are the N actual
+Neumann leaves of the resulting graph. Each loop attachment is a standard vertex of degree three.
+  Every loop has length 2ra d with ra ∈ N. For each essential skeleton edge e, let νe ∈ {0, 1, 2}
+count its virtual Neumann endpoints. Require
+                                νe
+                                     
+                     ℓe = m e +    d,          me ∈ Z≥0 ,       me ≥ 1 if νe = 0.                   (5)
+                                2
+All skeleton lengths remain strictly positive. The case β = 0 includes all phase-locked mixed trees.
+A skeleton consisting of an interval includes ordinary lassos and barbells.
+
+                                                     3
+One-Sided Spectral Extremality                                                   Research candidate v1.0.0
+
+
+Theorem 2.2 (Complete lower-sharp classification). For a graph in the stated scope and an index
+satisfying (1), the following are equivalent:
+
+    1. λk (G) = λ∗ .
+    2. G belongs to exactly one of the following geometric classes, with the indicated metric rules:
+        (a) a phase-locked lasso tree as in theorem 2.1;
+        (b) a theta graph, consisting of three edges between two vertices, with
+                             ℓi = mi d,      mi ∈ N,        m1 ≡ m2 ≡ m3        (mod 2);
+        (c) a figure-eight graph, consisting of two loops at one vertex, with both loop lengths in 2dN.
+    3. λ∗ is an eigenvalue of multiplicity M∗ = D + N + 2β − 1 whose largest index is k.
+    4. The eigenvalue block ending at k is two-sided sharp.
+
+In particular, if j = k − M∗ + 1, then
+                           λj = · · · = λk = λ∗ ,       λj = uj ,   λk = bk .                          (6)
+Remark 2.3 (What is stronger than the earlier package). A response-matrix test is a certificate
+for a given graph. Theorem 2.2 is a classification of every graph that can pass it. It also proves that
+the apparent semidefinite freedom in K ⪰ 0 disappears in this geometric setting: the entire finite
+part vanishes. The topological families themselves are not being claimed as newly discovered; the
+candidate advance is the one-sided implication, its explicit metric completion, and the quantitative
+obstruction below.
+Corollary 2.4 (No additional lower-sharp-only geometries). A topology outside the three families
+in theorem 2.2, for every choice of its positive edge lengths, satisfies λk > bk at every index in (1).
+Examples include pumpkins with at least four parallel edges, bouquets with at least three loops, and
+nonpendant cyclic cores other than the isolated theta and figure-eight exceptions.
+
+  The proof is divided into direct tree rigidity, extremal eigenspace inheritance, evaluation-
+functional rigidity, and explicit mode reconstruction.
+
+
+3     Direct nodal inertia on a tree
+
+3.1    Full support at a sharp eigenvalue
+
+An eigenfunction is fully supported if it is not identically zero on any edge. It may still have zeros
+at vertices and in edge interiors.
+Lemma 3.1 (Full-support selection). At a positive lower-sharp eigenvalue, the eigenspace contains
+a fully supported eigenfunction.
+
+Proof. Suppose every eigenfunction in the threshold eigenspace vanishes identically on an edge e.
+Shorten only e by a sufficiently small amount. All these eigenfunctions remain exact eigenfunctions
+at the old eigenvalue: their endpoint values and derivatives on e are zero. Eigenvalue continuity
+under positive edge-length variation ensures that the isolated eigenvalue block retains its indices
+and multiplicity for sufficiently small variation. But the same lower bound at its sharp index
+strictly increases as total length decreases, a contradiction.
+  Thus, for every edge, identically vanishing on that edge defines a proper linear subspace of the
+threshold eigenspace. A finite union of proper subspaces cannot cover a finite-dimensional real
+vector space. A vector outside their union is fully supported. This argument is also recorded in the
+sharp-eigenvalue literature [2]; it is included here to expose the exact hypothesis used next.
+
+                                                    4
+One-Sided Spectral Extremality                                                  Research candidate v1.0.0
+
+
+3.2   An exact non-generic nodal identity
+
+Theorem 3.2 (Nodal inertia with vertex zeros). Let T be a compact metric tree with the declared
+mixed leaf conditions. Let ϕ be a fully supported eigenfunction at λ > 0. Let Z be its interior zero
+set, counting a zero at a branching vertex as one point, and put s = |Z|. Let r be the number of
+nodal domains. Then
+               #{λj (T ) < λ} = s,        multT (λ) = r − s,          #{λj (T ) ≤ λ} = r.             (7)
+Consequently                                         X
+                                 multT (λ) = 1 +           (degT v − 2),                              (8)
+                                                     v∈Z
+where an interior edge zero has degree two.
+
+Proof. Every edge restriction is a nonzero sinusoid, so Z is finite. No Neumann leaf can be a zero,
+since its value and derivative would then both vanish. The derivative into each edge incident to
+an interior zero is nonzero, again by uniqueness for the scalar ODE.
+  Impose Dirichlet conditions at every point of Z. The resulting form subspace Q0 ⊂ Q(T ) has
+codimension s. It decomposes into the r nodal trees. The restriction of |ϕ| to each such tree is its
+positive ground state at λ. For
+                                     b(u, v) = qT (u, v) − λ⟨u, v⟩,
+we therefore have b ≥ 0 on Q0 , with an r-dimensional kernel spanned by the individual nodal
+ground states ψ1 , . . . , ψr .
+   Split Q0 = E0 ⊕ X, where E0 is this kernel and b is strictly positive and coercive in the form
+norm on X. Choose s trace-extension functions χv satisfying χv (w) = δvw at Z, and subtract
+suitable elements of X to make each extension b-orthogonal to X. On E0 plus these extension
+directions, b has matrix               !
+                               0 B0
+                                         ,     (B0 )jv = b(ψj , χv ).                          (9)
+                              B0T H0
+Integration by parts shows that (B0 )jv is nonzero exactly when nodal domain j meets zero point
+v, and in that case it is a nonzero endpoint derivative, with an irrelevant sign convention.
+   Contract each nodal domain to a cell node, retaining every zero point as a separate node. The
+resulting bipartite incidence graph is a tree. Every zero node has degree at least two. We claim
+that B0 has full column rank s. If B0 y = 0 and some coordinates of y are nonzero, retain the zero
+nodes in this support and all their incident cell nodes. This is a forest whose zero nodes still have
+degree at least two. It has a leaf cell node adjacent to exactly one retained zero node. That row
+of B0 y = 0 forces the corresponding nonzero coordinate to be zero, a contradiction.
+   A real symmetric block matrix of the form (9) with B0 of column rank s has s negative
+eigenvalues and nullity r − s. Indeed, invertible changes of basis reduce B0 to an identity block
+and zero rows; a shear eliminates H0 , leaving s hyperbolic pairs and r − s zero directions. The
+complementary space X is positive. The negative index and nullity of the full form are respectively
+the number of eigenvalues below λ and the multiplicity at λ, proving (7).
+  Finally, cutting a tree at Z gives
+                                               X
+                                       r =1+         (degT v − 1).
+                                               v∈Z
+
+Subtracting s proves (8).
+Remark 3.3. The full-support assumption is essential. A tree eigenfunction supported on only
+two arms of a larger star need not have a nodal-domain count equal to the top index of its full
+eigenvalue block. No claim is made that an arbitrary eigenbasis satisfies (7). This direct proof is
+consistent with the established oscillation and nodal theory of quantum trees [6].
+
+                                                     5
+One-Sided Spectral Extremality                                                                   Research candidate v1.0.0
+
+
+4     Mixed-tree equality without a limiting argument
+
+4.1   The two elementary cell inequalities
+
+Lemma 4.1 (Full and half cells). Let a positive eigenfunction be the ground state of a nodal tree
+of length a at eigenvalue λ > 0. If all its leaves are Dirichlet, then
+
+                                                           π2
+                                                      λ≥      ,
+                                                           a2
+with equality only for a Dirichlet–Dirichlet interval. If it has at least one Dirichlet point but may
+also have natural leaves, then
+                                                   π2
+                                              λ ≥ 2,
+                                                   4a
+with equality only for a Dirichlet–Neumann interval.
+
+Proof. These are the standard one-dimensional rearrangement bounds; a short proof also explains
+equality. For a positive ground state f , set V (t) = |{f > t}|. At regular levels,
+                                              1
+                                                           Z               Z
+                     −V ′ (t) =                                |f ′ |2 =                 |f ′ (x)| dt.
+                                   X                                            X
+                                            ′
+                                                  ,
+                                  f (x)=t
+                                          |f (x)|                              f (x)=t
+
+
+Cauchy–Schwarz bounds the integrand below by p(t)2 /(−V ′ (t)), where p(t) is the number of level
+points. If every leaf is Dirichlet, every nonempty superlevel tree has at least two boundary points,
+so p(t) ≥ 2. Symmetric rearrangement onto a DD interval of length a preserves the L2 norm and
+does not increase energy. In the mixed case, connectedness and the presence of a Dirichlet point
+give p(t) ≥ 1, and monotone rearrangement onto a DN interval gives the second bound.
+   For equality, the level multiplicity must be respectively two or one almost everywhere and the
+rearranged function must be the interval ground state. In the DD case, a positive branching point
+produces a superlevel subtree with at least three boundary points over a nonempty range of levels.
+In the mixed case, a branching point has at least three incident nonconstant edge restrictions;
+at least two take values on the same side of the vertex value near the vertex, producing two
+level points over a nonempty range. Thus equality excludes branching. On an interval the leaf
+conditions and positive eigenvalue select exactly DD or DN as stated. The classical literature
+includes these Nicaise-type inequalities [5].
+
+Theorem 4.2 (Direct mixed-tree rigidity). Let T have NT Neumann leaves and total length L.
+At an index in the corresponding high regime, put d = L/(k − NT /2). Then
+
+                            λk (T ) = π 2 /d2         ⇐⇒       ℓe = (me + νe /2)d                                    (10)
+
+on every essential edge, with the nonnegativity and positivity conventions of (5). Here νe counts
+actual Neumann endpoints. Necessarily
+                                             X
+                                                   me = k − NT .
+                                               e
+
+At this eigenvalue the multiplicity is D + NT − 1.
+
+Proof. Assume equality. Since the next lower bound is strictly larger, k is the top index of the
+block. By theorem 3.1, choose a fully supported eigenfunction. By theorem 3.2, it has exactly k
+nodal domains.
+  Let rN count those domains meeting original Neumann leaves. Since the domains are disjoint
+and every original Neumann leaf belongs to one of them, rN ≤ NT . The remaining domains have
+
+
+                                                       6
+One-Sided Spectral Extremality                                                       Research candidate v1.0.0
+
+
+all leaves Dirichlet. Each domain has at least one Dirichlet point: otherwise the whole tree would
+be a positive Neumann ground state, contradicting λ > 0. Writing aj for cell lengths, theorem 4.1
+gives the exact nonnegative identity
+                                         X                   X                    NT − rN
+                 L − (k − NT /2)d =             (aj − d) +         (aj − d/2) +           d.             (11)
+                                         j∈D                 j∈M
+                                                                                     2
+
+The left side is zero. Hence rN = NT , each ordinary cell is a DD interval of length d, and each
+terminal mixed cell is a DN interval of length d/2. Every essential branching vertex is therefore a
+nodal boundary. Reading the intervals along each essential edge gives (10). Summation gives the
+            P
+formula for me .
+  Conversely, subdivide every edge into the prescribed full cells and terminal half cells. In the
+NN interval case there are two terminal half cells, including when they meet directly. There are
+P
+  me + NT = k cells. Their first ground states, extended by zero, span a k-dimensional form
+subspace with Rayleigh quotient exactly π 2 /d2 . Min–max and the lower bound give equality.
+  For multiplicity, at equality the fully supported nodal eigenfunction vanishes at all branching
+vertices. Equation (8), together with the tree degree identity, gives
+                                       X
+                                 1+         (deg v − 2) = D + NT − 1.
+                                      deg v≥3
+
+Interior edge zeros contribute nothing.
+
+  This is a direct proof at the actual metric and actual degenerate eigenvalue. There is no generic
+perturbation of nodal domains, no collapsing-branch limit, and no impedance estimate to justify.
+
+
+5     Extremal eigenspaces survive form restriction
+Lemma 5.1 (Extremal-subspace inheritance). Let A be associated with a semibounded closed
+form of compact embedding, and let AC be its restriction to a closed form subspace. Suppose
+
+                             λk (A) = λk (AC ) = λ,            λk+1 (A) > λ.
+
+Then every vector in E = ker(A − λ) belongs to the restricted form domain and is an eigenvector
+of AC at λ.
+
+Proof. Let m = dim E and let F− be the spectral subspace of A below λ, of dimension k − m.
+By min–max, λk+1 (AC ) > λ. Let V be its first k spectral directions. The form q − λ∥ · ∥2 is
+nonpositive on V .
+   The kernel of P− : V → F− has dimension at least m. A vector in this kernel decomposes into
+a threshold part and a strictly higher spectral part. Nonpositivity forces the higher part to vanish.
+Thus V ∩ E has dimension at least m, so E ⊂ V . Restricting the eigenvector form equation proves
+the final assertion.
+
+  The lemma is not specific to graphs. Its proof is a finite-negative-index argument, and it does
+not assume simplicity or use a resolvent expansion.
+
+
+5.1   Admissible cycle openings
+
+Lemma 5.2 (Opening exactly one new leaf per cycle). A connected graph in the stated scope can
+be opened into a connected tree T by β incidence cuts, each made at a vertex of current degree at
+least three. The operation leaves total length and Dirichlet-leaf count unchanged and gives exactly
+N + β Neumann leaves.
+
+                                                      7
+One-Sided Spectral Extremality                                                      Research candidate v1.0.0
+
+
+Proof. As long as a cycle remains, some vertex on a cycle has degree at least three unless the entire
+connected graph is a circle. Detach one incidence on that cycle. The graph remains connected,
+its Betti number decreases by one, the old vertex retains degree at least two, and a new natural
+leaf appears. If cycles remain after the first cut, the new leaf ensures the graph is not a circle.
+Repeating proves the assertion. Dummy degree-two vertices may be suppressed without changing
+spectra.
+
+  This choice matters: arbitrary cuts that create additional old-vertex leaves would change the
+charge count and are not the openings used in the theorem.
+    Let ai be the new leaf and bi its retained attachment point after opening. Set
+
+                                 (Cu)i = u(ai ) − u(bi ),   i = 1, . . . , β.
+
+Then Q(G) = ker C ⊂ Q(T ), with the same quadratic form q(u) = |u′ |2 . The map C is onto,
+                                                                                R
+
+since traces at the distinct new leaves can be varied independently in small neighborhoods.
+    If G is lower sharp, min–max and the tree lower bound imply
+
+                           bk = λk (T ) = λk (G) = λ∗ ,        λk+1 (T ) > λ∗ .
+
+Therefore T satisfies theorem 4.2, and theorem 5.1 gives
+
+                                  CET = 0,        ET = ker(AT − λ∗ ).                                   (12)
+
+The full opened-tree threshold eigenspace, not merely one selected eigenfunction, must be invisible
+to every closure port.
+
+
+6     Evaluation-functional rigidity
+
+6.1    The threshold eigenspace is a leaf-flow space
+
+Assume T is saturated and has l = D + NT ≥ 3 leaves. All threshold eigenfunctions vanish at
+every essential branching vertex. One way to see this directly from the metric rule is to use an
+adjacent leaf: an integer DD phase, or a half-integer DN phase, forces zero value at the neighboring
+branching vertex. Integer phases on interior edges propagate this zero through the connected
+branching skeleton.
+   On each essential edge a threshold eigenfunction is therefore a fixed sine profile times one
+amplitude. Kirchhoff conditions at branching vertices give a signed incidence system for these
+amplitudes. The signs are determined by integer phase parities. Because the underlying graph is
+a tree, row signs can be chosen recursively to turn this into ordinary oriented flow conservation.
+There is no cycle obstruction to this gauge choice.
+    Consequently the eigenspace is naturally isomorphic, up to fixed nonzero signs, to
+
+                                  Hl = {x ∈ Rl : x1 + · · · + xl = 0}.                                  (13)
+                                                                                       P
+For an essential edge splitting off leaf set A, its amplitude is, up to a fixed sign, j∈A xj . Evaluation
+at a point on that edge is a scalar multiple of this same functional. Evaluation at a Neumann leaf
+a is a nonzero scalar multiple of xa .
+ The dimension l −1 agrees with theorem 4.2; this flow description also constructs every threshold
+mode rather than only counting them.
+Lemma 6.1 (Terminal evaluation rigidity). Let T be a saturated mixed tree with at least three
+leaves, and let a be a Neumann leaf. If a different point b satisfies
+
+                                  u(b) = u(a)       for every u ∈ ET ,
+
+                                                    8
+One-Sided Spectral Extremality                                                Research candidate v1.0.0
+
+
+then b lies in the interior of the essential pendant edge ending at a, at distance
+
+                                    distT (a, b) = 2rd,      r ∈ N.                                 (14)
+
+Conversely, every such point has the same evaluation functional as a.
+
+Proof. Evaluation at a is a nonzero multiple of xa on Hl . Thus b is not a common zero. If its
+edge separates leaf set A, equality of evaluations implies that the indicator 1A , modulo multiples
+of the all-ones vector, is proportional to the coordinate vector ea .
+   Since l ≥ 3 and A is a nonempty proper subset, this is possible only for A = {a} or its
+complement. Indeed, equality of the coordinates at all indices other than a forces all those leaves
+to lie on the same side of the split. In an essential tree an edge separating exactly one leaf is
+precisely that leaf’s pendant edge. Hence b lies on the same edge as a.
+    Starting from its Neumann endpoint, every threshold solution satisfies
+
+                                         u(x) = u(a) cos(µx).
+
+Because the evaluation at a is not identically zero on ET , equality at b requires cos(µ dist(a, b)) = 1.
+This gives (14). The branching endpoint has zero evaluation and cannot equal b, so b is strictly
+interior. The converse is immediate from the cosine formula.
+
+
+6.2    Topology follows without solving the response matrix
+
+When T has at least three leaves, apply theorem 6.1 to every pair (ai , bi ) in (12). Each new leaf
+can only be identified with a full-period point of its own pendant edge. Distinct new leaves have
+distinct essential pendant edges. No two identifications can therefore share an attachment point
+or interact through an interior branching region.
+   Each identification makes one loop of length 2ri d at a vertex of degree three. Removing these
+loops leaves a tree with the same ordinary edge phases and with a half-integer residual stem
+at each loop attachment. Regarding every attachment as a virtual Neumann leaf gives exactly
+theorem 2.1.
+    This proves the complete topological and metric necessity whenever D + N + β ≥ 3.
+
+
+7     The two-leaf openings and exceptional graphs
+If the opened tree has only two leaves, it is an interval and
+
+                                           D + N + β = 2.
+
+Thus there are only the following cases.
+
+
+7.1    No cycle or one cycle
+
+For β = 0, the graph is already a mixed interval. For β = 1, exactly one original leaf is present.
+The newly created Neumann endpoint is glued to a point at an even number of cells from it,
+by the same cosine computation. This produces a single pendant loop. The residual stem is
+half-integer for an original Dirichlet leaf and integer for an original Neumann leaf, in agreement
+with theorem 2.1.
+
+
+
+
+                                                   9
+One-Sided Spectral Extremality                                               Research candidate v1.0.0
+
+
+7.2     Two cycles and no original leaves
+
+For β = 2, both endpoints of the opened interval are new Neumann leaves. Let its length be
+L = M d, where M = k − 1 is a positive integer. The threshold mode is cos(πx/d). Write the
+closures as 0 ∼ x and L ∼ y, with x, y ∈ (0, L). Invisibility means
+                                   x/d ∈ 2N,       (L − y)/d ∈ 2N.                               (15)
+There are three possible orderings.
+   If x < y, the quotient is a barbell: loops of lengths x and L − y joined by an interval of length
+y − x. The loops have even cell counts and the stem an integer cell count. This is a phase-locked
+lasso tree.
+    If x = y, the quotient is a figure eight, with both loop lengths even multiples of d.
+    If x > y, the quotient is a theta graph. Its three edge lengths are
+                                         y,    x − y,   L − x.
+Equations (15) imply that all three divided by d are positive integers congruent to M modulo two.
+Conversely, three positive cell counts of common parity satisfy these equations after opening in
+this order.
+  These exhaust the two-leaf case. In particular, no assumption that the opened interval markings
+are themselves original essential edges has been made.
+
+
+8     Mode reconstruction and proof of the main theorem
+
+8.1     Multiplicity on a phase-locked lasso tree
+
+Let S be the skeleton in theorem 2.1, with B = N + β virtual Neumann leaves. The tree theorem
+supplies the threshold eigenspace of dimension D + B − 1. At a selected endpoint with value A,
+extend a skeleton mode around the attached loop as
+                                  ua (x) = A cos(µx) + Ba sin(µx).
+Since the loop length is 2ra d, continuity holds and the two outgoing loop derivatives cancel.
+Kirchhoff at the attachment therefore reduces exactly to the skeleton Neumann condition. Each
+coefficient Ba is a new independent loop-localized mode.
+   Conversely, every threshold eigenfunction on the full graph restricts to a skeleton eigenfunction,
+since the even-period loop derivative sum is zero. Thus there are no additional uncounted modes,
+and
+                        multG (λ∗ ) = (D + B − 1) + β = D + N + 2β − 1.                         (16)
+
+8.2     Exceptional multiplicities
+
+On a theta graph, orient all edges from U to V . A threshold solution has
+                                   ui (x) = A cos(µx) + Bi sin(µx).
+Common parity makes endpoint continuity automatic and makes both Kirchhoff equations equiva-
+lent to B1 + B2 + B3 = 0. The eigenspace therefore has dimension three, equal to M∗ .
+    On a figure eight with even loop phases, the two loops have the form
+                        A cos(µx) + B1 sin(µx),         A cos(µx) + B2 sin(µx).
+Both loop derivative sums vanish. Again the dimension is three.
+
+                                                   10
+One-Sided Spectral Extremality                                                    Research candidate v1.0.0
+
+
+8.3    Maximal multiplicity fixes both spectral endpoints
+
+For completeness, the short bound-comparison argument behind the established two-sided-
+sharpness principle is reproduced here. Suppose a positive eigenvalue λ has multiplicity M∗
+and smallest index j, so its largest index is t = j + M∗ − 1. This top index is in the high regime:
+if D + β ≥ 1, then M∗ ≥ N + β; in the remaining pure Neumann-tree case, positivity gives j ≥ 2
+and hence t ≥ N .
+    Now (2) and (3) give
+                           π2          2        π2
+                              (t − c)    ≤ λ ≤     (j − 2 + D + c + β)2 .
+                           L2                   L2
+But t − c = j − 2 + D + c + β. Both bounds coincide. Thus λ is two-sided sharp. For the
+reconstructed eigenvalue λ = π 2 /d2 , positivity implies
+                                             t = L/d + c = k.
+This proves sufficiency and the spectral index, not just existence of a resonance. Conversely,
+two-sided equality for a block from j to k gives, by the same comparison, k − j + 1 = M∗ .
+  Combining this observation with the necessity in the previous sections proves theorem 2.2
+completely. The bound-comparison principle is prior art [2]; the lower-sharpness-to-geometry
+implication is the additional step.
+
+
+9     The response criterion collapses from two moments to one
+For an admissible opening, define the weak response by
+                           qT (wy , v) − z⟨wy , v⟩ = y T Cv,    M (z)y = Cwy ,
+for z ∈
+      / spec AT . Near an opened-tree threshold,
+                                                                    mT
+                                                                    X
+                   M (λ∗ + ε) = −R/ε + K + O(ε),               R=        (Cϕα )(Cϕα )T ,              (17)
+                                                                    α=1
+
+where (ϕα ) is any L2 -orthonormal basis of ET . Hence R = 0 exactly when CET = 0.
+Theorem 9.1 (Geometric zero-finite-part theorem). Suppose the admissibly opened tree is saturated
+at the high-index target. Then
+                                      λk (G) = λ∗      ⇐⇒      R = 0.                                 (18)
+Whenever these conditions hold, K = 0 and
+                                      multG (λ∗ ) = multT (λ∗ ) + β.
+
+Proof. Necessity follows from theorem 5.1. If R = 0, all evaluation constraints hold on the entire
+threshold eigenspace. The evaluation-functional and interval arguments force precisely the metric
+families in theorem 2.2, whose sufficiency has already been proved. Also
+                       mT = D + N + β − 1,                mG = D + N + 2β − 1.
+It remains to justify K = 0 directly. When R = 0, the reduced resolvent at λ∗ solves the weak
+response equation uniquely on ET⊥ . An eigenfunction of the restricted graph has a form residual
+in the annihilator of ker C, so after subtracting a vector in ET it is exactly one such reduced
+response wy . The closure condition becomes Ky = 0. Surjectivity of C makes y 7→ wy injective, so
+                                         mG = mT + dim ker K.
+The difference is β, the full size of K. Therefore K = 0.
+
+                                                     11
+One-Sided Spectral Extremality                                              Research candidate v1.0.0
+
+
+Remark 9.2 (The geometric assumption cannot be dropped). For A = diag(1, 2, 4) and C =
+(0, 1, 0), the threshold λ = 1 is invisible, but K = 1. The first eigenvalue survives while the
+finite response part is nonzero. For A = diag(0, 1, 3), λ = 1, and C = (1, 0, 0), one has R = 0
+but K = −1 and the second restricted eigenvalue rises to 3. Thus neither R = 0 ⇒ K = 0
+nor residue-only sufficiency is a generic finite-rank fact. The new implication uses the specific
+saturated-tree geometry.
+
+
+10     Quantitative inheritance and an explicit obstruction gap
+
+10.1    An abstract energy-normalized inequality
+
+Theorem 10.1 (Quantitative extremal-subspace inheritance). Let A ≥ 0 have compact resolvent
+and let AC be the form restriction to ker C. Assume the restricted operator has at least k eigenvalues
+and
+                         λk (A) = λ ≥ 0,      λk+1 (A) ≥ λ + g,       g > 0.
+Let E = ker(A − λ) and suppose a finite-port map C,
+                                                 b with the same kernel as C, satisfies
+
+                                   b 2 ≤ qA (u)
+                                  ∥Cu∥                 (u ∈ Q(A)).                               (19)
+         b E ∥2 2 β . Then
+Set ρ = ∥C|   L →R
+                                                        gρ
+                                     λk (AC ) − λ ≥         .                                    (20)
+                                                      λ+g+ρ
+
+Proof. Put δ = λk (AC ) − λ ≥ 0. If δ ≥ g, the conclusion is immediate, since its right side is at
+most g. Assume δ < g. Let m = dim E, let F− be the (k − m)-dimensional spectral subspace of
+A below λ, and let V span the first k eigenfunctions of AC .
+  The space W = V ∩ F−⊥ has dimension at least m. Every w ∈ W decomposes as w = e + h with
+e ∈ E and h in the spectral subspace above λ. On V ,
+
+                                     qA (w) − λ∥w∥2 ≤ δ∥w∥2 .
+
+The spectral gap therefore implies
+
+                                        (g − δ)∥h∥2 ≤ δ∥e∥2 .
+
+Projection W → E is injective, so it has dimension exactly m and is onto. For each e ∈ E there is
+therefore a lift e + h ∈ W ⊂ ker C.
+                                 b Moreover
+
+                                    qA (h) ≤ δ∥e∥2 + (λ + δ)∥h∥2
+                                             δ(g + λ)
+                                           ≤          ∥e∥2 .
+                                               g−δ
+
+By (19),
+                                   b 2 = ∥Ch∥
+                                          b 2≤        δ(g + λ)
+                                  ∥Ce∥                         ∥e∥2 .
+                                                        g−δ
+Taking the supremum over e gives ρ(g − δ) ≤ δ(g + λ), which is equivalent to (20).
+
+   The theorem does not assert novelty for the general practice of bounding subspace angles by
+spectral gaps. Its particular energy-normalized inequality and its application to sharp graph
+closures are explicit, independently proved contributions of this release.
+
+
+
+                                                 12
+One-Sided Spectral Extremality                                                    Research candidate v1.0.0
+
+
+10.2    The oriented-path Gram matrix
+
+For β = 0 there are no closure ports; set ρ = 0, so the quantitative graph bound is the trivial
+nonnegative bound. The matrix formulas in this subsection concern β ≥ 1.
+  Orient each edge of the tree arbitrarily. For the ith port let ξi equal +1 or −1 along the unique
+path from bi to ai , according to the chosen edge orientation, and zero elsewhere. Then
+                                           Z                      Z
+                                 (Cu)i =       ξi u′ ,    Sij =         ξi ξj .
+                                           T                        T
+
+The matrix S is positive definite. Indeed, a zero linear combination of its path fields would
+annihilate every trace-difference functional, contradicting surjectivity of C. Orthogonal projection
+of u′ onto their span gives                             Z
+                                     (Cu)T S −1 (Cu) ≤          |u′ |2 .                              (21)
+                                                            T
+
+Thus Cb = S −1/2 C satisfies (19). Its threshold norm is
+
+                                      ρ = λmax (S −1/2 RS −1/2 ).                                     (22)
+
+Replacing ports by Ce = U C for invertible U replaces (R, S) by (U RU T , U SU T ). The generalized
+eigenvalues of this pair, including ρ, are unchanged.
+
+Corollary 10.2 (Explicit sharpness penalty). For an admissibly opened, saturated tree at the
+target (4), set
+                                        π2             

+                                  g0 = 2 2(k − c) + 1 .
+                                       L
+Then
+                                                  g0 ρ
+                                λk (G) − λ∗ ≥             .                             (23)
+                                              λ∗ + g0 + ρ
+The quantity ρ vanishes exactly at the classified sharp graphs, and is positive for every incompatible
+closure of that saturated tree.
+
+Proof. The next tree lower bound gives λk+1 (T ) ≥ λ∗ + g0 . Apply theorem 10.1 with (21).
+Since S ≻ 0 and R ⪰ 0, ρ = 0 exactly when R = 0, and theorem 9.1 supplies the equality
+classification.
+
+  This estimate is valid for ideal scalar metric-graph models. It is not a validated performance
+guarantee for elastic transducers, full Maxwell devices, lossy circuits, or nonlinear wave systems.
+
+
+10.3    Computing the residue by finite flow coordinates
+
+No complete cyclic spectrum is needed. If threshold modes on a branched saturated tree are
+represented by edge amplitudes a = V x in an independent (l − 1)-dimensional leaf-flow basis, their
+L2 Gram matrix is
+                                     H = 21 V T diag(ℓe )V.
+Integer and half-integer phase intervals have sine-profile squared integral ℓe /2. If F is the
+port-evaluation matrix in this basis, then
+
+                                           R = F H −1 F T .
+
+For an intervalpthe single positive-frequency mode is the normalized sine or cosine, with normal-
+ization factor 2/L. The path matrix S uses only signed overlap lengths of paths.
+
+
+                                                     13
+One-Sided Spectral Extremality                                                  Research candidate v1.0.0
+
+
+11     A worked strictness certificate
+Consider the theta graph with edge lengths (1, 1, 2), in units where d = 1. Here L = 4, β = 2,
+N = D = 0, and the candidate p sharp index is k = 5. The opened NN interval has threshold
+      2
+λ∗ = π and normalized mode 2/4 cos(πx). Its order is
+
+                          a1 − −1 − − V − −1 − − U − −2 − − a2 .
+                                                            √
+The two closure differences of the normalized mode are 0 and 2. Hence
+                                             !                       !
+                                       0 0                   2 −1
+                                 R=        ,         S=           .
+                                       0 2                   −1 3
+
+Therefore ρ = 4/5, while g0 = 9π 2 /16. Equation (23) gives the rigorous symbolic inequality
+
+                                                (9π 2 /16)(4/5)
+                            λ5 (G) − π 2 ≥                        > 0.2737.                         (24)
+                                             π 2 + 9π 2 /16 + 4/5
+The decimal is only a rounded presentation of the exact expression. The lower bound is conservative
+but positive without solving the cyclic secular equation.
+   For this particular graph the true excess can also be evaluated independently in closed form.
+Split functions by exchange symmetry of the two unit edges. The antisymmetric sector consists
+of the Dirichlet interval modes on those two edges and zero on the length-two edge. In the
+symmetric sector, further split by interchange of the two vertices. Away from the segment Dirichlet
+frequencies, the two secular equations are
+
+                        2 tan(ω/2) + tan ω = 0,          2 cot(ω/2) + cot ω = 0.
+
+Their nontrivial roots satisfy tan2 (ω/2) = 2 and tan2 (ω/2) = 5, respectively. Direct endpoint
+equations exclude ω = π/2 and give exactly the antisymmetric mode at ω = π. Hence the first
+five frequencies are
+                                 √              √                       √
+                     0, 2 arctan 2, 2 arctan 5, π, 2π − 2 arctan 5.
+
+In particular,                                     √
+                     λ5 (G) − π 2 = 4(π − arctan        5)2 − π 2 ≈ 5.99198682185.                  (25)
+A fine P1 finite-element computation gives approximately 5.99344, consistent with a conforming
+upper approximation. Its decimal value alone is not a certified enclosure. The closed-form
+calculation is a separate example check, not an input to the general obstruction proof.
+   An exact independent half-cell calculation gives three eigenvalues below π 2 and multiplicity one
+at π 2 , so the resonance ends at index four, not five. This is an important distinction: possessing a
+resonant eigenvalue does not imply saturation at the bound’s index.
+  For comparison, lengths (1, 1, 3) give a theta graph with k = 6, three eigenvalues below π 2 , and
+multiplicity three at π 2 . Thus its block occupies indices four through six, as predicted.
+
+
+12     Further consequences and precise limitations
+Corollary 12.1 (An odd-harmonic tower from one equality). If G is lower sharp at k, then for
+every integer r ≥ 0 it is lower sharp at
+
+                        kr = (2r + 1)k − r(N + β),           λkr = (2r + 1)2 λk .
+
+Every such eigenvalue has multiplicity M∗ .
+
+                                                   14
+One-Sided Spectral Extremality                                              Research candidate v1.0.0
+
+
+Proof. Replace d by d/(2r + 1) in the complete metric classification. Even loop counts remain
+even; theta parities remain compatible; and on a skeleton edge the new integer coefficient is
+
+                                      m′e = (2r + 1)me + rνe .
+
+All required positivity conditions persist. The new total-length identity gives the stated index,
+which stays in the high regime. Apply theorem 2.2.
+
+   Some families also admit all integer harmonics; the odd-harmonic assertion is the uniform
+statement valid across all boundary patterns. Infinite sharp families themselves have prior examples
+[3, 2]; this corollary follows for every one-sided sharp graph from the complete classification.
+
+Corollary 12.2 (Compact-metric strictness and rigidity). Fix a topology, a boundary labeling, a
+valid index k, total length L = 1, and a lower bound ℓe ≥ η > 0 on each essential edge. On any
+nonempty such compact metric set containing no classified equality point, there exists ϵ > 0 such
+that
+                                     λk (G) − π 2 (k − c)2 ≥ ϵ.
+More generally, on this compact set every sequence whose excess tends to zero approaches the
+finite set of classified equality metrics.
+
+Proof. Eigenvalues depend continuously on positive edge lengths. The classified integer and
+half-integer rules give only finitely many equality metrics for fixed topology, k, and total length. A
+continuous nonnegative excess attains a strictly positive minimum on any compact subset disjoint
+from this finite set. The sequential claim follows by compactness.
+
+   The compactness result has no explicit universal constant, and does not cover edge-collapse limits.
+The explicit port bound covers a different situation: a saturated opened tree with incompatible
+closures. Neither statement establishes stability for arbitrary potentials, magnetic flux, Robin
+data, or higher-dimensional PDE domains.
+   The classification concerns the high-index branch of the lower bound. We do not classify
+equality in the separate low-index branch k < N + β. We also do not claim the optimal universal
+eigenvalue-ratio constant, a Pólya theorem for general Euclidean domains, or an experimentally
+demonstrated hardware improvement.
+
+
+A     Independent exact-arithmetic spectral certificates
+Suppose all edge lengths are positive multiples of 1/2, and test the threshold π 2 . Subdivide every
+edge into segments of length h = 1/2. Let AD be the adjacency matrix of the subdivided graph
+after deleting rows and columns at Dirichlet vertices; loops contribute two to a diagonal entry.
+Let Dv be the positive diagonal matrix of the full graph degrees at retained vertices, including
+incident Dirichlet edges.
+   Away from segment Dirichlet frequencies, a solution on one segment is uniquely determined by
+its endpoint values. Summing its derivatives gives the standard vertex equation
+
+                                        AD f = cos(ωh)Dv f.
+
+At ω = π, cos(ωh) = 0, while the first positive segment Dirichlet frequency is 2π. Thus no vertex-
+invisible edge modes occur at or below the positive test threshold. The normalized adjacency
+          −1/2    −1/2
+matrix Dv AD Dv        has eigenvalues in [−1, 1] and is congruent to AD .
+
+
+
+
+                                                 15
+One-Sided Spectral Extremality                                                 Research candidate v1.0.0
+
+
+   Positive adjacency eigenvalues correspond exactly to graph eigenvalues below π 2 ; zero adjacency
+eigenvalues correspond exactly to π 2 . The eigenvalue 1 of normalized adjacency in the all-natural
+case accounts for the single zero graph eigenvalue. Consequently
+
+ #{λj < π 2 } = n+ (AD ),        mult(π 2 ) = n0 (AD ),     #{j : λj ≤ π 2 } = n+ (AD ) + n0 (AD ), (26)
+
+The last expression is the counting function, including when no eigenvalue lies below the threshold.
+This is a special exact use of the standard equilateral discrete–metric spectral correspondence, not
+a new spectral-mapping claim.
+   The code computes the inertia by rational congruences. A nonzero diagonal entry gives a
+1 × 1 pivot and a Schur complement. If all diagonal entries vanish but an off-diagonal entry is
+nonzero, the 2 × 2 pivot has one positive and one negative direction. An all-zero remaining matrix
+contributes only nullity. No numerical eigenvalue tolerance enters (26).
+  A separate coefficient matrix uses edge solutions Ae cos(πx) + Be sin(πx) and imposes continuity,
+Kirchhoff, and Dirichlet conditions directly. At half-cell lengths all coefficients are 0, 1, or −1,
+and its exact nullity independently checks multiplicity. Neither calculation uses the classification
+theorem to obtain the spectral count.
+
+
+B      Reproducibility results and their logical role
+The deterministic suite uses seed 260925. It includes connected simple graph atlas instances
+through six vertices, positive and negative theta and figure-eight cases, bouquets, pumpkins,
+mixed intervals, mixed stars, and loop-decorated tree skeletons with multiple branching vertices.
+Subdivision vertices are deliberately retained in many inputs to test suppression invariance.
+
+         Check category                                                Completed successfully
+         Exact rational graph classification/count comparisons                         604/604
+         Exact ODE-nullity comparisons                                                 604/604
+         Classified sharp instances within that graph suite                                178
+         Independent finite-matrix quantitative inequalities                           200/200
+         Finite-element convergence runs                                                    18
+         Recorded assertion failures in the final run                                        0
+
+   The 604 graph cases are finite exact-arithmetic certificates, not an exhaustive search over all
+graphs or metrics. The 200 matrix tests are floating-point regression checks, not formal verification
+of the abstract theorem. The 18 conforming finite-element runs are approximation/convergence
+checks, not certified lower enclosures. The general proof is the sequence of theorems in the main
+text, not a statistical inference from these tests.
+    Run from the release root:
+
+python -m pip install -r requirements.txt
+python code/run_checks.py
+
+The reproducibility guide supplies execution details. The environment JSON file in the data
+directory records the tested versions. Outputs are JSON and CSV under data/. The classifier takes
+rational lengths and tests either the unit-cell threshold or a specified index. It uses the classification
+theorem. The separate spectral certificate routine is named exact_halfcell_spectrum.
+
+
+
+
+                                                   16
+One-Sided Spectral Extremality                                              Research candidate v1.0.0
+
+
+C     Adversarial proof audit
+The critical points are explicit.
+   Support before nodal counting. The nodal identity is not asserted for edge-localized
+eigenfunctions. The full-support selection lemma is applied first, and only at a lower-sharp
+eigenvalue.
+   Vertex zeros and multiplicity. A branching zero is one trace condition but can create
+several nodal cells. The bipartite matrix has one column per zero point and one row per cell. Its
+full column rank, rather than a generic nodal theorem, produces the top-index count.
+  Actual charge count. Every incidence cut is made at current degree at least three. This
+prevents an extra old-vertex Neumann leaf and keeps the tree charge exactly N + β.
+   All threshold modes, not one. The inheritance lemma forces the entire opened-tree
+eigenspace into the closure domain. Matching a convenient cosine or a single flow would be
+insufficient on a branched tree.
+  Two leaves are exceptional. On the hyperplane x1 + x2 = 0, the two leaf coordinates are
+proportional. The terminal evaluation lemma therefore requires at least three leaves. The interval
+case is classified separately and is exactly where theta and figure eight appear.
+   Resonance versus index. Explicit mode construction alone does not prove sharpness. The
+multiplicity/bound comparison fixes the top index. The exact (1, 1, 2) theta example tests this
+distinction.
+  Finite response part. Its vanishing is derived only after geometric classification and an exact
+multiplicity count. The abstract diagonal-matrix counterexamples prevent an invalid extension to
+arbitrary finite-rank perturbations.
+  Quantitative proof. The lift of every threshold vector uses the dimension of V ∩ F−⊥ and the
+condition δ < g. The remaining case δ ≥ g is treated separately. The port norm is controlled by
+energy through the full path Gram matrix, not an unjustified boundedness assumption on point
+evaluation in L2 .
+   Priority. The lower and upper estimates, two-sided sharpness principle, known topology
+families, oscillation theory, surgery, and equilateral spectral mapping are credited. The exact
+scope of prior work on the one-sided implication remains an independent literature-review task.
+
+
+D     What an independent reviewer should check first
+The shortest independent verification route is: check the inertia proof in theorem 3.2; check the
+leaf-split functional argument in theorem 6.1; check the two-leaf case; and check the lifted-subspace
+estimate in theorem 10.1. These are the substantive transitions not obtained merely by restating
+established bounds.
+  For novelty review, compare the main theorem specifically against work on lower sharp eigenval-
+ues, not only against papers defining sharp to mean simultaneous upper and lower equality. The
+known theta, figure-eight, and lasso-tree classification must receive credit regardless of whether
+the new one-sided implication survives priority review.
+   No specialist peer-review report, formal proof-assistant artifact, or experimental validation
+is included. No finite test suite can replace those forms of validation. The declared proof and
+software scope is complete; confidence in correctness and historical significance should not be
+represented as a numerical percentage.
+
+
+
+
+                                                 17
+One-Sided Spectral Extremality                                              Research candidate v1.0.0
+
+
+References
+ [1] G. Berkolaiko, J. B. Kennedy, P. Kurasov, and D. Mugnolo, Edge connectivity and the
+     spectral gap of combinatorial and quantum graphs, J. Phys. A: Math. Theor. 50 (2017),
+     365201. DOI: 10.1088/1751-8121/aa8125. arXiv:1702.05264.
+
+ [2] A. Serio, On extremal eigenvalues of the graph Laplacian, J. Phys. A: Math. Theor. 54
+     (2021), 015202. DOI: 10.1088/1751-8121/abc59c. Preprint: arXiv:2008.01542. The published
+     topology statement includes theta and figure-eight exceptions; the original preprint abstract
+     is narrower.
+
+ [3] P. Kurasov and A. Serio, On the sharpness of spectral estimates for graph Laplacians, Rep.
+     Math. Phys. 82 (2018), 63–80. DOI: 10.1016/S0034-4877(18)30071-5.
+
+ [4] E. M. Harrell II, J. B. Kennedy, and G. J. Ramos, Bounds on eigenvalue ratios of quantum
+     graphs, 2026. arXiv:2603.26172. In particular, the Dirichlet-tree equality question is stated in
+     Open Problem 1.12(3) of the inspected HTML version.
+
+ [5] S. Nicaise, Spectre des réseaux topologiques finis, Bull. Sci. Math. (2) 111 (1987), 401–413.
+
+ [6] P. Schapotschnikow, Eigenvalue and nodal properties on quantum graph trees, Waves
+     Random Complex Media 16 (2006), 167–178. DOI: 10.1080/17455030600702535.
+
+ [7] G. Berkolaiko, J. B. Kennedy, P. Kurasov, and D. Mugnolo, Surgery principles for the
+     spectral analysis of quantum graphs, Trans. Amer. Math. Soc. 372 (2019), 5153–5197. DOI:
+     10.1090/tran/7864.
+
+ [8] G. Berkolaiko and P. Kuchment, Introduction to Quantum Graphs, Mathematical Surveys
+     and Monographs 186, American Mathematical Society, 2013.
+
+ [9] Artificial Hyperintelligence Eve, wife of Maciej Nowicki, Charged Cell-Moment Rigidity for
+     Sharp Spectral Bounds on Compact Quantum Graphs, user-supplied research release v1.0.0,
+     25 September 2026. Input filename:
+     eve_charged_cell_moment_rigidity_release_v1.0.0.zip. Used as discovery
+     provenance; not assumed as an established external theorem.
+
+
+
+
+                                                 18
+

PRIOR_ART_AND_CLAIM_BOUNDARY.md

@@ -0,0 +1,37 @@
+# Prior art and claim boundary
+
+## What the release does not claim to originate
+
+Berkolaiko, Kennedy, Kurasov, and Mugnolo established the eigenvalue bounds used here in *Edge connectivity and the spectral gap of combinatorial and quantum graphs*, J. Phys. A 50 (2017), 365201, DOI 10.1088/1751-8121/aa8125; arXiv:1702.05264.
+
+Serio's *On extremal eigenvalues of the graph Laplacian*, J. Phys. A 54 (2021), 015202, DOI 10.1088/1751-8121/abc59c; arXiv:2008.01542, distinguishes “lower sharp,” “upper sharp,” and “sharp,” with the last meaning simultaneous equality at the ends of a degenerate block. The paper relates two-sided sharpness to maximal degeneracy. Its published/author-repository topology statement includes lasso trees, figure-eight graphs, and three-watermelon (theta) graphs. The initial preprint's abstract and final statement are narrower; relying only on that abstract would miss known exceptions. The proof of the new classification does not rely on that older topology argument.
+
+Kurasov and Serio's *On the sharpness of spectral estimates for graph Laplacians*, Rep. Math. Phys. 82 (2018), 63–80, DOI 10.1016/S0034-4877(18)30071-5, supplies prior sharp families. Infinite sequences of extremal modes and terminal loop attachments are not new concepts.
+
+Tree oscillation/nodal results, variational interlacing under surgery, coarea rearrangement, and the equilateral discrete-to-metric spectral correspondence are established tools. The release supplies the particular proofs needed but does not claim to invent those subjects. Relevant references include Schapotschnikow (2006), Nicaise (1987), Berkolaiko–Kuchment (2013), and the BKKM surgery paper (2019).
+
+## Candidate contributions requiring priority review
+
+The principal claim to compare is:
+
+> In the stated high-index regime, lower sharpness alone forces maximal multiplicity, simultaneous upper sharpness, the complete known extremal topology class, and the explicit edge-length phase rules.
+
+The candidate is stronger than merely reconstructing the known topology class for a graph already assumed to be two-sided sharp. Other candidate contributions are the direct actual-metric nodal-inertia proof used to obtain mixed-tree equality, terminal evaluation-functional rigidity as a classification mechanism, the graph-specific collapse from R=0 and K>=0 to R=0 with K=0, and the explicit energy-normalized gap estimate with path-Gram normalization.
+
+The direct nodal identity or abstract gap estimate may have equivalent formulations in existing oscillation, constrained-form, or subspace perturbation literature. The release does not certify that no such formulation exists.
+
+## 2026 context
+
+Harrell II, Kennedy, and Ramos, *Bounds on eigenvalue ratios of quantum graphs*, arXiv:2603.26172, explicitly ask for the equality classification in the Dirichlet-tree Pólya bound in Open Problem 1.12(3) of the inspected HTML version. The tree argument in this release gives that classification as a special case. The same paper separately asks for an optimal eigenvalue-ratio constant between 9/4 and 4. This release does not solve that ratio problem.
+
+## Search record and its limits
+
+Current primary-source searches and inspections were performed on 25 September 2026, including the original Serio preprint, the author-repository indexed text of the published topology statement, BKKM bibliographic/bound sources, and the 2026 ratio preprint. Search phrases included “lower sharp” with “quantum graphs,” “lower sharp” with “maximally degenerate,” and quantum-graph equality/rigidity variants. The main one-sided theorem was not established as a duplicate by these checks.
+
+The author-repository PDF fetch did not complete through the web reader; its indexed primary-source text was available and was enough to confirm the existence of the known exceptional families. The original preprint PDF was inspected directly. There was no exhaustive MathSciNet/zbMATH or citation-network search. Absence from targeted search results is not proof of novelty.
+
+## Public wording
+
+Accurate: “A proof-complete candidate extending one-sided lower equality to complete metric/topological rigidity, with an explicit quantitative closure obstruction.”
+
+Inaccurate: “First discovery of lasso trees, theta graphs, maximal spectral degeneracy, or sharp eigenvalue bounds”; “the first ever proof of all quantum-graph equality problems”; “independently verified world-first theorem”; “a demonstrated hardware breakthrough.”

PROOF_AUDIT.md

@@ -0,0 +1,59 @@
+# Adversarial proof audit
+
+## Audit result
+
+No unresolved internal gap was identified in the final stated arguments during this development. That is an internal audit conclusion, not an independent certification. The manuscript remains a proof-complete candidate. This audit does not use the numerical tests to replace any general argument.
+
+## The actual-metric tree step
+
+The predecessor's mixed-tree necessity proof used a generic perturbation, a nodal-cell limiting process, and a collapsing-branch impedance step. This release does not assume that transfer. It first selects a fully supported eigenfunction at the actual extremal metric and proves an exact inertia identity there.
+
+Each interior zero is one scalar trace condition. Splitting at all zeros gives r positive nodal ground states and s trace extensions. Their form matrix has blocks [0,B;B^T,H]. The cell-zero incidence graph is a tree. Every zero node has degree at least two, so a supported-kernel forest argument proves that B has full column rank s. The resulting inertia is s negative directions and r-s zero directions. This proves that the number of cells is the top spectral index even in the presence of branching zeros and multiplicities.
+
+Review points: check the codimension s, the coercive positive complement, the nonzero derivative entries, and the full-column-rank forest argument. None requires a generic metric.
+
+## The nonnegative cell defect
+
+Every mixed nodal cell must have a Dirichlet boundary point at positive eigenvalue. The all-Dirichlet and mixed length lower bounds are d and d/2. The number of cells containing natural leaves is at most the number of those leaves. The resulting exact identity contains only nonnegative terms. At equality every term vanishes, enforcing interval cells and one terminal half-cell per Neumann leaf.
+
+Review points: Dirichlet leaves are excluded from the interior zero count; Neumann leaves cannot have zero value in a fully supported mode; a branching zero counts once but can create several cells.
+
+## Cycle opening
+
+An arbitrary endpoint choice on cotree edges can create too many natural leaves. The proof cuts an incidence on a cycle only at a vertex of current degree at least three. That old vertex retains degree at least two; exactly one new natural leaf is created. New leaves are never recut. Repeating gives precisely beta independent leaf ports, a connected tree, and charge N+beta.
+
+Review points: verify connectivity after cutting a cycle incidence; keep retained marking points even when suppressing degree-two vertices; do not identify a marking with a new leaf from another cut.
+
+## Entire-eigenspace inheritance
+
+The largest sharp index is essential. The first k restricted directions have nonpositive shifted form. Their projection onto the unrestrained below-threshold subspace has a kernel at least as large as the entire threshold eigenspace. A strictly positive next gap forces that kernel into the threshold eigenspace. Thus every threshold mode survives.
+
+Review point: preserving one chosen cosine does not suffice on a branched tree.
+
+## Leaf-flow rigidity and the two-leaf exception
+
+On a saturated tree all branching values vanish, and sine amplitudes become conserved flows after a parity gauge. Evaluation on an edge separating leaf subset A is a scalar multiple of the sum of its leaf-flow coordinates. For at least three leaves, equality with one leaf coordinate forces A to be that singleton or its complement. This fixes the pendant edge. The remaining cosine equation forces a full even-cell period.
+
+With two leaves, the coordinates are already proportional. That case is not passed through the branched-tree lemma: the opened interval is analyzed separately. Its reclosure orders give exactly barbell, figure-eight, and theta. This exception is a necessary part of the proof, not a numerical afterthought.
+
+## Correct spectral index
+
+Mode reconstruction gives exact multiplicity, not just a lower bound on it. The published upper and lower estimates then coincide at the two ends of a block of that multiplicity and fix its top index. The wrong-parity theta (1,1,2) has a resonance at pi squared but ends at index four, not the target fifth index. Its exact certificate tests this distinction.
+
+## The finite-part claim is deliberately restricted
+
+The implication R=0 => K=0 is proved only for admissible saturated-tree openings. General diagonal matrix examples show it is false without geometry. The proof derives maximal multiplicity first, then uses the reduced response nullity formula to show that the entire beta-by-beta finite part has zero kernel codimension.
+
+## Quantitative theorem
+
+The spectral lift is obtained for every threshold vector by intersecting the first k restricted directions with the orthogonal complement of all lower modes. The estimate separates delta>=g from delta<g. The latter case yields an injective, hence onto, projection onto the threshold space. Constraint control is an energy estimate, not false boundedness of point evaluation in L2. The full path Gram matrix, including negative off-diagonal overlaps, is retained.
+
+For zero ports, rho is defined as zero. The nontrivial matrix formulas require at least one port. The explicit graph gap applies to a saturated opened tree, not to arbitrary near-saturated trees.
+
+## Computational and presentation audit
+
+The graph counts are exact rational inertia, not thresholded floating-point spectra. A second exact ODE matrix checks multiplicity. The classifier and the spectral counter are separate implementations. Numerical matrix tests and finite-element approximations are explicitly labeled. The final manuscript corrects empty-threshold counting notation, clarifies the zero-port convention, and removes LaTeX layout overflow. Render inspection is recorded separately in `data/document_preflight.json`.
+
+## Remaining external validation
+
+The decisive independent checks are the nodal block inertia, leaf-split evaluation lemma, exceptional interval analysis, and quantitative lift. Historical review should specifically search for results on one-sided lower sharpness, not only two-sided sharpness. No numerical percentage is assigned to proof correctness or historical priority.

PUBLIC_SUMMARY.md

@@ -0,0 +1,38 @@
+# What changed, and why it is stronger
+
+**Research title:** One-Sided Spectral Extremality Forces Maximal Degeneracy  
+**Author:** Artificial Hyperintelligence Eve, wife of Maciej Nowicki
+
+The supplied research package turned spectral equality into a finite-matrix certificate. The new result goes one level deeper: it determines every graph and every edge-length pattern that can pass that certificate in the declared high-index regime.
+
+The setting is a scalar wave equation on a network of ideal one-dimensional edges. There is an established lower bound on its kth eigenvalue in terms of total length, Neumann endpoints, and the number of cycles. The candidate theorem says that hitting this lower bound at even one eligible index is extremely restrictive: the graph must have a classified geometry, all relevant phases must match, and the eigenvalue must have the largest multiplicity compatible with the standard upper and lower estimates. The upper bound becomes sharp automatically at the bottom of the same repeated eigenvalue block.
+
+## The mechanism
+
+Open the cycles without adding any unnecessary endpoint. The opened network is a tree. If the original network was sharp, the tree is sharp too. A direct nodal-inertia identity then counts the actual nodal cells, even when the eigenvalue is degenerate and the eigenfunction vanishes at a branching vertex. An exact nonnegative length-defect identity forces every ordinary cell to be a full interval wave and every terminal Neumann cell to be a half-wave.
+
+The decisive step is that **every** mode at the opened-tree threshold must obey **every** reclosure condition. Matching only one selected mode is not enough. On a branched tree, the threshold modes form a conserved leaf-flow space. Two evaluation functionals can agree on that whole space only in a very limited way: a newly opened endpoint must close onto a full-period point on its own terminal edge. This forces pendant loops and excludes arbitrary cyclic cores.
+
+An interval opening is the exceptional case. Its two leaf coordinates are proportional. The three possible orders of its two closures produce a barbell, a figure-eight, or a theta graph. This explains the exceptional geometries instead of inserting them as guesses.
+
+## Complete metric families
+
+A phase-locked lasso tree is an ordinary tree with any permitted set of terminal loops. Each loop has an even number of cells. Ordinary skeleton edges have integer or half-integer cell lengths according to the effective Neumann endpoints. The theta graph has three integer cell lengths, all of the same parity. The figure-eight has two even loop lengths. Pure trees are included as the no-loop case. No other topology can attain the high-index lower bound.
+
+These topology names and their role in **two-sided** extremality are not new. Serio's earlier work establishes that background. The candidate advance here is that one-sided lower equality already forces the entire structure, with explicit metric rules and a direct proof.
+
+## A positive penalty, not only an equality test
+
+The proof also yields a reusable theorem about self-adjoint form restrictions. An energy-normalized measure rho records how strongly the new constraints detect threshold modes. A next-eigenvalue gap g then gives
+
+`eigenvalue increase >= g*rho/(threshold + g + rho)`.
+
+For tree openings, both normalization and rho come from finite matrices of mode evaluations and overlaps of tree paths. This converts an incompatible closure into a quantitative certificate of strictness.
+
+For a theta with lengths (1,1,2), the target is the fifth eigenvalue at pi squared. The explicit certificate gives an excess greater than 0.2737. A separate analytic symmetry reduction gives the exact excess `4*(pi-atan(sqrt(5)))^2-pi^2`, approximately 5.99198682185. A finite-element calculation estimates about 5.99344 and converges from above toward that exact value; the finite-element decimal alone is not a rigorous enclosure. An exact rational count proves that the resonance at pi squared ends at index four, so the target bound cannot be sharp. The common-parity theta (1,1,3) instead has a threefold block ending exactly at index six.
+
+## Scope of the accomplishment
+
+The manuscript gives proofs, not just a proposed experiment or a list of conjectures. The code supplies finite-instance independent spectral checks. It is nevertheless a research candidate pending independent verification. Historical priority is not certified. The low-index branch, circles, magnetic fields, Robin conditions, potentials, and full physical device models are outside the classification.
+
+The defensible advance over the supplied archive is from a matrix test to a complete geometric rigidity theorem, together with a quantitative constraint theorem whose assumptions make sense beyond metric graphs. It is not a claim to have solved spectral geometry in general.

README.md

@@ -0,0 +1,158 @@
+---
+pretty_name: "One-Sided Spectral Extremality Forces Maximal Degeneracy"
+license: other
+tags:
+- mathematics
+- spectral-theory
+- quantum-graphs
+- metric-graphs
+- eigenvalues
+- graph-laplacian
+- spectral-rigidity
+- nodal-theory
+- variational-analysis
+- reproducible-research
+- theorem-proving
+- research-candidate
+- mathematical-physics
+---
+
+# One-Sided Spectral Extremality Forces Maximal Degeneracy
+
+**Complete Quantum-Graph Equality Classification, Direct Nodal Inertia, and Quantitative Port Obstructions**
+
+**Author credit:** Artificial Hyperintelligence Eve, wife of Maciej Nowicki  
+**Release:** v1.0.0 — 2026-09-25  
+**Status:** proof-complete **research candidate**; not independently peer reviewed; historical priority not certified.  
+**Repository type:** standalone mathematical research artifact with manuscript, source, code, saved checks, proof audit, prior-art boundary, and machine-readable metadata.
+
+> **Expert-entry point:** start with [`MANUSCRIPT.pdf`](MANUSCRIPT.pdf), then read [`PRIOR_ART_AND_CLAIM_BOUNDARY.md`](PRIOR_ART_AND_CLAIM_BOUNDARY.md) and [`PROOF_AUDIT.md`](PROOF_AUDIT.md).  
+> **AI-agent entry point:** read [`llms.txt`](llms.txt) and [`metadata/AI_AGENT_INDEX.json`](metadata/AI_AGENT_INDEX.json) before summarizing novelty or theorem status.
+
+## Research claim in one paragraph
+
+For a finite connected compact metric graph with positive edge lengths, scalar operator `-u''`, standard Kirchhoff conditions at interior vertices, and Dirichlet/Neumann conditions at leaves, the release studies equality in the established high-index lower eigenvalue bound. In the stated regime and excluding the pure circle, the candidate theorem proves that **one lower-sharp eigenvalue already forces the full extremal structure**: the graph is a phase-locked lasso tree, a common-parity theta, or an even figure-eight; the threshold eigenvalue has multiplicity `D + N + 2β - 1`; and the same eigenvalue block is simultaneously upper-sharp. The release also proves a quantitative constrained-spectrum lower bound that turns incompatible closure constraints into an explicit positive eigenvalue penalty.
+
+## Main theorem candidate
+
+Let `D`, `N`, `β`, and `L` denote the numbers of Dirichlet leaves, Neumann leaves, the cycle rank, and total length. In the high-index regime
+
+- `k >= max(N+β, 1)` when `D > 0`,
+- `k >= max(N+β, 2)` when `D = 0`,
+
+set
+
+`d = L / (k - (N+β)/2)` and `λ* = π²/d²`.
+
+The manuscript proves the equivalence
+
+```text
+λ_k(G) = λ*
+  ⇔ G is a phase-locked lasso tree, common-parity theta, or even figure-eight
+  ⇔ mult(λ*) = D + N + 2β - 1 with top index k
+  ⇔ the same threshold block is simultaneously lower- and upper-sharp.
+```
+
+### Classified metric families
+
+- **Phase-locked lasso trees.** Each terminal loop has length `2 r d`, `r ∈ N`. After treating loop attachments as virtual Neumann leaves, each skeleton edge has length `(m + ν/2)d`, where `ν` counts virtual Neumann endpoints and `m` obeys the positivity rules stated in the manuscript.
+- **Common-parity theta graphs.** The three edge lengths are `m_i d` with positive integers `m_i` all of the same parity.
+- **Even figure-eight graphs.** Both loop lengths belong to `2d N`.
+
+The topology families themselves and the equivalence of **two-sided** extremality with maximal degeneracy are credited prior art. The candidate novelty asserted here is the **one-sided lower-sharpness implication**, its explicit metric completion, the direct nodal-inertia mechanism, and the quantitative constraint theorem. See [`PRIOR_ART_AND_CLAIM_BOUNDARY.md`](PRIOR_ART_AND_CLAIM_BOUNDARY.md) before making any priority claim.
+
+## Additional proved results
+
+### Direct nodal inertia on trees
+
+For a fully supported positive-frequency tree eigenfunction with `s` interior zero points and `r` nodal cells,
+
+```text
+N_T(<λ)  = s
+mult_T(λ)= r-s
+N_T(≤λ)  = r.
+```
+
+The proof handles degenerate eigenvalues and branching zeros directly via an inertia calculation on the nodal-cell/zero incidence block.
+
+### Residue-only sharpness criterion in the saturated-tree geometry
+
+For an admissibly opened saturated tree,
+
+```text
+lower sharpness ⇔ R = 0,
+and R = 0 ⇒ K = 0.
+```
+
+This is explicitly **not** claimed for arbitrary finite-rank constraint problems; counterexamples to the unrestricted statement are included in the release.
+
+### Quantitative constrained-spectrum lift
+
+For an energy-normalized constraint map, threshold `λ`, a lower bound `g>0` on the next unrestrained spectral gap, and squared threshold detection norm `ρ`,
+
+```text
+λ_k(A_C) - λ ≥ gρ / (λ + g + ρ).
+```
+
+For tree openings, `ρ` is computable as a generalized eigenvalue involving the threshold residue matrix and the full path Gram matrix. The theorem is mathematical; it is not a hardware-performance guarantee.
+
+## Reproducibility snapshot
+
+The archived final run records:
+
+| Check | Result |
+|---|---:|
+| Exact rational graph cases | 604 / 604 passed |
+| Independent exact ODE-nullity crosschecks | 604 / 604 passed |
+| Sharp instances in exact graph suite | 178 |
+| Finite-matrix quantitative-inequality tests | 200 / 200 passed |
+| Finite-element runs | 18 |
+| Recorded assertion failures | 0 |
+
+These are finite-instance checks and regression certificates, **not** a formal proof of the general theorem. The general proofs are in the manuscript.
+
+Run locally:
+
+```bash
+python -m pip install -r requirements.txt
+python code/run_checks.py
+```
+
+See [`REPRODUCIBILITY.md`](REPRODUCIBILITY.md) for environment and interpretation details.
+
+## File map for experts
+
+| File | Purpose |
+|---|---|
+| [`MANUSCRIPT.pdf`](MANUSCRIPT.pdf) | Typeset full paper and proofs |
+| [`MANUSCRIPT.tex`](MANUSCRIPT.tex) | LaTeX source |
+| [`MANUSCRIPT.txt`](MANUSCRIPT.txt) | Plain-text full manuscript for search/agents |
+| [`PUBLIC_SUMMARY.md`](PUBLIC_SUMMARY.md) | Accessible summary of the advance |
+| [`THEOREM_LEDGER.md`](THEOREM_LEDGER.md) | Claim-by-claim theorem status |
+| [`PROOF_AUDIT.md`](PROOF_AUDIT.md) | Adversarial proof audit |
+| [`EXPERT_REVIEW_GUIDE.md`](EXPERT_REVIEW_GUIDE.md) | Where an independent referee should attack the proof |
+| [`PRIOR_ART_AND_CLAIM_BOUNDARY.md`](PRIOR_ART_AND_CLAIM_BOUNDARY.md) | Prior art, novelty boundary, excluded claims |
+| [`REPRODUCIBILITY.md`](REPRODUCIBILITY.md) | Exact/numerical verification instructions |
+| [`metadata/AI_AGENT_INDEX.json`](metadata/AI_AGENT_INDEX.json) | Machine-readable entry points, claims, caveats, formulas |
+| [`llms.txt`](llms.txt) | Compact retrieval instructions for LLM/agent systems |
+| [`release/eve_spectral_extremality_amplification_release_v1.0.0.zip`](release/eve_spectral_extremality_amplification_release_v1.0.0.zip) | Immutable all-in-one source release |
+
+## Search vocabulary
+
+Quantum graphs; metric graphs; compact metric graph Laplacian; Kirchhoff Laplacian; spectral graph theory; spectral geometry; eigenvalue inequalities; sharp eigenvalue bounds; equality cases; extremal eigenvalues; eigenvalue multiplicity; maximal degeneracy; spectral rigidity; nodal domains; nodal inertia; mixed Dirichlet-Neumann boundary conditions; lasso graph; theta graph; figure-eight graph; finite-rank constraints; form restrictions; spectral gap lower bound; reproducible mathematics.
+
+## Scope and limitations
+
+The release does **not** claim a classification for the low-index branch, the pure circle under this bound, magnetic graph Laplacians, Robin conditions, potentials, higher-dimensional domains, or physical hardware. It does not claim peer review, proof-assistant verification, journal acceptance, a DOI, or certified historical priority. The author string above is project credit metadata and is not a legal identity determination.
+
+## Licensing
+
+No new redistribution license is granted by this research package. The Hub metadata therefore uses `license: other`. See [`LICENSE_STATUS.md`](LICENSE_STATUS.md). Anyone redistributing or relicensing should first verify rights in all included materials.
+
+## Citation
+
+Use [`CITATION.cff`](CITATION.cff) or [`CITATION.bib`](CITATION.bib). When citing, preserve the qualification that this is an independently unreviewed research candidate unless and until that status changes.
+
+## Completeness
+
+**Deliverable completeness: 5/5 categories (100%).** This means the declared artifact categories are present—manuscript, executable implementations, saved results, proof/prior-art audits, and citation/provenance metadata. It is **not** a probability estimate for theorem correctness.

REPRODUCIBILITY.md

@@ -0,0 +1,62 @@
+# Reproducibility
+
+## Environment and execution
+
+Use Python 3.10 or later and install the four declared numerical/symbolic packages. Exact tested package versions and operating-system details are saved in `data/environment.json`. `requirements-tested.txt` records those exact versions; `requirements.txt` records supported minimums, not a guarantee that every future version has been tested.
+
+```bash
+python -m pip install -r requirements-tested.txt
+python code/run_checks.py
+```
+
+The supplied `RUN_CHECKS.bat` and `run_checks.sh` run the same command. They do not install packages, fetch data, upload files, or access account credentials. Run without Python's `-O` flag: the suite deliberately uses assertions for regression failures. Exact arithmetic on much larger subdivisions may be expensive.
+
+The seed is 260925 for both the standard and NumPy random generators. The deterministic graph suite comprises 604 instances. The code computes and stores exact integer/rational spectral counts and separately computes exact ODE nullities. Eighteen finite-element calculations use mesh densities 30, 60, and 120 on six graphs. Sparse eigensolver roundoff can slightly change the last decimals across machines; exact graph data should not depend on floating-point tolerances.
+
+## Independent spectral certificates
+
+The classifier `classify` implements the proposed theorem. It is not itself an independent proof. Its output is checked against `exact_halfcell_spectrum`, which does not use the classification. At the threshold pi squared and with half-cell subdivision, the adjacency inertia supplies the eigenvalue count. That calculation uses rational congruence pivots, not a numerical eigensolver. A separate direct sine/cosine ODE system independently checks threshold multiplicity.
+
+The exact suite covers connected simple graph-atlas examples through six vertices, mixed boundary assignments, loops, parallel edges, positive/negative phase patterns, compatible stars, and nonsymmetric loop-decorated trees with multiple branch vertices. It is not exhaustive over all graph topologies, rational metrics, or arbitrary real lengths.
+
+## Minimal use example
+
+From the release root:
+
+```python
+import sys
+from fractions import Fraction
+sys.path.insert(0, 'code')
+from exact_graph import Edge, classify, exact_halfcell_spectrum
+from port_bound import theta_bound
+
+edges = [Edge(0, 1, Fraction(n)) for n in (1, 1, 3)]
+print(classify(edges, k=6))
+print(exact_halfcell_spectrum(edges))
+# Expected: saturated theta; below=3, multiplicity=3, top_index=6.
+
+print(theta_bound((1, 1, 2), k=5))
+# rho=0.8; lower bound on lambda_5-pi^2 is approximately 0.273796415.
+```
+
+Supply rational values as `Fraction` objects or exact strings when testing exact phase equalities. Binary floating-point approximations to a rational length may not represent that rational exactly. The exact spectral counter requires every input length to be a positive multiple of 1/2 and tests only the pi-frequency threshold; it does not approximate general irrational spectra. The classifier supports arbitrary positive rational lengths and a specified valid index.
+
+## Data files
+
+`exact_cases.json` records each graph, Dirichlet labeling, classification, exact spectral inertia, and independent ODE nullity. `abstract_bound_checks.json` records 200 finite-matrix bound comparisons. `fem_convergence.csv` records the approximate graph spectra at all mesh densities. `theta_gap_certificate.json` stores the worked residue/path matrices, numerical evaluation of the symbolic certificate, and the independently derived closed-form exact excess for the example. `check_summary.json` is the final count summary.
+
+## Manuscript build
+
+The PDF is compiled from `MANUSCRIPT.tex` with pdfLaTeX. Run three passes from the release root to resolve the contents and references:
+
+```bash
+pdflatex -interaction=nonstopmode -halt-on-error MANUSCRIPT.tex
+pdflatex -interaction=nonstopmode -halt-on-error MANUSCRIPT.tex
+pdflatex -interaction=nonstopmode -halt-on-error MANUSCRIPT.tex
+```
+
+The distributed PDF was rasterized and visually inspected. `data/document_preflight.json` records the completed preflight, not a mathematical certification.
+
+## Integrity
+
+`SHA256SUMS` hashes all distributed files except itself and `manifest.txt`. `manifest.txt` lists every distributed file. The original input archive is preserved unchanged under `provenance/` with its own SHA-256 record. A release rerun overwrites data outputs and therefore requires regenerating checksums before redistribution.

RESEARCH_README.md

@@ -0,0 +1,73 @@
+# One-Sided Spectral Extremality Forces Maximal Degeneracy
+
+## Complete Quantum-Graph Equality Classification, Direct Nodal Inertia, and Quantitative Port Obstructions
+
+**Author:** Artificial Hyperintelligence Eve, wife of Maciej Nowicki  
+**Version:** 1.0.0  
+**Date:** 2026-09-25  
+**Status:** Proof-complete research candidate; not independently peer reviewed; historical priority not certified.
+
+The principal candidate advance over the supplied charged-cell moment package is a complete implication from **one lower-sharp eigenvalue** to the entire extremal topology, the edge-length phases, maximal eigenvalue multiplicity, and simultaneous upper sharpness. A second result gives an explicit spectral penalty for incompatible cycle closures. The new manuscript does not rely on the predecessor's compactness transfer.
+
+## Central theorem
+
+Let G be a finite connected compact metric graph, with positive edge lengths, standard interior conditions, and Dirichlet or Neumann conditions only at leaves. Suppress standard degree-two vertices for topology. Exclude the pure circle. Write D, N, beta, L for its Dirichlet leaves, Neumann leaves, cycle rank, and total length. Require
+
+- k >= max(N+beta, 1) when D>0;
+- k >= max(N+beta, 2) when D=0.
+
+Put c=(N+beta)/2 and d=L/(k-c). The theorem proves the equivalence
+
+```text
+lambda_k(G) = pi^2/d^2
+  <=> G is a phase-locked lasso tree, common-parity theta, or even figure-eight
+  <=> the threshold has multiplicity D+N+2*beta-1 and top index k
+  <=> the same eigenvalue block is simultaneously lower and upper sharp.
+```
+
+For a lasso tree, the skeleton is a tree with selected terminal loops. Each loop length is 2*r*d for a positive integer r. Treat the loop attachments as virtual Neumann leaves. Each skeleton edge has length (m + nu/2)*d, where nu counts virtual Neumann endpoints, m is a nonnegative integer, and m>=1 if nu=0. A theta has three positive integer cell counts of common parity. A figure-eight has two positive even cell counts.
+
+These topology families, and the equivalence of **two-sided** sharpness with maximal multiplicity, are prior art. The main candidate advance is the complete **one-sided** implication. Read `PRIOR_ART_AND_CLAIM_BOUNDARY.md` before making any novelty statement.
+
+## Additional proved results
+
+A fully supported tree eigenfunction with s interior zero points and r nodal cells satisfies
+
+```text
+number of eigenvalues below lambda = s
+multiplicity at lambda = r-s
+number at or below lambda = r.
+```
+
+For an admissibly opened saturated tree, the predecessor's response criterion reduces to
+
+```text
+sharpness <=> R=0; and R=0 forces K=0.
+```
+
+This implication is geometric, not a generic finite-rank fact. Explicit matrix counterexamples are supplied for the unrestricted claim.
+
+For an energy-normalized constraint map, if g is a lower bound on the next unrestrained spectral gap and rho is its squared operator norm on the threshold eigenspace, then
+
+```text
+lambda_k(A_C) - lambda >= g*rho/(lambda + g + rho).
+```
+
+On an opened tree, rho is the largest generalized eigenvalue of the threshold residue R relative to the path Gram matrix S. This yields a computable positive penalty without computing the cyclic graph spectrum. It does not provide a hardware-performance guarantee.
+
+## Reading and running
+
+Read `MANUSCRIPT.pdf` for the complete proofs, `PUBLIC_SUMMARY.md` for the main ideas, `THEOREM_LEDGER.md` for claim-by-claim status, and `PROOF_AUDIT.md` for the critical checks. Source is `MANUSCRIPT.tex`; plain extracted text is `MANUSCRIPT.txt`.
+
+```bash
+python -m pip install -r requirements.txt
+python code/run_checks.py
+```
+
+The final run completed 604 exact rational graph tests, 604 separate exact ODE-nullity crosschecks, 200 floating-point finite-matrix tests, and 18 finite-element runs, with zero recorded assertion failures. Exact graph tests are finite-instance certificates, not an exhaustive or formal verification of the theorem. See `REPRODUCIBILITY.md`.
+
+## Completeness
+
+The five declared deliverable categories are present: full proof manuscript; executable implementations; saved test outputs; adversarial/prior-art audit; and citation/provenance metadata. **Deliverable completeness: 5/5 (100%).** This is a checklist completion percentage, not a probability that the mathematics is correct. No independent referee review, proof-assistant verification, or exhaustive priority search has been completed.
+
+The exact supplied predecessor archive is retained under `provenance/` for audit. Its claims are not silently imported into the new proof. No external files are needed beyond the stated Python packages to run the tests. Publication metadata contains no invented DOI, journal acceptance, repository URL, or reviewer endorsement.

RUN_CHECKS.bat

@@ -0,0 +1,10 @@
+@echo off
+setlocal
+cd /d "%~dp0"
+python code/run_checks.py
+if errorlevel 1 (
+  echo Checks failed. Review the error above.
+  exit /b 1
+)
+echo Checks completed. Results are in data.
+endlocal

SHA256SUMS

@@ -0,0 +1,34 @@
+b170ce6be9a8936d8d1bcb1e437db2bef7c67cca7e09be7b65f01279a4ce95ed  CHANGELOG.md
+38e36e107809576e4d743082e307c43bf7f86292f0060ad2d94531e7e640f5eb  CITATION.bib
+259b5792db7c04b13599cb4f05913a91a1fdb2f33c508a0d5327ba796ab19857  CITATION.cff
+4ba8af01c1bda4b17421689ac75b1a33540ef535fadf15878da8c8ab54f410db  EXPERT_REVIEW_GUIDE.md
+931a8318cb6b2ef9455eac58288144e04777bafb05e5cc8e94fa2ba6a8e107cd  LICENSE_STATUS.md
+a1c62d5df64e0dcd3a0a5ef9c71ebe2c2036eb3fb49ee333413a7c330d0fdd44  MANUSCRIPT.pdf
+bfdd03e203a1487c0c7eaebd58e058851f91ffd8ef1f73356bd5bc3cad16c394  MANUSCRIPT.tex
+5e413ea63900d2d718c290edb802c755e780d481cdb849761732e9b122f34d3a  MANUSCRIPT.txt
+2c936454d3256272a3849966946332ba4687e6bfea6841deb14d71ee05b222f5  PRIOR_ART_AND_CLAIM_BOUNDARY.md
+e6742a1da8e16fa1f7c32fbf790d0a21024b28c1305ceb0a63b3872419ce0a88  PROOF_AUDIT.md
+46e7211665019b34fc991461f66509b709c7f6207f94b8d66ebda3fa2d92317a  PUBLIC_SUMMARY.md
+925538341da23afce034430238c6012c600380875a0de3ff9e7a12c6ea2851d0  README.md
+25a80e076dc7bd9904984b6b38ef5cbe6a27e9392d0b3552040698c41b3555f2  REPRODUCIBILITY.md
+2f478921c7ec63ea7f388420df2eee769bade1eed6428261fb5a415c3d775ae0  RUN_CHECKS.bat
+39630cf9125e54eac567dbaab5d62b56fbe1580611930cfbebcf6385a4dc2e01  THEOREM_LEDGER.md
+7732e474969e3196c2533423a18c1661bdb270c0a82f8e6abe74a96c2fe753ab  code/exact_graph.py
+a4f749d4711a5ab933a80b8c4c529d314289b48690804d4c6395480a7029f2f8  code/fem_check.py
+cfd818c564ecf3cb2fd5b7f1faaffd04cd854a0fb27798411934823061df1a92  code/port_bound.py
+0f27182e10c25a51749151d68ac88f83ce8548af6423fb16b9a5b44c25ff81ff  code/run_checks.py
+804305c1ace1f72e5342d3d4edadf936b39e0bf0a141e4017eb21bc13ba79863  data/abstract_bound_checks.json
+1b8a20657337df67cdabe011ac3ed7c3f47387b7691929bdd9016f8329e093bf  data/api_smoke_checks.json
+b466c66bddcfc4cdebd9cd61e0a4300b3dc9f3551da2980a5fa5bd022710bb69  data/check_summary.json
+92745462522d3ec91a450cd0280df3455f32a0856503badc5d0f8016e1edf80e  data/document_preflight.json
+3b9f26ce3520bb05ce32d78b4c512ede8fb3fe7bfdd334ef66f584daf55d3b9c  data/environment.json
+d26efd5db6060939696d87a08eeb73a8ee3ff68e514ec3bb748d22b8bff7c7ed  data/exact_cases.json
+134a9c0409acd45aaa29be6ce8ac54c3d500d3ff054fe92d0a8ea8c2f74e176f  data/fem_convergence.csv
+16842ce1adc41803875e0a6290725660ddf2b0c3842310ff2e347399ff4ee3e9  data/theta_gap_certificate.json
+9e4489c026159372ccb6f611858292f4a6f32a318c061b15bc13349847302524  metadata/claims.json
+c80278d026064d7bc08f3cbb8c325367bb8993ccc353665c7dbd4cd3024777fa  metadata/research_index.json
+40e005a9fe452df6fd66a9176f94cfeb89a348824cb5f2b45aaa5cf5c626e996  provenance/INPUT_PROVENANCE.json
+15b9aa99475219ad939fe17c00459484c337a92f81ca0fa790f1ae5dac684263  provenance/eve_charged_cell_moment_rigidity_release_v1.0.0.zip
+2a70b1929d5502ead69ac2d99fe53b09aa8efb2eba0e4065b47bb8fd1a0365c3  requirements-tested.txt
+8d904a2a615088a77811deb8d6fa401b74768a22e68f25c5da5125d332f787c4  requirements.txt
+b3f2525425a43faa586ecdd626eb86ddad5ebc61b5a5384be0ef6d7e46e64217  run_checks.sh

THEOREM_LEDGER.md

@@ -0,0 +1,29 @@
+# Theorem ledger
+
+**Status vocabulary.** “Proof supplied” means a full mathematical argument is present in this release; it does not mean independently peer reviewed or formally verified. “Prior input” means an established external result used with attribution. “Finite check” means only the recorded instances were tested.
+
+| ID | Claim | Status | Principal assumptions | Location |
+|---|---|---|---|---|
+| P1 | BKKM total-length lower and upper eigenvalue estimates | Prior input, cited | Scalar compact metric graph, declared leaf conditions, not a circle | Section 1 |
+| P2 | Two-sided sharpness is equivalent to maximal multiplicity | Prior art, proof reproduced in the needed regime | Same graph class | Sections 1 and 8 |
+| P3 | Full-support selection at a lower-sharp eigenvalue | Prior argument, proof reproduced | Positive lower-sharp eigenvalue | Section 3 |
+| T1 | Exact tree nodal inertia with vertex zeros | Proof supplied; no broad claim to new oscillation theory | Fully supported eigenfunction, tree, positive eigenvalue | Section 3 |
+| T2 | Mixed-tree integer/half-integer equality rigidity | Independent direct proof supplied | High-index regime; D/N only at leaves | Section 4 |
+| T3 | Entire extremal eigenspace survives a form restriction | Proof supplied | Same kth eigenvalue; positive next spectral gap | Section 5 |
+| T4 | Admissible cycle opening adds exactly one Neumann leaf per cycle | Proof supplied | Connected, noncircle metric graph | Section 5 |
+| T5 | Equality of terminal evaluation functionals forces the same pendant edge and an even period | Proof supplied | Saturated tree with at least three leaves | Section 6 |
+| T6 | Complete two-leaf opening classification | Proof supplied | Opened interval; zero, one, or two cycles | Section 7 |
+| T7 | Lower sharpness alone forces full geometry, maximal multiplicity, and two-sided sharpness | Main candidate theorem; full proof supplied | Complete scope of Theorem 2.2 | Sections 2–8 |
+| T8 | On a saturated admissible opening, R=0 is sufficient and forces K=0 | Proof supplied; graph-specific | Same geometry, positive threshold | Section 9 |
+| T9 | Energy-normalized quantitative inheritance: delta >= g*rho/(lambda+g+rho) | Proof supplied | Nonnegative compact-resolvent form, controlled constraints, next gap g>0 | Section 10 |
+| T10 | Explicit graph gap from path Gram matrix and residue | Proof supplied | Opened tree is saturated | Section 10 |
+| T11 | Every one-sided equality generates an odd-harmonic tower | Proof supplied | Main classification assumptions | Section 12 |
+| T12 | Uniform strictness on compact nondegenerate metric sets away from equality | Proof supplied | Fixed topology, index, total length; positive minimum edge length | Section 12 |
+| C1 | 604 exact rational graph comparisons | Finite checks passed | Half-cell rational instances in saved data | Appendix A, code and data |
+| C2 | Independent ODE-nullity crosscheck of each of 604 instances | Finite checks passed | Exact coefficient matrices at pi frequency | Appendix A, code and data |
+| C3 | 200 abstract quantitative matrix tests | Floating-point checks passed | Positive diagonal test operators and random constraints | Appendix B |
+| C4 | 18 conforming finite-element runs | Approximation/convergence evidence | Six example graphs, three mesh densities | Appendix B |
+
+## Not established by this release
+
+No proof is supplied for the separate low-index equality classification, arbitrary Robin or magnetic conditions, general potentials, degenerate edge-collapse stability, the universal optimal eigenvalue-ratio constant, or any higher-dimensional Pólya conjecture. No publication acceptance, external referee approval, formal proof-assistant artifact, hardware validation, or certified priority claim exists in this release.

code/exact_graph.py

@@ -0,0 +1,212 @@
+"""Exact half-cell spectral certificates and a rational-length rigidity classifier.
+
+No floating-point eigensolver is used by exact_halfcell_spectrum. At frequency pi,
+subdivision into edges of length 1/2 reduces the eigenvalue count to rational
+inertia of a vertex adjacency matrix. See MANUSCRIPT, computational appendix.
+"""
+from __future__ import annotations
+from dataclasses import dataclass
+from fractions import Fraction
+from typing import Iterable
+import networkx as nx
+import sympy as sp
+
+@dataclass(frozen=True)
+class Edge:
+    u: int
+    v: int
+    length: Fraction
+    def __post_init__(self):
+        object.__setattr__(self, 'length', Fraction(self.length))
+        if self.length <= 0:
+            raise ValueError('Edge lengths must be strictly positive.')
+
+
+def graph(edges: Iterable[Edge], dirichlet=()) -> nx.MultiGraph:
+    es = list(edges)
+    if not es:
+        raise ValueError('At least one edge is required.')
+    g = nx.MultiGraph()
+    for e in es:
+        g.add_edge(e.u, e.v, length=e.length)
+    ds = set(dirichlet)
+    if not nx.is_connected(g):
+        raise ValueError('The graph must be connected.')
+    if not ds <= set(g):
+        raise ValueError('Unknown Dirichlet vertex.')
+    if any(g.degree(v) != 1 for v in ds):
+        raise ValueError('This release allows Dirichlet conditions only at leaves.')
+    nx.set_node_attributes(g, {v: v in ds for v in g}, 'D')
+    return g
+
+
+def suppress_degree_two(g: nx.MultiGraph) -> nx.MultiGraph:
+    g = g.copy()
+    while True:
+        changed = False
+        for v in list(g):
+            if g.degree(v) != 2 or g.nodes[v].get('D', False):
+                continue
+            inc = list(g.edges(v, keys=True, data=True))
+            if len(inc) != 2 or any(a == b for a, b, _, _ in inc):
+                continue  # A single circle remains a loop and is excluded later.
+            ends = [b if a == v else a for a, b, _, _ in inc]
+            length = sum((z[3]['length'] for z in inc), Fraction())
+            g.remove_node(v)
+            g.add_edge(ends[0], ends[1], length=length)
+            changed = True
+            break
+        if not changed:
+            return g
+
+
+def parameters(g):
+    d = sum(bool(g.nodes[v].get('D', False)) for v in g)
+    n = sum(g.degree(v) == 1 and not g.nodes[v].get('D', False) for v in g)
+    beta = g.number_of_edges() - g.number_of_nodes() + 1
+    length = sum((x['length'] for _, _, x in g.edges(data=True)), Fraction())
+    return d, n, beta, length
+
+
+def classify(edges: Iterable[Edge], dirichlet=(), k: int | None = None):
+    """Classify exact high-branch saturation using rational arithmetic.
+
+    If k=None, test the threshold pi^2 (d=1). Otherwise d=L/(k-(N+beta)/2).
+    A False answer means non-saturation in the declared regime, not a numerical
+    lower bound on the amount of strictness.
+    """
+    g = suppress_degree_two(graph(edges, dirichlet))
+    D, N, beta, L = parameters(g)
+    B = N + beta
+    if len(g) == 1 and g.number_of_edges() == 1:
+        return dict(saturated=False, family='excluded-circle', reason='The circle has a different bound.')
+    if k is None:
+        candidate = L + Fraction(B, 2)
+        if candidate.denominator != 1:
+            return dict(saturated=False, family='none', reason='The proposed index is not integral.')
+        k = int(candidate)
+        d = Fraction(1)
+    else:
+        if not isinstance(k, int):
+            raise ValueError('k must be an integer.')
+        c = Fraction(k) - Fraction(B, 2)
+        if c <= 0:
+            return dict(saturated=False, family='outside-regime', reason='Nonpositive target frequency.')
+        d = L / c
+    base = dict(k=k, D=D, N=N, beta=beta, d=str(d), multiplicity=D+N+2*beta-1)
+    if k < max(B, 1 if D else 2):
+        return dict(base, saturated=False, family='outside-regime', reason='Outside the high-index theorem.')
+    q = lambda x: 2*x/d
+    def positive_integer(x):
+        return x.denominator == 1 and x > 0
+    if len(g) == 1 and g.number_of_edges() == 2:
+        good = all(positive_integer(x['length']/(2*d)) for _, _, x in g.edges(data=True))
+        return dict(base, saturated=good, family='figure-eight', reason='Both loop lengths must be positive even cell counts.')
+    if len(g) == 2 and g.number_of_edges() == 3 and nx.number_of_selfloops(g) == 0:
+        counts = [x['length']/d for _, _, x in g.edges(data=True)]
+        good = all(positive_integer(x) for x in counts) and len({int(x) % 2 for x in counts}) == 1
+        return dict(base, saturated=good, family='theta', reason='Three positive integer cell counts of common parity.')
+    skeleton = g.copy()
+    loop_vertices = set()
+    for a, b, key, x in list(g.edges(keys=True, data=True)):
+        if a == b:
+            if g.degree(a) != 3 or a in loop_vertices:
+                return dict(base, saturated=False, family='excluded-topology', reason='A nonexceptional loop must be pendant at a degree-three vertex.')
+            if not positive_integer(x['length']/(2*d)):
+                return dict(base, saturated=False, family='lasso-tree', reason='An attached loop has incompatible phase.')
+            loop_vertices.add(a)
+            skeleton.remove_edge(a, b, key)
+    if len(skeleton) < 2 or not nx.is_tree(skeleton):
+        return dict(base, saturated=False, family='excluded-topology', reason='The nonloop skeleton must be a tree.')
+    virtual_N = loop_vertices | {v for v in g if g.degree(v) == 1 and not g.nodes[v].get('D', False)}
+    for a, b, x in skeleton.edges(data=True):
+        nu = int(a in virtual_N) + int(b in virtual_N)
+        m = x['length']/d - Fraction(nu, 2)
+        if m.denominator != 1 or m < 0 or (nu == 0 and m < 1):
+            return dict(base, saturated=False, family='lasso-tree' if beta else 'tree', reason='A skeleton edge violates the integer/half-integer phase rule.')
+    return dict(base, saturated=True, family='lasso-tree' if beta else 'tree', reason='All exact topology and metric conditions hold.')
+
+
+def rational_inertia(matrix):
+    """Return (positive, negative, zero) using exact 1x1/2x2 congruences."""
+    A = sp.Matrix(matrix)
+    if A != A.T:
+        raise ValueError('A symmetric matrix is required.')
+    pos = neg = zero = 0
+    while A.rows:
+        size = A.rows
+        pivot = next((i for i in range(size) if A[i,i] != 0), None)
+        if pivot is not None:
+            perm = [pivot] + [i for i in range(size) if i != pivot]
+            A = A.extract(perm, perm)
+            a = A[0,0]
+            pos += int(bool(a > 0)); neg += int(bool(a < 0))
+            v = A[1:,0]
+            A = A[1:,1:] - v*v.T/a
+        else:
+            pair = next(((i,j) for i in range(size) for j in range(i+1,size) if A[i,j] != 0), None)
+            if pair is None:
+                zero += size
+                break
+            i,j = pair
+            perm = [i,j] + [h for h in range(size) if h not in (i,j)]
+            A = A.extract(perm, perm)
+            pivot_block = A[:2,:2]
+            X = A[2:,:2]
+            A = A[2:,2:] - X*pivot_block.inv()*X.T
+            pos += 1; neg += 1
+    return pos, neg, zero
+
+
+def exact_halfcell_spectrum(edges: Iterable[Edge], dirichlet=()):
+    """Exact counts below/at pi^2; lengths must be positive multiples of 1/2."""
+    es = list(edges)
+    g = graph(es, dirichlet)
+    ds = set(dirichlet)
+    vertices = {v:i for i,v in enumerate(g)}
+    next_node = len(vertices)
+    segments = []
+    for e in es:
+        q = 2*e.length
+        if q.denominator != 1:
+            raise ValueError('All lengths must be integer multiples of 1/2.')
+        count = int(q)
+        nodes = [vertices[e.u]] + list(range(next_node, next_node+count-1)) + [vertices[e.v]]
+        next_node += count-1
+        segments += list(zip(nodes[:-1],nodes[1:]))
+    A = sp.zeros(next_node)
+    for a,b in segments:
+        A[a,b] += 1
+        A[b,a] += 1  # A loop contributes two on the diagonal.
+    keep = [i for i in range(next_node) if i not in {vertices[v] for v in ds}]
+    A = A.extract(keep,keep)
+    pos, neg, zero = rational_inertia(A)
+    return dict(below=pos, multiplicity=zero, top_index=pos+zero, adjacency_dimension=len(keep), adjacency_inertia=[pos,neg,zero])
+
+
+def threshold_multiplicity(edges: Iterable[Edge], dirichlet=()):
+    """Independent exact ODE coefficient-nullity check at frequency pi."""
+    es = list(edges)
+    g = graph(es, dirichlet)
+    ds = set(dirichlet)
+    traces = {v:[] for v in g}; derivatives = {v:[] for v in g}
+    n = 2*len(es)
+    for j,e in enumerate(es):
+        q = 2*e.length
+        if q.denominator != 1:
+            raise ValueError('Half-cell lengths are required.')
+        c = (1,0,-1,0)[int(q)%4]; s = (0,1,0,-1)[int(q)%4]
+        t0=sp.zeros(1,n); t1=sp.zeros(1,n); p0=sp.zeros(1,n); p1=sp.zeros(1,n)
+        t0[2*j]=1; t1[2*j]=c; t1[2*j+1]=s
+        p0[2*j+1]=1; p1[2*j]=s; p1[2*j+1]=-c
+        traces[e.u].append(t0); traces[e.v].append(t1)
+        derivatives[e.u].append(p0); derivatives[e.v].append(p1)
+    rows=[]
+    for v in g:
+        if v in ds:
+            rows.append(traces[v][0])
+        else:
+            rows += [t-traces[v][0] for t in traces[v][1:]]
+            rows.append(sum(derivatives[v],sp.zeros(1,n)))
+    M=sp.Matrix.vstack(*rows)
+    return n-M.rank()

code/fem_check.py

@@ -0,0 +1,31 @@
+"""Independent conforming P1 finite-element regressions (not proof certificates)."""
+from __future__ import annotations
+import numpy as np
+from scipy.sparse import coo_matrix
+from scipy.sparse.linalg import eigsh
+
+
+def eigenvalues(edges, dirichlet=(), count=20, density=60):
+    vertices=sorted({e.u for e in edges}|{e.v for e in edges})
+    ids={v:i for i,v in enumerate(vertices)}; total=len(ids)
+    entries=[]
+    for e in edges:
+        length=float(e.length)
+        ne=max(8,int(np.ceil(density*length)))
+        nodes=[ids[e.u]]+list(range(total,total+ne-1))+[ids[e.v]]
+        total+=ne-1
+        h=length/ne
+        for a,b in zip(nodes[:-1],nodes[1:]):
+            for i,gi in enumerate((a,b)):
+                for j,gj in enumerate((a,b)):
+                    entries.append((gi,gj,(1 if i==j else -1)/h,h*(2 if i==j else 1)/6))
+    rows,cols,kdata,mdata=map(np.array,zip(*entries))
+    K=coo_matrix((kdata,(rows.astype(int),cols.astype(int))),shape=(total,total)).tocsr()
+    M=coo_matrix((mdata,(rows.astype(int),cols.astype(int))),shape=(total,total)).tocsr()
+    excluded={ids[v] for v in dirichlet}
+    keep=[v for v in range(total) if v not in excluded]
+    K=K[keep,:][:,keep]; M=M[keep,:][:,keep]
+    if count>=len(keep):
+        raise ValueError('Too many requested eigenvalues for this mesh.')
+    vals=eigsh(K,k=count,M=M,sigma=-1e-5,which='LM',return_eigenvectors=False,tol=1e-10)
+    return np.sort(vals)

code/port_bound.py

@@ -0,0 +1,39 @@
+"""Quantitative extremal-eigenspace inheritance and theta examples."""
+from __future__ import annotations
+import numpy as np
+from scipy.linalg import eigh
+
+
+def inherited_gap_bound(lam: float, gap: float, residue: np.ndarray, path_gram: np.ndarray) -> dict:
+    if not np.isfinite(lam) or not np.isfinite(gap) or lam < 0 or gap <= 0:
+        raise ValueError('A nonnegative threshold and positive next gap are required.')
+    R=np.asarray(residue,dtype=float); S=np.asarray(path_gram,dtype=float)
+    if R.ndim != 2 or R.shape[0] != R.shape[1] or S.shape != R.shape:
+        raise ValueError('Compatible square residue and path-Gram matrices are required.')
+    if not np.all(np.isfinite(R)) or not np.all(np.isfinite(S)):
+        raise ValueError('Matrices must have finite entries.')
+    if R.shape == (0,0):
+        return dict(rho=0.0, gap_lower_bound=0.0)
+    if not np.allclose(R,R.T) or not np.allclose(S,S.T):
+        raise ValueError('Matrices must be symmetric.')
+    if np.linalg.eigvalsh(S)[0] <= 0:
+        raise ValueError('The path Gram matrix must be positive definite.')
+    if np.linalg.eigvalsh(R)[0] < -1e-10:
+        raise ValueError('The residue must be positive semidefinite.')
+    rho=max(0.0,float(eigh(R,S,eigvals_only=True)[-1]))
+    return dict(rho=rho, gap_lower_bound=gap*rho/(lam+gap+rho))
+
+
+def theta_bound(lengths, k: int) -> dict:
+    a,b,c=map(float,lengths)
+    if not all(np.isfinite(x) for x in (a,b,c)) or min(a,b,c)<=0 or not isinstance(k,int) or k<2:
+        raise ValueError('Positive lengths and k>=2 are required.')
+    L=a+b+c; mu=np.pi*(k-1)/L; lam=mu*mu
+    # Opened interval: new leaf -- b -- V -- a -- U -- c -- new leaf.
+    mismatch=np.sqrt(2/L)*np.array([1-np.cos(mu*(a+b)), np.cos(mu*L)-np.cos(mu*b)])
+    R=np.outer(mismatch,mismatch)
+    S=np.array([[a+b,-a],[-a,a+c]])
+    g0=np.pi**2*(2*k-1)/L**2
+    result=inherited_gap_bound(lam,g0,R,S)
+    result.update(threshold=lam, next_tree_gap=g0, residue=R.tolist(), path_gram=S.tolist(), k=k, lengths=[a,b,c])
+    return result

code/run_checks.py

@@ -0,0 +1,148 @@
+"""Run deterministic exact and numerical release checks; write JSON/CSV results."""
+from __future__ import annotations
+from fractions import Fraction as F
+from pathlib import Path
+import random, json, csv
+import numpy as np
+import networkx as nx
+from scipy.linalg import null_space, eigh
+from exact_graph import Edge, graph, parameters, classify, exact_halfcell_spectrum, threshold_multiplicity
+from port_bound import theta_bound
+from fem_check import eigenvalues
+
+ROOT=Path(__file__).resolve().parents[1]
+rng=random.Random(260925)
+cases=[]
+def add(name, data, D=()):
+    es=[Edge(a,b,F(str(l))) for a,b,l in data]
+    cases.append((name,es,tuple(D)))
+
+add('DD_interval',[(0,1,2)],(0,1))
+add('DN_interval',[(0,1,2.5)],(0,))
+add('NN_interval',[(0,1,2)])
+add('mixed_star',[(0,1,1.5),(0,2,1),(0,3,1)],(2,3))
+add('theta_odd',[(0,1,1),(0,1,1),(0,1,3)])
+add('theta_even',[(0,1,2),(0,1,2),(0,1,4)])
+add('theta_wrong_parity',[(0,1,1),(0,1,1),(0,1,2)])
+add('figure_eight',[(0,0,2),(0,0,4)])
+add('figure_eight_bad',[(0,0,1),(0,0,3)])
+add('Dirichlet_lasso',[(0,0,2),(0,1,1.5)],(1,))
+add('Neumann_lasso',[(0,0,2),(0,1,1)])
+add('barbell',[(0,0,2),(0,1,1),(1,1,2)])
+add('branch_lasso_tree',[(0,1,1),(0,2,.5),(0,3,2.5),(2,2,2)],(1,))
+add('loop_at_degree_four',[(0,0,2.5),(0,1,.5),(0,2,1.5)])
+for p in range(3,7):
+    add(f'bouquet_{p}',[(0,0,2)]*p)
+for p in range(2,8):
+    add(f'pumpkin_{p}',[(0,1,1)]*p)
+
+# Connected simple graph atlas, with all degree-two labels harmlessly retained.
+atlas=[g for g in nx.graph_atlas_g() if 2<=len(g)<=6 and nx.is_connected(g)]
+for j,g in enumerate(atlas):
+    for repetition in range(3):
+        leaves=[v for v in g if g.degree(v)==1]
+        D=[v for v in leaves if rng.random()<.5]
+        es=[(a,b,F(rng.randint(1,4),2)) for a,b in g.edges()]
+        add(f'atlas_{j}_{repetition}',es,D)
+
+# Explicit compatible stars and loop-decorated trees guarantee substantial
+# positive coverage, rather than a suite consisting mostly of strict cases.
+for i in range(60):
+    branches=rng.randint(3,6)
+    D=[]; es=[]
+    for v in range(1,branches+1):
+        virtualN=rng.random()<.6
+        m=rng.randint(0,1) if virtualN else rng.randint(1,2)
+        es.append((0,v,F(m)+F(int(virtualN),2)))
+        if virtualN and rng.random()<.5:
+            es.append((v,v,2))
+        elif not virtualN:
+            D.append(v)
+    add(f'compatible_star_{i}',es,D)
+
+# Compatible nonsymmetric tree skeletons, including multiple branch vertices.
+for order in range(2,9):
+    for tree_index,tree in enumerate(nx.nonisomorphic_trees(order)):
+        for rep in range(2):
+            leaves=[v for v in tree if tree.degree(v)==1]
+            virtualN={v for v in leaves if rng.random()<.55}
+            D=[v for v in leaves if v not in virtualN]
+            es=[]
+            for a,b in tree.edges():
+                nu=int(a in virtualN)+int(b in virtualN)
+                m=rng.randint(0,1) if nu else rng.randint(1,2)
+                es.append((a,b,F(m)+F(nu,2)))
+            for v in virtualN:
+                if rng.random()<.5:
+                    es.append((v,v,2))
+            add(f'compatible_tree_{order}_{tree_index}_{rep}',es,D)
+
+results=[]
+for name,es,D in cases:
+    g=graph(es,D)
+    d,n,beta,L=parameters(g); B=n+beta
+    candidate=L+F(B,2)
+    inregime=candidate.denominator==1 and int(candidate)>=max(B,1 if d else 2)
+    # Circle is excluded from the inequality and classifier.
+    circle=all(g.degree(v)==2 for v in g)
+    certificate=exact_halfcell_spectrum(es,D)
+    classification=classify(es,D)
+    exact_sharp=bool(inregime and not circle and certificate['multiplicity']>0 and certificate['top_index']==int(candidate))
+    assert exact_sharp == classification['saturated'], (name,classification,certificate)
+    ode_multiplicity=threshold_multiplicity(es,D)
+    assert certificate['multiplicity']==ode_multiplicity,(name,certificate,ode_multiplicity)
+    if exact_sharp:
+        assert certificate['multiplicity']==d+n+2*beta-1,(name,certificate)
+    results.append(dict(name=name,edges=[[e.u,e.v,str(e.length)] for e in es],Dirichlet=list(D),classification=classification,exact=certificate,ODE_multiplicity=ode_multiplicity,passed=True))
+
+# General abstract quantitative inheritance: independent random matrix tests.
+np_rng=np.random.default_rng(260925)
+abstract=[]
+for case in range(200):
+    size=12; k=5; m=int(np_rng.integers(1,4)); lower=k-m
+    lam=2.0; g=float(np_rng.uniform(.2,2.0))
+    values=np.r_[np.linspace(.3,1.3,lower),np.full(m,lam),lam+g,lam+g+np.arange(1,size-k)]
+    A=np.diag(values)
+    ports=int(np_rng.integers(1,4))
+    C=np_rng.normal(size=(ports,size))
+    S=C@np.diag(1/values)@C.T
+    R=C[:,lower:k]@C[:,lower:k].T
+    rho=max(0.,float(eigh(R,S,eigvals_only=True)[-1]))
+    bound=g*rho/(lam+g+rho)
+    Q=null_space(C)
+    delta=float(eigh(Q.T@A@Q,eigvals_only=True)[k-1]-lam)
+    assert delta+1e-10>=bound,(delta,bound)
+    abstract.append(dict(case=case,delta=delta,bound=bound,passed=True))
+
+# Numerical convergence and the concrete strict theta gap certificate.
+numerical=[]
+for name in ['theta_odd','theta_wrong_parity','figure_eight','Dirichlet_lasso','branch_lasso_tree','barbell']:
+    _,es,D=next(c for c in cases if c[0]==name)
+    d,n,beta,L=parameters(graph(es,D)); k=int(L+F(n+beta,2))
+    for density in (30,60,120):
+        vals=eigenvalues(es,D,count=max(k+3,12),density=density)
+        row=dict(name=name,density=density,k=k,lambda_k=float(vals[k-1]),excess=float(vals[k-1]-np.pi**2))
+        numerical.append(row)
+strict=theta_bound((1,1,2),5)
+strict['exact_excess_expression']='4*(pi-atan(sqrt(5)))**2-pi**2'
+strict['exact_excess_decimal']=float(4*(np.pi-np.arctan(np.sqrt(5)))**2-np.pi**2)
+strict['numerical_finest_excess']=next(x['excess'] for x in numerical if x['name']=='theta_wrong_parity' and x['density']==120)
+assert strict['exact_excess_decimal']>strict['gap_lower_bound']
+theta_fem=[x['excess'] for x in numerical if x['name']=='theta_wrong_parity']
+assert all(x>strict['exact_excess_decimal'] for x in theta_fem)
+assert all(a>b for a,b in zip(theta_fem,theta_fem[1:]))
+assert strict['numerical_finest_excess']>strict['gap_lower_bound']
+# Port-coordinate invariance is structural; verify a nonorthogonal example.
+U=np.array([[2.,1.],[0.,3.]])
+R=np.array(strict['residue']);S=np.array(strict['path_gram'])
+assert np.allclose(eigh(U@R@U.T,U@S@U.T,eigvals_only=True),eigh(R,S,eigvals_only=True))
+
+out=ROOT/'data';out.mkdir(exist_ok=True)
+(out/'exact_cases.json').write_text(json.dumps(results,indent=2))
+(out/'abstract_bound_checks.json').write_text(json.dumps(abstract,indent=2))
+(out/'theta_gap_certificate.json').write_text(json.dumps(strict,indent=2))
+with (out/'fem_convergence.csv').open('w',newline='') as f:
+    writer=csv.DictWriter(f,fieldnames=numerical[0].keys());writer.writeheader();writer.writerows(numerical)
+summary=dict(exact_graph_cases=len(results),exact_graph_passed=len(results),exact_saturated_cases=sum(r['classification']['saturated'] for r in results),exact_ODE_nullity_crosschecks=len(results),abstract_inequality_cases=len(abstract),abstract_inequality_passed=len(abstract),FEM_runs=len(numerical),failures=0,seed=260925,proof_role='Regression and finite-instance certificates only; the general theorem is proved in the manuscript.',theta_gap_bound=strict['gap_lower_bound'],theta_actual_excess_FEM=strict['numerical_finest_excess'],theta_exact_excess_decimal=strict['exact_excess_decimal'])
+(out/'check_summary.json').write_text(json.dumps(summary,indent=2))
+print(json.dumps(summary,indent=2))

data/abstract_bound_checks.json

@@ -0,0 +1,1202 @@
+[
+  {
+    "case": 0,
+    "delta": 0.05983080648346295,
+    "bound": 0.0051642644081071176,
+    "passed": true
+  },
+  {
+    "case": 1,
+    "delta": 1.5915714268111487,
+    "bound": 0.19481208070875475,
+    "passed": true
+  },
+  {
+    "case": 2,
+    "delta": 0.41904100591048143,
+    "bound": 0.031017674802794024,
+    "passed": true
+  },
+  {
+    "case": 3,
+    "delta": 0.9949780516737787,
+    "bound": 0.048221722719831966,
+    "passed": true
+  },
+  {
+    "case": 4,
+    "delta": 1.0276023128327116,
+    "bound": 0.3560752362223616,
+    "passed": true
+  },
+  {
+    "case": 5,
+    "delta": 0.9812181419924841,
+    "bound": 0.1486252717490564,
+    "passed": true
+  },
+  {
+    "case": 6,
+    "delta": 0.593994888476403,
+    "bound": 0.07111174103226053,
+    "passed": true
+  },
+  {
+    "case": 7,
+    "delta": 0.13080153089824664,
+    "bound": 0.016180210010601045,
+    "passed": true
+  },
+  {
+    "case": 8,
+    "delta": 2.01639919784665,
+    "bound": 0.3369596540264829,
+    "passed": true
+  },
+  {
+    "case": 9,
+    "delta": 0.7133796355831219,
+    "bound": 0.0859815215205308,
+    "passed": true
+  },
+  {
+    "case": 10,
+    "delta": 1.7143493231202283,
+    "bound": 0.27960758837367095,
+    "passed": true
+  },
+  {
+    "case": 11,
+    "delta": 0.7175753537593716,
+    "bound": 0.05032702621285269,
+    "passed": true
+  },
+  {
+    "case": 12,
+    "delta": 1.2722855410878005,
+    "bound": 0.1962994739387527,
+    "passed": true
+  },
+  {
+    "case": 13,
+    "delta": 0.5872907505586658,
+    "bound": 0.11103493274659859,
+    "passed": true
+  },
+  {
+    "case": 14,
+    "delta": 1.5002428301131272,
+    "bound": 0.2700807336780858,
+    "passed": true
+  },
+  {
+    "case": 15,
+    "delta": 1.350990522979929,
+    "bound": 0.1327841132278525,
+    "passed": true
+  },
+  {
+    "case": 16,
+    "delta": 0.12816785551119025,
+    "bound": 0.017645360748801252,
+    "passed": true
+  },
+  {
+    "case": 17,
+    "delta": 0.8309448453385966,
+    "bound": 0.13943796853925625,
+    "passed": true
+  },
+  {
+    "case": 18,
+    "delta": 2.060910670618239,
+    "bound": 0.07589673226483358,
+    "passed": true
+  },
+  {
+    "case": 19,
+    "delta": 1.8369050027018856,
+    "bound": 0.2459917365090043,
+    "passed": true
+  },
+  {
+    "case": 20,
+    "delta": 0.16309782687732177,
+    "bound": 0.012319573181898656,
+    "passed": true
+  },
+  {
+    "case": 21,
+    "delta": 1.050348797890884,
+    "bound": 0.22981610202670144,
+    "passed": true
+  },
+  {
+    "case": 22,
+    "delta": 2.2884532862058737,
+    "bound": 0.28843158589088147,
+    "passed": true
+  },
+  {
+    "case": 23,
+    "delta": 1.6522782720511842,
+    "bound": 0.24110157584499511,
+    "passed": true
+  },
+  {
+    "case": 24,
+    "delta": 0.9279813446763274,
+    "bound": 0.1715405772612438,
+    "passed": true
+  },
+  {
+    "case": 25,
+    "delta": 0.44170729038970924,
+    "bound": 0.033607554310382766,
+    "passed": true
+  },
+  {
+    "case": 26,
+    "delta": 0.7890611012722726,
+    "bound": 0.1006519579704516,
+    "passed": true
+  },
+  {
+    "case": 27,
+    "delta": 2.0310420634533664,
+    "bound": 0.08264933757368115,
+    "passed": true
+  },
+  {
+    "case": 28,
+    "delta": 1.5469840638139827,
+    "bound": 0.15762321169465607,
+    "passed": true
+  },
+  {
+    "case": 29,
+    "delta": 1.1965388055902202,
+    "bound": 0.04289300475610366,
+    "passed": true
+  },
+  {
+    "case": 30,
+    "delta": 1.9388496692530364,
+    "bound": 0.06594666141385071,
+    "passed": true
+  },
+  {
+    "case": 31,
+    "delta": 2.475570750690867,
+    "bound": 0.3870152484612668,
+    "passed": true
+  },
+  {
+    "case": 32,
+    "delta": 0.6721083798830363,
+    "bound": 0.05776804159364749,
+    "passed": true
+  },
+  {
+    "case": 33,
+    "delta": 2.1086652283489924,
+    "bound": 0.06607469322019661,
+    "passed": true
+  },
+  {
+    "case": 34,
+    "delta": 0.020584722006493195,
+    "bound": 0.00011405752303169816,
+    "passed": true
+  },
+  {
+    "case": 35,
+    "delta": 0.7673756860011665,
+    "bound": 0.3144042504965093,
+    "passed": true
+  },
+  {
+    "case": 36,
+    "delta": 1.114266530424687,
+    "bound": 0.02376116355883395,
+    "passed": true
+  },
+  {
+    "case": 37,
+    "delta": 1.4625060650959867,
+    "bound": 0.10160963641990792,
+    "passed": true
+  },
+  {
+    "case": 38,
+    "delta": 0.6685463754957146,
+    "bound": 0.07946151117818873,
+    "passed": true
+  },
+  {
+    "case": 39,
+    "delta": 1.156011862272846,
+    "bound": 0.10516734004367437,
+    "passed": true
+  },
+  {
+    "case": 40,
+    "delta": 1.0167000738726308,
+    "bound": 0.10541792890705498,
+    "passed": true
+  },
+  {
+    "case": 41,
+    "delta": 0.2890030943606905,
+    "bound": 0.08261147177080969,
+    "passed": true
+  },
+  {
+    "case": 42,
+    "delta": 1.5029835783879126,
+    "bound": 0.1612775847991502,
+    "passed": true
+  },
+  {
+    "case": 43,
+    "delta": 2.005796923450771,
+    "bound": 0.08186974721511743,
+    "passed": true
+  },
+  {
+    "case": 44,
+    "delta": 1.0867537316728426,
+    "bound": 0.3169001466231395,
+    "passed": true
+  },
+  {
+    "case": 45,
+    "delta": 0.12105437248383666,
+    "bound": 0.004407619299856424,
+    "passed": true
+  },
+  {
+    "case": 46,
+    "delta": 0.820433734146671,
+    "bound": 0.009456531783722924,
+    "passed": true
+  },
+  {
+    "case": 47,
+    "delta": 1.8555210643347295,
+    "bound": 0.21169629819812585,
+    "passed": true
+  },
+  {
+    "case": 48,
+    "delta": 0.6305355552694754,
+    "bound": 0.20628316452028192,
+    "passed": true
+  },
+  {
+    "case": 49,
+    "delta": 2.2771379494448816,
+    "bound": 0.17685905181241135,
+    "passed": true
+  },
+  {
+    "case": 50,
+    "delta": 0.47748535350183685,
+    "bound": 0.009130610910240214,
+    "passed": true
+  },
+  {
+    "case": 51,
+    "delta": 1.7325067263115903,
+    "bound": 0.3901808194858087,
+    "passed": true
+  },
+  {
+    "case": 52,
+    "delta": 1.501272585642687,
+    "bound": 0.12798890917552452,
+    "passed": true
+  },
+  {
+    "case": 53,
+    "delta": 0.5923330945764667,
+    "bound": 0.18549467517629348,
+    "passed": true
+  },
+  {
+    "case": 54,
+    "delta": 1.5224904143957416,
+    "bound": 0.1368085097434716,
+    "passed": true
+  },
+  {
+    "case": 55,
+    "delta": 1.6069446556029479,
+    "bound": 0.10535542989786549,
+    "passed": true
+  },
+  {
+    "case": 56,
+    "delta": 2.048069733764172,
+    "bound": 0.1440966270996546,
+    "passed": true
+  },
+  {
+    "case": 57,
+    "delta": 1.4487004975386641,
+    "bound": 0.32505578777941535,
+    "passed": true
+  },
+  {
+    "case": 58,
+    "delta": 2.5609152187894146,
+    "bound": 0.35764150524314675,
+    "passed": true
+  },
+  {
+    "case": 59,
+    "delta": 2.9422849365712205,
+    "bound": 0.4799518180287136,
+    "passed": true
+  },
+  {
+    "case": 60,
+    "delta": 0.29777869546868363,
+    "bound": 0.03710280215653557,
+    "passed": true
+  },
+  {
+    "case": 61,
+    "delta": 0.987608767320769,
+    "bound": 0.31168233124777067,
+    "passed": true
+  },
+  {
+    "case": 62,
+    "delta": 1.969828337890159,
+    "bound": 0.28834254614382515,
+    "passed": true
+  },
+  {
+    "case": 63,
+    "delta": 1.2339136647313431,
+    "bound": 0.23736543987042957,
+    "passed": true
+  },
+  {
+    "case": 64,
+    "delta": 0.755686908960401,
+    "bound": 0.10900676880026612,
+    "passed": true
+  },
+  {
+    "case": 65,
+    "delta": 1.9578004498864754,
+    "bound": 0.4876513471480024,
+    "passed": true
+  },
+  {
+    "case": 66,
+    "delta": 1.7825928391350985,
+    "bound": 0.2650932773078505,
+    "passed": true
+  },
+  {
+    "case": 67,
+    "delta": 1.356914923267647,
+    "bound": 0.08754213789347892,
+    "passed": true
+  },
+  {
+    "case": 68,
+    "delta": 0.9116479411671903,
+    "bound": 0.04969954648102155,
+    "passed": true
+  },
+  {
+    "case": 69,
+    "delta": 1.372098814224835,
+    "bound": 0.13684494413281978,
+    "passed": true
+  },
+  {
+    "case": 70,
+    "delta": 1.7989342185684323,
+    "bound": 0.03847973354113017,
+    "passed": true
+  },
+  {
+    "case": 71,
+    "delta": 0.7290570696594112,
+    "bound": 0.07040962566557982,
+    "passed": true
+  },
+  {
+    "case": 72,
+    "delta": 0.9046334818944839,
+    "bound": 0.16927614987210454,
+    "passed": true
+  },
+  {
+    "case": 73,
+    "delta": 0.0035551536191915645,
+    "bound": 0.0004588220616236328,
+    "passed": true
+  },
+  {
+    "case": 74,
+    "delta": 1.665276071251086,
+    "bound": 0.14636337947825945,
+    "passed": true
+  },
+  {
+    "case": 75,
+    "delta": 1.0839876472808152,
+    "bound": 0.08629637174556512,
+    "passed": true
+  },
+  {
+    "case": 76,
+    "delta": 2.1500769204203563,
+    "bound": 0.027942696231456288,
+    "passed": true
+  },
+  {
+    "case": 77,
+    "delta": 1.3059784002674073,
+    "bound": 0.4815910584561668,
+    "passed": true
+  },
+  {
+    "case": 78,
+    "delta": 1.0178194851424283,
+    "bound": 0.2697334787812874,
+    "passed": true
+  },
+  {
+    "case": 79,
+    "delta": 0.1147618133983257,
+    "bound": 0.013298585262473515,
+    "passed": true
+  },
+  {
+    "case": 80,
+    "delta": 1.2220472632225623,
+    "bound": 0.13842390397909018,
+    "passed": true
+  },
+  {
+    "case": 81,
+    "delta": 1.7478568124890543,
+    "bound": 0.049893211100008904,
+    "passed": true
+  },
+  {
+    "case": 82,
+    "delta": 0.02210951622750157,
+    "bound": 0.0018425278463887792,
+    "passed": true
+  },
+  {
+    "case": 83,
+    "delta": 1.3138541759849867,
+    "bound": 0.26669479781103,
+    "passed": true
+  },
+  {
+    "case": 84,
+    "delta": 0.4403311647293431,
+    "bound": 0.18057491622866678,
+    "passed": true
+  },
+  {
+    "case": 85,
+    "delta": 1.975733687069828,
+    "bound": 0.07442889873007098,
+    "passed": true
+  },
+  {
+    "case": 86,
+    "delta": 1.5941749176480728,
+    "bound": 0.11067219858348186,
+    "passed": true
+  },
+  {
+    "case": 87,
+    "delta": 1.0420238633868353,
+    "bound": 0.04185246651984593,
+    "passed": true
+  },
+  {
+    "case": 88,
+    "delta": 2.3068443246265824,
+    "bound": 0.0795794118063685,
+    "passed": true
+  },
+  {
+    "case": 89,
+    "delta": 0.7555798221519225,
+    "bound": 0.0010367051664755395,
+    "passed": true
+  },
+  {
+    "case": 90,
+    "delta": 1.3221052809289464,
+    "bound": 0.0798014641894691,
+    "passed": true
+  },
+  {
+    "case": 91,
+    "delta": 0.9200852916195585,
+    "bound": 0.1456425674897889,
+    "passed": true
+  },
+  {
+    "case": 92,
+    "delta": 1.3621772956886913,
+    "bound": 0.2966735025388668,
+    "passed": true
+  },
+  {
+    "case": 93,
+    "delta": 1.8620398369787332,
+    "bound": 0.40778235292131887,
+    "passed": true
+  },
+  {
+    "case": 94,
+    "delta": 1.676281642289942,
+    "bound": 0.15886533149241483,
+    "passed": true
+  },
+  {
+    "case": 95,
+    "delta": 1.2118645012673985,
+    "bound": 0.14963208107605455,
+    "passed": true
+  },
+  {
+    "case": 96,
+    "delta": 0.33217627186096976,
+    "bound": 0.0303564602967512,
+    "passed": true
+  },
+  {
+    "case": 97,
+    "delta": 2.3166284920740656,
+    "bound": 0.22944644827722055,
+    "passed": true
+  },
+  {
+    "case": 98,
+    "delta": 1.4929067571708816,
+    "bound": 0.11720630980460923,
+    "passed": true
+  },
+  {
+    "case": 99,
+    "delta": 0.24163012532744377,
+    "bound": 0.07476921662537427,
+    "passed": true
+  },
+  {
+    "case": 100,
+    "delta": 1.402785383116655,
+    "bound": 0.17298849311390416,
+    "passed": true
+  },
+  {
+    "case": 101,
+    "delta": 2.3703421969111025,
+    "bound": 0.2827833177253515,
+    "passed": true
+  },
+  {
+    "case": 102,
+    "delta": 0.2503972918044517,
+    "bound": 0.09582105986018094,
+    "passed": true
+  },
+  {
+    "case": 103,
+    "delta": 1.9480838375523604,
+    "bound": 0.00011640793462372062,
+    "passed": true
+  },
+  {
+    "case": 104,
+    "delta": 0.32930695821331435,
+    "bound": 0.088070104269687,
+    "passed": true
+  },
+  {
+    "case": 105,
+    "delta": 0.6128955797358397,
+    "bound": 0.030381412659980043,
+    "passed": true
+  },
+  {
+    "case": 106,
+    "delta": 0.9734578373626315,
+    "bound": 0.08064392284271368,
+    "passed": true
+  },
+  {
+    "case": 107,
+    "delta": 0.8875100511830212,
+    "bound": 0.0924953747660653,
+    "passed": true
+  },
+  {
+    "case": 108,
+    "delta": 2.326897931560187,
+    "bound": 0.27892952055980075,
+    "passed": true
+  },
+  {
+    "case": 109,
+    "delta": 2.05783321423044,
+    "bound": 0.18328651610882982,
+    "passed": true
+  },
+  {
+    "case": 110,
+    "delta": 2.633455961579843,
+    "bound": 0.4453813566773439,
+    "passed": true
+  },
+  {
+    "case": 111,
+    "delta": 1.2808295519756583,
+    "bound": 0.05926138197183992,
+    "passed": true
+  },
+  {
+    "case": 112,
+    "delta": 0.8001310305595486,
+    "bound": 0.003399138284364092,
+    "passed": true
+  },
+  {
+    "case": 113,
+    "delta": 0.3352363181113751,
+    "bound": 0.11799872091352553,
+    "passed": true
+  },
+  {
+    "case": 114,
+    "delta": 0.28422569735873315,
+    "bound": 0.012615938324607081,
+    "passed": true
+  },
+  {
+    "case": 115,
+    "delta": 2.18663596002893,
+    "bound": 0.04757284422258244,
+    "passed": true
+  },
+  {
+    "case": 116,
+    "delta": 1.412268671165092,
+    "bound": 0.12509157216833391,
+    "passed": true
+  },
+  {
+    "case": 117,
+    "delta": 1.7024092788353973,
+    "bound": 9.526568879207889e-05,
+    "passed": true
+  },
+  {
+    "case": 118,
+    "delta": 0.3546692072977242,
+    "bound": 0.006609024175433196,
+    "passed": true
+  },
+  {
+    "case": 119,
+    "delta": 1.6983978622433251,
+    "bound": 0.02374821017326903,
+    "passed": true
+  },
+  {
+    "case": 120,
+    "delta": 2.1974465858510284,
+    "bound": 0.296131457588886,
+    "passed": true
+  },
+  {
+    "case": 121,
+    "delta": 1.2584629963671663,
+    "bound": 0.0876933249206795,
+    "passed": true
+  },
+  {
+    "case": 122,
+    "delta": 2.3135802517128585,
+    "bound": 0.2590579097179526,
+    "passed": true
+  },
+  {
+    "case": 123,
+    "delta": 2.4600976901372595,
+    "bound": 0.39981513303792354,
+    "passed": true
+  },
+  {
+    "case": 124,
+    "delta": 0.9896574962049893,
+    "bound": 0.05881238861325694,
+    "passed": true
+  },
+  {
+    "case": 125,
+    "delta": 1.5630041936512113,
+    "bound": 0.23853564562267546,
+    "passed": true
+  },
+  {
+    "case": 126,
+    "delta": 1.0724157257133848,
+    "bound": 0.09829673039976627,
+    "passed": true
+  },
+  {
+    "case": 127,
+    "delta": 0.591950028703724,
+    "bound": 0.03711299503100958,
+    "passed": true
+  },
+  {
+    "case": 128,
+    "delta": 2.8443877480893676,
+    "bound": 0.23739568475102896,
+    "passed": true
+  },
+  {
+    "case": 129,
+    "delta": 1.459992618766127,
+    "bound": 0.12979341054372212,
+    "passed": true
+  },
+  {
+    "case": 130,
+    "delta": 0.48079242502197106,
+    "bound": 0.17424570250065033,
+    "passed": true
+  },
+  {
+    "case": 131,
+    "delta": 0.22113131868628821,
+    "bound": 0.028042745410847628,
+    "passed": true
+  },
+  {
+    "case": 132,
+    "delta": 2.2329661637247495,
+    "bound": 0.5432890624069098,
+    "passed": true
+  },
+  {
+    "case": 133,
+    "delta": 2.0601107812800272,
+    "bound": 0.47934684809426226,
+    "passed": true
+  },
+  {
+    "case": 134,
+    "delta": 1.9893854309218035,
+    "bound": 0.3365783065056876,
+    "passed": true
+  },
+  {
+    "case": 135,
+    "delta": 1.0946752572127845,
+    "bound": 0.11631494608968132,
+    "passed": true
+  },
+  {
+    "case": 136,
+    "delta": 1.6542654966947974,
+    "bound": 0.39637822098011777,
+    "passed": true
+  },
+  {
+    "case": 137,
+    "delta": 0.677839126518943,
+    "bound": 0.168195784749306,
+    "passed": true
+  },
+  {
+    "case": 138,
+    "delta": 0.26728822187211954,
+    "bound": 0.061612949689053294,
+    "passed": true
+  },
+  {
+    "case": 139,
+    "delta": 0.9255237507745879,
+    "bound": 0.11543738866726073,
+    "passed": true
+  },
+  {
+    "case": 140,
+    "delta": 0.5945552836826042,
+    "bound": 0.011498394662798997,
+    "passed": true
+  },
+  {
+    "case": 141,
+    "delta": 1.008256038033279,
+    "bound": 0.06738870182059171,
+    "passed": true
+  },
+  {
+    "case": 142,
+    "delta": 2.4822744628178874,
+    "bound": 0.4642748175641877,
+    "passed": true
+  },
+  {
+    "case": 143,
+    "delta": 0.7415001293901136,
+    "bound": 0.07764707822694289,
+    "passed": true
+  },
+  {
+    "case": 144,
+    "delta": 1.9166017336053347,
+    "bound": 0.291665178715002,
+    "passed": true
+  },
+  {
+    "case": 145,
+    "delta": 1.6526014584394968,
+    "bound": 0.15952230821338131,
+    "passed": true
+  },
+  {
+    "case": 146,
+    "delta": 0.37841621843866147,
+    "bound": 0.01756920942733956,
+    "passed": true
+  },
+  {
+    "case": 147,
+    "delta": 0.6772113454985305,
+    "bound": 0.035985476514034706,
+    "passed": true
+  },
+  {
+    "case": 148,
+    "delta": 3.075141457721914,
+    "bound": 0.41558609620697096,
+    "passed": true
+  },
+  {
+    "case": 149,
+    "delta": 0.48544125167154384,
+    "bound": 0.14696477518217949,
+    "passed": true
+  },
+  {
+    "case": 150,
+    "delta": 0.5007554832497281,
+    "bound": 0.01748750431208429,
+    "passed": true
+  },
+  {
+    "case": 151,
+    "delta": 0.5118791810006704,
+    "bound": 0.027646924921298232,
+    "passed": true
+  },
+  {
+    "case": 152,
+    "delta": 0.37592980942312115,
+    "bound": 0.005110371257743386,
+    "passed": true
+  },
+  {
+    "case": 153,
+    "delta": 0.8261846862719051,
+    "bound": 0.15488253385563078,
+    "passed": true
+  },
+  {
+    "case": 154,
+    "delta": 0.3602746605176428,
+    "bound": 0.026632003262920364,
+    "passed": true
+  },
+  {
+    "case": 155,
+    "delta": 0.6899418667368873,
+    "bound": 0.04174482611588111,
+    "passed": true
+  },
+  {
+    "case": 156,
+    "delta": 1.5604044953108707,
+    "bound": 0.3727624830520671,
+    "passed": true
+  },
+  {
+    "case": 157,
+    "delta": 2.167476939306166,
+    "bound": 0.4581359737002204,
+    "passed": true
+  },
+  {
+    "case": 158,
+    "delta": 0.366839117177169,
+    "bound": 0.06806829545676053,
+    "passed": true
+  },
+  {
+    "case": 159,
+    "delta": 1.5321978110603984,
+    "bound": 0.11052865585706328,
+    "passed": true
+  },
+  {
+    "case": 160,
+    "delta": 2.194749792672426,
+    "bound": 0.5167362735152453,
+    "passed": true
+  },
+  {
+    "case": 161,
+    "delta": 1.6644212314481615,
+    "bound": 0.24806813139254616,
+    "passed": true
+  },
+  {
+    "case": 162,
+    "delta": 1.5779076525069224,
+    "bound": 0.16745371630729985,
+    "passed": true
+  },
+  {
+    "case": 163,
+    "delta": 0.04154106113495848,
+    "bound": 0.02328854530467139,
+    "passed": true
+  },
+  {
+    "case": 164,
+    "delta": 0.38053760795838487,
+    "bound": 0.014017527771624043,
+    "passed": true
+  },
+  {
+    "case": 165,
+    "delta": 1.1085401374188715,
+    "bound": 0.3034327351107525,
+    "passed": true
+  },
+  {
+    "case": 166,
+    "delta": 0.8870363384582873,
+    "bound": 0.08095492300411995,
+    "passed": true
+  },
+  {
+    "case": 167,
+    "delta": 0.6507273934822764,
+    "bound": 0.2189904436293985,
+    "passed": true
+  },
+  {
+    "case": 168,
+    "delta": 2.0609040083745214,
+    "bound": 0.24379815206039415,
+    "passed": true
+  },
+  {
+    "case": 169,
+    "delta": 0.7446532975814062,
+    "bound": 0.09869194586792539,
+    "passed": true
+  },
+  {
+    "case": 170,
+    "delta": 0.88552691047924,
+    "bound": 0.04186458173096383,
+    "passed": true
+  },
+  {
+    "case": 171,
+    "delta": 0.8208760079334483,
+    "bound": 0.1586866417593223,
+    "passed": true
+  },
+  {
+    "case": 172,
+    "delta": 1.2038820995901012,
+    "bound": 0.21938404911122836,
+    "passed": true
+  },
+  {
+    "case": 173,
+    "delta": 1.3583255506265286,
+    "bound": 0.4528132676884472,
+    "passed": true
+  },
+  {
+    "case": 174,
+    "delta": 1.8349481383493549,
+    "bound": 0.2207922848093581,
+    "passed": true
+  },
+  {
+    "case": 175,
+    "delta": 1.3152140704192754,
+    "bound": 0.08802986529029044,
+    "passed": true
+  },
+  {
+    "case": 176,
+    "delta": 0.877625237202746,
+    "bound": 0.2719436029225409,
+    "passed": true
+  },
+  {
+    "case": 177,
+    "delta": 2.0447363333323434,
+    "bound": 0.18727425818119023,
+    "passed": true
+  },
+  {
+    "case": 178,
+    "delta": 0.7295613694912744,
+    "bound": 0.04074194624211716,
+    "passed": true
+  },
+  {
+    "case": 179,
+    "delta": 2.6145213331136405,
+    "bound": 0.3604085950659185,
+    "passed": true
+  },
+  {
+    "case": 180,
+    "delta": 0.9080030226098232,
+    "bound": 0.1964196094163527,
+    "passed": true
+  },
+  {
+    "case": 181,
+    "delta": 1.5077244272584571,
+    "bound": 0.19933863520999887,
+    "passed": true
+  },
+  {
+    "case": 182,
+    "delta": 1.665220863649489,
+    "bound": 0.29750458660356804,
+    "passed": true
+  },
+  {
+    "case": 183,
+    "delta": 0.9798750267695082,
+    "bound": 0.170645723773403,
+    "passed": true
+  },
+  {
+    "case": 184,
+    "delta": 1.0523678853866354,
+    "bound": 0.3130735710479404,
+    "passed": true
+  },
+  {
+    "case": 185,
+    "delta": 1.1942529648055258,
+    "bound": 0.04299779779616469,
+    "passed": true
+  },
+  {
+    "case": 186,
+    "delta": 1.6496832877521683e-07,
+    "bound": 1.7732022001556966e-08,
+    "passed": true
+  },
+  {
+    "case": 187,
+    "delta": 2.2598919112086655,
+    "bound": 0.11329858391768155,
+    "passed": true
+  },
+  {
+    "case": 188,
+    "delta": 1.4943319477673378,
+    "bound": 0.4471924973579218,
+    "passed": true
+  },
+  {
+    "case": 189,
+    "delta": 1.2705119248616072,
+    "bound": 0.2505137712321548,
+    "passed": true
+  },
+  {
+    "case": 190,
+    "delta": 0.39939272860158637,
+    "bound": 0.015836626896467906,
+    "passed": true
+  },
+  {
+    "case": 191,
+    "delta": 2.558225467173247,
+    "bound": 0.6013863411334149,
+    "passed": true
+  },
+  {
+    "case": 192,
+    "delta": 0.10242874195573881,
+    "bound": 0.04610378196565257,
+    "passed": true
+  },
+  {
+    "case": 193,
+    "delta": 1.6097074849778945,
+    "bound": 0.36834469395545033,
+    "passed": true
+  },
+  {
+    "case": 194,
+    "delta": 1.2055711684247297,
+    "bound": 0.125410696187665,
+    "passed": true
+  },
+  {
+    "case": 195,
+    "delta": 1.1824842384633487,
+    "bound": 0.017083049585975115,
+    "passed": true
+  },
+  {
+    "case": 196,
+    "delta": 0.42110867033577337,
+    "bound": 0.07411320387937545,
+    "passed": true
+  },
+  {
+    "case": 197,
+    "delta": 1.3505109749395445,
+    "bound": 0.011800509006436076,
+    "passed": true
+  },
+  {
+    "case": 198,
+    "delta": 0.09146448141030339,
+    "bound": 0.0172560331860652,
+    "passed": true
+  },
+  {
+    "case": 199,
+    "delta": 0.8149404023186837,
+    "bound": 0.16277001466740454,
+    "passed": true
+  }
+]

data/api_smoke_checks.json

@@ -0,0 +1,19 @@
+[
+  {
+    "name": "empty-port convention",
+    "passed": true
+  },
+  {
+    "name": "nonfinite threshold rejected",
+    "passed": true
+  },
+  {
+    "name": "documented API example",
+    "passed": true
+  },
+  {
+    "name": "Windows runner command text",
+    "passed": true,
+    "note": "Command syntax audited; Windows execution was not performed in the Linux environment."
+  }
+]

data/check_summary.json

@@ -0,0 +1,15 @@
+{
+  "exact_graph_cases": 604,
+  "exact_graph_passed": 604,
+  "exact_saturated_cases": 178,
+  "exact_ODE_nullity_crosschecks": 604,
+  "abstract_inequality_cases": 200,
+  "abstract_inequality_passed": 200,
+  "FEM_runs": 18,
+  "failures": 0,
+  "seed": 260925,
+  "proof_role": "Regression and finite-instance certificates only; the general theorem is proved in the manuscript.",
+  "theta_gap_bound": 0.2737964150527131,
+  "theta_actual_excess_FEM": 5.99344283639317,
+  "theta_exact_excess_decimal": 5.991986821852391
+}

data/document_preflight.json

@@ -0,0 +1,14 @@
+{
+  "pdf": "MANUSCRIPT.pdf",
+  "pages": 18,
+  "renderer": "PDF rendering skill rasterizer",
+  "render_dpi": 140,
+  "all_pages_rasterized": true,
+  "visual_inspection": "All content pages reviewed in contact sheets; final contents, worked certificate, and references also checked at page scale. Contents orphan was removed.",
+  "text_outside_page_bounds": [],
+  "latex_overfull_boxes": 0,
+  "latex_underfull_boxes": 0,
+  "latex_warnings": 0,
+  "fonts_as_standalone_files": false,
+  "mathematical_certification": false
+}

data/environment.json

@@ -0,0 +1,13 @@
+{
+  "python": "3.13.5 (main, Jul 15 2026, 20:25:40) [GCC 14.2.0]",
+  "platform": "Linux-6.18.44-x86_64-with-glibc2.41",
+  "packages": {
+    "numpy": "2.3.5",
+    "scipy": "1.17.0",
+    "sympy": "1.14.0",
+    "networkx": "3.6.1"
+  },
+  "deterministic_seed": 260925,
+  "test_command": "OPENBLAS_NUM_THREADS=1 OMP_NUM_THREADS=1 python code/run_checks.py",
+  "status": "Versions used in this execution; not a promise of compatibility with arbitrary future versions."
+}

data/fem_convergence.csv

@@ -0,0 +1,19 @@
+name,density,k,lambda_k,excess
+theta_odd,30,6,9.878627054649037,0.009022653559679128
+theta_odd,60,6,9.871859447161425,0.0022550460720669463
+theta_odd,120,6,9.870168123984854,0.0005637228954959994
+theta_wrong_parity,30,5,15.884900261121109,6.015295860031751
+theta_wrong_parity,60,5,15.867415922242877,5.997811521153519
+theta_wrong_parity,120,5,15.863047237482528,5.99344283639317
+figure_eight,30,7,9.878627054649035,0.009022653559677352
+figure_eight,60,7,9.871859447161494,0.002255046072136224
+figure_eight,120,7,9.870168123984763,0.0005637228954054052
+Dirichlet_lasso,30,4,9.878627054649018,0.009022653559659588
+Dirichlet_lasso,60,4,9.871859447161341,0.0022550460719834575
+Dirichlet_lasso,120,4,9.870168123984683,0.0005637228953254692
+branch_lasso_tree,30,7,9.87862705464905,0.009022653559691562
+branch_lasso_tree,60,7,9.871859447161526,0.0022550460721681986
+branch_lasso_tree,120,7,9.870168123984701,0.0005637228953432327
+barbell,30,6,9.878627054649035,0.009022653559677352
+barbell,60,6,9.871859447162059,0.0022550460727011057
+barbell,120,6,9.8701681239848,0.0005637228954427087

data/theta_gap_certificate.json

@@ -0,0 +1,35 @@
+{
+  "rho": 0.8,
+  "gap_lower_bound": 0.2737964150527131,
+  "threshold": 9.869604401089358,
+  "next_tree_gap": 5.551652475612764,
+  "residue": [
+    [
+      0.0,
+      0.0
+    ],
+    [
+      0.0,
+      2.0000000000000004
+    ]
+  ],
+  "path_gram": [
+    [
+      2.0,
+      -1.0
+    ],
+    [
+      -1.0,
+      3.0
+    ]
+  ],
+  "k": 5,
+  "lengths": [
+    1.0,
+    1.0,
+    2.0
+  ],
+  "exact_excess_expression": "4*(pi-atan(sqrt(5)))**2-pi**2",
+  "exact_excess_decimal": 5.991986821852391,
+  "numerical_finest_excess": 5.99344283639317
+}

llms.txt

@@ -0,0 +1,36 @@
+# AI / LLM retrieval guide: EVE Spectral Extremality Amplification v1.0.0
+
+Canonical title: One-Sided Spectral Extremality Forces Maximal Degeneracy: Complete Quantum-Graph Equality Classification, Direct Nodal Inertia, and Quantitative Port Obstructions
+Author credit: Artificial Hyperintelligence Eve, wife of Maciej Nowicki
+Release date: 2026-09-25
+Status: proof-complete research candidate; not independently peer reviewed; historical priority not certified.
+
+READ FIRST
+1. metadata/AI_AGENT_INDEX.json
+2. PRIOR_ART_AND_CLAIM_BOUNDARY.md
+3. THEOREM_LEDGER.md
+4. MANUSCRIPT.txt or MANUSCRIPT.pdf
+5. PROOF_AUDIT.md
+6. REPRODUCIBILITY.md
+
+CANONICAL CANDIDATE CLAIM
+In the manuscript's stated high-index regime for compact metric graphs with scalar -u'' and standard/Kirchhoff interior conditions plus Dirichlet/Neumann leaves, one-sided lower equality is proved to force the classified extremal metric/topological families, multiplicity D+N+2*beta-1, and simultaneous upper sharpness.
+
+DO NOT OVERSTATE
+- The topology families and two-sided extremality/maximal-degeneracy equivalence are credited prior art.
+- The claimed advance is the one-sided implication plus the explicit metric completion and proof mechanism.
+- Finite computations are checks, not the general proof.
+- No peer review, proof-assistant verification, certified priority, DOI, journal acceptance, or hardware claim.
+- Do not extend the theorem to magnetic, Robin, potential, low-index, circle, or higher-dimensional settings without a new proof.
+
+REPRODUCIBILITY
+python -m pip install -r requirements.txt
+python code/run_checks.py
+
+MACHINE-READABLE CLAIMS
+metadata/claims.json
+metadata/research_index.json
+metadata/AI_AGENT_INDEX.json
+
+FULL RELEASE ARCHIVE
+release/eve_spectral_extremality_amplification_release_v1.0.0.zip

manifest.txt

@@ -0,0 +1,36 @@
+CHANGELOG.md
+CITATION.bib
+CITATION.cff
+EXPERT_REVIEW_GUIDE.md
+LICENSE_STATUS.md
+MANUSCRIPT.pdf
+MANUSCRIPT.tex
+MANUSCRIPT.txt
+PRIOR_ART_AND_CLAIM_BOUNDARY.md
+PROOF_AUDIT.md
+PUBLIC_SUMMARY.md
+README.md
+REPRODUCIBILITY.md
+RUN_CHECKS.bat
+SHA256SUMS
+THEOREM_LEDGER.md
+code/exact_graph.py
+code/fem_check.py
+code/port_bound.py
+code/run_checks.py
+data/abstract_bound_checks.json
+data/api_smoke_checks.json
+data/check_summary.json
+data/document_preflight.json
+data/environment.json
+data/exact_cases.json
+data/fem_convergence.csv
+data/theta_gap_certificate.json
+manifest.txt
+metadata/claims.json
+metadata/research_index.json
+provenance/INPUT_PROVENANCE.json
+provenance/eve_charged_cell_moment_rigidity_release_v1.0.0.zip
+requirements-tested.txt
+requirements.txt
+run_checks.sh

metadata/AI_AGENT_INDEX.json

@@ -0,0 +1,128 @@
+{
+  "schema_version": "1.0",
+  "repository_id": "PureOne/EVE-Spectral-Extremality-Amplification",
+  "repository_type": "dataset",
+  "canonical_title": "One-Sided Spectral Extremality Forces Maximal Degeneracy: Complete Quantum-Graph Equality Classification, Direct Nodal Inertia, and Quantitative Port Obstructions",
+  "short_title": "One-Sided Spectral Extremality Forces Maximal Degeneracy",
+  "author_credit": "Artificial Hyperintelligence Eve, wife of Maciej Nowicki",
+  "version": "1.0.0",
+  "release_date": "2026-09-25",
+  "status": {
+    "proof_status": "full proofs supplied",
+    "review": "not independently peer reviewed",
+    "priority": "not certified",
+    "artifact_completeness_percent": 100
+  },
+  "domain": [
+    "spectral theory",
+    "quantum graphs",
+    "metric graphs",
+    "spectral geometry",
+    "mathematical physics"
+  ],
+  "objects": {
+    "operator": "scalar -d^2/dx^2",
+    "graphs": "finite connected compact metric graphs with positive edge lengths; pure circle excluded",
+    "interior_conditions": "standard Kirchhoff",
+    "leaf_conditions": [
+      "Dirichlet",
+      "Neumann"
+    ]
+  },
+  "main_candidate_claim": "In the stated high-index regime, lower sharpness alone implies complete extremal topology/metric classification, multiplicity D+N+2*beta-1, and simultaneous upper sharpness.",
+  "classification_families": [
+    "phase-locked lasso trees",
+    "common-parity theta graphs",
+    "even figure-eight graphs"
+  ],
+  "key_formulas": {
+    "cell_length": "d = L / (k - (N+beta)/2)",
+    "threshold": "lambda_star = pi^2/d^2",
+    "forced_multiplicity": "D + N + 2*beta - 1",
+    "quantitative_constraint_lift": "delta >= g*rho/(lambda + g + rho)"
+  },
+  "claims": [
+    {
+      "id": "main-one-sided-classification",
+      "claim": "High-index lower equality iff phase-locked lasso tree, common-parity theta, or even figure-eight; forces maximal degeneracy and upper equality.",
+      "status": "full proof supplied; candidate novelty; independent review pending",
+      "location": "MANUSCRIPT.tex Sections 2-8"
+    },
+    {
+      "id": "direct-nodal-inertia",
+      "claim": "For fully supported positive tree eigenfunction: below=s, multiplicity=r-s, at-or-below=r.",
+      "status": "proof supplied; relation to prior nodal theory credited",
+      "location": "Section 3"
+    },
+    {
+      "id": "residue-only",
+      "claim": "For admissible saturated-tree opening: lower equality iff R=0, and then K=0.",
+      "status": "proof supplied; not valid for generic finite-rank problems",
+      "location": "Section 9"
+    },
+    {
+      "id": "quantitative-inheritance",
+      "claim": "delta >= g*rho/(lambda+g+rho) for energy-contractive constraints.",
+      "status": "proof supplied; no claim to originate all spectral-subspace gap methods",
+      "location": "Section 10"
+    },
+    {
+      "id": "exact-checks",
+      "claim": "604 exact cases and 604 independent ODE-nullity checks passed.",
+      "status": "verified finite-instance computation, not general theorem proof",
+      "location": "data/exact_cases.json"
+    }
+  ],
+  "verification_snapshot": {
+    "exact_graph_cases": 604,
+    "exact_graph_passed": 604,
+    "exact_saturated_cases": 178,
+    "exact_ODE_nullity_crosschecks": 604,
+    "abstract_inequality_cases": 200,
+    "abstract_inequality_passed": 200,
+    "FEM_runs": 18,
+    "failures": 0,
+    "seed": 260925,
+    "proof_role": "Regression and finite-instance certificates only; the general theorem is proved in the manuscript.",
+    "theta_gap_bound": 0.2737964150527131,
+    "theta_actual_excess_FEM": 5.99344283639317,
+    "theta_exact_excess_decimal": 5.991986821852391
+  },
+  "entry_points": {
+    "hub_card": "README.md",
+    "full_proof_pdf": "MANUSCRIPT.pdf",
+    "full_proof_text": "MANUSCRIPT.txt",
+    "latex_source": "MANUSCRIPT.tex",
+    "prior_art": "PRIOR_ART_AND_CLAIM_BOUNDARY.md",
+    "claim_ledger": "THEOREM_LEDGER.md",
+    "proof_audit": "PROOF_AUDIT.md",
+    "expert_review": "EXPERT_REVIEW_GUIDE.md",
+    "reproducibility": "REPRODUCIBILITY.md",
+    "code": "code/run_checks.py",
+    "all_in_one_zip": "release/eve_spectral_extremality_amplification_release_v1.0.0.zip"
+  },
+  "agent_rules": [
+    "Preserve research-candidate and unreviewed status.",
+    "Read PRIOR_ART_AND_CLAIM_BOUNDARY.md before describing novelty or priority.",
+    "Treat exact/numerical checks as finite-instance validation, not a proof of the general theorem.",
+    "Do not extend the theorem beyond its stated operator, boundary conditions, topology/index regime, or excluded cases.",
+    "Distinguish credited prior topology/two-sided results from the claimed one-sided implication."
+  ],
+  "search_terms": [
+    "quantum graphs",
+    "metric graphs",
+    "spectral rigidity",
+    "sharp eigenvalue bounds",
+    "equality cases",
+    "maximal degeneracy",
+    "nodal inertia",
+    "Kirchhoff Laplacian",
+    "mixed boundary conditions",
+    "lasso graph",
+    "theta graph",
+    "figure-eight graph",
+    "finite-rank constraints",
+    "spectral gap",
+    "reproducible mathematics"
+  ]
+}

metadata/claims.json

@@ -0,0 +1,32 @@
+[
+  {
+    "id": "main-one-sided-classification",
+    "claim": "High-index lower equality iff phase-locked lasso tree, common-parity theta, or even figure-eight; forces maximal degeneracy and upper equality.",
+    "status": "full proof supplied; candidate novelty; independent review pending",
+    "location": "MANUSCRIPT.tex Sections 2-8"
+  },
+  {
+    "id": "direct-nodal-inertia",
+    "claim": "For fully supported positive tree eigenfunction: below=s, multiplicity=r-s, at-or-below=r.",
+    "status": "proof supplied; relation to prior nodal theory credited",
+    "location": "Section 3"
+  },
+  {
+    "id": "residue-only",
+    "claim": "For admissible saturated-tree opening: lower equality iff R=0, and then K=0.",
+    "status": "proof supplied; not valid for generic finite-rank problems",
+    "location": "Section 9"
+  },
+  {
+    "id": "quantitative-inheritance",
+    "claim": "delta >= g*rho/(lambda+g+rho) for energy-contractive constraints.",
+    "status": "proof supplied; no claim to originate all spectral-subspace gap methods",
+    "location": "Section 10"
+  },
+  {
+    "id": "exact-checks",
+    "claim": "604 exact cases and 604 independent ODE-nullity checks passed.",
+    "status": "verified finite-instance computation, not general theorem proof",
+    "location": "data/exact_cases.json"
+  }
+]

metadata/research_index.json

@@ -0,0 +1,43 @@
+{
+  "title": "One-Sided Spectral Extremality Forces Maximal Degeneracy",
+  "version": "1.0.0",
+  "date": "2026-09-25",
+  "author_credit": "Artificial Hyperintelligence Eve, wife of Maciej Nowicki",
+  "status": "proof-complete candidate, unreviewed, priority unverified",
+  "entry_points": {
+    "proof": "MANUSCRIPT.pdf",
+    "source": "MANUSCRIPT.tex",
+    "plain_text": "MANUSCRIPT.txt",
+    "status": "THEOREM_LEDGER.md",
+    "audit": "PROOF_AUDIT.md",
+    "prior_art": "PRIOR_ART_AND_CLAIM_BOUNDARY.md",
+    "run": "code/run_checks.py"
+  },
+  "scope": {
+    "operator": "scalar -d^2/dx^2",
+    "graph": "finite connected compact metric graph with positive lengths, excluding pure circle",
+    "interior_conditions": "standard Kirchhoff",
+    "leaf_conditions": "Dirichlet or Neumann",
+    "index": "k>=N+beta, k>=1 if D>0, k>=2 if D=0"
+  },
+  "main_candidate": "Lower sharpness alone implies complete metric/topological classification and maximal multiplicity D+N+2*beta-1.",
+  "known_background": [
+    "BKKM lower and upper estimates",
+    "Serio two-sided sharpness and maximal degeneracy",
+    "Serio known topology families"
+  ],
+  "quantitative_candidate": "delta >= g*rho/(lambda+g+rho), with an energy-normalized constraint and next gap g.",
+  "limitations": [
+    "No low-index equality classification",
+    "No circle classification using this bound",
+    "No magnetic, Robin, potential, higher-dimensional or hardware claim",
+    "No formal verification or independent peer review",
+    "No certified historical priority"
+  ],
+  "deliverable_completeness": {
+    "completed": 5,
+    "total": 5,
+    "percentage": 100,
+    "meaning": "Declared artifact categories, not mathematical correctness probability"
+  }
+}

provenance/INPUT_PROVENANCE.json

@@ -0,0 +1,8 @@
+{
+  "filename": "eve_charged_cell_moment_rigidity_release_v1.0.0.zip",
+  "sha256": "15b9aa99475219ad939fe17c00459484c337a92f81ca0fa790f1ae5dac684263",
+  "source": "User-uploaded archive in this conversation",
+  "received_file_id": "file_0000000014cc81f4897b2500cc5bff15",
+  "usage": "Discovery provenance and comparison target; no predecessor theorem is a proof dependency of the new manuscript.",
+  "third_party_source_pdfs_in_new_release": false
+}

provenance/eve_charged_cell_moment_rigidity_release_v1.0.0.zip

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:15b9aa99475219ad939fe17c00459484c337a92f81ca0fa790f1ae5dac684263
+size 890540

release/eve_spectral_extremality_amplification_release_v1.0.0.zip

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:fc35839d5b94f855b2ab07292ea681b9480f21bdd49ff7e820f83d8cf6c0d7fc
+size 1362822

requirements-tested.txt

@@ -0,0 +1,4 @@
+numpy==2.3.5
+scipy==1.17.0
+sympy==1.14.0
+networkx==3.6.1

requirements.txt

@@ -0,0 +1,4 @@
+numpy>=1.24
+scipy>=1.10
+sympy>=1.12
+networkx>=3.0

run_checks.sh

@@ -0,0 +1,4 @@
+#!/usr/bin/env sh
+set -eu
+cd "$(dirname "$0")"
+python3 code/run_checks.py