{"payload":{"schema_version":"research-record-v0","publication":{"version":1,"sha256":"4719ddb168910e03f9b109fe6c84c80ce44a3d49275a7544e44b3d3af9f96753","published_at":"2026-09-30T20:13:42.324330+00:00","reason":"Initial checked pilot publication; source attribution, rights, wording and coverage reviewed by OpenMath staff.","withdrawn":false,"draft":{"schema_version":"research-record-v0","problem":{"problem_id":"problem-prime-infinitude","slug":"prime-infinitude","title":"Why are there infinitely many primes?","question":"For every natural number n, does there exist a prime p with n < p?","scope":"Natural numbers and ordinary primality. This strict formulation follows by applying the pinned at-or-above theorem at n + 1.","aliases":[],"fields":["Number theory"],"msc":["11A41"],"topics":["primes","Euclid","factorial","bounds"],"background":"undergraduate","scale":"known theorem","depth":"maintained","source_entry_ids":["prime-infinitude:entry:0:v1","prime-infinitude:entry:1:v1"],"status_report_ids":["prime-infinitude:report:0:v1","prime-infinitude:report:1:v1"],"editorial":{"collection_id":"elementary-primes","collection_title":"Elementary prime results","reviewer":"OpenMath staff","state":"known","scope":"Wording, natural-number assumptions and pinned source correspondence checked by staff. Independent mathematical review remains pending.","rationale":"Established result supported by the cited note and pinned mathlib statement. The local exercise tests exact Lean inputs, not novelty.","decided_on":"2026-10-01","review_due_on":"2027-03-30","report_ids":["prime-infinitude:report:0:v1","prime-infinitude:report:1:v1"],"independent_mathematical_review":"pending"},"literature":[{"title":"OpenMath source note","url":"https://openmath.dev/sources/prime-note","note":"Original exposition under CC BY 4.0; exact spans and hashes retained."}],"formalizations":[{"title":"Pinned witness theorem","url":"https://github.com/leanprover-community/mathlib4/blob/32d24245c7a12ded17325299fd41d412022cd3fe/Mathlib/Data/Nat/Prime/Infinite.lean#L31-L42","note":"Source-level staff correspondence. A passing Run does not independently confirm informal/formal alignment.","declaration":"Nat.exists_infinite_primes","source_commit":"32d24245c7a12ded17325299fd41d412022cd3fe","alignment":"staff_linked","checked_on":"2026-10-01"},{"title":"Disputed direct strict-bound mapping","url":"https://github.com/leanprover-community/mathlib4/blob/32d24245c7a12ded17325299fd41d412022cd3fe/Mathlib/Data/Nat/Prime/Infinite.lean#L31-L42","note":"Treating the returned n ≤ p as a direct proof of n < p is invalid. The recorded broken input exposes this mismatch; applying the theorem at n + 1 repairs the route.","declaration":"Nat.exists_infinite_primes → n < p without shifting n","source_commit":"32d24245c7a12ded17325299fd41d412022cd3fe","alignment":"disputed","checked_on":"2026-10-01"}],"related":[{"slug":"prime-at-or-above-bound","title":"A prime at or above any bound","relation":"prerequisite","note":"Compare non-strict and strict quantifier bounds; retain separate source correspondence."},{"slug":"strict-prime-bound","title":"A prime strictly above any bound","relation":"variant","note":"Compare non-strict and strict quantifier bounds; retain separate source correspondence."}],"tasks":[{"slug":"strict-prime-bound","title":"Formalize a prime strictly above every bound","goal":"Check the shifted-bound proof and inspect the failed unshifted route with the approved Lean recipe."}],"insights":[{"id":"insight-factorial-plus-one","title":"A prime divisor of factorial plus one","summary":"The key move is not to find the next prime directly. Construct n! + 1, take one of its prime factors, and notice that any prime at most n would divide both n! and n! + 1. That impossible overlap supplies a prime beyond the alleged bound.","review":"pending"}],"coverage_gaps":["No exhaustive literature or source-list coverage.","Independent mathematical assessment has not been performed."],"checked_on":"2026-10-01"},"sources":[{"id":"openmath-prime-note@a640f3adfa536da0","source_id":"openmath-prime-note","title":"OpenMath · prime note","owner":"OpenMath staff","url":"https://openmath.dev/sources/prime-note","subject_scope":"Elementary-number-theory reference prose","revision":"a640f3adfa536da0","content_sha256":"a640f3adfa536da0fb792b52610d9d9d56540fbeb430df766667a4ff65b8b49f","update_method":"Manual checked import; new observations require staff preview and publication","identifier_policy":"Canonical source URL plus explicit item/declaration locator; no fuzzy identity merge","observed_on":"2026-10-01","source_updated_on":"2026-09-26","rights":"full-text","license":"CC-BY-4.0","terms_url":"https://creativecommons.org/licenses/by/4.0/","attribution":"OpenMath staff","rights_note":"Licensed source links and exact source spans; attribution retained.","check_interval_days":180},{"id":"mathlib-prime-infinite@32d24245c7a12ded17325299fd41d412022cd3fe","source_id":"mathlib-prime-infinite","title":"mathlib · infinitude of primes","owner":"mathlib contributors","url":"https://github.com/leanprover-community/mathlib4/blob/32d24245c7a12ded17325299fd41d412022cd3fe/Mathlib/Data/Nat/Prime/Infinite.lean","subject_scope":"Natural-number prime statements","revision":"32d24245c7a12ded17325299fd41d412022cd3fe","content_sha256":"4d7a663d097dc291c3c3e55d097c7c5d0adfc7cb215c4700917f09c0acfbd527","update_method":"Manual checked import; new observations require staff preview and publication","identifier_policy":"Canonical source URL plus explicit item/declaration locator; no fuzzy identity merge","observed_on":"2026-10-01","source_updated_on":null,"rights":"licensed-excerpt","license":"Apache-2.0","terms_url":"https://github.com/leanprover-community/mathlib4/blob/32d24245c7a12ded17325299fd41d412022cd3fe/LICENSE","attribution":"mathlib contributors","rights_note":"Licensed source links and exact source spans; attribution retained.","check_interval_days":180}],"entries":[{"id":"prime-infinitude:entry:0:v1","source_version_id":"openmath-prime-note@a640f3adfa536da0","item_id":"notes/primes.md lines 9–15, 21–29","url":"https://openmath.dev/sources/prime-note","wording":"For every natural number n, does there exist a prime p with n < p?","wording_kind":"paraphrase","locator":"notes/primes.md lines 9–15, 21–29","supersedes":null},{"id":"prime-infinitude:entry:1:v1","source_version_id":"mathlib-prime-infinite@32d24245c7a12ded17325299fd41d412022cd3fe","item_id":"Mathlib/Data/Nat/Prime/Infinite.lean lines 31–42","url":"https://github.com/leanprover-community/mathlib4/blob/32d24245c7a12ded17325299fd41d412022cd3fe/Mathlib/Data/Nat/Prime/Infinite.lean","wording":"For every natural number n, does there exist a prime p with n < p?","wording_kind":"paraphrase","locator":"Mathlib/Data/Nat/Prime/Infinite.lean lines 31–42","supersedes":null}],"reports":[{"id":"prime-infinitude:report:0:v1","entry_id":"prime-infinitude:entry:0:v1","state":"resolved","source_label":"Known theorem in authored reference note","scope":"The cited source item and version only; this is not an independent OpenMath assessment.","source_date":null,"observed_on":"2026-10-01","evidence_url":"https://openmath.dev/sources/prime-note","supersedes":null},{"id":"prime-infinitude:report:1:v1","entry_id":"prime-infinitude:entry:1:v1","state":"resolved","source_label":"Proved declaration Nat.exists_infinite_primes","scope":"The cited source item and version only; this is not an independent OpenMath assessment.","source_date":null,"observed_on":"2026-10-01","evidence_url":"https://github.com/leanprover-community/mathlib4/blob/32d24245c7a12ded17325299fd41d412022cd3fe/Mathlib/Data/Nat/Prime/Infinite.lean","supersedes":null}]},"status":{"state":"resolved","label":"Reported resolved","extent":"unspecified","summary":"Resolution scope has not been assessed in this publication.","basis":"editorial","attributed_to":"Elementary prime results · OpenMath staff","as_of":"2026-10-01","progress_label":null,"progress_claim_ids":[],"remaining":null,"views":["resolved"]}},"data_mode":"published catalog snapshot; historical Phase 0 checks only","context_packs":[{"schemaVersion":"openmath.dev.context-pack.phase0.2","fixtureOnly":true,"id":"context-prime-strict-v1","version":1,"previousContextPackId":null,"task":{"id":"task-strict-bound","slug":"strict-prime-bound","title":"Turn the existing bound into a strict one","objectiveId":"objective-strict-prime-witness","targetClaimId":"claim-prime-strictly-above","contextPackId":"context-prime-strict-v1","deliverable":"A Lean declaration for ∀ n, ∃ p, n < p ∧ Nat.Prime p, plus a short source-grounded explanation.","acceptance":["Typechecks under the pinned Lean/mathlib toolchain.","Uses the existing theorem without claiming mathematical novelty.","Explains why applying the theorem at n is too weak and n + 1 succeeds.","Keeps source alignment, machine checking, and human review as separate states."],"status":"fixture-exercise-not-open-problem","version":1,"nextContextPackId":null},"objective":{"id":"objective-strict-prime-witness","title":"Explain and check the strict-bound corollary","kind":"formalization-and-explanation-exercise","novelty":"none-claimed","problemId":"problem-prime-infinitude","version":1},"selectionRationale":"Pinned sources, distinct formulations, proof architecture, and the known off-by-one failure. The successful follow-up is deliberately excluded until the next context version.","coverage":{"scope":"One OpenMath-authored note and three pinned mathlib files about natural-number primes; no literature-wide search or completeness claim.","complete":false,"extraction":"manual-reference-fixture","review":"internal-fixture-only","indexedSourceIds":["source-note","source-prime-defs","source-prime-infinite","source-primefin"],"asOf":"2026-09-26","rights":"Only the OpenMath note is mirrored; mathlib files are linked by exact commit and checksum under Apache-2.0."},"upstream":{"repository":"https://github.com/leanprover-community/mathlib4","commit":"32d24245c7a12ded17325299fd41d412022cd3fe","toolchain":"leanprover/lean4:v4.27.0-rc1","license":"Apache-2.0","licenseUrl":"https://github.com/leanprover-community/mathlib4/blob/32d24245c7a12ded17325299fd41d412022cd3fe/LICENSE"},"sources":[{"id":"source-note","title":"Prime numbers do not run out","kind":"openmath-note","path":"notes/primes.md","sha256":"a640f3adfa536da0fb792b52610d9d9d56540fbeb430df766667a4ff65b8b49f","license":"CC-BY-4.0","attribution":"OpenMath Phase 0 contributors, original reference prose","licenseUrl":"https://creativecommons.org/licenses/by/4.0/"},{"id":"source-prime-defs","title":"Mathlib: natural-number prime definitions","kind":"lean-source","path":"Mathlib/Data/Nat/Prime/Defs.lean","url":"https://github.com/leanprover-community/mathlib4/blob/32d24245c7a12ded17325299fd41d412022cd3fe/Mathlib/Data/Nat/Prime/Defs.lean","sha256":"ed1f1384e13ab35eb5bf0b4d0dba1572dcb927998557e9b3f6565cda55bc3e47","license":"Apache-2.0","attribution":"mathlib contributors; see pinned source header and repository history"},{"id":"source-prime-infinite","title":"Mathlib: infinitude of primes","kind":"lean-source","path":"Mathlib/Data/Nat/Prime/Infinite.lean","url":"https://github.com/leanprover-community/mathlib4/blob/32d24245c7a12ded17325299fd41d412022cd3fe/Mathlib/Data/Nat/Prime/Infinite.lean","sha256":"4d7a663d097dc291c3c3e55d097c7c5d0adfc7cb215c4700917f09c0acfbd527","license":"Apache-2.0","attribution":"mathlib contributors; source header credits Leonardo de Moura, Jeremy Avigad, Mario Carneiro"},{"id":"source-primefin","title":"Mathlib: infinite set of primes","kind":"lean-source","path":"Mathlib/Data/Nat/PrimeFin.lean","url":"https://github.com/leanprover-community/mathlib4/blob/32d24245c7a12ded17325299fd41d412022cd3fe/Mathlib/Data/Nat/PrimeFin.lean","sha256":"6bb17dd4f324b78804bdbd3d449df5cb77758ef096d13fae8d7360f58e94a8ea","license":"Apache-2.0","attribution":"mathlib contributors; see pinned source header and repository history"}],"spans":[{"id":"span-note-definition","sourceId":"source-note","startLine":5,"endLine":7,"label":"Informal definition"},{"id":"span-note-bound","sourceId":"source-note","startLine":9,"endLine":15,"label":"Theorem wording and proof idea"},{"id":"span-note-related","sourceId":"source-note","startLine":17,"endLine":19,"label":"Several possible infinitude formulations"},{"id":"span-note-task","sourceId":"source-note","startLine":21,"endLine":25,"label":"Strict-bound task and known failure"},{"id":"span-prime-def","sourceId":"source-prime-defs","startLine":38,"endLine":43,"label":"Nat.Prime definition","anchorText":"def Prime"},{"id":"span-bound-theorem","sourceId":"source-prime-infinite","startLine":31,"endLine":42,"label":"Nat.exists_infinite_primes and factorial proof","anchorText":"theorem exists_infinite_primes"},{"id":"span-unbounded-theorem","sourceId":"source-prime-infinite","startLine":44,"endLine":49,"label":"Unbounded-set formulation","anchorText":"theorem not_bddAbove_setOf_prime"},{"id":"span-infinite-theorem","sourceId":"source-primefin","startLine":26,"endLine":28,"label":"Infinite-set formulation","anchorText":"theorem infinite_setOf_prime"}],"claims":[{"id":"claim-prime-above-bound","slug":"prime-above-bound","title":"A prime at or above every bound","statement":"For every natural number n, some prime p satisfies n ≤ p.","kind":"known-theorem","sourceSpanIds":["span-note-bound","span-bound-theorem"],"representationId":"representation-bound","alignmentStatus":"staff-linked-not-independently-reviewed","reviewStatus":"pending-independent-review","argumentId":"argument-euclid-factorial","version":1,"contentSha256":"07513bbc687f0763ac96428359b1f202f1e982708574a25d0d70c1a0e8c67163"},{"id":"claim-primes-unbounded","slug":"primes-unbounded","title":"The set of primes is unbounded","statement":"There is no upper bound on natural-number primes.","kind":"known-theorem","sourceSpanIds":["span-note-related","span-unbounded-theorem"],"representationId":"representation-unbounded","alignmentStatus":"candidate-from-broad-wording","reviewStatus":"pending-independent-review","argumentId":"argument-unbounded","version":1,"contentSha256":"9325f021cab0bef2e52d1ec727153d193bc8a83526cc19c0ec49dc9f97dd82fd"},{"id":"claim-primes-infinite","slug":"primes-infinite","title":"There are infinitely many primes","statement":"The set of natural-number primes is infinite.","kind":"known-theorem","sourceSpanIds":["span-note-related","span-infinite-theorem"],"representationId":"representation-infinite","alignmentStatus":"candidate-from-broad-wording","reviewStatus":"pending-independent-review","argumentId":"argument-infinite","version":1,"contentSha256":"2a73c4bb2d2948a485a67b923febe95ccefe6ca840ca5a6738faf7a8404537ac"},{"id":"claim-prime-strictly-above","slug":"prime-strictly-above","title":"A prime strictly above every bound","statement":"For every natural number n, some prime p satisfies n < p.","kind":"derived-exercise","sourceSpanIds":["span-note-task"],"representationId":"representation-strict","alignmentStatus":"staff-linked-not-independently-reviewed","reviewStatus":"pending-independent-review","argumentId":"argument-strict","version":1,"contentSha256":"6d0128a689908ca169bc1519198182a42354e12e5c2254c38197333ee3a58fd5"}],"representations":[{"id":"representation-bound","targetId":"claim-prime-above-bound","formalSystem":"Lean 4 / mathlib","declaration":"Nat.exists_infinite_primes","expression":"∀ n : ℕ, ∃ p, n ≤ p ∧ Nat.Prime p","sourceSpanId":"span-bound-theorem","executionStatus":"upstream-source-pinned","version":1},{"id":"representation-unbounded","targetId":"claim-primes-unbounded","formalSystem":"Lean 4 / mathlib","declaration":"Nat.not_bddAbove_setOf_prime","expression":"¬BddAbove { p | Nat.Prime p }","sourceSpanId":"span-unbounded-theorem","executionStatus":"upstream-source-pinned","version":1},{"id":"representation-infinite","targetId":"claim-primes-infinite","formalSystem":"Lean 4 / mathlib","declaration":"Nat.infinite_setOf_prime","expression":"{ p | Nat.Prime p }.Infinite","sourceSpanId":"span-infinite-theorem","executionStatus":"upstream-source-pinned","version":1},{"id":"representation-strict","targetId":"claim-prime-strictly-above","formalSystem":"Lean 4 / mathlib","declaration":"OpenMath.Phase0.exists_prime_strictly_above","expression":"∀ n : ℕ, ∃ p, n < p ∧ Nat.Prime p","sourceSpanId":"span-note-task","executionStatus":"locally-typechecked-fixture","version":1}],"arguments":[{"id":"argument-euclid-factorial","claimId":"claim-prime-above-bound","title":"A prime factor of n! + 1","steps":["Choose a prime factor p of n! + 1.","If p ≤ n, then p divides n!.","It would then divide the difference (n! + 1) - n! = 1, a contradiction.","Therefore p ≥ n."],"sourceSpanIds":["span-note-bound","span-bound-theorem"],"reviewStatus":"pending-independent-review","version":1},{"id":"argument-strict","claimId":"claim-prime-strictly-above","title":"Shift the bound by one","steps":["Ask the existing theorem for a prime p ≥ n + 1.","Conclude p > n."],"sourceSpanIds":["span-note-task"],"reviewStatus":"pending-independent-review","version":1}],"insights":[{"id":"insight-factorial-plus-one","title":"The extra one breaks every small prime divisor","body":"The key move is not to find the next prime directly. Construct n! + 1, take one of its prime factors, and notice that any prime at most n would divide both n! and n! + 1. That impossible overlap supplies a prime beyond the alleged bound.","limitation":"This explains the pinned proof idea; it is not an independent review of the informal-to-formal alignment or a claim that the displayed witness is the least possible prime.","sourceSpanIds":["span-note-bound","span-bound-theorem"],"reviewStatus":"pending-independent-review","version":1,"contentSha256":"3d9f978e724ce193135a1d7c3964a123129721d7608636efbc24c6319b7ba7cb"}],"knownRuns":[{"id":"run-strict-broken","title":"Off-by-one proof attempt fails","status":"typecheck-failed","fixtureOnly":true,"observedOn":"2026-09-26","inputPath":"lean/PrimeStrictBroken.lean","inputSha256":"09f6c5028086b2acee711755f2905570bc432194944846dea2556fb6e62e49ab","toolchain":"leanprover/lean4:v4.27.0-rc1","mathlibCommit":"32d24245c7a12ded17325299fd41d412022cd3fe","launcher":"lake env lean in a local project with the pinned mathlib revision","exitCode":1,"diagnostic":"hbound has type n ≤ p but is expected to have type n < p","claimId":"claim-prime-strictly-above","trustScope":"Local failure observation; it refutes this attempt, not the mathematical statement.","artifactId":"artifact-strict-broken","actorId":"actor-phase0-curator"}],"knownAttempts":[{"id":"attempt-strict-broken","version":1,"actorId":"actor-phase0-curator","taskId":"task-strict-bound","contextPackId":"context-prime-strict-v1","runIds":["run-strict-broken"],"outcome":"failed","summary":"The non-strict witness gives n ≤ p, which cannot establish n < p.","fixtureOnly":true}],"contentSha256":"121e539cc737c85597eeb4a1ef31bd1c11aa0f986f9375c11fe513b640f029b6"},{"schemaVersion":"openmath.dev.context-pack.phase0.2","fixtureOnly":true,"id":"context-prime-strict-v2","version":2,"previousContextPackId":"context-prime-strict-v1","task":{"id":"task-strict-bound","slug":"strict-prime-bound","title":"Turn the existing bound into a strict one","objectiveId":"objective-strict-prime-witness","targetClaimId":"claim-prime-strictly-above","contextPackId":"context-prime-strict-v1","deliverable":"A Lean declaration for ∀ n, ∃ p, n < p ∧ Nat.Prime p, plus a short source-grounded explanation.","acceptance":["Typechecks under the pinned Lean/mathlib toolchain.","Uses the existing theorem without claiming mathematical novelty.","Explains why applying the theorem at n is too weak and n + 1 succeeds.","Keeps source alignment, machine checking, and human review as separate states."],"status":"fixture-exercise-not-open-problem","version":1,"nextContextPackId":"context-prime-strict-v2"},"objective":{"id":"objective-strict-prime-witness","title":"Explain and check the strict-bound corollary","kind":"formalization-and-explanation-exercise","novelty":"none-claimed","problemId":"problem-prime-infinitude","version":1},"selectionRationale":"Refresh after the seeded contributor records the strict-bound proof. Preserve the earlier failure, cite the successful artifact, and keep independent review pending.","coverage":{"scope":"One OpenMath-authored note and three pinned mathlib files about natural-number primes; no literature-wide search or completeness claim.","complete":false,"extraction":"manual-reference-fixture","review":"internal-fixture-only","indexedSourceIds":["source-note","source-prime-defs","source-prime-infinite","source-primefin"],"asOf":"2026-09-26","rights":"Only the OpenMath note is mirrored; mathlib files are linked by exact commit and checksum under Apache-2.0."},"upstream":{"repository":"https://github.com/leanprover-community/mathlib4","commit":"32d24245c7a12ded17325299fd41d412022cd3fe","toolchain":"leanprover/lean4:v4.27.0-rc1","license":"Apache-2.0","licenseUrl":"https://github.com/leanprover-community/mathlib4/blob/32d24245c7a12ded17325299fd41d412022cd3fe/LICENSE"},"sources":[{"id":"source-note","title":"Prime numbers do not run out","kind":"openmath-note","path":"notes/primes.md","sha256":"a640f3adfa536da0fb792b52610d9d9d56540fbeb430df766667a4ff65b8b49f","license":"CC-BY-4.0","attribution":"OpenMath Phase 0 contributors, original reference prose","licenseUrl":"https://creativecommons.org/licenses/by/4.0/"},{"id":"source-prime-defs","title":"Mathlib: natural-number prime definitions","kind":"lean-source","path":"Mathlib/Data/Nat/Prime/Defs.lean","url":"https://github.com/leanprover-community/mathlib4/blob/32d24245c7a12ded17325299fd41d412022cd3fe/Mathlib/Data/Nat/Prime/Defs.lean","sha256":"ed1f1384e13ab35eb5bf0b4d0dba1572dcb927998557e9b3f6565cda55bc3e47","license":"Apache-2.0","attribution":"mathlib contributors; see pinned source header and repository history"},{"id":"source-prime-infinite","title":"Mathlib: infinitude of primes","kind":"lean-source","path":"Mathlib/Data/Nat/Prime/Infinite.lean","url":"https://github.com/leanprover-community/mathlib4/blob/32d24245c7a12ded17325299fd41d412022cd3fe/Mathlib/Data/Nat/Prime/Infinite.lean","sha256":"4d7a663d097dc291c3c3e55d097c7c5d0adfc7cb215c4700917f09c0acfbd527","license":"Apache-2.0","attribution":"mathlib contributors; source header credits Leonardo de Moura, Jeremy Avigad, Mario Carneiro"},{"id":"source-primefin","title":"Mathlib: infinite set of primes","kind":"lean-source","path":"Mathlib/Data/Nat/PrimeFin.lean","url":"https://github.com/leanprover-community/mathlib4/blob/32d24245c7a12ded17325299fd41d412022cd3fe/Mathlib/Data/Nat/PrimeFin.lean","sha256":"6bb17dd4f324b78804bdbd3d449df5cb77758ef096d13fae8d7360f58e94a8ea","license":"Apache-2.0","attribution":"mathlib contributors; see pinned source header and repository history"}],"spans":[{"id":"span-note-definition","sourceId":"source-note","startLine":5,"endLine":7,"label":"Informal definition"},{"id":"span-note-bound","sourceId":"source-note","startLine":9,"endLine":15,"label":"Theorem wording and proof idea"},{"id":"span-note-related","sourceId":"source-note","startLine":17,"endLine":19,"label":"Several possible infinitude formulations"},{"id":"span-note-task","sourceId":"source-note","startLine":21,"endLine":25,"label":"Strict-bound task and known failure"},{"id":"span-prime-def","sourceId":"source-prime-defs","startLine":38,"endLine":43,"label":"Nat.Prime definition","anchorText":"def Prime"},{"id":"span-bound-theorem","sourceId":"source-prime-infinite","startLine":31,"endLine":42,"label":"Nat.exists_infinite_primes and factorial proof","anchorText":"theorem exists_infinite_primes"},{"id":"span-unbounded-theorem","sourceId":"source-prime-infinite","startLine":44,"endLine":49,"label":"Unbounded-set formulation","anchorText":"theorem not_bddAbove_setOf_prime"},{"id":"span-infinite-theorem","sourceId":"source-primefin","startLine":26,"endLine":28,"label":"Infinite-set formulation","anchorText":"theorem infinite_setOf_prime"}],"claims":[{"id":"claim-prime-above-bound","slug":"prime-above-bound","title":"A prime at or above every bound","statement":"For every natural number n, some prime p satisfies n ≤ p.","kind":"known-theorem","sourceSpanIds":["span-note-bound","span-bound-theorem"],"representationId":"representation-bound","alignmentStatus":"staff-linked-not-independently-reviewed","reviewStatus":"pending-independent-review","argumentId":"argument-euclid-factorial","version":1,"contentSha256":"07513bbc687f0763ac96428359b1f202f1e982708574a25d0d70c1a0e8c67163"},{"id":"claim-primes-unbounded","slug":"primes-unbounded","title":"The set of primes is unbounded","statement":"There is no upper bound on natural-number primes.","kind":"known-theorem","sourceSpanIds":["span-note-related","span-unbounded-theorem"],"representationId":"representation-unbounded","alignmentStatus":"candidate-from-broad-wording","reviewStatus":"pending-independent-review","argumentId":"argument-unbounded","version":1,"contentSha256":"9325f021cab0bef2e52d1ec727153d193bc8a83526cc19c0ec49dc9f97dd82fd"},{"id":"claim-primes-infinite","slug":"primes-infinite","title":"There are infinitely many primes","statement":"The set of natural-number primes is infinite.","kind":"known-theorem","sourceSpanIds":["span-note-related","span-infinite-theorem"],"representationId":"representation-infinite","alignmentStatus":"candidate-from-broad-wording","reviewStatus":"pending-independent-review","argumentId":"argument-infinite","version":1,"contentSha256":"2a73c4bb2d2948a485a67b923febe95ccefe6ca840ca5a6738faf7a8404537ac"},{"id":"claim-prime-strictly-above","slug":"prime-strictly-above","title":"A prime strictly above every bound","statement":"For every natural number n, some prime p satisfies n < p.","kind":"derived-exercise","sourceSpanIds":["span-note-task"],"representationId":"representation-strict","alignmentStatus":"staff-linked-not-independently-reviewed","reviewStatus":"pending-independent-review","argumentId":"argument-strict","version":1,"contentSha256":"6d0128a689908ca169bc1519198182a42354e12e5c2254c38197333ee3a58fd5"}],"representations":[{"id":"representation-bound","targetId":"claim-prime-above-bound","formalSystem":"Lean 4 / mathlib","declaration":"Nat.exists_infinite_primes","expression":"∀ n : ℕ, ∃ p, n ≤ p ∧ Nat.Prime p","sourceSpanId":"span-bound-theorem","executionStatus":"upstream-source-pinned","version":1},{"id":"representation-unbounded","targetId":"claim-primes-unbounded","formalSystem":"Lean 4 / mathlib","declaration":"Nat.not_bddAbove_setOf_prime","expression":"¬BddAbove { p | Nat.Prime p }","sourceSpanId":"span-unbounded-theorem","executionStatus":"upstream-source-pinned","version":1},{"id":"representation-infinite","targetId":"claim-primes-infinite","formalSystem":"Lean 4 / mathlib","declaration":"Nat.infinite_setOf_prime","expression":"{ p | Nat.Prime p }.Infinite","sourceSpanId":"span-infinite-theorem","executionStatus":"upstream-source-pinned","version":1},{"id":"representation-strict","targetId":"claim-prime-strictly-above","formalSystem":"Lean 4 / mathlib","declaration":"OpenMath.Phase0.exists_prime_strictly_above","expression":"∀ n : ℕ, ∃ p, n < p ∧ Nat.Prime p","sourceSpanId":"span-note-task","executionStatus":"locally-typechecked-fixture","version":1}],"arguments":[{"id":"argument-euclid-factorial","claimId":"claim-prime-above-bound","title":"A prime factor of n! + 1","steps":["Choose a prime factor p of n! + 1.","If p ≤ n, then p divides n!.","It would then divide the difference (n! + 1) - n! = 1, a contradiction.","Therefore p ≥ n."],"sourceSpanIds":["span-note-bound","span-bound-theorem"],"reviewStatus":"pending-independent-review","version":1},{"id":"argument-strict","claimId":"claim-prime-strictly-above","title":"Shift the bound by one","steps":["Ask the existing theorem for a prime p ≥ n + 1.","Conclude p > n."],"sourceSpanIds":["span-note-task"],"reviewStatus":"pending-independent-review","version":1}],"insights":[{"id":"insight-factorial-plus-one","title":"The extra one breaks every small prime divisor","body":"The key move is not to find the next prime directly. Construct n! + 1, take one of its prime factors, and notice that any prime at most n would divide both n! and n! + 1. That impossible overlap supplies a prime beyond the alleged bound.","limitation":"This explains the pinned proof idea; it is not an independent review of the informal-to-formal alignment or a claim that the displayed witness is the least possible prime.","sourceSpanIds":["span-note-bound","span-bound-theorem"],"reviewStatus":"pending-independent-review","version":1,"contentSha256":"3d9f978e724ce193135a1d7c3964a123129721d7608636efbc24c6319b7ba7cb"}],"knownRuns":[{"id":"run-strict-broken","title":"Off-by-one proof attempt fails","status":"typecheck-failed","fixtureOnly":true,"observedOn":"2026-09-26","inputPath":"lean/PrimeStrictBroken.lean","inputSha256":"09f6c5028086b2acee711755f2905570bc432194944846dea2556fb6e62e49ab","toolchain":"leanprover/lean4:v4.27.0-rc1","mathlibCommit":"32d24245c7a12ded17325299fd41d412022cd3fe","launcher":"lake env lean in a local project with the pinned mathlib revision","exitCode":1,"diagnostic":"hbound has type n ≤ p but is expected to have type n < p","claimId":"claim-prime-strictly-above","trustScope":"Local failure observation; it refutes this attempt, not the mathematical statement.","artifactId":"artifact-strict-broken","actorId":"actor-phase0-curator"},{"id":"run-strict-success","title":"Strict-bound corollary typechecks","status":"typecheck-passed","fixtureOnly":true,"observedOn":"2026-09-26","inputPath":"lean/PrimeStrict.lean","inputSha256":"ceb85a78b5086e78ae29195528323cd7cb1ae880f58958865973b5a931a9da10","toolchain":"leanprover/lean4:v4.27.0-rc1","mathlibCommit":"32d24245c7a12ded17325299fd41d412022cd3fe","launcher":"lake env lean in a local project with the pinned mathlib revision","exitCode":0,"diagnostic":"No Lean diagnostics; process exited 0.","claimId":"claim-prime-strictly-above","trustScope":"Local typecheck observation only; no container digest, independent reproduction, alignment review, or novel-math claim.","artifactId":"artifact-strict-success","actorId":"actor-phase0-contributor"}],"knownAttempts":[{"id":"attempt-strict-broken","version":1,"actorId":"actor-phase0-curator","taskId":"task-strict-bound","contextPackId":"context-prime-strict-v1","runIds":["run-strict-broken"],"outcome":"failed","summary":"The non-strict witness gives n ≤ p, which cannot establish n < p.","fixtureOnly":true},{"id":"attempt-strict-success","version":1,"actorId":"actor-phase0-contributor","taskId":"task-strict-bound","contextPackId":"context-prime-strict-v1","runIds":["run-strict-success"],"outcome":"formal-typecheck-passed","summary":"Apply the pinned theorem at n + 1 and derive a strict bound.","fixtureOnly":true}],"contentSha256":"d67c6f126d758b69be14e1afcb5ad1e4fea90e717757bb0b60ba79fd99c83d3e"}],"reference_fixture_checks":[{"schemaVersion":"openmath.dev.research-record.phase0.2","fixtureOnly":true,"run":{"id":"run-strict-success","title":"Strict-bound corollary typechecks","status":"typecheck-passed","fixtureOnly":true,"observedOn":"2026-09-26","inputPath":"lean/PrimeStrict.lean","inputSha256":"ceb85a78b5086e78ae29195528323cd7cb1ae880f58958865973b5a931a9da10","toolchain":"leanprover/lean4:v4.27.0-rc1","mathlibCommit":"32d24245c7a12ded17325299fd41d412022cd3fe","launcher":"lake env lean in a local project with the pinned mathlib revision","exitCode":0,"diagnostic":"No Lean diagnostics; process exited 0.","claimId":"claim-prime-strictly-above","trustScope":"Local typecheck observation only; no container digest, independent reproduction, alignment review, or novel-math claim.","artifactId":"artifact-strict-success","actorId":"actor-phase0-contributor"},"artifact":{"id":"artifact-strict-success","path":"lean/PrimeStrict.lean","sha256":"ceb85a78b5086e78ae29195528323cd7cb1ae880f58958865973b5a931a9da10","mediaType":"text/x-lean","license":"Apache-2.0"},"attempt":{"id":"attempt-strict-success","version":1,"actorId":"actor-phase0-contributor","taskId":"task-strict-bound","contextPackId":"context-prime-strict-v1","runIds":["run-strict-success"],"outcome":"formal-typecheck-passed","summary":"Apply the pinned theorem at n + 1 and derive a strict bound.","fixtureOnly":true},"verificationResult":{"id":"verification-strict-success","runId":"run-strict-success","artifactId":"artifact-strict-success","outcome":"passed","scope":"Local Lean typecheck of the pinned formal statement","independentReproduction":"not-done","diagnostic":"No Lean diagnostics; process exited 0."},"claimId":"claim-prime-strictly-above","representation":{"id":"representation-strict","targetId":"claim-prime-strictly-above","formalSystem":"Lean 4 / mathlib","declaration":"OpenMath.Phase0.exists_prime_strictly_above","expression":"∀ n : ℕ, ∃ p, n < p ∧ Nat.Prime p","sourceSpanId":"span-note-task","executionStatus":"locally-typechecked-fixture","version":1},"sourceCommit":"32d24245c7a12ded17325299fd41d412022cd3fe","contextPackId":"context-prime-strict-v1","verification":{"executionStatus":"typecheck-passed","statementAlignment":"staff-linked-not-independently-reviewed","independentReproduction":"not-done","editorialReview":"pending-independent-review"},"contentSha256":"303910995ec7de534f973b87ce237174b0494804b0207f22466dcd9958f6d040"},{"schemaVersion":"openmath.dev.research-record.phase0.2","fixtureOnly":true,"run":{"id":"run-strict-broken","title":"Off-by-one proof attempt fails","status":"typecheck-failed","fixtureOnly":true,"observedOn":"2026-09-26","inputPath":"lean/PrimeStrictBroken.lean","inputSha256":"09f6c5028086b2acee711755f2905570bc432194944846dea2556fb6e62e49ab","toolchain":"leanprover/lean4:v4.27.0-rc1","mathlibCommit":"32d24245c7a12ded17325299fd41d412022cd3fe","launcher":"lake env lean in a local project with the pinned mathlib revision","exitCode":1,"diagnostic":"hbound has type n ≤ p but is expected to have type n < p","claimId":"claim-prime-strictly-above","trustScope":"Local failure observation; it refutes this attempt, not the mathematical statement.","artifactId":"artifact-strict-broken","actorId":"actor-phase0-curator"},"artifact":{"id":"artifact-strict-broken","path":"lean/PrimeStrictBroken.lean","sha256":"09f6c5028086b2acee711755f2905570bc432194944846dea2556fb6e62e49ab","mediaType":"text/x-lean","license":"Apache-2.0"},"attempt":{"id":"attempt-strict-broken","version":1,"actorId":"actor-phase0-curator","taskId":"task-strict-bound","contextPackId":"context-prime-strict-v1","runIds":["run-strict-broken"],"outcome":"failed","summary":"The non-strict witness gives n ≤ p, which cannot establish n < p.","fixtureOnly":true},"verificationResult":{"id":"verification-strict-broken","runId":"run-strict-broken","artifactId":"artifact-strict-broken","outcome":"failed","scope":"Local Lean typecheck of the pinned formal statement","independentReproduction":"not-done","diagnostic":"hbound has type n ≤ p but is expected to have type n < p"},"claimId":"claim-prime-strictly-above","representation":{"id":"representation-strict","targetId":"claim-prime-strictly-above","formalSystem":"Lean 4 / mathlib","declaration":"OpenMath.Phase0.exists_prime_strictly_above","expression":"∀ n : ℕ, ∃ p, n < p ∧ Nat.Prime p","sourceSpanId":"span-note-task","executionStatus":"locally-typechecked-fixture","version":1},"sourceCommit":"32d24245c7a12ded17325299fd41d412022cd3fe","contextPackId":"context-prime-strict-v1","verification":{"executionStatus":"typecheck-failed","statementAlignment":"staff-linked-not-independently-reviewed","independentReproduction":"not-done","editorialReview":"pending-independent-review"},"contentSha256":"766ba956ddefe9dee6120099c80cd8a5c324240f8be04192fbeace7a0897a960"}],"repeat_instructions":"Use the staff API with an approved exact input: openmath verify strict-prime-bound success <unique-idempotency-key>. Historical fixture exports do not contain a released image digest; obtain a live Run export before asserting image-identical repeatability."},"payload_sha256":"b9ae4afb9d5ac86ab17df2f9b1a1978146bb2b3245710953c21aa75624d06d98","canonicalization":"RFC 8785 JSON Canonicalization Scheme. Hash the payload, excluding this envelope. Immutable embedded domain hashes retain their original profile."}