{"schema_version":"claim-reader-v1","record":{"available_versions":[3,2],"current_version":3,"assessment_summary":"consistent","claim":{"statement":"The set of natural-number primes is infinite.","id":"claim-primes-infinite","slug":"primes-infinite","version":3,"kind":"theorem","title":"There are infinitely many primes","assumptions":["Natural numbers","Ordinary primality"],"scope":"Natural numbers; no claim of this equivalence for arbitrary ordered sets.","source_entry_ids":["prime-infinitude:entry:0:v1","prime-infinitude:entry:1:v1"],"formal_declarations":[]},"sha256":"1c5093b35fd7fb4f8a8d26fd5f0ebc8c4ccfbdb46e2889ad9005ea6e14fabef8","contexts":[{"assessment_history":[{"report_id":"prime-infinitude:report:0:v1","source_id":"openmath-prime-note","source_version_id":"openmath-prime-note@a640f3adfa536da0","source_title":"OpenMath · prime note","source_label":"Known theorem in authored reference note","state":"resolved","scope":"The cited source item and version only; this is not an independent OpenMath assessment.","observed_on":"2026-10-01","evidence_url":"https://openmath.dev/sources/prime-note","entry_id":"prime-infinitude:entry:0:v1"},{"report_id":"prime-infinitude:report:1:v1","source_id":"mathlib-prime-infinite","source_version_id":"mathlib-prime-infinite@32d24245c7a12ded17325299fd41d412022cd3fe","source_title":"mathlib · infinitude of primes","source_label":"Proved declaration Nat.exists_infinite_primes","state":"resolved","scope":"The cited source item and version only; this is not an independent OpenMath assessment.","observed_on":"2026-10-01","evidence_url":"https://github.com/leanprover-community/mathlib4/blob/32d24245c7a12ded17325299fd41d412022cd3fe/Mathlib/Data/Nat/Prime/Infinite.lean","entry_id":"prime-infinitude:entry:1:v1"}],"problem_id":"problem-prime-infinitude","slug":"prime-infinitude","title":"Why are there infinitely many primes?","publication_version":8,"relationship":{"claim":{"id":"claim-primes-infinite","version":3},"relation":"equivalent_formulation","relationship_note":"A finite set of natural numbers is bounded; a bounded set lies in a finite initial segment. Thus infinitude and unboundedness are equivalent here.","result":"proved","report_ids":["prime-infinitude:report:0:v1","prime-infinitude:report:1:v1"],"independent_review":"pending","reading":{"placement":"formulation","note":"A bounded set of natural numbers is finite, so infinitude and unboundedness agree."}},"assessments":[{"report_id":"prime-infinitude:report:0:v1","source_id":"openmath-prime-note","source_version_id":"openmath-prime-note@a640f3adfa536da0","source_title":"OpenMath · prime note","source_label":"Known theorem in authored reference note","state":"resolved","scope":"The cited source item and version only; this is not an independent OpenMath assessment.","observed_on":"2026-10-01","evidence_url":"https://openmath.dev/sources/prime-note","entry_id":"prime-infinitude:entry:0:v1"},{"report_id":"prime-infinitude:report:1:v1","source_id":"mathlib-prime-infinite","source_version_id":"mathlib-prime-infinite@32d24245c7a12ded17325299fd41d412022cd3fe","source_title":"mathlib · infinitude of primes","source_label":"Proved declaration Nat.exists_infinite_primes","state":"resolved","scope":"The cited source item and version only; this is not an independent OpenMath assessment.","observed_on":"2026-10-01","evidence_url":"https://github.com/leanprover-community/mathlib4/blob/32d24245c7a12ded17325299fd41d412022cd3fe/Mathlib/Data/Nat/Prime/Infinite.lean","entry_id":"prime-infinitude:entry:1:v1"}],"connections":[],"related_claims":[],"progress":[],"tasks":[{"target":{"id":"claim-prime-strictly-above","version":3},"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."}],"statements":[{"statement":"The set of natural-number primes is infinite.","id":"claim-primes-infinite","slug":"primes-infinite","version":3,"kind":"theorem","title":"There are infinitely many primes","assumptions":["Natural numbers","Ordinary primality"],"scope":"Natural numbers; no claim of this equivalence for arbitrary ordered sets.","source_entry_ids":["prime-infinitude:entry:0:v1","prime-infinitude:entry:1:v1"],"formal_declarations":[],"relation":"equivalent_formulation","relationship_note":"A finite set of natural numbers is bounded; a bounded set lies in a finite initial segment. Thus infinitude and unboundedness are equivalent here.","result":"proved","report_ids":["prime-infinitude:report:0:v1","prime-infinitude:report:1:v1"],"independent_review":"pending","reading":{"placement":"formulation","note":"A bounded set of natural numbers is finite, so infinitude and unboundedness agree."}}],"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}],"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}]}],"assessments":[{"report_id":"prime-infinitude:report:1:v1","source_id":"mathlib-prime-infinite","source_version_id":"mathlib-prime-infinite@32d24245c7a12ded17325299fd41d412022cd3fe","source_title":"mathlib · infinitude of primes","source_label":"Proved declaration Nat.exists_infinite_primes","state":"resolved","scope":"The cited source item and version only; this is not an independent OpenMath assessment.","observed_on":"2026-10-01","evidence_url":"https://github.com/leanprover-community/mathlib4/blob/32d24245c7a12ded17325299fd41d412022cd3fe/Mathlib/Data/Nat/Prime/Infinite.lean","entry_id":"prime-infinitude:entry:1:v1"},{"report_id":"prime-infinitude:report:0:v1","source_id":"openmath-prime-note","source_version_id":"openmath-prime-note@a640f3adfa536da0","source_title":"OpenMath · prime note","source_label":"Known theorem in authored reference note","state":"resolved","scope":"The cited source item and version only; this is not an independent OpenMath assessment.","observed_on":"2026-10-01","evidence_url":"https://openmath.dev/sources/prime-note","entry_id":"prime-infinitude:entry:0:v1"}],"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}],"formalizations":[],"tasks":[],"assessment_state":"proved","publication":{"version":8,"sha256":"058147cafc9657c33dffc4e1df74765bb95b8af044638abbd5cc55511add3dc8","published_at":"2026-10-14T09:35:13.081479+00:00","reason":"Reviewed reader correction: preserve assertion history, exact citations and scoped assessments; task evidence names its exact Claim target.","withdrawn":false,"draft":{"reader_guide":{"reading":[{"entry_id":"prime-infinitude:entry:0:v1","role":"introduction","note":"Read the setting and notation before comparing the results."},{"entry_id":"prime-at-or-above-bound:entry:0:v1","role":"formal_source","note":"Inspect the formal statement, assumptions and reported checks."}],"definitions":[{"id":"prime-infinitude-definition","term":"Unbounded primes","explanation":"For each natural-number bound there is a larger prime. This is equivalent to saying that the set of primes is infinite.","source_entry_ids":["prime-infinitude:entry:0:v1"]}],"proofs":[],"bounds":[],"witnesses":[],"contributors":{"summary":"The OpenMath note explains the classical infinitude argument. Mathlib contributors provide the linked formal theorems and prime definitions.","source_entry_ids":["prime-infinitude:entry:0:v1","prime-infinitude:entry:1:v1","prime-at-or-above-bound:entry:0:v1","prime-divisor-characterization:entry:v1"]},"scopes":[],"question":{"scope_summary":"Natural numbers and ordinary primality. The question asks for a prime strictly larger than any specified bound.","detail_title":"Strict and non-strict formal statement correspondence","aspects":[],"lead_insight_id":"insight-factorial-plus-one","source_entry_ids":["prime-infinitude:entry:0:v1","prime-infinitude:entry:1:v1","prime-at-or-above-bound:entry:0:v1","prime-divisor-characterization:entry:v1"]}},"claim_relations":[{"claim":{"id":"claim-prime-strictly-above","version":3},"relation":"primary_formulation","relationship_note":"The strict witness formulation states the canonical question.","result":"proved","report_ids":["prime-infinitude:report:0:v1","prime-infinitude:report:1:v1"],"independent_review":"pending"},{"claim":{"id":"claim-prime-above-bound","version":3},"relation":"equivalent_formulation","relationship_note":"Apply this theorem at n + 1 to obtain n < p. Conversely n < p implies n ≤ p. This equivalence concerns the universal statements; a particular non-strict witness at n can equal n.","result":"proved","report_ids":["prime-at-or-above-bound:report:0:v1"],"independent_review":"pending"},{"claim":{"id":"claim-primes-unbounded","version":3},"relation":"equivalent_formulation","relationship_note":"Unboundedness means that every natural-number bound has a larger prime. This is exactly the strict witness formulation.","result":"proved","report_ids":["prime-infinitude:report:0:v1","prime-infinitude:report:1:v1"],"independent_review":"pending","reading":{"placement":"formulation","note":"Unboundedness says that no natural-number bound contains every prime."}},{"claim":{"id":"claim-primes-infinite","version":3},"relation":"equivalent_formulation","relationship_note":"A finite set of natural numbers is bounded; a bounded set lies in a finite initial segment. Thus infinitude and unboundedness are equivalent here.","result":"proved","report_ids":["prime-infinitude:report:0:v1","prime-infinitude:report:1:v1"],"independent_review":"pending","reading":{"placement":"formulation","note":"A bounded set of natural numbers is finite, so infinitude and unboundedness agree."}},{"claim":{"id":"claim-prime-divisor-characterization","version":2},"relation":"supporting_result","relationship_note":"This prerequisite supplies the divisibility contradiction in the factorial-plus-one proof. It is a supporting theorem, not another prime-infinitude Problem.","result":"proved","report_ids":["prime-divisor-characterization:report:v1"],"independent_review":"pending","reading":{"placement":"background","note":"This characterizes primality; it is not another infinitude result."}}],"schema_version":"research-record-v3","claims":[{"statement":"For every natural number n, there exists a prime p with n < p.","id":"claim-prime-strictly-above","slug":"prime-strictly-above","version":3,"kind":"theorem","title":"A prime strictly above every bound","assumptions":["Natural numbers","Ordinary primality"],"scope":"Natural-number bounds and ordinary primality.","source_entry_ids":["prime-infinitude:entry:0:v1","prime-infinitude:entry:1:v1"],"formal_declarations":[]},{"statement":"For every natural number n, there exists a prime p with n ≤ p.","id":"claim-prime-above-bound","slug":"prime-above-bound","version":3,"kind":"theorem","title":"A prime at or above every bound","assumptions":["Natural numbers","Ordinary primality"],"scope":"Same natural-number domain as the strict formulation.","source_entry_ids":["prime-at-or-above-bound:entry:0:v1"],"formal_declarations":["Nat.exists_infinite_primes"]},{"statement":"The natural-number primes have no upper bound.","id":"claim-primes-unbounded","slug":"primes-unbounded","version":3,"kind":"theorem","title":"The set of primes is unbounded","assumptions":["Natural numbers","Ordinary primality"],"scope":"Natural-number primes with their usual order.","source_entry_ids":["prime-infinitude:entry:0:v1","prime-infinitude:entry:1:v1"],"formal_declarations":[]},{"statement":"The set of natural-number primes is infinite.","id":"claim-primes-infinite","slug":"primes-infinite","version":3,"kind":"theorem","title":"There are infinitely many primes","assumptions":["Natural numbers","Ordinary primality"],"scope":"Natural numbers; no claim of this equivalence for arbitrary ordered sets.","source_entry_ids":["prime-infinitude:entry:0:v1","prime-infinitude:entry:1:v1"],"formal_declarations":[]},{"statement":"A natural number p is prime exactly when p ≥ 2 and every natural-number divisor m of p is either 1 or p.","id":"claim-prime-divisor-characterization","slug":"prime-divisor-characterization","version":2,"kind":"lemma","title":"Characterizing a natural-number prime","assumptions":["Natural numbers","Ordinary primality"],"scope":"Natural-number divisibility and ordinary primality.","source_entry_ids":["prime-divisor-characterization:entry:v1"],"formal_declarations":["Nat.prime_def"]}],"problem":{"resolution_scope":{"resolution":"proved","extent":"full_statement","summary":"Full natural-number statement proved; the strict, non-strict, unbounded and infinite formulations are equivalent.","report_ids":["prime-infinitude:report:0:v1","prime-infinitude:report:1:v1"],"progress_claim_ids":[],"remaining":null},"statement_kind":"theorem","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":["Infinitude of primes","A prime at or above any bound","Primes are unbounded","Euclid’s theorem"],"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","prime-at-or-above-bound:entry:0:v1","prime-divisor-characterization:entry: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":"Staff checked the equivalence under natural-number assumptions and retained exact source correspondence. 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-10","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"},{"title":"Pinned prime-divisor characterization","url":"https://github.com/leanprover-community/mathlib4/blob/32d24245c7a12ded17325299fd41d412022cd3fe/Mathlib/Data/Nat/Prime/Defs.lean#L97-L105","note":"Source-level staff correspondence. A passing Run does not independently confirm informal/formal alignment.","declaration":"Nat.prime_def","source_commit":"32d24245c7a12ded17325299fd41d412022cd3fe","alignment":"staff_linked","checked_on":"2026-10-01"}],"related":[],"tasks":[{"target":{"id":"claim-prime-strictly-above","version":3},"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-12"},"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},{"id":"mathlib-prime-defs@32d24245c7a12ded17325299fd41d412022cd3fe","source_id":"mathlib-prime-defs","title":"mathlib · natural-number prime definitions","owner":"mathlib contributors","url":"https://github.com/leanprover-community/mathlib4/blob/32d24245c7a12ded17325299fd41d412022cd3fe/Mathlib/Data/Nat/Prime/Defs.lean","subject_scope":"Natural-number primality and divisibility","revision":"32d24245c7a12ded17325299fd41d412022cd3fe","content_sha256":"ed1f1384e13ab35eb5bf0b4d0dba1572dcb927998557e9b3f6565cda55bc3e47","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},{"id":"prime-at-or-above-bound:entry:0: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 each natural number n, there is a prime p satisfying n ≤ p.","wording_kind":"paraphrase","locator":"Mathlib/Data/Nat/Prime/Infinite.lean lines 31–42","supersedes":null},{"id":"prime-divisor-characterization:entry:v1","source_version_id":"mathlib-prime-defs@32d24245c7a12ded17325299fd41d412022cd3fe","item_id":"Nat.prime_def","url":"https://github.com/leanprover-community/mathlib4/blob/32d24245c7a12ded17325299fd41d412022cd3fe/Mathlib/Data/Nat/Prime/Defs.lean","wording":"Is a natural number p prime exactly when p ≥ 2 and every natural-number divisor m of p is either 1 or p?","wording_kind":"paraphrase","locator":"Mathlib/Data/Nat/Prime/Defs.lean lines 97–105","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},{"id":"prime-at-or-above-bound:report:0:v1","entry_id":"prime-at-or-above-bound:entry:0: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},{"id":"prime-divisor-characterization:report:v1","entry_id":"prime-divisor-characterization:entry:v1","state":"resolved","source_label":"Proved characterization Nat.prime_def","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/Defs.lean","supersedes":null}]},"status":{"state":"proved","label":"Proved","extent":"full_statement","summary":"Full natural-number statement proved; the strict, non-strict, unbounded and infinite formulations are equivalent.","basis":"editorial","attributed_to":"Elementary prime results · OpenMath staff","as_of":"2026-10-10","progress_label":null,"progress_claim_ids":[],"remaining":null,"views":["resolved"]}},"selected_context":{"assessment_history":[{"report_id":"prime-infinitude:report:0:v1","source_id":"openmath-prime-note","source_version_id":"openmath-prime-note@a640f3adfa536da0","source_title":"OpenMath · prime note","source_label":"Known theorem in authored reference note","state":"resolved","scope":"The cited source item and version only; this is not an independent OpenMath assessment.","observed_on":"2026-10-01","evidence_url":"https://openmath.dev/sources/prime-note","entry_id":"prime-infinitude:entry:0:v1"},{"report_id":"prime-infinitude:report:1:v1","source_id":"mathlib-prime-infinite","source_version_id":"mathlib-prime-infinite@32d24245c7a12ded17325299fd41d412022cd3fe","source_title":"mathlib · infinitude of primes","source_label":"Proved declaration Nat.exists_infinite_primes","state":"resolved","scope":"The cited source item and version only; this is not an independent OpenMath assessment.","observed_on":"2026-10-01","evidence_url":"https://github.com/leanprover-community/mathlib4/blob/32d24245c7a12ded17325299fd41d412022cd3fe/Mathlib/Data/Nat/Prime/Infinite.lean","entry_id":"prime-infinitude:entry:1:v1"}],"problem_id":"problem-prime-infinitude","slug":"prime-infinitude","title":"Why are there infinitely many primes?","publication_version":8,"relationship":{"claim":{"id":"claim-primes-infinite","version":3},"relation":"equivalent_formulation","relationship_note":"A finite set of natural numbers is bounded; a bounded set lies in a finite initial segment. Thus infinitude and unboundedness are equivalent here.","result":"proved","report_ids":["prime-infinitude:report:0:v1","prime-infinitude:report:1:v1"],"independent_review":"pending","reading":{"placement":"formulation","note":"A bounded set of natural numbers is finite, so infinitude and unboundedness agree."}},"assessments":[{"report_id":"prime-infinitude:report:0:v1","source_id":"openmath-prime-note","source_version_id":"openmath-prime-note@a640f3adfa536da0","source_title":"OpenMath · prime note","source_label":"Known theorem in authored reference note","state":"resolved","scope":"The cited source item and version only; this is not an independent OpenMath assessment.","observed_on":"2026-10-01","evidence_url":"https://openmath.dev/sources/prime-note","entry_id":"prime-infinitude:entry:0:v1"},{"report_id":"prime-infinitude:report:1:v1","source_id":"mathlib-prime-infinite","source_version_id":"mathlib-prime-infinite@32d24245c7a12ded17325299fd41d412022cd3fe","source_title":"mathlib · infinitude of primes","source_label":"Proved declaration Nat.exists_infinite_primes","state":"resolved","scope":"The cited source item and version only; this is not an independent OpenMath assessment.","observed_on":"2026-10-01","evidence_url":"https://github.com/leanprover-community/mathlib4/blob/32d24245c7a12ded17325299fd41d412022cd3fe/Mathlib/Data/Nat/Prime/Infinite.lean","entry_id":"prime-infinitude:entry:1:v1"}],"connections":[],"related_claims":[],"progress":[],"tasks":[{"target":{"id":"claim-prime-strictly-above","version":3},"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."}],"statements":[{"statement":"The set of natural-number primes is infinite.","id":"claim-primes-infinite","slug":"primes-infinite","version":3,"kind":"theorem","title":"There are infinitely many primes","assumptions":["Natural numbers","Ordinary primality"],"scope":"Natural numbers; no claim of this equivalence for arbitrary ordered sets.","source_entry_ids":["prime-infinitude:entry:0:v1","prime-infinitude:entry:1:v1"],"formal_declarations":[],"relation":"equivalent_formulation","relationship_note":"A finite set of natural numbers is bounded; a bounded set lies in a finite initial segment. Thus infinitude and unboundedness are equivalent here.","result":"proved","report_ids":["prime-infinitude:report:0:v1","prime-infinitude:report:1:v1"],"independent_review":"pending","reading":{"placement":"formulation","note":"A bounded set of natural numbers is finite, so infinitude and unboundedness agree."}}],"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}],"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}]}}}