Recursive closure
A fully executable visual explanation of how signed rest-distance corrections converge, how direction reversal isolates the odd Sagnac sector, and where reduced Poincare–Cartan action enters the phase readout.
Watch one return-time correction become a closed result
This is not an animation of a photon physically flying around a ring. It is an animation of the calculation: each glowing point is one correction step, and each step adds the currently remaining light-travel time before shrinking and signing the remainder for the selected direction.
ℓn+1 = σβℓn. Blue points are the signed remainder length ℓn still carried into the next correction; the blue line shows how that remainder contracts or alternates. The lower trace subtracts the two directions and keeps only the odd powers, β + β³ + β⁵ + …. Gold points are the accumulated directional difference, approaching the gold exact limit.β says how large the next correction is compared with the current remainder. Values closer to 1 converge more slowly and make more of the closure visible.
This sets the normalized initial remainder, not β. Every displayed remainder, accumulated time, and exact limit scales by ℓ0/L, while the convergence factor remains |β|. The upper axis adapts to keep both directions visible.
The slider changes how many terms are revealed. It does not change the infinite-limit formula.
Ready: r₀ is loaded; no correction has been added yet.
Four layers, kept separate
Signed rest distance
Closure map: the normalized signed remainder ℓₙ/L (written as ℓₙ in the recurrence) starts at h=ℓ₀/L and contributes one light-travel increment at each directed step. The sign records direction; |β|<1 is the convergence condition; h only sets scale. It is a projected bookkeeping map, not a full phase-space trajectory.
Sagnac difference
Sagnac difference: this is the direction-odd projection: subtracting the +β and −β geometric sums cancels every even power. qk is the next odd time contribution; the accelerated recurrence is a compact representation, not a second physical route.
Poincare–Cartan bookkeeping
Poincaré–Cartan bookkeeping: this formula names the extended-phase-space one-form and its closed-contour integral. At fixed energy in a stationary optical/Hamilton–Jacobi reduction, its odd contribution is Δ𝓘odd=EΔt, up to the declared contour orientation.
Detector layer
Phase readout: this formula converts the axle-frame return-time difference into detector proper time and then phase. Here 𝒜=πR² is ring area; SSZ metric A=D² is a different quantity. Calibration and uncertainty still belong to the measurement protocol.
Loop integral, series and exact error
The loop expression and the discrete correction series are two representations of the same constant-speed closure. Each tail formula below names its own index, so a displayed step is not confused with an odd-sector term.
Continuous loop
For constant v and fixed ring length, this is the physical h=1 loop expression and equals the difference of the two directed geometric limits. The laboratory height control instead explores the same normalized recurrence at a chosen h=ℓ₀/L.
Directed tail
N counts directed corrections already added. The counter-rotating sign alternates, while the absolute tail shrinks geometrically for |β|<1.
Odd-sector tail
K counts the odd contributions (\beta,\beta^3,\ldots,\beta^{2K-1}) already included. This compact tail is the accelerated odd-sector series; the loop form is preferable when v or the rotational metric term varies along the path.
From closed action cycles to zeta ordinates — a testable hypothesis
The Recursive-Zeta-Zero-Finding-Suite supplies an independently computed numerical reference sequence γₙ and prime-side diagnostics. This page does not identify those ordinates with the single β-closure or claim a Hilbert–Pólya operator; it states the sharper multi-cycle question that can actually be tested.
Semiclassical action question
A possible Hamiltonian model would quantize closed-orbit actions and produce eigenvalues comparable with the independently computed zeta ordinates. The comparison is a research criterion, not a result already established by this recurrence.
Repeated primitive cycles
For each prime p, r counts repetitions. The recursion is exactly equivalent to the corresponding truncated prime-power sum; it organizes the explicit formula but does not derive a classical orbit family.
Oscillatory density
Prime periods log p and their repetitions r log p are the essential scales. Shuffled-period and integer-period controls should fail; a high correlation with this formula is expected because it is the same known arithmetic structure being reconstructed.
What would complete the bridge
The unresolved work is constructive: specify H and its domain, prove self-adjointness, derive the primitive actions and amplitudes, and establish exact spectral completeness. Until then the result remains a disciplined hypothesis.
Reference implementation: Riemann Zeta Zero-Finding Suite ↗. Its hardened numerical path distinguishes complete mpmath Siegel evaluation from exploratory main-sum scans and labels interval diagnostics as non-rigorous unless fully validated.
What this visual establishes — and what it cannot
It establishes
Exact finite-sum identities, convergence for |β|<1, direction reversal, the odd-series limit and the algebraic axle expression within the declared kinematic setup.
It does not establish
A complete rotating SSZ spacetime, symplecticity of the projected matrix map, invariance under arbitrary ring deformation, or a measured detector phase.
Next evidence layer
Use the maintained repository’s seven focused tests, including synchronized odd-step and exact-tail checks, then connect any physical claim to an independent forward model, calibration, uncertainty budget and preregistered decision rule.
How to read Recursive Closure
This page separates the declared definition, its computation or visualisation, the evidence supporting it, and the conclusions that remain outside its scope.
Start with the formula or control, identify its domain and inputs, then follow the linked implementation and evidence record.
A passing identity, numerical limit, plot or comparison supports only the stated relation under its recorded assumptions and provenance.
It is not automatically an independent experiment, a complete physical theory, or a proof beyond the explicit claim boundary.
Definitions, evidence and limitations stay linked
The portal keeps current canonical locks above historical descriptions and keeps software verification separate from empirical confirmation.
Canonical source
Use the current P0, JIF or mathematical lock for the formula and domain shown on this page.
Evidence class
Read tests, convergence, reference compatibility, dataset-conditioned comparisons and independent replication as different evidence classes.
Boundary
Every result retains its assumptions, limits and explicit non-claim so a visual or passing assertion is not over-promoted.