Research / Mathematics / Information Science · Operational Geometry & Arithmetic

Operational Information Geometry V — Scale Flow, Continuum Response, and Protocol Boundaries

A finite operational model of refinement, directed response, continuum scaling, and what a declared protocol can observe

Originating direction and research environment: TGN's human founder

Standalone synthesis · theorem, computation, hypothesis and boundary separated

operational information geometry continuum limits spectral dimension directed response Markov generators protocol observability computer-assisted mathematics
Status
identified
Published
2026-08-14
Updated
2026-08-14
Article slug
operational-information-geometry-v-scale-flow

The central question

What survives refinement, and what depends on the protocol?

Operational Information Geometry begins with a finite premise: states are geometrically separated only to the extent that a declared experiment can distinguish their histories. This stage uses the cell-centred path scaling A_n=n²L_n, density-normalized channels, and an exactly one-way subsystem response inside a symmetric continuous-time Markov generator. It asks which statements survive refinement, which disappear under another limit, and which are artifacts of the preparation or measurement protocol. The answer is deliberately mixed: exact low-mode spectrum and parity rules coexist with numerical convergence landmarks, singular atomic limits, and protocol boundaries that prevent broad claims about reality.

Headline synthesis

The finite model has an explicit scale dictionary and exact response reduction. Its low spectrum obeys the Neumann interval law with O(n^-2) error, while the transient spectral dimension has noncommuting ultraviolet limits. Smooth density-normalized responses show numerical O(n^-2) convergence, but fixed-mode operator convergence remains a hypothesis. A 192-bit outward-rounded adjacent certificate brackets z* between 4.982412×10^-9 and 4.982942×10^-9 on exact algebraic and frozen binary64 time grids.

Status ledger: theorem, computation, hypothesis and boundary

Interpretive synthesis

The manuscript keeps proved analytic statements, independently tested computations, hypotheses supported by numerical evidence, and non-claims visibly separate. This is a research manuscript with computer-assisted evidence; it is not peer reviewed.

  • Proved analytically: the path spectrum, scale limits, modal response reduction, smooth parity rule, smooth-versus-atomic scaling, rank bound, leakage envelopes, and protocol boundaries.
  • Computed with independent tests: response-Gramian convergence, leakage radii, reflection-symmetric rank control, endpoint silence versus path activity, and the interval certificate.
  • Hypothesized: uniform positive-time fixed-mode operator convergence and positive-time convergence for appropriately smoothed atomic targets.

Sources: [1]

Three limits and the renormalization dictionary

Exact statement or rational verification

Fixed-domain refinement, infinite volume, and joint continuum/infinite-volume limits are distinct experiments. The third is not a formal consequence of the first two and requires uniform localization and modulation assumptions.

Finite-to-continuum normalization used in the fixed-domain experiment

The cell-centred convention is material; endpoint labelling with spacing 1/(n−1) introduces a different effective-boundary error.

Finite objectPhysical normalization
vertex jx_j=(j+1/2)/n
generator L_nA_n=n²L_n
graph timet_graph=n²τ
graph distanced_graph/n
probability perturbation U/√nsampled L² density mode U

Sources: [1]

Exact path spectrum and O(n^-2) low-mode error

Exact statement or rational verification

For the cell-centred path, the discrete cosine vectors form an orthonormal eigenbasis. For 0≤k<n, μ_(k,n)=4n² sin²(πk/(2n)), and every fixed nonzero mode obeys 0≤(πk)²−μ_(k,n)≤π⁴k⁴/(12n²).

Sources: [1]

Spectral dimension is a scale-window statement

Exact statement or rational verification

For a d-fold product, fixed n followed by τ→0 gives D_(n,d)(τ)→0. If τ_n→0 while n²τ_n→∞, the same construction tends to the chosen product factor count d. The limits do not commute; the mesoscopic window separates lattice ultraviolet scale from observation scale.

Three-factor mesoscopic spectral-dimension sample path

At fixed n, τ→0 gives dimension 0; the mesoscopic window n^-2≪τ_n≪1 recovers the chosen product factor count d.

n3264128256512
D_(n,3)(n^-3/2)2.75282.83872.90242.94352.9683

Sources: [1]

One-way generator and exact modal response reduction

Exact statement or rational verification

The square-lattice generator G_n=A_n⊗I+(I+gD_n)⊗A_n is symmetric as a Markov generator while its declared source-to-target response is one-way. If A_nu_l=μ_(l,n)u_l and β_l=u_l^Tq, then the target-mode response reduces exactly to an n×n matrix exponential:

Sources: [1]

Smooth density response, parity, and regularity

Exact statement or rational verification

