The Missing Eigenvalue

Abstract

A proof strategy is an object with a shape, and the shape can be wrong before a single lemma is attempted. We study one such strategy for Goldbach's conjecture — the proposal to cover the even numbers by an expanding family of graphs on prime states, so that a spectral gap forces the count of prime-pair representations to stay positive. The strategy names its own graph: a finite carrier of Zeckendorf words with an append-rule for edges. We compute that graph's Laplacian spectrum and find that the eigenvalue it needs is not there. The prime φ-graph is disconnected — its algebraic connectivity is exactly zero — and by the Fiedler equivalence between a positive gap and connectivity, no expander witness can live on it. The consequence is a theorem, not a difficulty: any hypothesis of eventual expansion forces eventual connectivity, yet the strategy's own carrier is disconnected at the size where we certify it, so the expansion hypothesis has no model there. The route is obstructed on the object it names; whether the obstruction persists at every size — closing the route with no escape — is a sharp conjecture we state but do not prove. We reach this result by auditing a machine-produced formalization that had packaged the same strategy as a conditional theorem — an implication from four labelled hypotheses and a large-range bridge to Goldbach that type-checked, carried no sorry, and depended on no exotic axiom, while being a tautology: two of its four hypotheses do no work in the proof, a third is a theorem the library already proves, and the bridge that actually carries the argument is Goldbach-for-large-n wearing the clothing of a convolution. A proof that compiles and means nothing is more dangerous than one that admits it is unfinished. The obstruction we extract is the honest residue of that audit: the reason the strategy fails, made into mathematics that a kernel checks. That obstruction turns out to be one face of a single positivity bridge — an equivalence between a vanishing invariant and a failing property — that also generates the paper's arithmetic content; in its pure form the schema is axiom-free, and it identifies the missing eigenvalue as a hole, the ground floor of a graded tower of obstructions. We prove nothing about Goldbach itself. We prove where one road to it ends, and why the ending was invisible until the spectrum was read. Published by The Institute for Applied Ontological Mathematics.