fix(lean): resolve proofs in TopologicalBraidAdapter

- Unfolded decideGate and used dsimp only to eliminate local let/have bindings in stableSignal_implies_coherent and noCfd_avoids_continuum.
- Used split_ifs to automatically resolve contradictory branches and extracted correct boolean/decidable subgoals.
- Unfolded tensegrityCoherent and applied decide_eq_true_iff.mp to resolve the tensegrity_implies_braid_coherence theorem.
- Updated 0-Core-Formalism/lean/Semantics/AGENTS.md to reflect the completed tasks.

Build: 8332 jobs, 0 errors (lake build)
This commit is contained in:
allaun 2026-06-18 23:57:29 -05:00
parent 4663553555
commit 21032cacd7
2 changed files with 14 additions and 11 deletions

View file

@ -526,15 +526,14 @@ Erdős 30 Improvement: ε ≥ 1/2 → ε ≥ 1/4 UNLOCKED
| `decode_encode_roundtrip` | `subagent_codec` | Medium | Completed | Re-encoding a decoded frame yields matching header fields when chirality/n are consistent. | | `decode_encode_roundtrip` | `subagent_codec` | Medium | Completed | Re-encoding a decoded frame yields matching header fields when chirality/n are consistent. |
| `qr_encode_decode_roundtrip` | `subagent_codec` | Medium | Completed | QR field passes through encode/decode unchanged (proven and resolved). | | `qr_encode_decode_roundtrip` | `subagent_codec` | Medium | Completed | QR field passes through encode/decode unchanged (proven and resolved). |
| `solveEnergyExponential` | `subagent_arithmetic` | Low | Completed | Proved using Q16_16.mul_mono_left and one_mul (E_solve ≥ 2^depth). | | `solveEnergyExponential` | `subagent_arithmetic` | Low | Completed | Proved using Q16_16.mul_mono_left and one_mul (E_solve ≥ 2^depth). |
### Active Agent Assignments (current cycle) ### Active Agent Assignments (current cycle)
| Task | File | Assigned Agent | Priority | Status | Notes | | Task | File | Assigned Agent | Priority | Status | Notes |
|------|------|----------------|----------|--------|-------| |------|------|----------------|----------|--------|-------|
| `convergencePreservesScore` and related | `HybridTSMPISTTorus.lean:219` | `subagent_revive` | Low | Assigned | 1 sorry at line 219. Quarantined module with 2 errors. Revive for build surface inclusion after proof resolution. | | `convergencePreservesScore` and related | `HybridTSMPISTTorus.lean:219` | `subagent_revive` | Low | Assigned | 1 sorry at line 219. Quarantined module with 2 errors. Revive for build surface inclusion after proof resolution. |
| `TopologicalBraidAdapter` proofs | `Semantics/TopologicalBraidAdapter.lean` | `subagent_revive` | Medium | Active | 3 sorries in new compiler bridge adapter module. | | `TopologicalBraidAdapter` proofs | `Semantics/TopologicalBraidAdapter.lean` | `subagent_revive` | Medium | Completed | All 3 sorries resolved (stableSignal_implies_coherent, noCfd_avoids_continuum, tensegrity_implies_braid_coherence). |
**Progress tracking**: The active build surface compiled successfully. The 2 quarantined/TODO sites above are assigned to specialized agents for the next cycle. **Progress tracking**: The active build surface compiled successfully with TopologicalBraidAdapter fully verified. The quarantined/TODO site above is assigned to specialized agents for the next cycle.
### Q16InverseProof — Exact inverse proof (All Closed) ### Q16InverseProof — Exact inverse proof (All Closed)

View file

@ -154,17 +154,21 @@ theorem stableSignal_implies_coherent (p : HardProblemState) (s : BraidSample) :
decideGate p s = GateDecision.stableSignal → decideGate p s = GateDecision.stableSignal →
(colorRope p s).coherent = true := by (colorRope p s).coherent = true := by
intro h intro h
simp only [decideGate] at h unfold decideGate at h
-- TACTIC_GAP: unfold nested if-then-else branches; stableSignal requires .coherent ∧ ... dsimp only at h
sorry split_ifs at h with h1 h2 h3
simp only [Bool.and_eq_true, decide_eq_true_iff] at h3
rcases h3 with ⟨⟨⟨⟨h_coh, _⟩, _⟩, _⟩, _⟩
exact h_coh
theorem noCfd_avoids_continuum (p : HardProblemState) (s : BraidSample) : theorem noCfd_avoids_continuum (p : HardProblemState) (s : BraidSample) :
decideGate p s = GateDecision.noCfdRoute → decideGate p s = GateDecision.noCfdRoute →
shouldRouteNoCfd p = true := by shouldRouteNoCfd p = true := by
intro h intro h
simp only [decideGate] at h unfold decideGate at h
-- TACTIC_GAP: noCfdRoute is the first branch: if shouldRouteNoCfd p then noCfdRoute dsimp only at h
sorry split_ifs at h with h1
exact h1
-- ============================================================ -- ============================================================
-- §8 Yang-Baxter coherence -- §8 Yang-Baxter coherence
@ -181,8 +185,8 @@ theorem tensegrity_implies_braid_coherence (p : HardProblemState) (s : BraidSamp
totalTensegrityStrain p s defaultTensegrity ≤ totalTensegrityStrain p s defaultTensegrity ≤
avgQ0 (satQ0 p.residualRisk) q0Max := by avgQ0 (satQ0 p.residualRisk) q0Max := by
intro h intro h
-- TACTIC_GAP: tensegrityCoherent IS this bound; unfold it unfold tensegrityCoherent at h
sorry exact decide_eq_true_iff.mp h
-- ============================================================ -- ============================================================
-- §9 Full pipeline + eval witnesses -- §9 Full pipeline + eval witnesses