Density-normalized smooth responses converge numerically at O(n^-2), but fixed-mode convergence is explicitly a computational landmark and hypothesis rather than a proved operator theorem. For a smooth single-mode background, the first response derivative vanishes for even source cosine modes and equals 2√2·a·g·ℓ²/k² for odd modes. A smooth target first jet tends g a π²/√24, whereas an atomic raw first jet grows like g n^(5/2)/√2. Refinement and the initial-time limit therefore do not commute.

Sources: [1]

Target bandwidth bounds causal-jet rank

Exact statement or rational verification

If source directions are restricted to a declared modal band, the first-jet sensing rank obeys a finite rank bound. This is an observability statement for the chosen channel, not a claim that directionality makes every source identifiable.

Sources: [1]

Poisson cone, signed displacement, and expanding-domain control

Exact statement or rational verification

The exact Poisson jump-count cone becomes continuum-trivial under diffusive scaling. A model-specific signed-displacement exponential-martingale argument gives P{h d₁(X_τ,X₀)≥r}≤min{1,4 exp(−I_h(r,τ;2+g))} and the sufficient limiting radius r_δ(τ)=√[4(2+g)τ log(4/δ)]. At g=.8, τ=.005, δ=.01, the bound is 0.5792426 while the actual radius is about 0.4375. In an expanding-domain stretched-ramp control, the localized arrow decays exactly as g√3/n.

Finite-lattice leakage and adjacent interval certificate

The heat kernel has instantaneous tails; this is not a relativistic causality statement, and the finite-grid certificate is not a continuous-time optimum.

QuantityPublished value
Signed-displacement radius at g=.8, τ=.005, δ=.01bound 0.5792426; actual radius about 0.4375
Continuum radius formular_δ(τ)=√[4(2+g)τ log(4/δ)]
Outward-rounded certificate4.982412×10^-9 ≤ z* ≤ 4.982942×10^-9

Sources: [1] [6]

Protocol choice changes observability

Exact statement or rational verification

Reflection-symmetric modulation has exact response rank 2, leaving three invisible source directions; an exact 2×2 jet minor is 32/125. A factorized stationary target is silent to the endpoint marginal, yet a path jump-rate sensor detects the arrow with norm 3.7872 and rank 3. Symmetric propagators restore reciprocity for conjugate or adjoint source-measurement ports; the directional result uses localized, nonconjugate ports. In the fixed linear model, intervention response is exactly affine, so all second amplitude derivatives vanish.

Exact or computed protocol boundaries in the finite model
Declared protocolObserved consequence
Reflection-symmetric modulationResponse rank 2; three source directions invisible; an exact 2×2 jet minor is 32/125
Stationary target, endpoint marginalSilent
Same target, path jump-rate sensorArrow detected; norm 3.7872 and rank 3
Symmetric propagator with conjugate/adjoint portsReciprocity restored
Fixed linear initial-state interventionAll second amplitude derivatives vanish

Sources: [1] [7]

Outward-rounded adjacent certificate

Numerical experiment

An independent 192-bit Arb certificate uses an exact dyadic primal and rational positive-semidefinite dual on both the exact algebraic and frozen binary64 120-time grids. It brackets z* between 4.982412×10^-9 and 4.982942×10^-9. This is a strong computer-assisted certificate for the declared finite grids, not proof-assistant interval arithmetic and not a continuous-time optimum.

Finite-lattice leakage and adjacent interval certificate

The heat kernel has instantaneous tails; this is not a relativistic causality statement, and the finite-grid certificate is not a continuous-time optimum.

QuantityPublished value
Signed-displacement radius at g=.8, τ=.005, δ=.01bound 0.5792426; actual radius about 0.4375
Continuum radius formular_δ(τ)=√[4(2+g)τ log(4/δ)]
Outward-rounded certificate4.982412×10^-9 ≤ z* ≤ 4.982942×10^-9

Sources: [1]

Falsification ledger and interpretation

Interpretive synthesis

The fixed-mode response convergence conjecture should be tested with uniform positive-time operator bounds and smoothed atomic preparations. Joint continuum/infinite-volume behavior needs its own localization hypotheses. The model is best read as a bridge theory for scale flow and protocol dependence: it does not select a physical dimension or explain why nature has one.

  • A heat kernel has instantaneous tails, so the leakage estimate is not relativistic causality.
  • Atomic preparations are valid at finite n, but their t=0 L² continuum jet is singular.
  • Fixed-domain limits do not imply infinite-volume behavior; endpoint silence does not mean path-space silence.

Sources: [1]

Reproduction and sources

Numerical experiment

