Research / Mathematics / Information Science · Operational Geometry & Arithmetic

Operational Information Geometry — From Response Limits to Certified Experiments

A proof-producing engine for query-directed experimental design under structured nuisance and model uncertainty

Originating direction, intuition, sustained collaboration, and research environment: TGN's human founder

Standalone synthesis · theorem, computation, hypothesis and boundary separated

operational information geometry certified experiment design inverse problems query identifiability structured nuisance model uncertainty proof-producing software interval arithmetic
Status
identified
Published
2026-08-15
Updated
2026-08-15
Article slug
operational-information-geometry-protocol-engine

The central question

Given several possible measurements, which ones should an experimenter take, and what is the weakest distinction that remains recoverable after noise, nuisance, finite resolution and model error?

The protocol engine turns a declared response model into an auditable decision procedure. It first controls the finite-resolution approximation, then profiles exact shared nuisance, tests a requested query rather than assuming full-state recovery, compares a sealed candidate library, and keeps structured nuisance separate from response-operator uncertainty.

Headline synthesis

For the declared finite and continuum models, the engine returns exact rational or interval-backed witnesses for finite-transfer bounds, query identifiability, candidate-library design decisions, structured-nuisance separation and model-aware uncertainty. In the pinned end-to-end control it selects H=[2] over H=[1], with d²=9/4, critical equal-noise radius²=9/16, and declared noise radius²=1/4<9/16.

The finite-resolution obstruction

Exact statement or rational verification

No fixed finite grid reproduces the normalized late continuum response for every time scale. In the declared two-port Neumann model, the theorem instead grows resolution with the diffusive scale: the finite-to-lattice error is bounded by 23√τ/n in the L2 source metric and (23/10)√τ/n in the declared H1 metric. The continuum-to-atomic errors are bounded by 2/(3τ) and 1/(15τ).

Sources: [1] [2]

From a full state to a declared query

Exact statement or rational verification

With data y=Hx+Bz+η, output precision W, and exact W-orthogonal profiling P of nuisance, the requested linear query Lx is identifiable precisely when ker(PH) is contained in ker(L). A successful certificate contains a nuisance-invariant decoder; a failed certificate returns an exact kernel witness instead of a numerical rank guess.

Sources: [1] [3]

Certified candidate-library design

Exact statement or rational verification

The engine compares only candidates with the same source metric, query, query metric and noise-radius convention. For a finite sealed library, the global optimum lies between the minimum certified lower and upper bounds; a candidate is called uniquely best only when its upper bound is strictly below every other identifiable candidate's lower bound.

Sources: [1] [4]

Structured nuisance is not independent refitting

Exact statement or rational verification

A coefficient shared across several protocols is not equivalent to independently refitting one nuisance coefficient per protocol. Correlated bounded nuisance is represented by its common-generator zonotope and charged through its exact support function. This keeps nuisance semantics visible rather than hiding them inside an entrywise box.

Sources: [1] [5]

Model geometry remains a separate audit

Exact statement or rational verification

Finite model secants, tangent/kernel angles, response tubes and nominally blind coordinates are audited separately. A positive ambient information floor cannot hide a query-relevant model collision. Structured additive nuisance and response-operator uncertainty are therefore not interchangeable proof obligations.

Sources: [1] [6]

Pinned end-to-end certificate

Exact statement or rational verification

The public control selects the scalar response H=[2] over H=[1] and a blind candidate, then reuses the same response and metrics across the structured-nuisance and response-tube layers. The resulting inequalities are exact for the pinned declared model, not an empirical fit.

Pinned end-to-end exact control
QuantityCertified value
Selected responseH=[2] over H=[1] and a blind candidate
Structured separationd²=9/4
Critical equal-noise radius²9/16
Declared noise radius²1/4<9/16

Sources: [7] [8]

Proof-producing software and tamper evidence

Numerical experiment

Each layer serializes declarations and witnesses, and standalone verifiers reconstruct them rather than trusting theorem flags. Exact arithmetic defines quotients, identifiability, design bounds and tamper decisions. The pinned integrated certificate is linked with its SHA-256 in the public manifest.

  • The focused protocol-engine suite reports 155/155 passing.
  • The independent Atlas-integration adversarial publication matrix reports 126/126 passing.
  • The complete repository at the canonical integration state reports 920 tests passing with one expected skip.

Sources: [2] [9]

What this proves

Exact statement or rational verification

