Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Timeline: The Arc in One Figure

Robert Aaron Tseglin

Published Nov 6, 2026• 0 citations
Publisher

Abstract

This is the timeline paper for the arc 2026a–2026v. It does not prove a new theorem. It puts all twenty-two papers in one figure, in order, with one line each, so a reader can see the whole arc at a glance. In 2026a (Ch. 124), we proved no unital map T → E for H = S^1. In 2026b (Ch. 125), we generalized to the triple (dim H^n, dim C^n, 1). In 2026c (Ch. 138), we defined the Bridge Conjecture. In 2026d (Ch. 139), we proved the eraser must be CPTP. In 2026e (Ch. 140), we proved all four follow from one Unifier Axiom: [x,y] = 1. In 2026f (Ch. 141), we categorified H. In 2026g (Ch. 142), we proved the Unifier survives in characteristic p. In 2026h (Ch. 143), we proved it survives for infinite H. In 2026i (Ch. 144), we gave the lab falsifier D^2 + V^2 ≤ 1. In 2026j (Ch. 145), we proved the nine papers are one theorem. In 2026k (Ch. 146), we proved the Unifier survives for any A with [x,y] = 1. In 2026l (Ch. 147), we constructed H(M) for M Lorentzian. In 2026m (Ch. 148), we defined causal homotopy, π1^causal, and H1^causal. In 2026n (Ch. 149), we defined H^n_causal(H(M)) for all n. In 2026o (Ch. 150), we proved the fourteen papers are one theorem. In 2026p (Ch. 151), we proved Einstein + NEC + Bridge ⇒ no CTC, and NEC violation still forces erasure. In 2026q (Ch. 152), we proved quantum M still forces erasure, branch + interference. In 2026r (Ch. 153), we gave the concrete lab protocol: Mach-Zehnder, W, E, D^2+V^2 ≤ 1, delayed-choice without retro-causation. In 2026s (Ch. 154), we proved the eighteen papers are one theorem. In 2026t (Ch. 155), we listed the open problems: NEC, M-Hat, lab, weaker Unifier, concrete H^1_causal, categorical F, joint char p + infinite + QFT. In 2026u (Ch. 156), we gave the index: twenty papers, one page, one falsifier, one reading path. In 2026v (Ch. 157), we gave the collected abstracts: twenty papers in twenty paragraphs. By 2026s, the twenty-two papers stand or fall together. By 2026t, the open questions are: NEC, M-Hat, lab. By 2026u, the map is one page. By 2026v, the abstracts are twenty paragraphs. This paper is the timeline in one figure. Tseglin 2026w = Ch. 158. Cites Tseglin 2026a DOI 10.5281/zenodo.23977165, 2026b DOI 10.5281/zenodo.23980498, 2026c DOI 10.5281/zenodo.23980738, 2026d DOI 10.5281/zenodo.23981860, 2026e DOI 10.5281/zenodo.23982063, 2026f DOI 10.5281/zenodo.23982359, 2026g DOI 10.5281/zenodo.23985216, 2026h DOI 10.5281/zenodo.23991367, 2026i DOI 10.5281/zenodo.23991442, 2026j DOI 10.5281/zenodo.23991535, 2026k DOI 10.5281/zenodo.23991603, 2026l DOI 10.5281/zenodo.23991665, 2026m DOI 10.5281/zenodo.23991998, 2026n DOI 10.5281/zenodo.23992083, 2026o DOI 10.5281/zenodo.23992187, 2026p DOI 10.5281/zenodo.23992267, 2026q DOI 10.5281/zenodo.23992317, 2026r DOI 10.5281/zenodo.23992397, 2026s DOI 10.5281/zenodo.23992535, 2026t DOI 10.5281/zenodo.23992634, 2026u DOI 10.5281/zenodo.23992755, 2026v DOI 10.5281/zenodo.23992855.

DOI
10.5281/zenodo.23992943

Related papers

Glossary: Every Symbol in One Page

Robert Aaron Tseglin

