integrable-lattice-gap-map

Project-specific gap-map construction for integrable-lattice. Use when Codex needs to build model × boundary × parameter × operation × statement maps that separate known cells, probably known cells, u

SKILL.md

GitHub

Integrable Lattice Gap Map

Goal

Build a map of solved and missing cells. The map is the bridge between literature extraction and unresolved statement generation.

Required Context

Read:

  • CLAUDE.md / AGENTS.md (mandatory before starting) — the repository's top-priority conventions: proof form (structured text under structured-latex/; never author new Typst), naming rules, verification commands, the definition of "done", and "文書・定理を番号や記号で管理しない" (never manage documents, theorems, or classifications by number or symbol — call them by name).
  • integrable-lattice/README.md and integrable-lattice/docs/tasks/auto-loop-runbook.md — project goal and the auto-loop procedure.
  • docs/discussion/対数順序群上の統計力学/ and docs/discussion/可算性の効用/ — primary sources for the countable core (ℕ⊂ℚ⊂Λ⊂ℚ̄) and for treating ℝ/ℂ as a convenience for applications; the countable/ℝ boundary is the decidability boundary.
  • docs/research/R-Lambda-duality/ — the ℝ-side / Λ-side duality and what counts as a closed form on the countable side.
  • docs/research/場の量子論の数学的定式化/ — which layers of existing physics close algebraically and which escape to ℝ.
  • integrable-lattice/docs/schemas.md
  • current classified fragments
  • relevant seed axes in integrable-lattice/inputs/seeds/axes.md

Workflow

  1. Choose a bounded map scope: model family, operation type, or paper cluster.
  2. Define the cell key (Λ ladder + four axes; NOT the literature operation-type taxonomy):
model × direction(A–F) × target_quantity × home × complexity × solvability × decidable × formal_verifiable

where home ∈ {ℤ[x], Λ, ℚ̄, ℝ-escape}, complexity ∈ {poly, #P, unknown}, solvability ∈ {closed, none, unknown}, decidable ∈ {yes, schanuel, no}, formal_verifiable ∈ {yes, partial, no}. Vocabulary: inputs/seeds/lambda-statement-program.md.

  1. Fill cells from classified fragments.
  2. Assign cell status:
    • known: directly evidenced.
    • probably_known: likely covered by a cited/general result but not yet verified.
    • unknown: no evidence found in the scoped corpus.
    • impossible: definition or compatibility appears to fail.
    • needs_review: classification or literature coverage is weak.
  3. For each unknown cell, record the nearest known anchor.
  4. Save curated maps under integrable-lattice/outputs/maps/.

Output Shape

cell_id:
model:
direction:            # A–F (lambda-statement-program)
target_quantity:      # 例: Fisher zeros, transfer matrix T(x), Massieu Φ_N
home:                 # ℤ[x] / Λ / ℚ̄ / ℝ-escape
complexity:           # poly / #P / unknown
solvability:          # closed / none / unknown
decidable:            # yes / schanuel / no
formal_verifiable:    # yes / partial / no
status:               # known / probably_known / unknown / impossible / needs_review
known_anchors:
missing_generalization:
coverage_notes:
review_notes:

Guardrails

  • Do not equate "not found" with "open"; use unknown until verification.
  • Keep the map scope explicit, because a gap depends on corpus coverage.
  • Prefer small reliable maps over broad maps with hidden uncertainty.