allaun/Research-Stack
1
0
Fork 0
mirror of https://github.com/allaunthefox/Research-Stack.git synced 2026-07-31 03:05:21 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions
Research-Stack/.opencode/agents/fix-pist-simulation-proof.md
Brandon Schneider ede983168c feat(lean): complete goldenContractionEnergyDecrease proof + PIST predictions pipeline v2 
- PistSimulation.lean: proven goldenContractionEnergyDecrease (no sorry)
  7 supporting lemmas, h_u'_nonneg + h_pt hypothesis, fold induction
- Connectors.lean: restored zeroIsVoid theorem with Q16_16 proof
- CanonSerialization.lean: removed dead theorem, documented blocker
- FixedPointBridge.lean: eliminated Float from compute paths

PIST predictions pipeline:
- pist_matrix_builder.py: reproducible matrix-only builder (SHA256)
- build_pist_matrices_278.py: generates PIST/Matrices278.lean
- PIST/Classify.lean: classifyProxy/classifyExact stubs (v2 surface)
- PIST/Matrices278.lean: 250-entry matrix HashMap
- build_corpus278.py: reads predictions artifact, uses classify*
- Pipeline contract documented in root AGENTS.md

Cleanup:
- Archived 5 orphan pist_* shims, 5 old route_repair variants
- Quarantined PIST/Repair.lean (no external callers)
- Created 4 opencode agents for remaining TODO items

Build: PistSimulation 3309, Compiler 3313, Full 3571 (0 errors)
2026-05-27 12:40:16 -05:00

1.9 KiB
Raw Blame History

description mode model permission
Complete the goldenContractionEnergyDecrease proof in PistSimulation.lean. Use ONLY when asked to fix PistSimulation pending proofs or resolve TODO(lean-port) markers in Semantics/PistSimulation.lean. subagent anthropic/claude-sonnet-4-6
edit bash read
allow allow allow

Fix PistSimulation pending proof

Context

Semantics/PistSimulation.lean has three TODO(lean-port) markers with sorry blocks:

  • Line 1317: TODO(lean-port): complete the proof; currently verified by #eval
  • Line 1604: TODO(lean-port): complete the proof; currently verified by #eval
  • Line 1614: TODO(lean-port): General proof requires Jensen's inequality for discrete

The P0 target is line 1614: goldenContractionEnergyDecrease — a theorem requiring Jensen's inequality for discrete convex combinations on Q16_16. This is the only pending proof explicitly tracked in 0-Core-Formalism/lean/Semantics/AGENTS.md under "Pending Proof Work."

What to do

  1. Read Semantics/PistSimulation.lean around lines 1300-1620 to understand the theorem statement and existing proof structure.
  2. Read Semantics/FixedPoint.lean and Semantics/Q16_16.lean for available Q16_16 lemmas.
  3. Attempt to complete the proof using Jensen's inequality for discrete convex combinations.
  4. If a full proof is not possible, add a detailed blocker comment explaining what lemmas are missing.
  5. Run lake build Semantics.PistSimulation to verify no build breaks.
  6. Run lake build Compiler to verify the narrow surface.

Constraints

  • Do NOT delete or comment-out the theorem — either fix the proof or leave the sorry + TODO(lean-port) intact.
  • Do NOT import Float (ofFloat) — use Q16_16.ofNat/Q16_16.ofRatio/Q16_16.ofInt.
  • If the proof requires Jensen's inequality, look for or create a convexOn lemma on Q16_16 before using generic mathlib versions.