This is the glossary paper for the arc 2026a–2026w. It does not prove a new theorem. It defines every symbol used in all twenty-three papers, in one place, so a reader can read any paper without guessing notation. In 2026a (Ch. 124), we proved no unital map T → E for H = S^1. In 2026b (Ch. 125), we generalized to the triple (dim H^n, dim C^n, 1). In 2026c (Ch. 138), we defined the Bridge Conjecture. In 2026d (Ch. 139), we proved the eraser must be CPTP. In 2026e (Ch. 140), we proved all four follow from one Unifier Axiom: [x,y] = 1. In 2026f (Ch. 141), we categorified H. In 2026g (Ch. 142), we proved the Unifier survives in characteristic p. In 2026h (Ch. 143), we proved it survives for infinite H. In 2026i (Ch. 144), we gave the lab falsifier D^2 + V^2 ≤ 1. In 2026j (Ch. 145), we proved the nine papers are one theorem. In 2026k (Ch. 146), we proved the Unifier survives for any A with [x,y] = 1. In 2026l (Ch. 147), we constructed H(M) for M Lorentzian. In 2026m (Ch. 148), we defined causal homotopy, π1^causal, and H1^causal. In 2026n (Ch. 149), we defined H^n_causal(H(M)) for all n. In 2026o (Ch. 150), we proved the fourteen papers are one theorem. In 2026p (Ch. 151), we proved Einstein + NEC + Bridge ⇒ no CTC, and NEC violation still forces erasure. In 2026q (Ch. 152), we proved quantum M still forces erasure, branch + interference. In 2026r (Ch. 153), we gave the concrete lab protocol: Mach-Zehnder, W, E, D^2+V^2 ≤ 1, delayed-choice without retro-causation. In 2026s (Ch. 154), we proved the eighteen papers are one theorem. In 2026t (Ch. 155), we listed the open problems: NEC, M-Hat, lab, weaker Unifier, concrete H^1_causal, categorical F, joint char p + infinite + QFT. In 2026u (Ch. 156), we gave the index: twenty papers, one page, one falsifier, one reading path. In 2026v (Ch. 157), we gave the collected abstracts: twenty papers in twenty paragraphs. In 2026w (Ch. 158), we gave the timeline: the arc in one figure. By 2026s, the twenty-three papers stand or fall together. By 2026t, the open questions are: NEC, M-Hat, lab. By 2026u, the map is one page. By 2026v, the abstracts are twenty paragraphs. By 2026w, the timeline is one figure. This paper is the glossary. Tseglin 2026x = Ch. 159. Cites Tseglin 2026a DOI 10.5281/zenodo.23977165, 2026b DOI 10.5281/zenodo.23980498, 2026c DOI 10.5281/zenodo.23980738, 2026d DOI 10.5281/zenodo.23981860, 2026e DOI 10.5281/zenodo.23982063, 2026f DOI 10.5281/zenodo.23982359, 2026g DOI 10.5281/zenodo.23985216, 2026h DOI 10.5281/zenodo.23991367, 2026i DOI 10.5281/zenodo.23991442, 2026j DOI 10.5281/zenodo.23991535, 2026k DOI 10.5281/zenodo.23991603, 2026l DOI 10.5281/zenodo.23991665, 2026m DOI 10.5281/zenodo.23991998, 2026n DOI 10.5281/zenodo.23992083, 2026o DOI 10.5281/zenodo.23992187, 2026p DOI 10.5281/zenodo.23992267, 2026q DOI 10.5281/zenodo.23992317, 2026r DOI 10.5281/zenodo.23992397, 2026s DOI 10.5281/zenodo.23992535, 2026t DOI 10.5281/zenodo.23992634, 2026u DOI 10.5281/zenodo.23992755, 2026v DOI 10.5281/zenodo.23992855, 2026w DOI 10.5281/zenodo.23992944.

•Nov 6, 2026•0 citations

Collected Abstracts: The Twenty Papers in Twenty Paragraphs

Robert Aaron Tseglin

This is the collected-abstracts paper for the arc 2026a–2026u. It does not prove a new theorem. It collects, in order, one paragraph per paper, for all twenty-one papers, so a reader can see the whole arc in one place. In 2026a (Ch. 124), we proved no unital map T → E for H = S^1. In 2026b (Ch. 125), we generalized to the triple (dim H^n, dim C^n, 1). In 2026c (Ch. 138), we defined the Bridge Conjecture. In 2026d (Ch. 139), we proved the eraser must be CPTP. In 2026e (Ch. 140), we proved all four follow from one Unifier Axiom: [x,y] = 1. In 2026f (Ch. 141), we categorified H. In 2026g (Ch. 142), we proved the Unifier survives in characteristic p. In 2026h (Ch. 143), we proved it survives for infinite H. In 2026i (Ch. 144), we gave the lab falsifier D^2 + V^2 ≤ 1. In 2026j (Ch. 145), we proved the nine papers are one theorem. In 2026k (Ch. 146), we proved the Unifier survives for any A with [x,y] = 1. In 2026l (Ch. 147), we constructed H(M) for M Lorentzian. In 2026m (Ch. 148), we defined causal homotopy, π1^causal, and H1^causal. In 2026n (Ch. 149), we defined H^n_causal(H(M)) for all n. In 2026o (Ch. 150), we proved the fourteen papers are one theorem. In 2026p (Ch. 151), we proved Einstein + NEC + Bridge ⇒ no CTC, and NEC violation still forces erasure. In 2026q (Ch. 152), we proved quantum M still forces erasure, branch + interference. In 2026r (Ch. 153), we gave the concrete lab protocol: Mach-Zehnder, W, E, D^2+V^2 ≤ 1, delayed-choice without retro-causation. In 2026s (Ch. 154), we proved the eighteen papers are one theorem. In 2026t (Ch. 155), we listed the open problems: NEC, M-Hat, lab, weaker Unifier, concrete H^1_causal, categorical F, joint char p + infinite + QFT. In 2026u (Ch. 156), we gave the index: twenty papers, one page, one falsifier, one reading path. By 2026s, the twenty-one papers stand or fall together. By 2026t, the open questions are: NEC, M-Hat, lab. By 2026u, the map is one page. This paper is the twenty paragraphs. Tseglin 2026v = Ch. 157. Cites Tseglin 2026a DOI 10.5281/zenodo.23977165, 2026b DOI 10.5281/zenodo.23980498, 2026c DOI 10.5281/zenodo.23980738, 2026d DOI 10.5281/zenodo.23981860, 2026e DOI 10.5281/zenodo.23982063, 2026f DOI 10.5281/zenodo.23982359, 2026g DOI 10.5281/zenodo.23985216, 2026h DOI 10.5281/zenodo.23991367, 2026i DOI 10.5281/zenodo.23991442, 2026j DOI 10.5281/zenodo.23991535, 2026k DOI 10.5281/zenodo.23991603, 2026l DOI 10.5281/zenodo.23991665, 2026m DOI 10.5281/zenodo.23991998, 2026n DOI 10.5281/zenodo.23992083, 2026o DOI 10.5281/zenodo.23992187, 2026p DOI 10.5281/zenodo.23992267, 2026q DOI 10.5281/zenodo.23992317, 2026r DOI 10.5281/zenodo.23992397, 2026s DOI 10.5281/zenodo.23992535, 2026t DOI 10.5281/zenodo.23992634, 2026u DOI 10.5281/zenodo.23992755.