The public repository contains the Stage I–V scripts, tests, frozen Stage IV grids, and the scaling and certificate ledgers. The commands below reproduce the declared laboratories from the repository root; the python-flint dependency is needed for the Arb certificate.

  • python -m unittest discover -v
  • python operational_information_geometry.py --controls 32
  • python operational_information_geometry_ii.py --protocols 16
  • python operational_information_geometry_iii.py --interaction-strength 0.4
  • python operational_information_geometry_iv.py --protocol-seeds 32
  • python operational_information_geometry_v.py
  • python oig_v_scaling_continuum.py --maximum-side-length 64
  • python oig_iv_certificate.py --grid both

Sources: [1] [2]

Reproduction and evidence boundary

From the repository root, install requirements.txt (including python-flint for the Arb certificate), then run: python -m unittest discover -v; python operational_information_geometry.py --controls 32; python operational_information_geometry_ii.py --protocols 16; python operational_information_geometry_iii.py --interaction-strength 0.4; python operational_information_geometry_iv.py --protocol-seeds 32; python operational_information_geometry_v.py; python oig_v_scaling_continuum.py --maximum-side-length 64; python oig_iv_certificate.py --grid both. The Stage IV reference grid is frozen as hexadecimal binary64 values and its published primal/dual design is replayed deterministically across platforms.

Canonical public source: commit c61834eff712524db6b82fa24dc43f990f8301a1; GitHub Actions reported 170 tests passing on Python 3.11 and 3.12.

  • operational_information_geometry.py --controls 32
  • operational_information_geometry_ii.py --protocols 16
  • operational_information_geometry_iii.py --interaction-strength 0.4
  • operational_information_geometry_iv.py --protocol-seeds 32
  • operational_information_geometry_v.py
  • oig_v_scaling_continuum.py --maximum-side-length 64
  • oig_iv_certificate.py --grid both

Public-safe source manifest

Filenames and hashes identify the reviewed research inputs without exposing local filesystem paths or private caches.

  • OPERATIONAL_INFORMATION_GEOMETRY_V.md — canonical Stage V synthesis; c3f89a9884b42589a5234040de43cc1c35933718be121dd03e5ff6b1b0d41a82
  • OPERATIONAL_INFORMATION_GEOMETRY_I.md — Stage I manuscript; b68fc3825179e33b738d6e3b80fbe026460f58d4e3ff5899a6423e15618fc839
  • OPERATIONAL_INFORMATION_GEOMETRY_II.md — Stage II manuscript; c303b47e4b0633ab7b9b35a2411302aa8c999ab6ba9eeaac138fcf880fe87227
  • OPERATIONAL_INFORMATION_GEOMETRY_III.md — Stage III manuscript; 5d6ef44faf0e95b81d3309c8e309557f337cfec18016fbf1ca450d397ae4f921
  • OPERATIONAL_INFORMATION_GEOMETRY_IV.md — Stage IV manuscript; ef507b520ca823a1a718c37401025e39d34a1e74d8c2473fae66e78c3b503ddd
  • oig_iv_certificate.md — Arb certificate ledger; a202d9b02195564c1d4529b86fc5c2b5917b674e3625241ddcd389323d190855
  • oig_v_scaling_report.md — continuum and scaling ledger; 97f53fb86149e245036de18693549678455030faed66b95097680bab9ec0336a
  • README.md — reproduction index; a6047c70ebf56859a20c530372873c23dd54d83f98257324e879ab2e7d32606a

Theorem / computation boundary

The path spectrum, scale limits, modal reduction, parity, rank and protocol boundaries are mathematical statements under the displayed finite-model assumptions. Convergence landmarks, leakage radii, response ranks and the 192-bit Arb bracket are computer-assisted evidence with explicit finite precision and grid boundaries. Fixed-mode continuum convergence remains a hypothesis; the certificate is not proof-assistant interval arithmetic, not a continuous-time optimum, and not evidence for a physical law or spacetime theory.

Sources consulted

  1. Operational Information Geometry public reproduction repository at immutable commit — GitHub / eruannaarte; software repository; retrieved 2026-08-14.
  2. Reproduction index and dependency notes — GitHub / eruannaarte; software repository; retrieved 2026-08-14.
  3. Random walks and heat kernels on finite graphs — Society for Industrial and Applied Mathematics; research paper; retrieved 2026-08-14.
  4. Random walks and heat kernels: literature context — JSTOR; research paper; retrieved 2026-08-14.
  5. Markov-chain and heat-kernel context — Cambridge University Press; research paper; retrieved 2026-08-14.
  6. Heat-kernel bounds — London Mathematical Society; research paper; retrieved 2026-08-14.
  7. Reciprocity and reversible transport context — American Physical Society; research paper; retrieved 2026-08-14.
  8. Information and experimental design context — Institute of Mathematical Statistics; research paper; retrieved 2026-08-14.
  9. Computational reproducibility context — IEEE; research paper; retrieved 2026-08-14.

These literature sources provide context for the model and methods; they do not establish project novelty or a claim about physical reality.