Skip to content

[Lean] Hyperplane-end helpers: multi-gate cleanup tails and the cold specialisation (stacked on #593, no κ claim) - #599

Merged
Mister-Meeseeks merged 2 commits into
CrocSwap:mainfrom
DreamingOfClouds:research/hyperplane-end-multi
Oct 12, 2026
Merged

Mister-Meeseeks merged 2 commits into
CrocSwap:mainfrom
DreamingOfClouds:research/hyperplane-end-multi

Conversation

@DreamingOfClouds

Copy link
Copy Markdown
Contributor

No κ claim. This PR extends #593's hyperplane-end Lean (jeremykothe2) in two directions:

  • multi-gate cleanup tails, with several helpers at once;
  • the cold specialisation, where the helper enters at E = ⊥.

It is stacked on #593 and adds one commit, touching only research/hyperplane-end-lean/.

What is proved (HyperplaneEnd/Multi.lean)

  • hpe_labels_multi: the word a ++ mtail ++ b ++ posts is well labelled, and every hyperplane-ended helper ends at (done, j). This holds for a general cleanup_tail: any number of gates t += q • s or t *= q, each at its own frame, where each operand climbs to that frame unless it is already there. A helper may be target or partner of several tail gates, and several helpers may interleave. Hypotheses:
    • the last tail gate touching j runs at term j;
    • the rest of the cleanup never moves j;
    • the entrance frame is arbitrary.
  • hpe_word_multi: Lemma A on streams for every such helper, given the per-helper (N), as in [Lean] Hyperplane-ended helpers: Lemma A with an arbitrary terminal frame (no κ claim) #593.
  • hpe_labels_tail: Tail.lean's one-gate word is the one-gate instance when both operands start away from U.
  • exact_cold, cold_hyperplane_width: given T_E = id, which holds for the canonical frame of E = ⊥, (N) reduces to T_U = L (C ⊗ id) R, and ⊥ ≤ U with dim U = 8 gives width 8. [Lean] Hyperplane-ended helpers: Lemma A with an arbitrary terminal frame (no κ claim) #593's hpe_word already accepts an arbitrary entrance frame, so the Lean content specific to E = ⊥ is just this specialisation.

Scope

Checks

Credit: #593 (jeremykothe2) is the base package and the single-gate theorem; #509 / #516 (DreamingOfClouds) are the Lemma G / Lemma A packages it builds on.

Prepared by DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code; Apache-2.0.

🤖 Generated with Claude Code

jeremykothe and others added 2 commits October 13, 2026 01:26
…ved in Lean 4

Generalizes Lemma G's extended labels so an entering helper may end at any frame U (wrappers keyed by (E, U)), derives Lemma A's (F) from the exact factorization T_U T_E^-1 = L (C (x) id) R, and applies Lemma A unchanged (hpe_block/family/streams/word). factor_iff_pre formalizes review finding F1. code/check_hpe_pairs.py checks the instance hypotheses on the ck/atm3/jp8 HPE words (38 helpers, 3 (E,U) pairs each). No sorry, no new axioms.

Prepared with Claude Opus 5.5 (Anthropic) in omp; submitted by jeremykothe2.
…he cold specialisation

HyperplaneEnd/Multi.lean models a general cleanup_tail (each operand climbs
to the gate's frame unless already there, then the gate runs) and proves
hpe_labels_multi and hpe_word_multi (Lemma A on streams for every
hyperplane-ended helper; any number of tail gates; helpers interleaved; entrance
frame arbitrary). hpe_labels_tail recovers Tail.lean's one-gate word when both
operands start away from U; the shipped helpers of CrocSwap#591/CrocSwap#592 are one-gate, and
multi-gate or scale tails are not checked here against emitted words.
exact_cold / cold_hyperplane_width give the specialisation T_E = id (the
canonical frame of E = bottom) and width 8. No sorry; all 27 results depend only
on propext, Classical.choice, Quot.sound.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
@Mister-Meeseeks
Mister-Meeseeks merged commit b3eb785 into CrocSwap:main Oct 12, 2026
60 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants