Verified Interval Calculus with an Observation-and-Identification Procedure
Result and scope
A finite conditional construction now connects interval records, process operations, observations and statistical identification. All six nonempty intervals on a three-edge line have distinct retained cavity-process representatives; all twelve legal endpoint edits are preserved; three declared photon probes separate their probability distributions; and a fixed-sample classifier has a proved error bound below 1%.
Here verified means written mathematical arguments with exact rational executable checks. It does not mean a proof-assistant formalization or an experiment. The carrier, passive optical law, detector instrument and statistical assumptions are supplied. This result does not derive AdS/dS geometry, select causal interpretations or time orientations, or determine metric scale. Hardware is outside this entry's scope.
Interval calculus and complete records
Let be the existing three retained round operators on ten optical modes. For , define
These represent the six actual NNMHV compiler records. At the incident slot , the diagonal entry is when round belongs to the interval and otherwise. The signature recovers the endpoints; the decoder checks the whole canonical matrix before reconstructing the complete source record, including its diagonal boundary update. Endpoint equality does not erase distinct edit histories.
Writing , the four operations obey
These are process compositions. Applying a bare first-round inverse to the final state generally fails. For an edit , the based output correction is instead , which satisfies . Adjacent segments compose in chronological order. The comparison checks all twelve edits, four adjacent compositions, two distinct-history squares and 792 occupation columns across number sectors zero through two. The all-sector composition statement uses the written symmetric-power argument, not finite sampling.
Observation and identification
In three separate preparation settings, inject one photon into , apply the process and measure that slot with the supplied initially ready detector. Both click and no-click outcomes are retained. The actual instrument calculation gives click probability on selected rounds and otherwise. These three coordinates distinguish the six intervals. Every proper subset of this particular probe family has a collision; no minimum over arbitrary observables is asserted.
For calibration, assume a static factor shared by reference and validation exposures at port . Their probabilities are and , where is the interval signature. A reference therefore identifies the ratio without assuming equal efficiencies across ports.
Take 40,000 independent Bernoulli trials per arm, with reference and validation at each of three ports: 240,000 total. Counts and arm sizes are fixed before observing outcomes. Hoeffding's inequality and a union bound give
The rational bound uses a positive Taylor lower bound for , avoiding a rounded numerical certificate. The classifier retains only signatures compatible with all six rate intervals and shared factors, reporting an interval only when it is uniquely compatible. Otherwise it returns no interval. On the simultaneous good event, every compatible ratio lies within of the true value, less than the signature gap ; the true interval is therefore uniquely identified. The error guarantee is an unconditional repeated-design probability, not posterior confidence conditional on certification. The sample count is sufficient, not optimal.
Falsifiers retained with the result
- Process versus state: all six passive processes fix vacuum. Distinct process operators do not automatically encode interval identity in one common output state.
- Family identification versus tomography: an output phase flip changes each process while preserving these three counting distributions. Identification requires the canonical-family promise.
- Shared calibration versus drift: true interval with reference factors and validation factors has exactly the same six probabilities as stationary interval . All factors remain in . More samples cannot resolve this distributional alias without a restriction on drift.
The finite-sample checker also rejects malformed or incomplete count records and exercises zero references, noninterval responses and ambiguous diagnostic regions. It checks 1,536 boundary cases; those cases test the implementation but do not replace the coverage proof.
Durable verification
Packets, with their source-bound checkers and receipts:
| Stage | Written construction | Checker | Result |
|---|---|---|---|
| Component correction | Prefix-removal compiler | research/nima/checkers/check_cavity_prefix_removal_compiler.py |
research/nima/results/cavity-prefix-removal-compiler.json |
| Interval processes | Process dictionary | research/nima/checkers/check_interval_cavity_process_dictionary.py |
research/nima/results/interval-cavity-process-dictionary.json |
| Observations | Three-probe theorem | research/nima/checkers/check_interval_cavity_probes.py |
research/nima/results/interval-cavity-probes.json |
| Identification | Finite-sample proof | research/nima/checkers/check_interval_cavity_finite_sample.py |
research/nima/results/interval-cavity-finite-sample.json |
Run each checker with Python. Owner-local SCC manifests for the last three stages are research/nima/scc-models/interval-cavity-process-dictionary.json, interval-cavity-probes.json and interval-cavity-finite-sample.json. Their validation/check runs passed; the workbench and broader-outcome audit also passed without promoting the causal-geometry conjectures.
The completed finite-sample claim is conjecture:390a7a9cf3d34550212a, recorded by graph event ev-000000016250-f6208a33-a541-48ac-82d5-c2e4b6f15ea5, proposal ep_fc2f0ee5-4b91-4ea0-9249-d161e8331fe1. Graph admission records the reviewed claim and its scope; it is not an independent truth certificate. Ledger number 4328 was allocated by sequence claim seqclaim-93b1624a9bd0e9a4cecfd3fb.