•Nov 6, 2026•0 citations

Synthesis: The Nine Papers as One Theorem

Robert Aaron Tseglin

This paper closes the arc. In 2026a (Ch. 124), we proved no unital map T → E for H = S^1. In 2026b (Ch. 125), we generalized to the triple H^n(T(H)) = (dim H^n, dim C^n, 1) for all finite H, all n. In 2026c (Ch. 138), we defined the Bridge Conjecture. In 2026d (Ch. 139), we proved the eraser must be CPTP decoherence. In 2026e (Ch. 140), we proved all four follow from one Unifier Axiom: [x,y] = 1, and no unital φ: T(H) → E preserves [x,y]. In 2026f (Ch. 141), we categorified H: histories as objects, T as functor, erasure as functor, No-Go as natural. In 2026g (Ch. 142), we proved the Unifier survives in characteristic p, via the Frobenius center k[x^p,y^p]. In 2026h (Ch. 143), we proved it survives for infinite H = lim→ H_i. In 2026i (Ch. 144), we gave the explicit falsifier: D^2 + V^2 ≤ 1. Here we prove the nine papers are one theorem: (U1) [x,y] = 1 implies (1) No-Go, (2) Triple, (3) Bridge, (4) CPTP eraser, (5) Functoriality, (6) Char p stability, (7) Infinite stability, (8) Lab bound D^2 + V^2 ≤ 1. Conversely, falsifying any one falsifies (U1). We give the dependency graph, the single falsifier that kills all nine, and what remains open: the Bridge Conjecture itself. This is not a new result. It is the map of the previous nine. Tseglin 2026j = Ch. 145. Cites Tseglin 2026a DOI 10.5281/zenodo.23977165, 2026b DOI 10.5281/zenodo.23980498, 2026c DOI 10.5281/zenodo.23980738, 2026d DOI 10.5281/zenodo.23981860, 2026e DOI 10.5281/zenodo.23982063, 2026f DOI 10.5281/zenodo.23982359, 2026g DOI 10.5281/zenodo.23985216, 2026h DOI 10.5281/zenodo.23991367, 2026i DOI 10.5281/zenodo.23991442.

•Nov 6, 2026•0 citations

Lab: D^2+V^2 in a Real Interferometer with Eraser

Robert Aaron Tseglin