Within the declared finite and continuum models, the engine proves the stated transfer, query, candidate-library, structured-nuisance and pinned integration consequences, provided the external response enclosures, candidate completeness and model premises are accepted as inputs.

Sources: [1] [8]

What this does not prove

Interpretive synthesis

The global analytic transfer schedule is conservative, the compact Arb cover stops at τ=6/5, and a finite candidate-library optimum is not a continuous-design optimum. Candidate-library completeness is a scientific premise, and matched modal sensors are global linear combinations rather than claimed local hardware.

  • The engine does not prove that an external physical system satisfies the declared model.
  • The radio/acoustic continuation is a plausible application target, not a validated instrument or propagation model.
  • No result establishes a theory of spacetime, matter, information as the substrate of reality, or any other physical law.
  • The work has not undergone independent specialist peer review and makes no unqualified literature-priority claim.

Sources: [10]

Reproduce the certificates

Numerical experiment

The immutable repository contains the synthesis, theorem notes, engines, dedicated dependencies, pinned integration program, certificate and adversarial tests. The compact Arb-cover test is slower and can be run as an additional verification step from the manifest.

  • git checkout 63068b62241359e51f1f98649d2718dc5b81145c
  • python -m pip install -r oig_protocol_engine_requirements.txt
  • python oig_atlas_protocol_integration.py --verify certificates/oig_atlas_protocol_integration.json
  • python -m unittest -v test_oig_protocol_artifacts.py

Sources: [2]

Reproduction and evidence boundary

From the repository root at commit 63068b62241359e51f1f98649d2718dc5b81145c, install oig_protocol_engine_requirements.txt, run the protocol-engine and integration test files listed in the handoff, verify certificates/oig_atlas_protocol_integration.json, and run test_oig_protocol_artifacts.py. The full focused and integration counts are recorded above.

Focused protocol-engine suite: 155/155; Atlas-integration adversarial matrix: 126/126; complete repository at the canonical integration state: 920 passing with one expected skip.

  • oig_atlas_protocol_integration.py --verify certificates/oig_atlas_protocol_integration.json
  • test_oig_protocol_artifacts.py
  • test_oig_atlas_protocol_integration.py
  • test_oig_atlas_protocol_integration_adversarial.py

Public-safe source manifest

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

  • OPERATIONAL_INFORMATION_GEOMETRY_PROTOCOL_ENGINE.md — canonical protocol-engine synthesis; 6f5b1d09150d2ac680e886cc718f47230d6e06727d9872ccee7fcc973b88434a
  • OIG_PROTOCOL_ENGINE_REPRODUCIBILITY_MANIFEST.md — reproducibility manifest; 64eac7fd905d4efaa83f1c4cdfb762a656d139ceef67c4d43dd2b0f55b4a6517
  • oig_atlas_protocol_integration.py — pinned integration program; 642dbbc1cb7cb21c977df1a0860242da677902d003598f7c4a35540527141330
  • oig_atlas_protocol_integration.json — pinned end-to-end certificate; bbda10851585de5601bafb8441f718e33e0618660fa044da451212d984afddd1

Theorem / computation boundary

The transfer, quotient, candidate-library and nuisance statements are mathematical claims under their displayed hypotheses. Exact rational fields and serialized witnesses support the finite certificates; Arb and floating-point laboratories are bounded computational evidence, not proof-assistant verification. External model enclosures, candidate completeness and physical applicability remain premises.

Sources consulted

  1. Operational Information Geometry protocol-engine synthesis — GitHub / eruannaarte; software repository; retrieved 2026-08-15.
  2. Protocol-engine reproducibility manifest — GitHub / eruannaarte; software repository; retrieved 2026-08-15.
  3. Query-directed protocol engine — GitHub / eruannaarte; software repository; retrieved 2026-08-15.
  4. Candidate-library certificate engine — GitHub / eruannaarte; software repository; retrieved 2026-08-15.
  5. Structured nuisance engine — GitHub / eruannaarte; software repository; retrieved 2026-08-15.
  6. Model-aware quotient engine — GitHub / eruannaarte; software repository; retrieved 2026-08-15.
  7. Pinned Atlas-integration certificate — GitHub / eruannaarte; software repository; retrieved 2026-08-15.
  8. Arithmetic-Atlas protocol integration note — GitHub / eruannaarte; software repository; retrieved 2026-08-15.
  9. Protocol artifact reconstruction tests — GitHub / eruannaarte; software repository; retrieved 2026-08-15.
  10. Protocol-engine adversarial audit — GitHub / eruannaarte; software repository; retrieved 2026-08-15.

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