Lesson 10 - Alignment Capstone and Research Handoff

Goal

Check whether the learner and Codex are aligned on the current Conjecture 3 frontier, then hand off to research actions without confusing learning progress with proof progress.

Prerequisites And Diagnostic Checks

Before using this lesson, the learner should be able to complete Lessons 01-09 active recall without major gaps.

If not, do not mark the frontier course complete. Return to the weakest lesson.

Concrete Motivation

The course exists because there are now two different progress axes:

• research progress: the local graph has settled some statements and narrowed several frontiers;
• learner progress: the learner is starting fresh and must internalize the route before contributing reliably.

Alignment means both axes are visible at once.

Capstone Map

The learner should be able to reproduce this map.

Solved Or Theorem-Backed

• Static near-square 2D syndrome extraction for theorem-level Quantum Tanner families has depth \(\Omega(\sqrt n)\) in linear space.
• The parameter route uses \(k,d=\Theta(n)\) and is presentation-invariant.
• The separator route extends the grid intuition to low-separator hardware in the appropriate stabilizer-measurement setting.
• Stabilizer cut rank is the intrinsic cut demand object.
• Submodular cut congestion lower-bounds SWAP-only service depth in the stated model.

Useful But Presentation-Sensitive

• Quantum Tanner chosen local-generator presentations have a strong explicit expansion stack.
• The chosen-presentation parity-Tanner theorem is close to the intuitive expander-versus-grid mechanism.
• This route remains valuable for finding intrinsic cut-rank witnesses, but by itself it is not a generator-invariant CD theorem.

Current Open Gaps

• deterministic explicit component-code packaging, depending on how strict the target family statement is;
• linear balanced cut rank for Quantum Tanner parity-check matrices;
• dense original-matroid concentration, especially dense tangle breadth;
• local quotient-image accumulation with survival and overlap losses controlled;
• compiler semantics beyond submodular cut congestion, especially whether auxiliary hidden-variable representations can mean routing.

Boundary Or Escape Awareness

The learner should know why these are not contradictions:

• thin-planar-connectivity-escape.md
• bilayer-locc-2d-implementation-boundary.md
• hierarchical-memories-2d-threshold-escape.md
• edge-disjoint-path-teleportation-escape.md

They add resources or change the model. They do not refute the direct static-grid barrier.

Alignment Diagnostic

Answer without looking.

1. State the minimal static 2D result and give the one-line parameter derivation.
2. Explain why the remaining frontier is not the static theorem itself.
3. Define \(\chi_L(\mathcal S)\) and give the rank formula.
4. Explain why token crossing is false but cut-edge service remains useful.
5. Define \(T_{\mathrm{sub}}\) and \(CD_{\mathrm{sub}}\).
6. Explain why ordinary graph cuts fail to represent stabilizer cut rank.
7. Explain the fundamental graph cut-rank positive result and why it still is not routing.
8. State dense tangle breadth as a sufficient intrinsic target.
9. Explain local quotient-image accumulation and the two losses.
10. Explain why Route D is now a semantic frontier.

Passing standard: the learner can answer at least 8 of 10 cleanly and can identify the missing premise in any answer they cannot complete.

Use the course assessment rubric for model answers, common mistakes, source evidence, and scoring. Do not grade from memory when the rubric is available.

Research Handoff

After alignment, the next research work should choose one target rather than widening the whole graph.

Target A: Static Manuscript Packaging

Use when the goal is to write a clean paper section now.

Primary nodes:

• static-2d-separator-cut-rank-manuscript-package.md
• quantum-tanner-good-family-presentation-invariant-2d-barrier.md
• weighted-separator-function-to-syndrome-depth.md

Expected output: theorem statement, proof sketch, model assumptions, and boundary resources.

Target B: Intrinsic Quantum Tanner Cut Rank

Use when the goal is mathematical progress toward presentation-invariant CD.

Primary nodes:

• quantum-tanner-needs-balanced-local-block-rank-accumulation.md
• local-quotient-image-span-controls-rank-accumulation.md
• dense-tangle-breadth-is-the-canonical-remaining-intrinsic-target.md

Expected output: one theorem-sized missing invariant, not another broad survey.

Target C: Compiler Semantics

Use when the goal is to clarify CD(T_n,G).

Primary nodes:

• stabilizer-cut-rank-defines-canonical-submodular-cd-object.md
• submodular-cut-congestion-lower-bounds-swap-only-compiler-depth.md
• route-d-semantic-separation-now-dominates-the-remaining-cd-frontier.md

Expected output: a precise semantics statement, or an impossibility/boundary theorem for one proposed semantics.

What This Does And Does Not Prove

Completing this lesson proves the learner is oriented enough to resume research work with Codex. It does not prove any new theorem.

The correct next state is:

• learner aligned: only after diagnostic pass;
• research frontier aligned: already represented by the graph and this course;
• proof frontier complete: not yet.

Next-Step Handoff

When the learner passes the diagnostic, update learner-progress.md and alignment-dashboard.md with the completion date, score, missed items, and Target A, B, or C for the next research session.