This paper is the third paper after Synthesis II, and the lab paper promised in 2026i, 2026o, 2026p, 2026q. In 2026a (Ch. 124), we proved no unital map T → E for H = S^1. In 2026b (Ch. 125), we generalized to the triple (dim H^n, dim C^n, 1). In 2026c (Ch. 138), we defined the Bridge Conjecture. In 2026d (Ch. 139), we proved the eraser must be CPTP. In 2026e (Ch. 140), we proved all four follow from one Unifier Axiom: [x,y] = 1. In 2026f (Ch. 141), we categorified H. In 2026g (Ch. 142), we proved the Unifier survives in characteristic p. In 2026h (Ch. 143), we proved it survives for infinite H. In 2026i (Ch. 144), we gave the lab falsifier D^2 + V^2 ≤ 1. In 2026j (Ch. 145), we proved the nine papers are one theorem. In 2026k (Ch. 146), we proved the Unifier survives for any A with [x,y] = 1. In 2026l (Ch. 147), we constructed H(M) for M Lorentzian. In 2026m (Ch. 148), we defined causal homotopy, π1^causal, and H1^causal. In 2026n (Ch. 149), we defined H^n_causal(H(M)) for all n. In 2026o (Ch. 150), we proved the fourteen papers are one theorem. In 2026p (Ch. 151), we proved Einstein + NEC + Bridge ⇒ no CTC, and NEC violation still forces erasure. In 2026q (Ch. 152), we proved quantum M still forces erasure, branch + interference. Here we give the concrete lab protocol that tests all seventeen papers in one interferometer. Setup: Mach-Zehnder interferometer, single photons, which-way marker W, quantum eraser E. Define D = distinguishability from W, V = fringe visibility at output. We prove: (1) D^2+V^2 ≤ 1 is exactly the lab shadow of no unital T → E preserving [x,y], (2) eraser E is CPTP by 2026d, and restores V only by erasing D, (3) delayed-choice eraser does not retro-cause: erasure acts on H(M) causal history, not on past M, (4) a repeatable run with D ≈ 1, V ≈ 1, no eraser, at >3σ, falsifies 2026i and hence 2026o/p/q and the whole arc, (5) a run with D → 1 forcing V → 0, and eraser restoring V → 1 forcing D → 0, confirms the One Theorem in lab. This is a protocol paper, not a data paper. No data is claimed. The protocol is falsifiable, cheap, and doable with existing photonics. Tseglin 2026r = Ch. 153. Cites Tseglin 2026a DOI 10.5281/zenodo.23977165, 2026b DOI 10.5281/zenodo.23980498, 2026c DOI 10.5281/zenodo.23980738, 2026d DOI 10.5281/zenodo.23981860, 2026e DOI 10.5281/zenodo.23982063, 2026f DOI 10.5281/zenodo.23982359, 2026g DOI 10.5281/zenodo.23985216, 2026h DOI 10.5281/zenodo.23991367, 2026i DOI 10.5281/zenodo.23991442, 2026j DOI 10.5281/zenodo.23991535, 2026k DOI 10.5281/zenodo.23991603, 2026l DOI 10.5281/zenodo.23991665, 2026m DOI 10.5281/zenodo.23991998, 2026n DOI 10.5281/zenodo.23992083, 2026o DOI 10.5281/zenodo.23992187, 2026p DOI 10.5281/zenodo.23992267, 2026q DOI 10.5281/zenodo.23992317.

•Nov 6, 2026•0 citations

The Experiment: D^2 + V^2 ≤ 1 as a Falsifier

Robert Aaron Tseglin

This paper turns the Unifier into an experiment. In 2026a, we proved no unital map T → E for H = S^1. In 2026b, we generalized to the triple H^n(T(H)) = (dim H^n, dim C^n, 1) for all finite H, all n. In 2026c, we defined the Bridge Conjecture. In 2026d, we proved the eraser must be CPTP decoherence. In 2026e, we proved all four follow from one Unifier Axiom: [x,y] = 1, and no unital φ: T(H) → E preserves [x,y]. In 2026f, we categorified H. In 2026g, we proved the Unifier survives in characteristic p. In 2026h, we proved it survives for infinite H = lim→ H_i. Here we give the explicit falsifier: a delayed-choice quantum eraser with which-path distinguishability D and interference visibility V must satisfy D^2 + V^2 ≤ 1. If a run with no eraser yields D ≈ 1 and V ≈ 1 repeatably at > 3σ, then (U1) fails, c is not 1, and 2026a/b/c/d/e/f/g/h all fall. If the bound holds, the Unifier survives its first laboratory test. This is not a new theory. It is the protocol that makes the previous eight papers falsifiable. Tseglin 2026i = Ch. 144. Cites Tseglin 2026a DOI 10.5281/zenodo.23977165, 2026b DOI 10.5281/zenodo.23980498, 2026c DOI 10.5281/zenodo.23980738, 2026d DOI 10.5281/zenodo.23981860, 2026e DOI 10.5281/zenodo.23982063, 2026f DOI 10.5281/zenodo.23982359, 2026g DOI 10.5281/zenodo.23985216, 2026h DOI 10.5281/zenodo.23991367.

•Nov 6, 2026•0 citations

Char p Frobenius: The Unifier in Characteristic p

Robert Aaron Tseglin

This paper tests the Unifier in characteristic p. In 2026a, we proved no unital map T → E for H = S^1. In 2026b, we generalized to the triple H^n(T(H)) = (dim H^n, dim C^n, 1) for all finite H, all n. In 2026c, we defined the Bridge Conjecture. In 2026d, we proved the eraser must be CPTP decoherence. In 2026e, we proved all four follow from one Unifier Axiom: [x,y] = 1, and no unital φ: T(H) → E preserves [x,y]. In 2026f, we categorified H: histories as objects, T as functor, erasure as functor, No-Go as natural. Here we ask: does the Unifier survive in characteristic p? In characteristic 0, [x,y] = 1 is sharp. In characteristic p, the Weyl algebra A_1 has a large center, the Frobenius map F: a ↦ a^p is central, and x^p, y^p commute with everything. We prove the No-Go survives, but in a new form: erasure cannot kill the Frobenius center. We define the char p triple (dim H^n, dim C^n, 1_p) where 1_p is the Frobenius obstruction, and prove it cannot be erased by any unital map. This does not change the experiment. It changes the algebra in which the experiment is interpreted. If the Unifier failed in char p, it would be a characteristic 0 accident. It does not fail. Tseglin 2026g = Ch. 142. Cites Tseglin 2026a DOI 10.5281/zenodo.23977165, 2026b DOI 10.5281/zenodo.23980498, 2026c DOI 10.5281/zenodo.23980738, 2026d DOI 10.5281/zenodo.23981860, 2026e DOI 10.5281/zenodo.23982063, 2026f DOI 10.5281/zenodo.23982359.

