Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Unconditional future separation

Abstract

Unconditional future separation.

The two actual sources repeat the seven windows 3,3,5,5,3,2,2 and 0,3,5,5,3,2,2. Strict actual entry records against the same rival have a shared literal tail, fixed common future errors and a positive uniform margin. That tail belongs to every recursively defined finite horizon.

Definition 1.1 (Universal finite separation assertion).

Lean statement: D5/S1/Digit/Infinite/SevenCycleSeparationRefutation.claim

Formalization. D5/S1/Digit/Infinite/SevenCycleSeparationRefutation.claim (✓ std3).

Source. Repository-derived.

Commentary.

The assertion quantifies over every positive subcritical budget, original endpoint graph and actual odd primitive singleton rival. It asks for one finite horizon removing all different-first-label entries compatible with that rival. The two first colors can differ; future common colors are tested recursively using the original guards and full branch images.

References