•Nov 5, 2026•0 citations
This is the timeline paper for the arc 2026a–2026v. It does not prove a new theorem. It puts all twenty-two papers in one figure, in order, with one line each, so a reader can see the whole arc at a glance. In 2026a (Ch. 124), we proved no unital map T → E for H = S^1. In 2026b (Ch. 125), we generalized to the triple (dim H^n, dim C^n, 1). In 2026c (Ch. 138), we defined the Bridge Conjecture. In 2026d (Ch. 139), we proved the eraser must be CPTP. In 2026e (Ch. 140), we proved all four follow from one Unifier Axiom: [x,y] = 1. In 2026f (Ch. 141), we categorified H. In 2026g (Ch. 142), we proved the Unifier survives in characteristic p. In 2026h (Ch. 143), we proved it survives for infinite H. In 2026i (Ch. 144), we gave the lab falsifier D^2 + V^2 ≤ 1. In 2026j (Ch. 145), we proved the nine papers are one theorem. In 2026k (Ch. 146), we proved the Unifier survives for any A with [x,y] = 1. In 2026l (Ch. 147), we constructed H(M) for M Lorentzian. In 2026m (Ch. 148), we defined causal homotopy, π1^causal, and H1^causal. In 2026n (Ch. 149), we defined H^n_causal(H(M)) for all n. In 2026o (Ch. 150), we proved the fourteen papers are one theorem. In 2026p (Ch. 151), we proved Einstein + NEC + Bridge ⇒ no CTC, and NEC violation still forces erasure. In 2026q (Ch. 152), we proved quantum M still forces erasure, branch + interference. In 2026r (Ch. 153), we gave the concrete lab protocol: Mach-Zehnder, W, E, D^2+V^2 ≤ 1, delayed-choice without retro-causation. In 2026s (Ch. 154), we proved the eighteen papers are one theorem. In 2026t (Ch. 155), we listed the open problems: NEC, M-Hat, lab, weaker Unifier, concrete H^1_causal, categorical F, joint char p + infinite + QFT. In 2026u (Ch. 156), we gave the index: twenty papers, one page, one falsifier, one reading path. In 2026v (Ch. 157), we gave the collected abstracts: twenty papers in twenty paragraphs. By 2026s, the twenty-two papers stand or fall together. By 2026t, the open questions are: NEC, M-Hat, lab. By 2026u, the map is one page. By 2026v, the abstracts are twenty paragraphs. This paper is the timeline in one figure. Tseglin 2026w = Ch. 158. Cites Tseglin 2026a DOI 10.5281/zenodo.23977165, 2026b DOI 10.5281/zenodo.23980498, 2026c DOI 10.5281/zenodo.23980738, 2026d DOI 10.5281/zenodo.23981860, 2026e DOI 10.5281/zenodo.23982063, 2026f DOI 10.5281/zenodo.23982359, 2026g DOI 10.5281/zenodo.23985216, 2026h DOI 10.5281/zenodo.23991367, 2026i DOI 10.5281/zenodo.23991442, 2026j DOI 10.5281/zenodo.23991535, 2026k DOI 10.5281/zenodo.23991603, 2026l DOI 10.5281/zenodo.23991665, 2026m DOI 10.5281/zenodo.23991998, 2026n DOI 10.5281/zenodo.23992083, 2026o DOI 10.5281/zenodo.23992187, 2026p DOI 10.5281/zenodo.23992267, 2026q DOI 10.5281/zenodo.23992317, 2026r DOI 10.5281/zenodo.23992397, 2026s DOI 10.5281/zenodo.23992535, 2026t DOI 10.5281/zenodo.23992634, 2026u DOI 10.5281/zenodo.23992755, 2026v DOI 10.5281/zenodo.23992855.
This is the glossary paper for the arc 2026a–2026w. It does not prove a new theorem. It defines every symbol used in all twenty-three papers, in one place, so a reader can read any paper without guessing notation. In 2026a (Ch. 124), we proved no unital map T → E for H = S^1. In 2026b (Ch. 125), we generalized to the triple (dim H^n, dim C^n, 1). In 2026c (Ch. 138), we defined the Bridge Conjecture. In 2026d (Ch. 139), we proved the eraser must be CPTP. In 2026e (Ch. 140), we proved all four follow from one Unifier Axiom: [x,y] = 1. In 2026f (Ch. 141), we categorified H. In 2026g (Ch. 142), we proved the Unifier survives in characteristic p. In 2026h (Ch. 143), we proved it survives for infinite H. In 2026i (Ch. 144), we gave the lab falsifier D^2 + V^2 ≤ 1. In 2026j (Ch. 145), we proved the nine papers are one theorem. In 2026k (Ch. 146), we proved the Unifier survives for any A with [x,y] = 1. In 2026l (Ch. 147), we constructed H(M) for M Lorentzian. In 2026m (Ch. 148), we defined causal homotopy, π1^causal, and H1^causal. In 2026n (Ch. 149), we defined H^n_causal(H(M)) for all n. In 2026o (Ch. 150), we proved the fourteen papers are one theorem. In 2026p (Ch. 151), we proved Einstein + NEC + Bridge ⇒ no CTC, and NEC violation still forces erasure. In 2026q (Ch. 152), we proved quantum M still forces erasure, branch + interference. In 2026r (Ch. 153), we gave the concrete lab protocol: Mach-Zehnder, W, E, D^2+V^2 ≤ 1, delayed-choice without retro-causation. In 2026s (Ch. 154), we proved the eighteen papers are one theorem. In 2026t (Ch. 155), we listed the open problems: NEC, M-Hat, lab, weaker Unifier, concrete H^1_causal, categorical F, joint char p + infinite + QFT. In 2026u (Ch. 156), we gave the index: twenty papers, one page, one falsifier, one reading path. In 2026v (Ch. 157), we gave the collected abstracts: twenty papers in twenty paragraphs. In 2026w (Ch. 158), we gave the timeline: the arc in one figure. By 2026s, the twenty-three papers stand or fall together. By 2026t, the open questions are: NEC, M-Hat, lab. By 2026u, the map is one page. By 2026v, the abstracts are twenty paragraphs. By 2026w, the timeline is one figure. This paper is the glossary. Tseglin 2026x = Ch. 159. Cites Tseglin 2026a DOI 10.5281/zenodo.23977165, 2026b DOI 10.5281/zenodo.23980498, 2026c DOI 10.5281/zenodo.23980738, 2026d DOI 10.5281/zenodo.23981860, 2026e DOI 10.5281/zenodo.23982063, 2026f DOI 10.5281/zenodo.23982359, 2026g DOI 10.5281/zenodo.23985216, 2026h DOI 10.5281/zenodo.23991367, 2026i DOI 10.5281/zenodo.23991442, 2026j DOI 10.5281/zenodo.23991535, 2026k DOI 10.5281/zenodo.23991603, 2026l DOI 10.5281/zenodo.23991665, 2026m DOI 10.5281/zenodo.23991998, 2026n DOI 10.5281/zenodo.23992083, 2026o DOI 10.5281/zenodo.23992187, 2026p DOI 10.5281/zenodo.23992267, 2026q DOI 10.5281/zenodo.23992317, 2026r DOI 10.5281/zenodo.23992397, 2026s DOI 10.5281/zenodo.23992535, 2026t DOI 10.5281/zenodo.23992634, 2026u DOI 10.5281/zenodo.23992755, 2026v DOI 10.5281/zenodo.23992855, 2026w DOI 10.5281/zenodo.23992944.
This is the collected-abstracts paper for the arc 2026a–2026u. It does not prove a new theorem. It collects, in order, one paragraph per paper, for all twenty-one papers, so a reader can see the whole arc in one place. In 2026a (Ch. 124), we proved no unital map T → E for H = S^1. In 2026b (Ch. 125), we generalized to the triple (dim H^n, dim C^n, 1). In 2026c (Ch. 138), we defined the Bridge Conjecture. In 2026d (Ch. 139), we proved the eraser must be CPTP. In 2026e (Ch. 140), we proved all four follow from one Unifier Axiom: [x,y] = 1. In 2026f (Ch. 141), we categorified H. In 2026g (Ch. 142), we proved the Unifier survives in characteristic p. In 2026h (Ch. 143), we proved it survives for infinite H. In 2026i (Ch. 144), we gave the lab falsifier D^2 + V^2 ≤ 1. In 2026j (Ch. 145), we proved the nine papers are one theorem. In 2026k (Ch. 146), we proved the Unifier survives for any A with [x,y] = 1. In 2026l (Ch. 147), we constructed H(M) for M Lorentzian. In 2026m (Ch. 148), we defined causal homotopy, π1^causal, and H1^causal. In 2026n (Ch. 149), we defined H^n_causal(H(M)) for all n. In 2026o (Ch. 150), we proved the fourteen papers are one theorem. In 2026p (Ch. 151), we proved Einstein + NEC + Bridge ⇒ no CTC, and NEC violation still forces erasure. In 2026q (Ch. 152), we proved quantum M still forces erasure, branch + interference. In 2026r (Ch. 153), we gave the concrete lab protocol: Mach-Zehnder, W, E, D^2+V^2 ≤ 1, delayed-choice without retro-causation. In 2026s (Ch. 154), we proved the eighteen papers are one theorem. In 2026t (Ch. 155), we listed the open problems: NEC, M-Hat, lab, weaker Unifier, concrete H^1_causal, categorical F, joint char p + infinite + QFT. In 2026u (Ch. 156), we gave the index: twenty papers, one page, one falsifier, one reading path. By 2026s, the twenty-one papers stand or fall together. By 2026t, the open questions are: NEC, M-Hat, lab. By 2026u, the map is one page. This paper is the twenty paragraphs. Tseglin 2026v = Ch. 157. Cites Tseglin 2026a DOI 10.5281/zenodo.23977165, 2026b DOI 10.5281/zenodo.23980498, 2026c DOI 10.5281/zenodo.23980738, 2026d DOI 10.5281/zenodo.23981860, 2026e DOI 10.5281/zenodo.23982063, 2026f DOI 10.5281/zenodo.23982359, 2026g DOI 10.5281/zenodo.23985216, 2026h DOI 10.5281/zenodo.23991367, 2026i DOI 10.5281/zenodo.23991442, 2026j DOI 10.5281/zenodo.23991535, 2026k DOI 10.5281/zenodo.23991603, 2026l DOI 10.5281/zenodo.23991665, 2026m DOI 10.5281/zenodo.23991998, 2026n DOI 10.5281/zenodo.23992083, 2026o DOI 10.5281/zenodo.23992187, 2026p DOI 10.5281/zenodo.23992267, 2026q DOI 10.5281/zenodo.23992317, 2026r DOI 10.5281/zenodo.23992397, 2026s DOI 10.5281/zenodo.23992535, 2026t DOI 10.5281/zenodo.23992634, 2026u DOI 10.5281/zenodo.23992755.
This paper closes the arc. In 2026a (Ch. 124), we proved no unital map T → E for H = S^1. In 2026b (Ch. 125), we generalized to the triple H^n(T(H)) = (dim H^n, dim C^n, 1) for all finite H, all n. In 2026c (Ch. 138), we defined the Bridge Conjecture. In 2026d (Ch. 139), we proved the eraser must be CPTP decoherence. In 2026e (Ch. 140), we proved all four follow from one Unifier Axiom: [x,y] = 1, and no unital φ: T(H) → E preserves [x,y]. In 2026f (Ch. 141), we categorified H: histories as objects, T as functor, erasure as functor, No-Go as natural. In 2026g (Ch. 142), we proved the Unifier survives in characteristic p, via the Frobenius center k[x^p,y^p]. In 2026h (Ch. 143), we proved it survives for infinite H = lim→ H_i. In 2026i (Ch. 144), we gave the explicit falsifier: D^2 + V^2 ≤ 1. Here we prove the nine papers are one theorem: (U1) [x,y] = 1 implies (1) No-Go, (2) Triple, (3) Bridge, (4) CPTP eraser, (5) Functoriality, (6) Char p stability, (7) Infinite stability, (8) Lab bound D^2 + V^2 ≤ 1. Conversely, falsifying any one falsifies (U1). We give the dependency graph, the single falsifier that kills all nine, and what remains open: the Bridge Conjecture itself. This is not a new result. It is the map of the previous nine. Tseglin 2026j = Ch. 145. Cites Tseglin 2026a DOI 10.5281/zenodo.23977165, 2026b DOI 10.5281/zenodo.23980498, 2026c DOI 10.5281/zenodo.23980738, 2026d DOI 10.5281/zenodo.23981860, 2026e DOI 10.5281/zenodo.23982063, 2026f DOI 10.5281/zenodo.23982359, 2026g DOI 10.5281/zenodo.23985216, 2026h DOI 10.5281/zenodo.23991367, 2026i DOI 10.5281/zenodo.23991442.
This paper is the third paper after Synthesis II, and the lab paper promised in 2026i, 2026o, 2026p, 2026q. In 2026a (Ch. 124), we proved no unital map T → E for H = S^1. In 2026b (Ch. 125), we generalized to the triple (dim H^n, dim C^n, 1). In 2026c (Ch. 138), we defined the Bridge Conjecture. In 2026d (Ch. 139), we proved the eraser must be CPTP. In 2026e (Ch. 140), we proved all four follow from one Unifier Axiom: [x,y] = 1. In 2026f (Ch. 141), we categorified H. In 2026g (Ch. 142), we proved the Unifier survives in characteristic p. In 2026h (Ch. 143), we proved it survives for infinite H. In 2026i (Ch. 144), we gave the lab falsifier D^2 + V^2 ≤ 1. In 2026j (Ch. 145), we proved the nine papers are one theorem. In 2026k (Ch. 146), we proved the Unifier survives for any A with [x,y] = 1. In 2026l (Ch. 147), we constructed H(M) for M Lorentzian. In 2026m (Ch. 148), we defined causal homotopy, π1^causal, and H1^causal. In 2026n (Ch. 149), we defined H^n_causal(H(M)) for all n. In 2026o (Ch. 150), we proved the fourteen papers are one theorem. In 2026p (Ch. 151), we proved Einstein + NEC + Bridge ⇒ no CTC, and NEC violation still forces erasure. In 2026q (Ch. 152), we proved quantum M still forces erasure, branch + interference. Here we give the concrete lab protocol that tests all seventeen papers in one interferometer. Setup: Mach-Zehnder interferometer, single photons, which-way marker W, quantum eraser E. Define D = distinguishability from W, V = fringe visibility at output. We prove: (1) D^2+V^2 ≤ 1 is exactly the lab shadow of no unital T → E preserving [x,y], (2) eraser E is CPTP by 2026d, and restores V only by erasing D, (3) delayed-choice eraser does not retro-cause: erasure acts on H(M) causal history, not on past M, (4) a repeatable run with D ≈ 1, V ≈ 1, no eraser, at >3σ, falsifies 2026i and hence 2026o/p/q and the whole arc, (5) a run with D → 1 forcing V → 0, and eraser restoring V → 1 forcing D → 0, confirms the One Theorem in lab. This is a protocol paper, not a data paper. No data is claimed. The protocol is falsifiable, cheap, and doable with existing photonics. Tseglin 2026r = Ch. 153. Cites Tseglin 2026a DOI 10.5281/zenodo.23977165, 2026b DOI 10.5281/zenodo.23980498, 2026c DOI 10.5281/zenodo.23980738, 2026d DOI 10.5281/zenodo.23981860, 2026e DOI 10.5281/zenodo.23982063, 2026f DOI 10.5281/zenodo.23982359, 2026g DOI 10.5281/zenodo.23985216, 2026h DOI 10.5281/zenodo.23991367, 2026i DOI 10.5281/zenodo.23991442, 2026j DOI 10.5281/zenodo.23991535, 2026k DOI 10.5281/zenodo.23991603, 2026l DOI 10.5281/zenodo.23991665, 2026m DOI 10.5281/zenodo.23991998, 2026n DOI 10.5281/zenodo.23992083, 2026o DOI 10.5281/zenodo.23992187, 2026p DOI 10.5281/zenodo.23992267, 2026q DOI 10.5281/zenodo.23992317.
This paper turns the Unifier into an experiment. In 2026a, we proved no unital map T → E for H = S^1. In 2026b, we generalized to the triple H^n(T(H)) = (dim H^n, dim C^n, 1) for all finite H, all n. In 2026c, we defined the Bridge Conjecture. In 2026d, we proved the eraser must be CPTP decoherence. In 2026e, we proved all four follow from one Unifier Axiom: [x,y] = 1, and no unital φ: T(H) → E preserves [x,y]. In 2026f, we categorified H. In 2026g, we proved the Unifier survives in characteristic p. In 2026h, we proved it survives for infinite H = lim→ H_i. Here we give the explicit falsifier: a delayed-choice quantum eraser with which-path distinguishability D and interference visibility V must satisfy D^2 + V^2 ≤ 1. If a run with no eraser yields D ≈ 1 and V ≈ 1 repeatably at > 3σ, then (U1) fails, c is not 1, and 2026a/b/c/d/e/f/g/h all fall. If the bound holds, the Unifier survives its first laboratory test. This is not a new theory. It is the protocol that makes the previous eight papers falsifiable. Tseglin 2026i = Ch. 144. Cites Tseglin 2026a DOI 10.5281/zenodo.23977165, 2026b DOI 10.5281/zenodo.23980498, 2026c DOI 10.5281/zenodo.23980738, 2026d DOI 10.5281/zenodo.23981860, 2026e DOI 10.5281/zenodo.23982063, 2026f DOI 10.5281/zenodo.23982359, 2026g DOI 10.5281/zenodo.23985216, 2026h DOI 10.5281/zenodo.23991367.
This paper tests the Unifier in characteristic p. In 2026a, we proved no unital map T → E for H = S^1. In 2026b, we generalized to the triple H^n(T(H)) = (dim H^n, dim C^n, 1) for all finite H, all n. In 2026c, we defined the Bridge Conjecture. In 2026d, we proved the eraser must be CPTP decoherence. In 2026e, we proved all four follow from one Unifier Axiom: [x,y] = 1, and no unital φ: T(H) → E preserves [x,y]. In 2026f, we categorified H: histories as objects, T as functor, erasure as functor, No-Go as natural. Here we ask: does the Unifier survive in characteristic p? In characteristic 0, [x,y] = 1 is sharp. In characteristic p, the Weyl algebra A_1 has a large center, the Frobenius map F: a ↦ a^p is central, and x^p, y^p commute with everything. We prove the No-Go survives, but in a new form: erasure cannot kill the Frobenius center. We define the char p triple (dim H^n, dim C^n, 1_p) where 1_p is the Frobenius obstruction, and prove it cannot be erased by any unital map. This does not change the experiment. It changes the algebra in which the experiment is interpreted. If the Unifier failed in char p, it would be a characteristic 0 accident. It does not fail. Tseglin 2026g = Ch. 142. Cites Tseglin 2026a DOI 10.5281/zenodo.23977165, 2026b DOI 10.5281/zenodo.23980498, 2026c DOI 10.5281/zenodo.23980738, 2026d DOI 10.5281/zenodo.23981860, 2026e DOI 10.5281/zenodo.23982063, 2026f DOI 10.5281/zenodo.23982359.