WikiLean · Articles Articles Brain Contribute About

Preliminary: these links have not yet had an independent audit.

Prime number

199 passages103 formalized14 statement only37 partial45 not formalized

More ways to filter
Library
About this page

This page

  • Wikipedia revision 1373534600, pinned: the text here is that revision, not today's article.
  • WikiProject Mathematics: GA-class, Top importance
  • Annotated article on WikiLean.
  • 199 passages checked, 271 Lean locations (and 67 related declarations).

Central statements: 87 of the 199 passages state the article's subject or a named result or definition; the other 112 are supporting (examples, setup). Of these 87: 51 formalized, 12 statement only, 12 partial, 12 not formalized.

What the colours mean

  • Formalized a Lean declaration states it, proved, or a Lean definition defines it
  • Statement only Lean states it, but the proof is not finished
  • Partial Lean states part of it, or a more general or special form
  • Not formalized searched every library and not found

Libraries searched

Searched 48 Lean libraries, pinned 2026-10-17, 3 left out (library set u1).

How these links were made

  • Accuracy, from an audit of a sample of 224 items (blind, not independent): Strong links (exact, close or broad match) on supporting passages that have exactly the right relation: 92% (95% interval 49–99%), from 36 drawn of 1029, weighted by relation and library, an effective sample of 5.1; Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation: 73% (95% interval 40–92%), from 48 drawn of 1740, weighted by relation and library, an effective sample of 8.1; Central and subject passages whose formalization status is right: 86% (95% interval 73–94%), from 44 drawn of 1905, weighted by recorded status, an effective sample of 42; 'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it): 60% (95% interval 25–87%), from 12 drawn of 1236, weighted by article, an effective sample of 6.1.
  • Audit run tierA-batch1-audit, run by jack, 2 Nov 2026, 21:10 – 3 Nov 2026, 02:10 UTC: judged by Claude Opus 5.5 (claude-opus-5-5).
  • Record set tierA-b1b (cf-locate-recordset/2, statuses by status rule 3), exported 1 Nov 2026 by formal-companion at commit d85385a.
  • Seal sha256 23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602.
  • Inventory run inv-tierA-b1r, run by jack, 30 Oct 2026, 07:23–20:00 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). It listed the formal passages, each with its kind and prominence, that the locate run then searched.
  • Locate run loc-tierA-b1b, run by jack, 31 Oct 2026, 04:59 – 1 Nov 2026, 03:06 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5).
  • Challenge run chal-tierA-b1, run by jack, 1 Nov 2026, 03:19–14:25 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). In this article it re-checked every Lean location and absence on a central or subject passage (134 locations and 12 absences); on supporting passages, a seeded sample (seed 0; drawn at 0.5 for strong matches, 0.2 for weaker links and 0.25 for absences): 101 of 137 locations and 9 of 33 absences. In all, 235 of 271 Lean locations (87%) and 21 of 45 absences (47%) were re-checked.
  • Passage text: 199 of 199 passages shown in full, each the slice of the pinned revision's text that its record's span sha256 hashes, checked when the store was built.
  • Lean code: each declaration's type, from the declaration corpus of universe u1 (built 18 Oct 2026, sha256 a364fd6aede5), at the commit its card links.

How the text is shown

Each passage is shown in full, as revision 1373534600 states it (checked against its record's span hash when the store was built). Where a passage is only part of a sentence, it is highlighted and the rest of the sentence is shown in grey around it, from the same copy of the revision; a list item also shows the sentence that introduces it. Formulas are drawn from their TeX; hover one to see it.

Each card's Lean code is its declaration's type as Lean prints it, from the declaration corpus of library set u1 at the card's commit, laid out as a header: binders before the colon, then the hypotheses as arrows (the corpus keeps no hypothesis names) and the conclusion, in Mathlib's notation (𝓝, π, R[X], Type*). It is not the source text; Source opens that.

Passages

What “exact match”, “more general” and the other labels mean
  1. Definition · Subject of the article

    Formalized

    Formalized: Mathlib states this exactly (a Prop-valued definition: it states the claim without proving it).

    A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers.

    Show in article · Read it in context on Wikipedia

    Nat.Prime exact match

    def Nat.Prime : ℕ → Prop

    Mathlib.Data.Nat.Prime.Defs · lines 42–43

    Note: Mathlib's predicate on the natural numbers holds of exactly the numbers the passage describes; its body is irreducibility in the natural numbers, which for n means n is above one and no two factors below n multiply to n.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key c91be2f98800 · pair key b0422c8ede0d.

    Nat.prime_iff_not_exists_mul_eq close match

    theorem Nat.prime_iff_not_exists_mul_eq {p : ℕ} : Nat.Prime p ↔ 2 ≤ p ∧ ¬∃ m n, m < p ∧ n < p ∧ m * n = p

    Mathlib.Data.Nat.Prime.Defs · lines 133–142

    Why close, not exact: Mathlib unfolds its prime predicate into the condition the passage uses: the number is at least two and no pair of factors each below it has it as product.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key e2815fe5a8cf · pair key dd0ae3e84845.
  2. Definition · main statement

    Formalized

    Formalized: ATLAS (atlas-lean) states this exactly (a Prop-valued definition: it states the claim without proving it).

    A natural number greater than 1 that is not prime is called a composite number.

    Show in article · Read it in context on Wikipedia

    Nat.IsComposite exact match

    def Nat.IsComposite : ℕ → Prop

    MathlibExt.NumberTheory.Composite · line 24

    Note: Atlas introduces this predicate on the natural numbers by the condition the passage gives: above one, and failing Mathlib's prime predicate.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key 08ee9b6277c7 · pair key 2aec699d5463.
  3. Example · supporting

    Formalized

    Formalized: Mathlib states this exactly (proved).

    For example, 5 is prime because the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself.

    Show in article · Read it in context on Wikipedia

    Nat.prime_five exact match

    theorem Nat.prime_five : Nat.Prime 5

    Mathlib.Data.Nat.Prime.Defs · line 175

    Note: Mathlib records primality of five as a closed theorem over the natural numbers.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key aa4e6642e889 · pair key 4292d17f66d9.
  4. Theorem · supporting

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    For example, 5 is prime because the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself.

    Show in article · Read it in context on Wikipedia

    Nat.prime_five close match

    theorem Nat.prime_five : Nat.Prime 5

    Mathlib.Data.Nat.Prime.Defs · line 175

    Why close, not exact: Mathlib writes the same fact about five with its own predicate, whose meaning on the natural numbers is that one factor of any two-factor product is the number itself and the other is one.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key df0ef8b7b645 · pair key 672e9756564a.
  5. Example · supporting

    Formalized

    Formalized: Mathlib states a more general result (proved).

    However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4.

    Show in article · Read it in context on Wikipedia

    Nat.not_prime_of_dvd_of_ne more general

    theorem Nat.not_prime_of_dvd_of_ne {m n : ℕ} : m ∣ n → m ≠ 1 → m ≠ n → ¬Nat.Prime n

    Mathlib.Data.Nat.Prime.Basic · lines 73–74

    Why more general: Mathlib rules out primality for any number having a divisor other than one and itself; taking two as a divisor of four gives the article's claim about four.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key f9170eefeb57 · pair key 45ab0e1bb252.
  6. Theorem · supporting

    Not formalized
    However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 029781becf5d).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  7. Theorem · main statement

    Formalized

    Formalized by 2 parts together (more general):

    1. Nat.primeFactorsList_unique Mathlib (proved)
      • such a prime factorization is unique up to reordering the factors
    2. UniqueFactorizationMonoid.exists_prime_factors Mathlib (proved)
      • every natural number above 1 is prime or factors as a product of primes
    Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order.

    Show in article · Read it in context on Wikipedia

    Nat.primeFactorsList_unique states part

    theorem Nat.primeFactorsList_unique {n : ℕ} {l : List ℕ} : l.prod = n → (∀ p ∈ l, Nat.Prime p) → l.Perm n.primeFactorsList

    Mathlib.Data.Nat.Factors · lines 168–179

    Why only part: Mathlib fixes one canonical prime list for n and says every prime factorisation of n is a rearrangement of that list.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 29bec2d7a371 · pair key 4f29d548fc41.

    UniqueFactorizationMonoid.exists_prime_factors states part

    theorem UniqueFactorizationMonoid.exists_prime_factors {α : Type*} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] (a : α) : a ≠ 0 → ∃ f, (∀ b ∈ f, Prime b) ∧ Associated f.prod a

    Mathlib.RingTheory.UniqueFactorizationDomain.Defs · lines 150–153

    Why only part: Mathlib asserts the existence of a prime factorisation in any unique factorisation monoid; the natural numbers form one, and association there is equality.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key e42c5fa40751 · pair key 244553f0ced5.
  8. Definition · supporting

    Formalized

    Formalized: Mathlib states this exactly (a Prop-valued definition: it states the claim without proving it).

    The property of being prime is called primality.

    Show in article · Read it in context on Wikipedia

    Nat.Prime exact match

    def Nat.Prime : ℕ → Prop

    Mathlib.Data.Nat.Prime.Defs · lines 42–43

    Note: Mathlib keeps this property of natural numbers under the name Nat.Prime, where the article gives it the name primality.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 88edbda5014a · pair key 811f2ebdf396.
  9. Definition · supporting

    Partial

    Partial, by a community edit: Mathlib states part of this (proved).

    A simple but slow method of checking the primality of a given number ⁠ n ⁠, called trial division, tests whether ⁠ n ⁠ is a multiple of any integer between 2 and ⁠ √n ⁠.

    Show in article · Read it in context on Wikipedia

    Nat.prime_def_le_sqrt states part

    theorem Nat.prime_def_le_sqrt {p : ℕ} : Nat.Prime p ↔ 2 ≤ p ∧ ∀ (m : ℕ), 2 ≤ m → m ≤ p.sqrt → ¬m ∣ p

    Mathlib.Data.Nat.Prime.Defs · lines 124–131

    Community Agent The pipeline said close match; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.

    Why only part: Nat.prime_def_le_sqrt states the criterion trial division relies on: a number at least 2 is prime exactly when no m with 2 ≤ m ≤ Nat.sqrt p divides it. It defines no testing procedure and says nothing about the method being slow, so it covers the mathematical part of the passage but not the method itself.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 60428656f738 · pair key 2b2f5aea3057.
  10. Theorem · supporting

    Not formalized
    Faster algorithms include the Miller–Rabin primality test, which is fast but has a small chance of error, and the AKS primality test, which always produces the correct answer in polynomial time but is too slow to be practical.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 6 queries and 4 candidates examined (receipt 3e2674d0c5fd).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  11. Theorem · main statement

    Formalized

    Formalized: Mathlib states this exactly (proved).

    There are infinitely many primes, as demonstrated by Euclid around 300 BC.

    Show in article · Read it in context on Wikipedia

    Nat.infinite_setOf_prime exact match

    theorem Nat.infinite_setOf_prime : {p | Nat.Prime p}.Infinite

    Deprecated at this commit, in favour of Nat.infinite_setOfPred_prime.

    Mathlib.Data.Nat.PrimeFin · line 30

    Note: Lean states the infinitude as a property of the set of natural numbers satisfying the primality predicate.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 0d07409ef98b · pair key 1309ed7be2e2.

    Nat.exists_infinite_primes close match

    theorem Nat.exists_infinite_primes (n : ℕ) : ∃ p, n ≤ p ∧ Nat.Prime p

    Mathlib.Data.Nat.Prime.Infinite · lines 36–45

    Why close, not exact: Lean encodes Euclid's theorem as unboundedness: for each n it produces a prime at least n, as its docstring records.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 23d48ded3eec · pair key 9ec0635375f3.

    Nat.Primes.infinite close match

    instance Nat.Primes.infinite : Infinite Nat.Primes

    Mathlib.Data.Nat.PrimeFin · line 32

    Why close, not exact: Lean encodes the infinitude as a typeclass instance on the subtype of primes rather than as a property of a set.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 3df6d1df59cd · pair key 5dc6518609d1.
  12. Conjecture · main statement

    Statement only

    Stated by 2 parts together (close match), not all of them finished:

    1. GoldbachConjecture.goldbach Formal Conjectures (statement only)
      • every even integer above 2 is the sum of two primes
    2. TwinPrimes.twin_primes Formal Conjectures (statement only)
      • infinitely many pairs of primes differ by two
    These include Goldbach's conjecture, that every even integer greater than 2 can be expressed as the sum of two primes, and the twin prime conjecture, that there are infinitely many pairs of primes that differ by two.

    Show in article · Read it in context on Wikipedia

    GoldbachConjecture.goldbach states part

    theorem GoldbachConjecture.goldbach (n : ℕ) : 2 < n → Even n → ∃ p q, Prime p ∧ Prime q ∧ n = p + q

    FormalConjectures.Wikipedia.GoldbachConjecture · lines 36–38

    Why only part: Lean quantifies over n : ℕ, and every even integer above 2 is a natural number, so the ℕ binder ranges over exactly the numbers the conjunct speaks of; the summands are required to be prime in the root-level sense, which on ℕ is the same predicate.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key a66c70b5c7d4 · pair key ebc6f56220b5.

    TwinPrimes.twin_primes states part

    theorem TwinPrimes.twin_primes : {p | Prime p ∧ Prime (p + 2)}.Infinite

    FormalConjectures.Wikipedia.TwinPrimes · lines 37–39

    Why only part: Lean encodes the pairs by their smaller member, stating the infinitude of the set of primes p for which p + 2 is prime.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 9de7f49d4be7 · pair key b004a8633d7f.

    Dickson.generalized_twin_primes states part

    theorem Dickson.generalized_twin_primes (k : ℕ) : 0 < k → Infinite ↑{p | Nat.Prime p ∧ Nat.Prime (p + 2 * k)}

    FormalConjectures.Wikipedia.Dickson · lines 54–56

    Why only part: Lean states a family of gap conjectures indexed by k : ℕ over the primes of ℕ, of which the gap two the passage names is the first member; the primes and the gaps the passage speaks of are natural numbers, so the ℕ binders cover exactly its pairs.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 4a5a7cf37215 · pair key 2ef8d5047b6a.
  13. Definition · main statement · Definition and examples

    Formalized

    Formalized: Mathlib states this exactly (a Prop-valued definition: it states the claim without proving it).

    A natural number (1, 2, 3, 4, 5, 6, etc.) is called a prime number (or a prime) if it is greater than 1 and cannot be written as the product of two smaller natural numbers.

    Show in article · Read it in context on Wikipedia

    Nat.Prime exact match

    def Nat.Prime : ℕ → Prop

    Mathlib.Data.Nat.Prime.Defs · lines 42–43

    Note: Lean defines the predicate as irreducibility of the natural number, which holds of exactly the numbers above one with no factorisation into two smaller naturals, and its docstring records that reading.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 326792b39fee · pair key d6e1c65cea4c.

    Nat.prime_iff_not_exists_mul_eq close match

    theorem Nat.prime_iff_not_exists_mul_eq {p : ℕ} : Nat.Prime p ↔ 2 ≤ p ∧ ¬∃ m n, m < p ∧ n < p ∧ m * n = p

    Mathlib.Data.Nat.Prime.Defs · lines 133–142

    Why close, not exact: Lean unfolds the predicate into the passage's own wording, writing 2 ≤ p for being above one and denying any pair of factors below p with product p.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key ffe00c556c09 · pair key 5cd0311a6faf.
  14. Definition · supporting · Definition and examples

    Formalized

    Formalized: ATLAS (atlas-lean) states this exactly (a Prop-valued definition: it states the claim without proving it).

    The numbers greater than 1 that are not prime are called composite numbers.[1]

    Show in article · Read it in context on Wikipedia

    Nat.IsComposite exact match

    def Nat.IsComposite : ℕ → Prop

    MathlibExt.NumberTheory.Composite · line 24

    Note: Lean defines the predicate as being above one and not prime, which its docstring states in those words.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key 04ddc48023ed · pair key 65bca33e2066.
  15. Definition · supporting · Definition and examples

    Partial

    Partial: Mathlib states this up to a convention difference, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.

    In other words, ⁠ n ⁠ is prime if ⁠ n ⁠ items cannot be divided up into smaller equal-size groups of more than one item,[2] or if it is not possible to arrange ⁠ n ⁠ dots into a rectangular grid that is more than one dot wide and more than one dot high.[3]

    Show in article · Read it in context on Wikipedia

    Nat.prime_iff_not_exists_mul_eq close match

    theorem Nat.prime_iff_not_exists_mul_eq {p : ℕ} : Nat.Prime p ↔ 2 ≤ p ∧ ¬∃ m n, m < p ∧ n < p ∧ m * n = p

    Mathlib.Data.Nat.Prime.Defs · lines 133–142

    Why close, not exact: Lean encodes the arrangement into equal groups as a pair of factors with product p, asking each factor to be below p, and carries the bound 2 ≤ p that the article's definition supplies.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 4ebba1889204 · pair key d2aad900099a.
  16. Example · supporting · Definition and examples

    Partial

    Partial: Mathlib states part of this (proved).

    For example, among the numbers 1 through 6, the numbers 2, 3, and 5 are the prime numbers,[4] as there are no other numbers that divide them evenly (without a remainder).

    Show in article · Read it in context on Wikipedia

    Nat.prime_two states part

    theorem Nat.prime_two : Nat.Prime 2

    Mathlib.Data.Nat.Prime.Defs · line 171

    Why only part: A standalone fact about the number two, proved once in the primality file.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key bf3e8e3ce3b5 · pair key 6be286f4d5fc.

    Nat.prime_three states part

    theorem Nat.prime_three : Nat.Prime 3

    Mathlib.Data.Nat.Prime.Defs · line 173

    Why only part: A standalone fact about the number three, proved once in the primality file.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 1a86c8a32614 · pair key 429b47ac8d40.

    Nat.prime_five states part

    theorem Nat.prime_five : Nat.Prime 5

    Mathlib.Data.Nat.Prime.Defs · line 175

    Why only part: A standalone fact about the number five, proved once in the primality file.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 2b6969ba68f1 · pair key 4e85c06181c2.

    Nat.not_prime_one states part

    theorem Nat.not_prime_one : ¬Nat.Prime 1

    Mathlib.Data.Nat.Prime.Defs · lines 57–58

    Why only part: A standalone fact about the number one, proved in the same primality file.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key bb12f1444451 · pair key 0af68e25b434.
  17. Example · supporting · Definition and examples

    Formalized

    Formalized: Mathlib states this exactly (proved).

    1 is not prime, as it is specifically excluded in the definition.

    Show in article · Read it in context on Wikipedia

    Nat.not_prime_one exact match

    theorem Nat.not_prime_one : ¬Nat.Prime 1

    Mathlib.Data.Nat.Prime.Defs · lines 57–58

    Note: The statement is about the natural number 1, the object of the passage; the article's ground for it is left to the definition.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 47bcbe976de9 · pair key 908f2ea6f315.

    not_prime_one more general

    theorem not_prime_one {M : Type*} [CommMonoidWithZero M] : ¬Prime 1

    Mathlib.Algebra.Prime.Defs · line 99

    Why more general: Stated for any commutative monoid with zero using Mathlib's algebraic primality predicate, which at the naturals is the same notion the passage uses.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 86d4248ae6e0 · pair key 2bb645a375ed.
  18. Example · supporting · Definition and examples

    Formalized

    Formalized: Mathlib states a more general result (proved).

    4 = 2 × 2 and 6 = 2 × 3 are both composite.

    Show in article · Read it in context on Wikipedia

    Nat.not_prime_of_mul_eq more general

    theorem Nat.not_prime_of_mul_eq {a b n : ℕ} : a * b = n → a ≠ 1 → b ≠ 1 → ¬Nat.Prime n

    Mathlib.Data.Nat.Prime.Basic · lines 31–32

    Why more general: The product equation the passage writes out is this theorem's own hypothesis, taken at the factor 2 twice.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 7c39964b316d · pair key 27087084b247.

    Nat.not_prime_mul more general

    theorem Nat.not_prime_mul {a b : ℕ} : a ≠ 1 → b ≠ 1 → ¬Nat.Prime (a * b)

    Mathlib.Data.Nat.Prime.Basic · lines 28–29

    Why more general: Stated about a product of two naturals neither of which is 1, the shape of the factorisation the passage gives for 4.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 97489d8a3dd2 · pair key 6813e7461783.
  19. Example · supporting · Definition and examples

    Formalized

    Formalized: Mathlib states a more general result (proved).

    4 = 2 × 2 and 6 = 2 × 3 are both composite.

    Show in article · Read it in context on Wikipedia

    Nat.not_prime_of_mul_eq more general

    theorem Nat.not_prime_of_mul_eq {a b n : ℕ} : a * b = n → a ≠ 1 → b ≠ 1 → ¬Nat.Prime n

    Mathlib.Data.Nat.Prime.Basic · lines 31–32

    Why more general: The product equation the passage writes out is this theorem's own hypothesis, taken at the factors 2 and 3.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 62458e4cc999 · pair key 57c8fdb74f15.

    Nat.not_prime_mul more general

    theorem Nat.not_prime_mul {a b : ℕ} : a ≠ 1 → b ≠ 1 → ¬Nat.Prime (a * b)

    Mathlib.Data.Nat.Prime.Basic · lines 28–29

    Why more general: Stated about a product of two naturals neither of which is 1, the shape of the factorisation the passage gives for 6.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key e0314db82bc0 · pair key d1a46487462c.
  20. Definition · supporting · Definition and examples

    Formalized

    Formalized: Mathlib states this up to a convention difference (a definition).

    The divisors of a natural number ⁠ n ⁠ are the natural numbers that divide ⁠ n ⁠ evenly.

    Show in article · Read it in context on Wikipedia

    Nat.divisors close match

    def Nat.divisors : ℕ → Finset ℕ

    Mathlib.NumberTheory.Divisors · line 52

    Why close, not exact: Mathlib keeps the divisors as a finite set and, as its docstring records, fixes the divisor set of 0 to be empty.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key efc55598412c · pair key a4ef95f2e0d7.
  21. Theorem · supporting · Definition and examples

    Formalized

    Formalized by 2 parts together:

    1. Nat.one_dvd Lean core (proved)
      • 1 divides every natural number
    2. Nat.dvd_refl Lean core (proved)
      • every natural number divides itself
    Every natural number has both 1 and itself as a divisor.

    Show in article · Read it in context on Wikipedia

    Nat.one_dvd states part

    theorem Nat.one_dvd (n : Nat) : 1 ∣ n

    Init.Data.Nat.Dvd · line 84

    Why only part: Stated for the natural numbers the passage speaks of, with 1 as the divisor.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key b5e1f523bf3e · pair key 78e3ccbeeb76.

    Nat.dvd_refl states part

    theorem Nat.dvd_refl (a : Nat) : a ∣ a

    Init.Data.Nat.Dvd · line 19

    Why only part: Stated for the natural numbers the passage speaks of, with the number as its own divisor.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 5527de2fad5d · pair key 2978458e617e.
  22. Theorem · supporting · Definition and examples

    Formalized

    Formalized, by a community edit: Mathlib states this up to a convention difference (proved).

    If it has any other divisor, it cannot be prime.

    Show in article · Read it in context on Wikipedia

    Nat.not_prime_of_dvd_of_lt close match

    theorem Nat.not_prime_of_dvd_of_lt {m n : ℕ} : m ∣ n → 2 ≤ m → m < n → ¬Nat.Prime n

    Mathlib.Data.Nat.Prime.Basic · lines 76–77

    Community Agent The pipeline said exact match; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.

    Why close, not exact: The passage says a divisor other than 1 and the number rules out primality. This lemma asks instead for a divisor m with 2 ≤ m < n. For n > 0 the two conditions agree, but for n = 0 they do not, and 0 is not prime anyway. Mathlib's exact form, with m ≠ 1 and m ≠ n, is Nat.not_prime_of_dvd_of_ne in the same file.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key d404d0647fa7 · pair key 86dddca3e843.

    Nat.Prime.eq_one_or_self_of_dvd exact match

    theorem Nat.Prime.eq_one_or_self_of_dvd {p : ℕ} : Nat.Prime p → ∀ (m : ℕ), m ∣ p → m = 1 ∨ m = p

    Mathlib.Data.Nat.Prime.Defs · lines 88–95

    Note: Mathlib writes the same fact the other way round: a divisor of a prime is 1 or the prime itself, so a number with any further divisor is not prime.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 17c96b572b8a · pair key 63cd09fbcf0b.
  23. Definition · main statement · Definition and examples

    Partial

    Partial: Mathlib states this up to a convention difference, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.

    This leads to an equivalent definition of prime numbers: they are the numbers with exactly two positive divisors.

    Show in article · Read it in context on Wikipedia

    Nat.properDivisors_eq_singleton_one_iff_prime close match

    theorem Nat.properDivisors_eq_singleton_one_iff_prime {n : ℕ} : n.properDivisors = {1} ↔ Nat.Prime n

    Mathlib.NumberTheory.Divisors · lines 476–481

    Why close, not exact: Mathlib writes the divisor count through the set of divisors below the number, which is {1} just when 1 and the number itself are its positive divisors.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 966d40677965 · pair key 97d14bd0f477.
  24. Theorem · supporting · Definition and examples

    Formalized

    Formalized: Mathlib states this exactly (proved).

    Those two are 1 and the number itself.

    Show in article · Read it in context on Wikipedia

    Nat.Prime.divisors exact match

    theorem Nat.Prime.divisors {p : ℕ} : Nat.Prime p → p.divisors = {1, p}

    Mathlib.NumberTheory.Divisors · lines 412–414

    Note: Mathlib's divisor set collects the positive divisors, and the theorem equates it with the pair consisting of 1 and the prime.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 5e001bf79cdb · pair key b18b31bb6586.
  25. Theorem · supporting · Definition and examples

    Partial

    Partial: Mathlib states part of this (proved).

    As 1 has only one divisor, itself, it is not prime by this definition.[5]

    Show in article · Read it in context on Wikipedia

    Nat.not_prime_one states part

    theorem Nat.not_prime_one : ¬Nat.Prime 1

    Mathlib.Data.Nat.Prime.Defs · lines 57–58

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 445798c78498 · pair key bf97a60b7005.

    Nat.divisors_one states part

    theorem Nat.divisors_one : Nat.divisors 1 = {1}

    Mathlib.NumberTheory.Divisors · lines 265–267

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 8edd77350ade · pair key cba9f977e20d.

    Nat.divisors_card_eq_one_iff states part

    theorem Nat.divisors_card_eq_one_iff (n : ℕ) : n.divisors.card = 1 ↔ n = 1

    Mathlib.NumberTheory.ArithmeticFunction.Misc · lines 229–233

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 2f9f644ea774 · pair key b7fe6757fb29.
  26. Definition · supporting · Definition and examples

    Partial

    Partial: Mathlib states this exactly, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.

    Yet another way to express the same thing is that a number ⁠ n ⁠ is prime if it is greater than one and if none of the numbers 2, 3, …, n − 1 divides ⁠ n ⁠ evenly.

    Show in article · Read it in context on Wikipedia

    Nat.prime_def_lt' exact match

    theorem Nat.prime_def_lt' {p : ℕ} : Nat.Prime p ↔ 2 ≤ p ∧ ∀ (m : ℕ), 2 ≤ m → m < p → ¬m ∣ p

    Mathlib.Data.Nat.Prime.Defs · lines 114–122

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 9874cbb45fa7 · pair key fbe464a571eb.

    Nat.prime_def_lt close match

    theorem Nat.prime_def_lt {p : ℕ} : Nat.Prime p ↔ 2 ≤ p ∧ ∀ m < p, m ∣ p → m = 1

    Mathlib.Data.Nat.Prime.Defs · lines 107–112

    Why close, not exact: Mathlib encodes the trial-division condition as: every divisor of n that is below n equals one.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key ed43598e347e · pair key b65d7943c5fd.
  27. Example · supporting · Definition and examples

    Partial

    Partial: Formal Conjectures states part of this (proved).

    The first 25 prime numbers (all the prime numbers less than 100) are:[7]
    2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97 (sequence A000040 in the OEIS).

    Show in article · Read it in context on Wikipedia

    OeisA100474.nth_prime_thirteen states part

    theorem OeisA100474.nth_prime_thirteen : Nat.nth Nat.Prime 13 = 43

    FormalConjectures.OEIS.«100474» · lines 86–88

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 767b356674d7 · pair key f204dec61ceb.

    OeisA100474.nth_prime_twelve states part

    theorem OeisA100474.nth_prime_twelve : Nat.nth Nat.Prime 12 = 41

    FormalConjectures.OEIS.«100474» · lines 81–83

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 017320f54023 · pair key d3bc2e5b5823.

    OeisA100474.nth_prime_eleven states part

    theorem OeisA100474.nth_prime_eleven : Nat.nth Nat.Prime 11 = 37

    FormalConjectures.OEIS.«100474» · lines 76–78

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key c466693fdf2b · pair key 774972c4009b.

    OeisA100474.nth_prime_ten states part

    theorem OeisA100474.nth_prime_ten : Nat.nth Nat.Prime 10 = 31

    FormalConjectures.OEIS.«100474» · lines 71–73

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key aa5a640b5238 · pair key 47a1576ff9af.

    OeisA100474.nth_prime_nine states part

    theorem OeisA100474.nth_prime_nine : Nat.nth Nat.Prime 9 = 29

    FormalConjectures.OEIS.«100474» · lines 66–68

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 5 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 90172ea55298 · pair key f2ee56c086ed.
  28. Theorem · supporting · Definition and examples

    Formalized

    Formalized: Mathlib states a more general result (proved).

    No even number ⁠ n ⁠ greater than 2 is prime because any such number can be expressed as the product ⁠ 2 × n/2 ⁠.

    Show in article · Read it in context on Wikipedia

    Nat.Prime.even_iff more general

    theorem Nat.Prime.even_iff {p : ℕ} : Nat.Prime p → (Even p ↔ p = 2)

    Mathlib.Data.Nat.Prime.Basic · lines 96–97

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 83d81a5128da · pair key 280f810eb8c2.

    Nat.not_prime_of_dvd_of_lt more general

    theorem Nat.not_prime_of_dvd_of_lt {m n : ℕ} : m ∣ n → 2 ≤ m → m < n → ¬Nat.Prime n

    Mathlib.Data.Nat.Prime.Basic · lines 76–77

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 5edf9e93080a · pair key 622aaf2ad3ec.
  29. Theorem · supporting · Definition and examples

    Formalized

    Formalized: Mathlib states a more general result (proved).

    No even number ⁠ n ⁠ greater than 2 is prime because any such number can be expressed as the product ⁠ 2 × n/2 ⁠.

    Show in article · Read it in context on Wikipedia

    Nat.two_mul_div_two_of_even more general

    theorem Nat.two_mul_div_two_of_even {n : ℕ} : Even n → 2 * (n / 2) = n

    Mathlib.Algebra.Group.Nat.Even · lines 73–74

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 7dcf8f16013c · pair key 4c70ecdcee96.

    Nat.div_two_mul_two_of_even more general

    theorem Nat.div_two_mul_two_of_even {n : ℕ} : Even n → n / 2 * 2 = n

    Mathlib.Algebra.Group.Nat.Even · lines 76–77

    Why more general: Mathlib writes the product with the half as the left factor.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key b617aff02688 · pair key 000dfdcb7432.
  30. Theorem · supporting · Definition and examples

    Formalized

    Formalized: Mathlib states this exactly (proved).

    Therefore, every prime number other than 2 is an odd number, and is called an odd prime.[8]

    Show in article · Read it in context on Wikipedia

    Nat.Prime.odd_of_ne_two exact match

    theorem Nat.Prime.odd_of_ne_two {p : ℕ} : Nat.Prime p → p ≠ 2 → Odd p

    Mathlib.Data.Nat.Prime.Basic · lines 103–104

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 36e7af955127 · pair key 46b7d715f7df.

    Nat.Prime.eq_two_or_odd' more general

    theorem Nat.Prime.eq_two_or_odd' {p : ℕ} : Nat.Prime p → p = 2 ∨ Odd p

    Mathlib.Data.Nat.Prime.Basic · lines 45–46

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 7e2ad30df02f · pair key 0077ce325a3d.
  31. Theorem · supporting · Definition and examples

    Not formalized
    Similarly, when written in the usual decimal system, all prime numbers larger than 5 end in 1, 3, 7, or 9.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 2073af07ac2d).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  32. Theorem · supporting · Definition and examples

    Not formalized
    The numbers that end with other digits are all composite: decimal numbers that end in 0, 2, 4, 6, or 8 are even, and decimal numbers that end in 0 or 5 are divisible by 5.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt f9685e44acd5).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  33. Theorem · supporting · Definition and examples

    Formalized

    Formalized: Mathlib states a more general result (proved).

    The numbers that end with other digits are all composite: decimal numbers that end in 0, 2, 4, 6, or 8 are even, and decimal numbers that end in 0 or 5 are divisible by 5.

    Show in article · Read it in context on Wikipedia

    Nat.dvd_iff_dvd_ofDigits more general

    theorem Nat.dvd_iff_dvd_ofDigits (b b' : ℕ) (c : ℤ) : ↑b ∣ ↑b' - c → ∀ (n : ℕ), b ∣ n ↔ ↑b ∣ Nat.ofDigits c (b'.digits n)

    Mathlib.Data.Nat.Digits.Div · lines 51–55

    Why more general: Mathlib writes the final decimal digit as Nat.ofDigits applied at zero to the base-ten digit list, and writes parity as divisibility by two.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key f4c37f5ec839 · pair key 64f9f1186c58.
  34. Theorem · supporting · Definition and examples

    Formalized

    Formalized: Mathlib states a more general result (proved).

    The numbers that end with other digits are all composite: decimal numbers that end in 0, 2, 4, 6, or 8 are even, and decimal numbers that end in 0 or 5 are divisible by 5.

    Show in article · Read it in context on Wikipedia

    Nat.dvd_iff_dvd_ofDigits more general

    theorem Nat.dvd_iff_dvd_ofDigits (b b' : ℕ) (c : ℤ) : ↑b ∣ ↑b' - c → ∀ (n : ℕ), b ∣ n ↔ ↑b ∣ Nat.ofDigits c (b'.digits n)

    Mathlib.Data.Nat.Digits.Div · lines 51–55

    Why more general: Mathlib writes the final decimal digit as Nat.ofDigits applied at zero to the base-ten digit list, and keeps divisibility by five as the article states it.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 1a8d49c540ff · pair key e0c54319e8a8.
  35. Notation · supporting · Definition and examples

    Formalized

    Formalized: Mathlib states this up to a convention difference (a definition).

    The set of all primes is sometimes denoted by P (a boldface capital P)[10] or by ℙ (a blackboard bold capital P).

    Show in article · Read it in context on Wikipedia

    Nat.Primes close match

    def Nat.Primes : Type

    Mathlib.Data.Nat.Prime.Defs · lines 438–440

    Why close, not exact: Mathlib carries the primes as a subtype of ℕ, bundling each prime with a proof of its primality, where the article speaks of a set of numbers.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 85a33d2443e7 · pair key 74e2f54c231c.
  36. Theorem · main statement · History

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    Around 1000 AD, the Islamic mathematician Ibn al-Haytham (Alhazen) found Wilson's theorem, characterizing the prime numbers as the numbers ⁠ n ⁠ that evenly divide ⁠ (n − 1)! + 1 ⁠.

    Show in article · Read it in context on Wikipedia

    Nat.prime_iff_fac_equiv_neg_one close match

    theorem Nat.prime_iff_fac_equiv_neg_one {n : ℕ} : n ≠ 1 → (Nat.Prime n ↔ ↑(n - 1).factorial = -1)

    Mathlib.NumberTheory.Wilson · lines 128–131

    Why close, not exact: Lean records the congruence as an equation with value −1 in ZMod n where the article divides the factorial plus one, and it puts n = 1 aside, the unit case in which division by one always succeeds.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key a41472eec02d · pair key 13b0acd24c84.

    ZMod.wilsons_lemma states part

    theorem ZMod.wilsons_lemma (p : ℕ) [Fact (Nat.Prime p)] : ↑(p - 1).factorial = -1

    Mathlib.NumberTheory.Wilson · lines 62–87

    Why only part: It assumes primality through a Fact instance and concludes the congruence, so it carries the forward half of the article's characterization.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key f874d06cfead · pair key 7f5ae82c738a.
  37. Conjecture · supporting · History

    Formalized

    Formalized: ATLAS (atlas-lean) states this exactly (proved).

    He also conjectured that all even perfect numbers come from Euclid's construction using Mersenne primes, but was unable to prove it.[16]

    Show in article · Read it in context on Wikipedia

    MetaMathlibExt.euler_characterization_of_even_perfect_numbers exact match

    theorem MetaMathlibExt.euler_characterization_of_even_perfect_numbers (N : ℕ) : Even N → N.Perfect → ∃ p, Nat.Prime p ∧ Nat.Prime (2 ^ p - 1) ∧ N = 2 ^ (p - 1) * (2 ^ p - 1)

    MathlibExt.NumberTheory.EvenPerfectNumbers · line 46

    Note: The declaration writes Euclid's construction out as the product of a power of two with the Mersenne prime, and requires the exponent to be prime as the article's Mersenne primes do.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key 41df891910f5 · pair key 3f9d69b5ca40.
  38. Definition · main statement · History

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    Fermat also investigated the primality of the Fermat numbers ⁠ 22n + 1 ⁠,[18] and Marin Mersenne studied the Mersenne primes, prime numbers of the form 2p − 1 with ⁠ p ⁠ itself a prime.[19]

    Show in article · Read it in context on Wikipedia

    mersenne more general

    def mersenne : ℕ → ℕ

    Mathlib.NumberTheory.LucasLehmer · lines 39–40

    Why more general: Mathlib's object is the Mersenne number 2^p − 1 at every exponent, and the article's Mersenne primes are those of its values that are prime at a prime exponent.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key cdd7645b9438 · pair key b87c464b9624.
  39. Conjecture · main statement · History

    Statement only

    With community edits: Statement only. As published it is Partial.

    Statement only, by a community edit: Formal Conjectures states this up to a convention difference (statement only: the proof is not finished).

    Christian Goldbach formulated Goldbach's conjecture, that every even number is the sum of two primes, in a 1742 letter to Euler.[20]

    Show in article · Read it in context on Wikipedia

    GoldbachConjecture.goldbach close match

    theorem GoldbachConjecture.goldbach (n : ℕ) : 2 < n → Even n → ∃ p q, Prime p ∧ Prime q ∧ n = p + q

    FormalConjectures.Wikipedia.GoldbachConjecture · lines 36–38

    Community Agent The pipeline said special case; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 10 Nov 2026.

    Why close, not exact: States Goldbach's conjecture, which the passage names: every even number greater than 2 is the sum of two primes. The convention difference is the bound: the declaration asks only about even naturals greater than 2, the standard form of the conjecture (0 and 2 are not sums of two primes), while the article's informal wording names no bound. Primality uses the general Prime predicate, which is equivalent to Nat.Prime on the naturals.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 7f78883bdc8d · pair key fb7b883ced75.
  40. Theorem · main statement · History

    Formalized

    Formalized: ATLAS (atlas-lean) states this exactly (proved).

    Euler proved Alhazen's conjecture (now the Euclid–Euler theorem) that all even perfect numbers can be constructed from Mersenne primes.[13]

    Show in article · Read it in context on Wikipedia

    MetaMathlibExt.euler_characterization_of_even_perfect_numbers exact match

    theorem MetaMathlibExt.euler_characterization_of_even_perfect_numbers (N : ℕ) : Even N → N.Perfect → ∃ p, Nat.Prime p ∧ Nat.Prime (2 ^ p - 1) ∧ N = 2 ^ (p - 1) * (2 ^ p - 1)

    MathlibExt.NumberTheory.EvenPerfectNumbers · line 46

    Note: The declaration writes the construction out as a power of two times the Mersenne prime, with the exponent required to be prime as the article's Mersenne primes are.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key aefbea6c01f1 · pair key 7d21b4b2a309.
  41. Theorem · supporting · History

    Partial

    With community edits: Partial. As published it is Formalized.

    Partial, by a community edit: Mathlib states part of this (proved).

    He introduced methods from mathematical analysis to this area in his proofs of the infinitude of the primes and the divergence of the sum of the reciprocals of the primes ⁠ 12 + 13 + 15 + 17 + 111 + ⋯ ⁠.[21]

    Show in article · Read it in context on Wikipedia

    Nat.Primes.not_summable_one_div states part

    theorem Nat.Primes.not_summable_one_div : ¬Summable fun p ↦ 1 / ↑↑p

    Mathlib.NumberTheory.SumPrimeReciprocals · lines 124–125

    Community Agent The pipeline said exact match; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.

    Why only part: The passage names two results proved by analytic methods: there are infinitely many primes, and the sum of the reciprocals of the primes diverges. This declaration states the second, as the failure of summability of 1/p over the primes. Infinitude follows from it but is not what it states.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 232782dc8f0b · pair key 09e6c1de451f.

    not_summable_one_div_on_primes states part

    theorem not_summable_one_div_on_primes : ¬Summable ({p | Nat.Prime p}.indicator fun n ↦ 1 / ↑n)

    Mathlib.NumberTheory.SumPrimeReciprocals · lines 102–120

    Community Agent The pipeline said close match; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.

    Why only part: The passage names two results proved by analytic methods: there are infinitely many primes, and the sum of the reciprocals of the primes diverges. This declaration states the second, as a sub-sum of the harmonic series, using the indicator of the primes so that non-prime terms are zero. Infinitude follows from it but is not what it states.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key b2249617647c · pair key 0b74bd21c1fe.
  42. Conjecture · main statement · History

    Partial

    Partial: ATLAS (atlas-lean) states a special case (proved).

    At the start of the 19th century, Legendre and Gauss conjectured that as ⁠ x ⁠ tends to infinity, the number of primes up to ⁠ x ⁠ is asymptotic to ⁠ x/log x ⁠, where log x is the natural logarithm of ⁠ x ⁠.

    Show in article · Read it in context on Wikipedia

    MathlibExt.NumberTheory.PrimeNumberTheoremWanted.prime_number_theorem special case

    theorem MathlibExt.NumberTheory.PrimeNumberTheoremWanted.prime_number_theorem : Asymptotics.IsEquivalent Filter.atTop (fun n ↦ ↑n.primeCounting) fun n ↦ ↑n / Real.log ↑n

    MathlibExt.NumberTheory.PrimeNumberTheorem · line 183

    Why a special case: The declaration runs the limit through natural arguments, casting the count and the argument into the reals; the counting function is constant between consecutive integers, so this records the same growth the passage describes.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key 75a855fcc0bf · pair key 1062c9f1b1cf.
  43. Theorem · main statement · History

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    A weaker consequence of this high density of primes was Bertrand's postulate, that for every n > 1 there is a prime between ⁠ n ⁠ and ⁠ 2n ⁠, proved in 1852 by Pafnuty Chebyshev.[22]

    Show in article · Read it in context on Wikipedia

    Nat.bertrand close match

    theorem Nat.bertrand (n : ℕ) : n ≠ 0 → ∃ p, Nat.Prime p ∧ n < p ∧ p ≤ 2 * n

    Mathlib.NumberTheory.Bertrand · line 243

    Why close, not exact: The declaration writes the upper bound without strictness, as a prime at most twice n; for n above 1 the endpoint twice n is even and larger than 2, so the primes it allows are the ones the passage describes.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 8ca85731925a · pair key ef36e506367a.

    MathlibExt.NumberTheory.BreuschWanted.ramanujan_two_primes_between special case

    theorem MathlibExt.NumberTheory.BreuschWanted.ramanujan_two_primes_between (n : ℕ) : 6 ≤ n → ∃ p q, Nat.Prime p ∧ Nat.Prime q ∧ n < p ∧ p < q ∧ q < 2 * n

    MathlibExt.NumberTheory.PrimeInterval.RamanujanTwoPrimes · line 29

    Why a special case: It assumes n is at least 6 and produces two primes, so it covers the passage's claim only from that point on.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key da80195ede85 · pair key f0f8fa35a981.

    Nat.exists_prime_lt_and_le_two_mul_eventually special case

    theorem Nat.exists_prime_lt_and_le_two_mul_eventually (n : ℕ) : 512 ≤ n → ∃ p, Nat.Prime p ∧ n < p ∧ p ≤ 2 * n

    Mathlib.NumberTheory.Bertrand · lines 199–210

    Why a special case: It assumes n is at least 512, so it settles only the tail of the range of n the passage speaks about.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key d91bc297508f · pair key f106abdc73b6.
  44. Theorem · main statement · History

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    Another important 19th century result was Dirichlet's theorem on arithmetic progressions, that certain arithmetic progressions contain infinitely many primes.

    Show in article · Read it in context on Wikipedia

    Nat.forall_exists_prime_gt_and_modEq close match

    theorem Nat.forall_exists_prime_gt_and_modEq (n : ℕ) {q a : ℕ} : q ≠ 0 → a.Coprime q → ∃ p > n, Nat.Prime p ∧ p ≡ a [MOD q]

    Mathlib.NumberTheory.LSeries.PrimesInAP · lines 463–465

    Why close, not exact: The declaration records containing infinitely many primes as the existence of a prime past every bound in the class, with membership written as a congruence of naturals.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 30a3cfe5f953 · pair key 45d235c6b023.

    Nat.infinite_setOf_prime_and_eq_mod close match

    theorem Nat.infinite_setOf_prime_and_eq_mod {q : ℕ} [NeZero q] {a : ZMod q} : IsUnit a → {p | Nat.Prime p ∧ ↑p = a}.Infinite

    Deprecated at this commit, in favour of Nat.infinite_setOfPred_prime_and_eq_mod.

    Mathlib.NumberTheory.LSeries.PrimesInAP · line 438

    Why close, not exact: The declaration writes the residue class in the ring of integers modulo q and asks the residue to be invertible there in place of a coprimality condition.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 4146a3a480d3 · pair key b8836c1e88f3.
  45. Theorem · main statement · History

    Statement only

    Stated by 2 parts together (more general), not all of them finished:

    1. Erdos219.erdos_219 Formal Conjectures (statement only)
      • the primes contain arithmetic progressions of every finite length
    2. WantedExt.NumberTheory.PrimeGapBounds.zhang2014UpperBound ATLAS (wanted)
      • infinitely many consecutive prime pairs have gap below a fixed bound
    The mathematical theory of prime numbers also moved forward with the Green–Tao theorem (2004) that there are arbitrarily long arithmetic progressions of prime numbers, and Yitang Zhang's 2013 proof that there exist infinitely many prime gaps of bounded size.

    Show in article · Read it in context on Wikipedia

    Erdos219.erdos_219 states part

    theorem Erdos219.erdos_219 (N : ℕ) : ∃ l ∈ Erdos219.primeArithmeticProgressions, ↑N ≤ ENat.card ↑l

    FormalConjectures.ErdosProblems.«219» · lines 80–81

    Why only part: The declaration measures a progression's length as a lower bound on its cardinality and quantifies that over every N.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 892c6ff3bc6a · pair key dc27a0b495b7.

    WantedExt.NumberTheory.PrimeGapBounds.zhang2014UpperBound states part

    theorem WantedExt.NumberTheory.PrimeGapBounds.zhang2014UpperBound : MathlibExt.NumberTheory.primeGapLiminf ≤ 70000000

    WantedExt.NumberTheory.PrimeGapBoundsWanted · line 34

    Why only part: The bound is recorded as an inequality on the lower limit of the gap sequence with Zhang's explicit constant in place of an unnamed bound.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key 0238783116ae · pair key 00050003be7d.
  46. Definition · main statement · Elementary properties › Unique factorization

    Formalized

    Formalized: Mathlib states this up to a convention difference (a definition).

    Writing a number as a product of prime numbers is called a prime factorization of the number.

    Show in article · Read it in context on Wikipedia

    Nat.primeFactorsList close match

    def Nat.primeFactorsList : ℕ → List ℕ

    Mathlib.Data.Nat.Factors · lines 38–44

    Why close, not exact: The library's object is the data the passage names: the primes whose product is the number, arranged in increasing order so that one arrangement is picked out.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key f444593fec7b · pair key 306b19679102.

    Nat.prod_primeFactorsList states part

    theorem Nat.prod_primeFactorsList {n : ℕ} : n ≠ 0 → n.primeFactorsList.prod = n

    Mathlib.Data.Nat.Factors · lines 70–81

    Community Agent The pipeline said close match; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.

    Why only part: This is a theorem about Mathlib's canonical factorization list, not the definition of a prime factorization. It proves one part of what the passage describes: for nonzero n, multiplying the entries of Nat.primeFactorsList n gives back n. That the entries are prime is a separate lemma, Nat.prime_of_mem_primeFactorsList. The definition itself is Nat.primeFactorsList.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 841e7b7ca3e2 · pair key 0d7724920d1c.
  47. Example · supporting · Elementary properties › Unique factorization

    Formalized

    Formalized: Mathlib states a more general result (proved).

    For example: 50= 2 × 5 × 5= 2 × 52.

    Show in article · Read it in context on Wikipedia

    Nat.prod_primeFactorsList more general

    theorem Nat.prod_primeFactorsList {n : ℕ} : n ≠ 0 → n.primeFactorsList.prod = n

    Mathlib.Data.Nat.Factors · lines 70–81

    Why more general: The declaration states the product property for every nonzero number, so the passage's number is one case of it, reached by evaluating the list at 50.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key c8c70671a3f3 · pair key 8b492f93ee56.
  48. Definition · supporting · Elementary properties › Unique factorization

    Formalized

    Formalized: Mathlib states this up to a convention difference (a definition).

    The terms in the product are called prime factors.

    Show in article · Read it in context on Wikipedia

    Nat.primeFactors close match

    def Nat.primeFactors : ℕ → Finset ℕ

    Mathlib.Data.Nat.PrimeFin · line 37

    Why close, not exact: The declaration gathers the primes occurring in the factorization into a finset, so each of them is named once however often it occurs in the product.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 450f8002e258 · pair key be84cbaa7a4e.

    Nat.primeFactorsList close match

    def Nat.primeFactorsList : ℕ → List ℕ

    Mathlib.Data.Nat.Factors · lines 38–44

    Why close, not exact: The declaration lists the primes of the factorization in increasing order, repeating one as often as it occurs in the product.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 60707aca3611 · pair key 0a76efff85a9.
  49. Theorem · supporting · Elementary properties › Unique factorization

    Formalized

    Formalized: Mathlib states a more general result (proved).

    The same prime factor may occur more than once; this example has two copies of the prime factor 5. When a prime occurs multiple times, exponentiation can be used to group together multiple copies of the same prime number: for example, in the second way of writing the product above, 52 denotes the square or second power of…

    Show in article · Read it in context on Wikipedia

    Nat.Prime.factorization_pow more general

    theorem Nat.Prime.factorization_pow {p k : ℕ} : Nat.Prime p → (p ^ k).factorization = fun₀ | p => k

    Mathlib.Data.Nat.Factorization.Defs · lines 238–239

    Why more general: Lean records a factorization as a finitely supported exponent function, and this says that in the kth power of a prime that prime carries exponent k.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key d0afd51e3e14 · pair key 9618a5973419.
  50. Example · supporting · Elementary properties › Unique factorization

    Not formalized
    The same prime factor may occur more than once; this example has two copies of the prime factor 5. When a prime occurs multiple times, exponentiation can be used to group together multiple copies of the same prime number: for example, in the second way of writing the product above, 52 denotes the square or second power of ⁠ 5 ⁠.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt b0f809ee1879).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  51. Notation · supporting · Elementary properties › Unique factorization

    Formalized

    Formalized: Mathlib states this up to a convention difference (a definition).

    The same prime factor may occur more than once; this example has two copies of the prime factor 5. When a prime occurs multiple times, exponentiation can be used to group together multiple copies of the same prime number: for example, in the second way of writing the product above, 52 denotes the square or second power of ⁠ 5 ⁠.

    Show in article · Read it in context on Wikipedia

    Nat.prod_primeFactors_pow_factorization close match

    theorem Nat.prod_primeFactors_pow_factorization {n : ℕ} : n ≠ 0 → n = ∏ p ∈ n.primeFactors, p ^ n.factorization p

    Mathlib.Data.Nat.Factorization.Basic · lines 482–484

    Why close, not exact: Lean writes the factorization with one factor for each distinct prime, each raised to the number of its copies, which is the grouped exponent form the passage introduces.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 783b8d20f4a0 · pair key 98cf50180d41.

    Nat.factorization close match

    def Nat.factorization : ℕ → ℕ →₀ ℕ

    Mathlib.Data.Nat.Factorization.Defs · lines 51–52

    Why close, not exact: Lean collects the exponents of all primes of a number into one finitely supported function instead of writing them one at a time next to each prime.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key a450ae14059c · pair key 859ed703c520.
  52. Theorem · main statement · Elementary properties › Unique factorization

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    Formalized by 2 parts together (more general):

    1. UniqueFactorizationMonoid.exists_prime_factors Mathlib (proved)
      • every integer above 1 is a product of one or more primes
    2. Nat.primeFactorsList_unique Mathlib (proved)
      • two prime factorizations of one number agree in the multiplicity of each prime
    This theorem states that every integer larger than 1 can be written as a product of one or more primes. More strongly, this product is unique in the sense that any two prime factorizations of the same number will have the same numbers of copies of the same primes, although their ordering may differ.[48]

    Show in article · Read it in context on Wikipedia

    Nat.instUniqueFactorizationMonoid close match

    instance Nat.instUniqueFactorizationMonoid : UniqueFactorizationMonoid ℕ

    Mathlib.RingTheory.UniqueFactorizationDomain.Nat · lines 43–44

    Why close, not exact: Mathlib's class of unique factorization is asserted of ℕ, and the library documents its fields as unfolding to the existence of a prime factorization of each nonzero natural number together with the agreement of any two of them.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key f885847d9499 · pair key 48033a480181.

    UniqueFactorizationMonoid.exists_prime_factors states part

    theorem UniqueFactorizationMonoid.exists_prime_factors {α : Type*} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] (a : α) : a ≠ 0 → ∃ f, (∀ b ∈ f, Prime b) ∧ Associated f.prod a

    Mathlib.RingTheory.UniqueFactorizationDomain.Defs · lines 150–153

    Why only part: Stated for any monoid with unique factorization and used here at ℕ, where being associated is being equal and Mathlib's Prime agrees with Nat.Prime; the passage's integers above one are exactly the naturals above one.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 0aeb60eb2617 · pair key ce8615d44d32.

    Nat.primeFactorsList_unique states part

    theorem Nat.primeFactorsList_unique {n : ℕ} {l : List ℕ} : l.prod = n → (∀ p ∈ l, Nat.Prime p) → l.Perm n.primeFactorsList

    Mathlib.Data.Nat.Factors · lines 168–179

    Why only part: Lean states this over ℕ and compares a factorization with the canonical list it computes rather than with a second factorization; the passage's integers above one are exactly the naturals above one, so the ℕ binders cover every case it asserts.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 27ec08257e02 · pair key b8e550640e12.
  53. Theorem · main statement · Elementary properties › Unique factorization

    Formalized

    Formalized: Mathlib states this exactly (proved).

    Some proofs of the uniqueness of prime factorizations are based on Euclid's lemma: If ⁠ p ⁠ is a prime number and ⁠ p ⁠ divides a product ab of integers ⁠ a ⁠ and b, then ⁠ p ⁠ divides ⁠ a ⁠ or ⁠ p ⁠ divides ⁠ b ⁠ (or both).[50]

    Show in article · Read it in context on Wikipedia

    Int.Prime.dvd_mul' exact match

    theorem Int.Prime.dvd_mul' {m n : ℤ} {p : ℕ} : Nat.Prime p → ↑p ∣ m * n → ↑p ∣ m ∨ ↑p ∣ n

    Mathlib.RingTheory.Int.Basic · lines 73–76

    Note: Lean takes the prime as a natural number cast into ℤ and the two factors as arbitrary integers, exactly as the passage does.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key ca9feffe94fa · pair key ef65b84cdf0d.

    Nat.Prime.dvd_mul special case

    theorem Nat.Prime.dvd_mul {p m n : ℕ} : Nat.Prime p → (p ∣ m * n ↔ p ∣ m ∨ p ∣ n)

    Mathlib.Data.Nat.Prime.Defs · lines 417–419

    Why a special case: Stated over ℕ, where the passage allows the two factors to be any integers.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 9ad6d715f184 · pair key cfd793e77587.
  54. Theorem · main statement · Elementary properties › Unique factorization

    Formalized

    Formalized: Mathlib states a more general result (proved).

    Conversely, if a number ⁠ p ⁠ has the property that when it divides a product it always divides at least one factor of the product, then ⁠ p ⁠ must be prime.

    Show in article · Read it in context on Wikipedia

    Nat.prime_iff more general

    theorem Nat.prime_iff {p : ℕ} : Nat.Prime p ↔ Prime p

    Mathlib.Data.Nat.Prime.Defs · lines 423–424

    Why more general: Lean states the equivalence between being prime and the notion defined by the dividing-a-factor property over ℕ, and the passage uses one half of it; the values zero and one that Mathlib's notion sets aside are outside what the section calls a number here.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 5a3f1564e1a8 · pair key 8614da218e3f.
  55. Theorem · main statement · Elementary properties › Infinitude

    Formalized

    Formalized: Mathlib states this exactly (proved).

    There are infinitely many prime numbers.

    Show in article · Read it in context on Wikipedia

    Nat.infinite_setOf_prime exact match

    theorem Nat.infinite_setOf_prime : {p | Nat.Prime p}.Infinite

    Deprecated at this commit, in favour of Nat.infinite_setOfPred_prime.

    Mathlib.Data.Nat.PrimeFin · line 30

    Note: Lean names the primes as the natural numbers satisfying Nat.Prime and asserts that this collection is infinite.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key a9b1bbfca995 · pair key 13754c5df9c7.

    Nat.exists_infinite_primes close match

    theorem Nat.exists_infinite_primes (n : ℕ) : ∃ p, n ≤ p ∧ Nat.Prime p

    Mathlib.Data.Nat.Prime.Infinite · lines 36–45

    Why close, not exact: Lean writes the same fact as the existence of a prime at least as large as any given natural number rather than as a statement about the size of a collection.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 4a57d25e94f1 · pair key f4bf15722636.
  56. Theorem · main statement · Elementary properties › Infinitude

    Formalized

    Formalized: ATLAS (atlas-lean) states this up to a convention difference (proved).

    Another way of saying this is that the sequence 2, 3, 5, 7, 11, 13, ...

    Show in article · Read it in context on Wikipedia

    MetaMathlibExt.bonse_nth_strictMono close match

    theorem MetaMathlibExt.bonse_nth_strictMono : StrictMono (Nat.nth Prime)

    MathlibExt.NumberTheory.BonseInequality · line 34

    Why close, not exact: Lean indexes the primes in increasing order by position and states that this indexing increases at every position, which is how the never-ending increasing listing is written there.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key f080374a4d02 · pair key eb7808af396f.

    Nat.infinite_setOf_prime close match

    theorem Nat.infinite_setOf_prime : {p | Nat.Prime p}.Infinite

    Deprecated at this commit, in favour of Nat.infinite_setOfPred_prime.

    Mathlib.Data.Nat.PrimeFin · line 30

    Why close, not exact: Lean states the size of the collection of primes rather than the behaviour of the increasing listing that the passage writes out.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 1015392f5d4b · pair key 0a70653476cd.
  57. Theorem · supporting · Elementary properties › Infinitude

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    Euclid's proof shows that every finite list of primes is incomplete.[56]

    Show in article · Read it in context on Wikipedia

    Nat.infinite_setOf_prime close match

    theorem Nat.infinite_setOf_prime : {p | Nat.Prime p}.Infinite

    Deprecated at this commit, in favour of Nat.infinite_setOfPred_prime.

    Mathlib.Data.Nat.PrimeFin · line 30

    Why close, not exact: Lean writes the fact as the non-finiteness of the set of prime naturals, where the passage writes it as no finite list holding them all.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key bd1cddb9189a · pair key fa7a9c389fa0.
  58. Construction · supporting · Elementary properties › Infinitude

    Partial

    Partial: Formal Conjectures states a special case (a definition).

    The key idea is to multiply together the primes in any given list and add 1. If the list consists of the primes p1, p2, …, pn, this gives the number N = 1 + p1 ⋅ p2⋯pn.

    Show in article · Read it in context on Wikipedia

    EuclidNumbers.Euclid special case

    def EuclidNumbers.Euclid : ℕ → ℕ

    FormalConjectures.Wikipedia.Euclid · line 33

    Why a special case: The library fixes the list to the first n primes rather than letting an arbitrary finite list of primes be given.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 3cfa1c5f08f0 · pair key e3fec5e15c9e.
  59. Theorem · supporting · Elementary properties › Infinitude

    Partial

    Partial: Mathlib states part of this (proved).

    By the fundamental theorem of arithmetic, ⁠ N ⁠ has a prime factorization N = p′1 ⋅ p′2⋯p′m with one or more prime factors. ⁠ N ⁠ is evenly divisible by each of these factors, but ⁠ N ⁠ has a remainder of one when divided by any of the prime numbers in the given list, so none of the prime factors of ⁠ N ⁠ can be in the given list.

    Show in article · Read it in context on Wikipedia

    Nat.prod_primeFactorsList states part

    theorem Nat.prod_primeFactorsList {n : ℕ} : n ≠ 0 → n.primeFactorsList.prod = n

    Mathlib.Data.Nat.Factors · lines 70–81

    Why only part: It states the product equation and leaves the primality of the entries and their number to separate declarations.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 9a84bb79d821 · pair key a3b551baa713.

    Nat.prime_of_mem_primeFactorsList states part

    theorem Nat.prime_of_mem_primeFactorsList {n p : ℕ} : p ∈ n.primeFactorsList → Nat.Prime p

    Mathlib.Data.Nat.Factors · lines 55–65

    Why only part: It supplies the primality of the factors and says nothing about their product or their number.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key f194635cf19e · pair key 40f6ee35f69b.

    Nat.primeFactorsList_ne_nil states part

    theorem Nat.primeFactorsList_ne_nil (n : ℕ) : n.primeFactorsList ≠ [] ↔ 1 < n

    Mathlib.Data.Nat.Factors · lines 131–132

    Why only part: It settles how many factors there are and says nothing about what they multiply to.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 1f83d09890f1 · pair key a78bdc52eb30.

    UniqueFactorizationMonoid.exists_prime_factors states part

    theorem UniqueFactorizationMonoid.exists_prime_factors {α : Type*} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] (a : α) : a ≠ 0 → ∃ f, (∀ b ∈ f, Prime b) ∧ Associated f.prod a

    Mathlib.RingTheory.UniqueFactorizationDomain.Defs · lines 150–153

    Why only part: It yields the existence of a prime collection with the right product and does not say that the collection is non-empty.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 2ee623dd2333 · pair key e4463a66a026.
  60. Theorem · supporting · Elementary properties › Infinitude

    Partial

    Partial: Mathlib states part of this (proved).

    with one or more prime factors. ⁠ N ⁠ is evenly divisible by each of these factors, but ⁠ N ⁠ has a remainder of one when divided by any of the prime numbers in the given list, so none of the prime factors of ⁠ N ⁠ can be in the given list.

    Show in article · Read it in context on Wikipedia

    Nat.dvd_of_mem_primeFactorsList states part

    theorem Nat.dvd_of_mem_primeFactorsList {n p : ℕ} : p ∈ n.primeFactorsList → p ∣ n

    Mathlib.Data.Nat.Factors · lines 149–152

    Why only part: Lean proves it for an arbitrary number and its factorization list, and at N it is the conjunct.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 30b83f515565 · pair key 805d15078c27.

    List.dvd_prod states part

    theorem List.dvd_prod {M : Type*} [CommMonoid M] {a : M} {l : List M} : a ∈ l → a ∣ l.prod

    Mathlib.Algebra.BigOperators.Group.List.Lemmas · lines 152–155

    Why only part: Lean states it of any commutative monoid and any list, and over the naturals it is the conjunct.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 49c615d4d732 · pair key 19329fa580b8.
  61. Theorem · supporting · Elementary properties › Infinitude

    Not formalized
    with one or more prime factors. ⁠ N ⁠ is evenly divisible by each of these factors, but ⁠ N ⁠ has a remainder of one when divided by any of the prime numbers in the given list, so none of the prime factors of ⁠ N ⁠ can be in the given list.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 3 candidates examined (receipt 664e629ffb06).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  62. Theorem · supporting · Elementary properties › Infinitude

    Formalized

    Formalized: Mathlib states this exactly (proved).

    Because there is no finite list of all the primes, there must be infinitely many primes.

    Show in article · Read it in context on Wikipedia

    Nat.infinite_setOf_prime exact match

    theorem Nat.infinite_setOf_prime : {p | Nat.Prime p}.Infinite

    Deprecated at this commit, in favour of Nat.infinite_setOfPred_prime.

    Mathlib.Data.Nat.PrimeFin · line 30

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 045bbbda0fe8 · pair key 742f1f7be5c5.

    Nat.Primes.infinite close match

    instance Nat.Primes.infinite : Infinite Nat.Primes

    Mathlib.Data.Nat.PrimeFin · line 32

    Why close, not exact: Lean packages the primes as a subtype and records infiniteness as a class instance on it.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 10ee2fadda34 · pair key 16f957aaa6c8.

    Nat.exists_infinite_primes close match

    theorem Nat.exists_infinite_primes (n : ℕ) : ∃ p, n ≤ p ∧ Nat.Prime p

    Mathlib.Data.Nat.Prime.Infinite · lines 36–45

    Why close, not exact: Lean encodes the count by producing, for each bound, a prime at least that large.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 45564c1862b7 · pair key 43ee982fae5d.
  63. Definition · supporting · Elementary properties › Infinitude

    Formalized

    Formalized: Formal Conjectures states this up to a convention difference (a definition).

    The numbers formed by adding one to the products of the smallest primes are called Euclid numbers.[57]

    Show in article · Read it in context on Wikipedia

    EuclidNumbers.Euclid close match

    def EuclidNumbers.Euclid : ℕ → ℕ

    FormalConjectures.Wikipedia.Euclid · line 33

    Why close, not exact: Lean indexes the family by the number of leading primes multiplied and settles the empty product at index zero.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 3f36a41a4e53 · pair key 1f58fe29a27e.
  64. Theorem · supporting · Elementary properties › Infinitude

    Not formalized
    The first five of them are prime, but the sixth, 1 + (2 ⋅ 3 ⋅ 5 ⋅ 7 ⋅ 11 ⋅ 13) = 30031 = 59 ⋅ 509, is a composite number.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 4 candidates examined (receipt 9234f2451149).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  65. Theorem · supporting · Elementary properties › Formulas for primes

    Not formalized
    For example, there is no non-constant polynomial, even in several variables, that takes only prime values.[58]

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 3 candidates examined (receipt dd9213b6fa73).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  66. Construction · supporting · Elementary properties › Formulas for primes

    Not formalized
    One possible formula is based on Wilson's theorem and generates the number 2 many times and all other primes exactly once.[59]

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt c0eecb85e3c8).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  67. Theorem · supporting · Elementary properties › Formulas for primes

    Not formalized
    There is also a set of Diophantine equations in nine variables and one parameter with the following property: the parameter is prime if and only if the resulting system of equations has a solution over the natural numbers.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 0a22a7a71735).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  68. Theorem · supporting · Elementary properties › Formulas for primes

    Not formalized
    This can be used to obtain a single formula with the property that all its positive values are prime.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 2f85ff488dd1).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  69. Theorem · main statement · Elementary properties › Formulas for primes

    Partial

    Partial: Formal Conjectures states part of this (statement only: the proof is not finished).

    These assert that there are real constants A > 1 and μ such that ⌊A3n⌋ and ⌊2⋯22μ⌋ are prime for any natural number ⁠ n ⁠ in the first formula, and any number of exponents in the second formula.[60]

    Show in article · Read it in context on Wikipedia

    Mills.exists' states part

    theorem Mills.exists' : ∃ A > 1, Mills.IsMills A

    FormalConjectures.Wikipedia.Mills · lines 56–57

    Why only part: Lean runs the exponent over positive n, the indexing under which this constant's triple powers have prime floors, and asks A to exceed one as the conjunct does.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 8c435de0d087 · pair key 69966005431c.
  70. Notation · supporting · Elementary properties › Formulas for primes

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    Here ⌊ ⋅ ⌋ represents the floor function, the largest integer less than or equal to the number in question.

    Show in article · Read it in context on Wikipedia

    Int.floor more general

    def Int.floor {α : Type*} [Ring α] [LinearOrder α] [FloorRing α] : α → ℤ

    Mathlib.Algebra.Order.Floor.Defs · lines 256–257

    Why more general: Mathlib defines the bracket for every linearly ordered ring equipped with a floor, the reals among them, and returns the greatest integer below the argument.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 4a9c806299bf · pair key eeb83b88d5fd.
  71. Conjecture · main statement · Elementary properties › Open questions

    Statement only

    Statement only: Formal Conjectures states this up to a convention difference (statement only: the proof is not finished).

    One of them is Goldbach's conjecture, which asserts that every even integer ⁠ n ⁠ greater than ⁠ 2 ⁠ can be written as a sum of two primes.

    Show in article · Read it in context on Wikipedia

    GoldbachConjecture.goldbach close match

    theorem GoldbachConjecture.goldbach (n : ℕ) : 2 < n → Even n → ∃ p q, Prime p ∧ Prime q ∧ n = p + q

    FormalConjectures.Wikipedia.GoldbachConjecture · lines 36–38

    Why close, not exact: Lean quantifies over ℕ, where every integer above two already lies, and spells primality with the ring-theoretic Prime predicate, which on the naturals is primality of a number.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 7e332134715f · pair key f4e3364550dd.
  72. Theorem · supporting · Elementary properties › Open questions

    Statement only

    Statement only: Formal Conjectures states a more general result (statement only: the proof is not finished).

    As of 2014[update], this conjecture has been verified for all numbers up to n = 4 ⋅ 1018. [63] Weaker statements than this have been proven; for example, Vinogradov's theorem says that every sufficiently large odd integer can be written as a sum of three primes.

    Show in article · Read it in context on Wikipedia

    GoldbachConjecture.goldbach more general

    theorem GoldbachConjecture.goldbach (n : ℕ) : 2 < n → Even n → ∃ p q, Prime p ∧ Prime q ∧ n = p + q

    FormalConjectures.Wikipedia.GoldbachConjecture · lines 36–38

    Why more general: The declaration states the two-prime decomposition for all even naturals above two, so it covers without restriction the finite range the passage reports as checked.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 1be2fe01ff1b · pair key 728f8cbd1b27.
  73. Theorem · main statement · Elementary properties › Open questions

    Statement only

    Statement only: Formal Conjectures states a more general result (statement only: the proof is not finished).

    As of 2014[update], this conjecture has been verified for all numbers up to n = 4 ⋅ 1018. [63] Weaker statements than this have been proven; for example, Vinogradov's theorem says that every sufficiently large odd integer can be written as a sum of three primes.[64]

    Show in article · Read it in context on Wikipedia

    TernaryGoldbachConjecture.ternaryGoldbach more general

    theorem TernaryGoldbachConjecture.ternaryGoldbach (n : ℕ) : 5 < n → Odd n → ∃ p q r, Nat.Prime p ∧ Nat.Prime q ∧ Nat.Prime r ∧ n = p + q + r

    FormalConjectures.Wikipedia.GoldbachConjecture · lines 52–54

    Why more general: Every binder is ℕ while the passage says integer, and the large odd integers it speaks of are positive, so the natural-number quantifier reaches each of them; the bound five is written out where the passage leaves its threshold unnamed.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 96c42d7eccb7 · pair key 576c7d13ae86.
  74. Theorem · main statement · Elementary properties › Open questions

    Not formalized
    Chen's theorem says that every sufficiently large even number can be expressed as the sum of a prime and a semiprime (the product of two primes).[65]

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 1ad7c139b460).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  75. Theorem · supporting · Elementary properties › Open questions

    Not formalized
    Also, any even integer greater than 10 can be written as the sum of six primes.[66]

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt cfebae4d132b).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  76. Definition · supporting · Elementary properties › Open questions

    Formalized

    Formalized: ATLAS (atlas-lean) states this up to a convention difference (a definition).

    Another type of problem concerns prime gaps, the differences between consecutive primes.

    Show in article · Read it in context on Wikipedia

    primeGap close match

    def primeGap : ℕ → ℕ

    MathlibExt.NumberTheory.PrimeGap · line 27

    Why close, not exact: The library writes the quantity as a function of the position n in the sequence of primes, returning the difference of the following prime and the n-th, so the same difference is carried by an index instead of by the pair itself.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key 2ec4e7f39eb9 · pair key 07328b5ab1dc.

    primeGap close match

    def primeGap : ℕ → ℕ

    FormalConjecturesForMathlib.NumberTheory.PrimeGap · line 27

    Why close, not exact: This library carries the same quantity as a function of the index n, returning the difference between the next prime and the n-th one.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 3044dd2efa0d · pair key ce56458a8554.
  77. Theorem · main statement · Elementary properties › Open questions

    Not formalized
    The existence of arbitrarily large prime gaps can be seen by noting that the sequence n! + 2, n! + 3, …, n! + n consists of n − 1 composite numbers, for any natural number n. [68] However, large prime gaps occur much earlier than this argument shows.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 2 candidates examined (receipt d6c29bcb8c0b).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  78. Example · supporting · Elementary properties › Open questions

    Not formalized
    For example, the first prime gap of length 8 is between the primes 89 and 97,[70] much smaller than 8! = 40320. It is conjectured that there are infinitely many twin primes, pairs of primes with difference 2; this is the twin prime conjecture.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 350a3f15d996).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  79. Conjecture · main statement · Elementary properties › Open questions

    Statement only

    Statement only, by a community edit: Formal Conjectures states this exactly (statement only: the proof is not finished).

    For example, the first prime gap of length 8 is between the primes 89 and 97,[70] much smaller than 8! = 40320. It is conjectured that there are infinitely many twin primes, pairs of primes with difference 2; this is the twin prime conjecture.

    Show in article · Read it in context on Wikipedia

    TwinPrimes.twin_primes exact match

    theorem TwinPrimes.twin_primes : {p | Prime p ∧ Prime (p + 2)}.Infinite

    FormalConjectures.Wikipedia.TwinPrimes · lines 37–39

    Community Agent The pipeline said close match; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 10 Nov 2026.

    Note: The declaration states the twin prime conjecture: the set of natural numbers p with p and p + 2 both prime is infinite. Counting each twin pair by its smaller member is the standard encoding of infinitely many pairs of primes with difference 2, and the general Prime predicate on natural numbers agrees with the usual one, so it says exactly what the passage says.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 4cd75cbf2e28 · pair key 76e2ee5e8ac9.

    Dickson.generalized_twin_primes more general

    theorem Dickson.generalized_twin_primes (k : ℕ) : 0 < k → Infinite ↑{p | Nat.Prime p ∧ Nat.Prime (p + 2 * k)}

    FormalConjectures.Wikipedia.Dickson · lines 54–56

    Why more general: The declaration ranges over every even difference 2k and phrases infinitude through the subtype rather than the set, which is the same assertion in another encoding.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 7c11494f64be · pair key a17ed2cc9fde.
  80. Conjecture · main statement · Elementary properties › Open questions

    Partial

    Partial: Formal Conjectures states a special case (statement only: the proof is not finished).

    Polignac's conjecture states more generally that for every positive integer k, there are infinitely many pairs of consecutive primes that differ by 2k. [71] Andrica's conjecture,[71] Brocard's conjecture,[72] Legendre's conjecture,[73] and Oppermann's conjecture[72] all suggest that the largest gaps between primes from 1 to ⁠ n ⁠ should be at most approximately √n, a result that is known to follow from the Riemann…

    Show in article · Read it in context on Wikipedia

    TwinPrimes.twin_primes special case

    theorem TwinPrimes.twin_primes : {p | Prime p ∧ Prime (p + 2)}.Infinite

    FormalConjectures.Wikipedia.TwinPrimes · lines 37–39

    Why a special case: The difference is fixed at two instead of running over every positive k, and for odd p the number p + 1 is even and larger than two, so the two primes do follow one another.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 2f100d13a239 · pair key 39a2fe27c4d9.
  81. Conjecture · supporting · Elementary properties › Open questions

    Partial

    Partial: Formal Conjectures states part of this (statement only: the proof is not finished).

    Polignac's conjecture states more generally that for every positive integer k, there are infinitely many pairs of consecutive primes that differ by 2k. [71] Andrica's conjecture,[71] Brocard's conjecture,[72] Legendre's conjecture,[73] and Oppermann's conjecture[72] all suggest that the largest gaps between primes from 1 to ⁠ n ⁠ should be at most approximately √n, a result that is known to follow from the Riemann hypothesis, while the much stronger Cramér conjecture sets the largest gap size at ⁠ O((log n)2) ⁠.[71]

    Show in article · Read it in context on Wikipedia

    Andrica.andrica_conjecture states part

    theorem Andrica.andrica_conjecture (n : ℕ) : √↑(Nat.nth Nat.Prime (n + 1)) - √↑(Nat.nth Nat.Prime n) < 1

    FormalConjectures.Wikipedia.Andrica · lines 38–40

    Why only part: This is the Andrica statement the paragraph names first, in the square-root form the library records.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key c6adc624f23d · pair key 95b4df4de3ec.

    LegendreConjecture.legendre_conjecture states part

    theorem LegendreConjecture.legendre_conjecture : ∀ n ≥ 1, ∃ p ∈ Set.Ioo (n ^ 2) ((n + 1) ^ 2), Nat.Prime p

    FormalConjectures.Wikipedia.LegendreConjecture · lines 38–40

    Why only part: This is the Legendre statement the paragraph names, recorded as a prime in each interval between neighbouring squares.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 8ea5372030db · pair key 4c175d777edb.

    Oppermann.oppermann_conjecture states part

    theorem Oppermann.oppermann_conjecture (x : ℕ) : 2 ≤ x → (∃ p ∈ Finset.Ioo (x * (x - 1)) (x ^ 2), Nat.Prime p) ∧ ∃ p ∈ Finset.Ioo (x ^ 2) (x * (x + 1)), Nat.Prime p

    FormalConjectures.Wikipedia.Oppermann · lines 57–60

    Why only part: This is the Oppermann statement the paragraph names, in its two-interval form.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 834f190a285b · pair key 4ea0d477aa6c.
  82. Definition · supporting · Elementary properties › Open questions

    Formalized

    Formalized: Formal Conjectures states a more general result (a Prop-valued definition: it states the claim without proving it).

    Prime gaps can be generalized to prime ⁠ k ⁠-tuples, patterns in the differences among more than two prime numbers.

    Show in article · Read it in context on Wikipedia

    HardyLittlewood.IsPrimeConstellation more general

    def HardyLittlewood.IsPrimeConstellation {k : ℕ} : (Fin k.succ → ℕ) → ℕ → Prop

    FormalConjectures.Wikipedia.HardyLittlewood · lines 40–41

    Why more general: Lean fixes a base p and a vector of offsets, asking each offset to be positive and even and each shifted value to be prime, which is the usual normalised form of the pattern.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key e23ea3a65640 · pair key 5facd65237fa.
  83. Theorem · supporting · Analytic properties

    Formalized

    Formalized: Mathlib states a more general result (proved).

    The problem asked for the value of the infinite sum 1 + 14 + 19 + 116 + …, which today can be recognized as the value ζ(2) of the Riemann zeta function.

    Show in article · Read it in context on Wikipedia

    zeta_nat_eq_tsum_of_gt_one more general

    theorem zeta_nat_eq_tsum_of_gt_one {k : ℕ} : 1 < k → riemannZeta ↑k = ∑' (n : ℕ), 1 / ↑n ^ k

    Mathlib.NumberTheory.LSeries.RiemannZeta · lines 223–227

    Why more general: Lean sums over all naturals, and its zeroth term is zero, so the value is the passage's sum beginning at one.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 68d3f682cdd5 · pair key ecaa85b46338.

    zeta_eq_tsum_one_div_nat_cpow more general

    theorem zeta_eq_tsum_one_div_nat_cpow {s : ℂ} : 1 < s.re → riemannZeta s = ∑' (n : ℕ), 1 / ↑n ^ s

    Mathlib.NumberTheory.LSeries.RiemannZeta · lines 207–210

    Why more general: The declaration holds for every complex argument to the right of the line through one, and the passage uses the point two.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 7dafd92c838f · pair key de150f61f3aa.
  84. Theorem · main statement · Analytic properties

    Formalized

    Formalized: Mathlib states this exactly (proved).

    Euler showed that ⁠ ζ(2) = π2/6 ⁠.[75]

    Show in article · Read it in context on Wikipedia

    riemannZeta_two exact match

    theorem riemannZeta_two : riemannZeta 2 = ↑π ^ 2 / 6

    Mathlib.NumberTheory.LSeries.HurwitzZetaValues · lines 226–230

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key bd95fccf3d69 · pair key b690842da30b.
  85. Theorem · main statement · Analytic properties

    Not formalized
    The reciprocal of this number, ⁠ 6/π2 ⁠, is the limiting probability that two random numbers selected uniformly from a large range are relatively prime (have no factors in common).

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 2 candidates examined (receipt 9a1d0b8f9ca2).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  86. Theorem · main statement · Analytic properties

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    Dirichlet's theorem on arithmetic progressions, in its basic form, asserts that linear polynomials p(n) = a + bn with relatively prime integers ⁠ a ⁠ and ⁠ b ⁠ take infinitely many prime values.

    Show in article · Read it in context on Wikipedia

    Nat.forall_exists_prime_gt_and_zmodEq close match

    theorem Nat.forall_exists_prime_gt_and_zmodEq (n : ℕ) {q : ℕ} {a : ℤ} : q ≠ 0 → IsCoprime a ↑q → ∃ p > n, Nat.Prime p ∧ ↑p ≡ a [ZMOD ↑q]

    Mathlib.NumberTheory.LSeries.PrimesInAP · lines 451–458

    Why close, not exact: Lean keeps the residue a in ℤ while writing the modulus as a natural number, and spells 'infinitely many' as a prime above every given bound; the moduli b and its negative describe the same progression.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key abfd5652ffc8 · pair key 07759c44904a.

    Nat.infinite_setOfPred_prime_and_modEq close match

    theorem Nat.infinite_setOfPred_prime_and_modEq {q a : ℕ} : q ≠ 0 → a.Coprime q → {p | Nat.Prime p ∧ p ≡ a [MOD q]}.Infinite

    Mathlib.NumberTheory.LSeries.PrimesInAP · lines 475–477

    Why close, not exact: Mathlib writes both the residue and the modulus as natural numbers and the progression as a congruence class; the integer moduli b and its negative give the same class, and a may be reduced into ℕ, so the passage's integer form is what is recorded.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key ffd06a21c8fb · pair key aabd868af9d4.
  87. Theorem · main statement · Analytic properties › Analytical proof of Euclid's theorem

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    Euler showed that, for any arbitrary real number ⁠ x ⁠, there exists a prime ⁠ p ⁠ for which this sum is greater than ⁠ x ⁠.[77]

    Show in article · Read it in context on Wikipedia

    Nat.Primes.not_summable_one_div close match

    theorem Nat.Primes.not_summable_one_div : ¬Summable fun p ↦ 1 / ↑↑p

    Mathlib.NumberTheory.SumPrimeReciprocals · lines 124–125

    Why close, not exact: Mathlib records the divergence of this positive series as the failure of summability over the subtype of primes.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 114dcb88d5cb · pair key 22af5d24bb4d.

    not_summable_one_div_on_primes close match

    theorem not_summable_one_div_on_primes : ¬Summable ({p | Nat.Prime p}.indicator fun n ↦ 1 / ↑n)

    Mathlib.NumberTheory.SumPrimeReciprocals · lines 102–120

    Why close, not exact: Here the same divergence is written with an indicator on the primes inside a sum over all naturals, rather than over a subtype.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key d485ba08c0a5 · pair key ebdb8b810415.
  88. Theorem · supporting · Analytic properties › Analytical proof of Euclid's theorem

    Formalized

    Formalized: Mathlib states a more general result (proved).

    For comparison, the sum 112 + 122 + 132 + ⋯ + 1n2 does not grow to infinity as ⁠ n ⁠ goes to infinity (see the Basel problem).

    Show in article · Read it in context on Wikipedia

    hasSum_zeta_two more general

    theorem hasSum_zeta_two : HasSum (fun n ↦ 1 / ↑n ^ 2) (π ^ 2 / 6)

    Mathlib.NumberTheory.ZetaValues · lines 453–456

    Why more general: The declaration pins the limit at the square of pi over six, which gives the boundedness the passage records and more besides.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key ae1d726479d7 · pair key 7ec1ccd593ff.

    Real.summable_one_div_nat_pow more general

    theorem Real.summable_one_div_nat_pow {p : ℕ} : (Summable fun n ↦ 1 / ↑n ^ p) ↔ 1 < p

    Mathlib.Analysis.PSeries · lines 330–332

    Why more general: The declaration is an equivalence covering every exponent, and the passage uses its consequence at the exponent two.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 367d6ca9ad35 · pair key 4d69d1946406.
  89. Theorem · main statement · Analytic properties › Analytical proof of Euclid's theorem

    Formalized

    Formalized: ATLAS (atlas-lean) states this exactly (proved).

    Brun's theorem states that the sum of the reciprocals of twin primes, (13 + 15) + (15 + 17) + (111 + 113) + ⋯, is finite.

    Show in article · Read it in context on Wikipedia

    MathlibExt.NumberTheory.PrimeCounting.summable_brunTwinPrimeReciprocalTerm exact match

    theorem MathlibExt.NumberTheory.PrimeCounting.summable_brunTwinPrimeReciprocalTerm : Summable MathlibExt.NumberTheory.PrimeCounting.brunTwinPrimeReciprocalTerm

    MathlibExt.NumberTheory.PrimeCounting.BrunConstant · line 46

    Note: Lean indexes the family by the smaller member of each pair and gives the value zero at every other index, a default the sum is unaffected by.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key ac648787a511 · pair key ef178f8c03be.

    MathlibExt.NumberTheory.PrimeCounting.BrunTwinPrimeReciprocalsWanted.brun_twin_prime_reciprocal_series_summable exact match

    theorem MathlibExt.NumberTheory.PrimeCounting.BrunTwinPrimeReciprocalsWanted.brun_twin_prime_reciprocal_series_summable : Summable fun p ↦ if Nat.Prime p ∧ Nat.Prime (p + 2) then 1 / ↑p + 1 / ↑(p + 2) else 0

    MathlibExt.NumberTheory.PrimeCounting.BrunTwinPrimeReciprocals · line 1325

    Note: The summand is spelled out as a case split on the pair condition, with the value zero elsewhere; a prime shared by two pairs is counted once in each, as in the displayed series.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key 89486424680a · pair key c73dc5690dc7.

    MathlibExt.NumberTheory.PrimeCounting.hasSum_brunConstant more general

    theorem MathlibExt.NumberTheory.PrimeCounting.hasSum_brunConstant : HasSum MathlibExt.NumberTheory.PrimeCounting.brunTwinPrimeReciprocalTerm MathlibExt.NumberTheory.PrimeCounting.brunConstant

    MathlibExt.NumberTheory.PrimeCounting.BrunConstant · line 55

    Why more general: It fixes the value of the sum, a real number called Brun's constant, and the passage asserts only that such a value exists.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key 6bc6b05c5678 · pair key 24392e5da8dd.
  90. Definition · main statement · Analytic properties › Number of primes below a given bound

    Formalized

    Formalized: Mathlib states this exactly (a definition).

    The prime-counting function π(n) is defined as the number of primes not greater than ⁠ n ⁠.[80]

    Show in article · Read it in context on Wikipedia

    Nat.primeCounting exact match

    def Nat.primeCounting : ℕ → ℕ

    Mathlib.NumberTheory.PrimeCounting · lines 57–58

    Note: The library's function sends a bound to the tally of primes up to and including it, and carries the pi notation for it.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key edcb56fb62a7 · pair key b7ddcbaaadb7.

    Nat.primesLE_card_eq_primeCounting close match

    theorem Nat.primesLE_card_eq_primeCounting (n : ℕ) : n.primesLE.card = n.primeCounting

    Mathlib.NumberTheory.PrimeCounting · lines 261–262

    Why close, not exact: It equates the library's counting function at a bound with the size of the finite collection of primes at most that bound, spelling out the defining formula.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 85982d02e10b · pair key ae2a893ffa4e.
  91. Example · supporting · Analytic properties › Number of primes below a given bound

    Formalized

    Formalized: Mathlib states a more general result (proved).

    For example, ⁠ π(11) = 5 ⁠, since there are five primes less than or equal to 11.

    Show in article · Read it in context on Wikipedia

    Nat.primesLE_card_eq_primeCounting more general

    theorem Nat.primesLE_card_eq_primeCounting (n : ℕ) : n.primesLE.card = n.primeCounting

    Mathlib.NumberTheory.PrimeCounting · lines 261–262

    Why more general: The equation holds at every bound, and at eleven both sides evaluate, giving the number the passage reads off.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 5e0d66e318ec · pair key c3b2db74a120.
  92. Theorem · main statement · Analytic properties › Number of primes below a given bound

    Formalized

    Formalized: ATLAS (atlas-lean) states this exactly (proved).

    The prime number theorem states that π(n) is asymptotic to ⁠ n/log n ⁠, which is denoted as π(n) ∼ nlog n, and means that the ratio of π(n) to the right-hand fraction approaches 1 as ⁠ n ⁠ grows to infinity.[82]

    Show in article · Read it in context on Wikipedia

    MathlibExt.NumberTheory.PrimeNumberTheoremWanted.prime_number_theorem exact match

    theorem MathlibExt.NumberTheory.PrimeNumberTheoremWanted.prime_number_theorem : Asymptotics.IsEquivalent Filter.atTop (fun n ↦ ↑n.primeCounting) fun n ↦ ↑n / Real.log ↑n

    MathlibExt.NumberTheory.PrimeNumberTheorem · line 183

    Note: Equivalence is written with the library's asymptotic relation at the filter of large naturals, between the counting function and the quotient of n by its logarithm.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key 862a39aab544 · pair key cda065dfa00a.
  93. Theorem · supporting · Analytic properties › Number of primes below a given bound

    Not formalized
    This implies that the likelihood that a randomly chosen number less than ⁠ n ⁠ is prime is (approximately) inversely proportional to the number of digits in ⁠ n ⁠.[83]

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 3 candidates examined (receipt ce5febdf380f).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  94. Theorem · supporting · Analytic properties › Number of primes below a given bound

    Not formalized
    It also implies that the ⁠ n ⁠th prime number is proportional to nlog n [84] and therefore that the average size of a prime gap is proportional to ⁠ log n ⁠.[69]

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 4 candidates examined (receipt 43d058f6ce61).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  95. Theorem · main statement · Analytic properties › Number of primes below a given bound

    Formalized

    Formalized: TauCeti states a more general result (proved).

    A more accurate estimate for π(n) is given by the offset logarithmic integral[82] π(n) ∼ Li(n) = ∫n2 dtlog t.

    Show in article · Read it in context on Wikipedia

    TauCeti.primeIdealTheorem more general

    theorem TauCeti.primeIdealTheorem (K : Type*) [Field K] [NumberField K] : (Asymptotics.IsEquivalent Filter.atTop (TauCeti.primePsi K Set.univ) fun x ↦ x) ∧ (Asymptotics.IsEquivalent Filter.atTop (TauCeti.primeTheta K Set.univ) fun x ↦ x) ∧ Asymptotics.IsEquivalent Filter.atTop (TauCeti.primeCount K Set.univ) TauCeti.Real.logIntegral

    TauCeti.NumberTheory.ArithmeticDirichletSeries.Prime.PrimeIdealTheorem · lines 39–43

    Why more general: Stated for every number field and for the count of prime ideals by norm, with the offset logarithmic integral taken as the integral of the reciprocal logarithm from two.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab.
    • Location key 5fc72840522a · pair key d1ce15c39092.
  96. Definition · main statement · Analytic properties › Arithmetic progressions

    Formalized

    Formalized: ATLAS (atlas-lean) states a more general result (a Prop-valued definition: it states the claim without proving it).

    An arithmetic progression is a finite or infinite sequence of numbers such that consecutive numbers in the sequence all have the same difference.[85]

    Show in article · Read it in context on Wikipedia

    Set.IsAPOfLength more general

    def Set.IsAPOfLength {α : Type*} [AddCommMonoid α] : Set α → ℕ∞ → Prop

    MathlibExt.Combinatorics.AP.Basic · line 35

    Why more general: Defined for any additively written commutative monoid and for a length that may be infinite, with the terms recorded as a set carrying a first term and a repeated difference.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key 17c91b596b9e · pair key aadaebb9db13.

    Set.IsAPOfLength more general

    def Set.IsAPOfLength {α : Type*} [AddCommMonoid α] : Set α → ℕ∞ → Prop

    FormalConjecturesForMathlib.Combinatorics.AP.Basic · lines 122–123

    Why more general: The same predicate in a second library: a length in the extended naturals and a first term with a repeated difference, with neither pinned to a value.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key d50fb975e8d7 · pair key 9da86f10bb23.

    List.IsAPOfLength special case

    def List.IsAPOfLength {α : Type*} [AddCommMonoid α] : List α → ℕ → Prop

    MathlibExt.Combinatorics.AP.Basic · line 59

    Why a special case: The list-valued form of the predicate, whose length is an ordinary count, so it reaches the finite runs only.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, low confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key c45b0f81da35 · pair key de43a5bdaedd.
  97. Notation · supporting · Analytic properties › Arithmetic progressions

    Not formalized
    This difference is called the modulus of the progression.[86]

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 569b4bcc54c8).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  98. Example · supporting · Analytic properties › Arithmetic progressions

    Not formalized
    For example, 3, 12, 21, 30, 39, ..., is an infinite arithmetic progression with modulus 9.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 0f7d17325c6d).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  99. Theorem · supporting · Analytic properties › Arithmetic progressions

    Formalized

    Formalized: Lean core states a more general result (proved).

    In an arithmetic progression, all the numbers have the same remainder when divided by the modulus; in this example, the remainder is 3.

    Show in article · Read it in context on Wikipedia

    Nat.add_mul_mod_self_left more general

    theorem Nat.add_mul_mod_self_left (x y z : Nat) : (x + y * z) % y = x % y

    Init.Data.Nat.Div.Basic · lines 345–348

    Why more general: Lean writes a term of the progression as the first term plus the index times the modulus, and the remainder with the percent operator.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 351cadbefe0d · pair key 9e328e18ba18.

    Int.modEq_add_fac_self more general

    theorem Int.modEq_add_fac_self {a t n : ℤ} : a + n * t ≡ a [ZMOD n]

    Mathlib.Data.Int.ModEq · line 370

    Why more general: Mathlib phrases the claim as a congruence to the modulus, which unfolds to the two remainders being equal, and states it over the integers.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key e1dc1dcbfae9 · pair key 2f3bb80dab8a.
  100. Example · supporting · Analytic properties › Arithmetic progressions

    Formalized

    Formalized: Lean core states a more general result (proved).

    In an arithmetic progression, all the numbers have the same remainder when divided by the modulus; in this example, the remainder is 3.

    Show in article · Read it in context on Wikipedia

    Nat.add_mul_mod_self_left more general

    theorem Nat.add_mul_mod_self_left (x y z : Nat) : (x + y * z) % y = x % y

    Init.Data.Nat.Div.Basic · lines 345–348

    Why more general: Lean's percent operator is the remainder, and the term is written as three plus the index times nine.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key f4159f6665b2 · pair key 1d94b13eca50.

    Nat.ModEq.modulus_mul_add more general

    theorem Nat.ModEq.modulus_mul_add {m a b : ℕ} : m * a + b ≡ b [MOD m]

    Mathlib.Data.Nat.ModEq · line 135

    Why more general: Mathlib writes the terms as nine times the index plus three and phrases the claim as a congruence to the modulus.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key bf42576de5d1 · pair key b7c87d905b5b.
  101. Theorem · supporting · Analytic properties › Arithmetic progressions

    Formalized

    Formalized: Formal Conjectures states a more general result (proved).

    Because both the modulus 9 and the remainder 3 are multiples of 3, so is every element in the sequence.

    Show in article · Read it in context on Wikipedia

    Nat.dvd_add_mul_self more general

    theorem Nat.dvd_add_mul_self {a b c : ℕ} : a ∣ b + c * a ↔ a ∣ b

    FormalConjecturesForMathlib.Data.Nat.Init · lines 25–26

    Why more general: Lean states the criterion as an equivalence in the naturals; the modulus nine of this example enters as three times three times the index.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 413bdb4d3f85 · pair key d5cd71ece0d9.
  102. Theorem · supporting · Analytic properties › Arithmetic progressions

    Not formalized
    Therefore, this progression contains only one prime number, 3 itself.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 39c3f64291ad).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  103. Theorem · main statement · Analytic properties › Arithmetic progressions

    Not formalized
    In general, the infinite progression a, a + q, a + 2q, a + 3q, … can have more than one prime only when its remainder ⁠ a ⁠ and modulus ⁠ q ⁠ are relatively prime.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt c0afeed3ac85).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  104. Theorem · main statement · Analytic properties › Arithmetic progressions

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    If they are relatively prime, Dirichlet's theorem on arithmetic progressions asserts that the progression contains infinitely many primes.

    Show in article · Read it in context on Wikipedia

    Nat.infinite_setOfPred_prime_and_modEq close match

    theorem Nat.infinite_setOfPred_prime_and_modEq {q a : ℕ} : q ≠ 0 → a.Coprime q → {p | Nat.Prime p ∧ p ≡ a [MOD q]}.Infinite

    Mathlib.NumberTheory.LSeries.PrimesInAP · lines 475–477

    Why close, not exact: Mathlib writes the terms of the progression as the residue class of a to the modulus q and concludes that the set of primes in that class is infinite.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 741df75661cf · pair key e40fd84fe13b.

    Nat.forall_exists_prime_gt_and_modEq close match

    theorem Nat.forall_exists_prime_gt_and_modEq (n : ℕ) {q a : ℕ} : q ≠ 0 → a.Coprime q → ∃ p > n, Nat.Prime p ∧ p ≡ a [MOD q]

    Mathlib.NumberTheory.LSeries.PrimesInAP · lines 463–465

    Why close, not exact: Mathlib names the terms by their residue class to the modulus q and says infinitude by producing such a prime above each bound.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 8595b0676b5e · pair key 5c89bb52bc2b.

    Nat.infinite_setOfPred_prime_and_eq_mod close match

    theorem Nat.infinite_setOfPred_prime_and_eq_mod {q : ℕ} [NeZero q] {a : ZMod q} : IsUnit a → {p | Nat.Prime p ∧ ↑p = a}.Infinite

    Mathlib.NumberTheory.LSeries.PrimesInAP · lines 431–435

    Why close, not exact: Mathlib names the class in the ring of residues modulo q and writes coprimality as that class being a unit there.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 5717fc374c47 · pair key 4661a68cbc5b.
  105. Theorem · main statement · Analytic properties › Arithmetic progressions

    Statement only

    Statement only: Formal Conjectures states this up to a convention difference (statement only: the proof is not finished).

    The Green–Tao theorem shows that there are arbitrarily long finite arithmetic progressions consisting only of primes.

    Show in article · Read it in context on Wikipedia

    Erdos219.erdos_219 close match

    theorem Erdos219.erdos_219 (N : ℕ) : ∃ l ∈ Erdos219.primeArithmeticProgressions, ↑N ≤ ENat.card ↑l

    FormalConjectures.ErdosProblems.«219» · lines 80–81

    Why close, not exact: The library records unbounded length as a cardinality bound on a set of primes in progression, and the first terms of such a set give the finite progression the passage describes.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 425302082a8c · pair key 909d6cc0e1cc.

    Erdos1187.erdos_1187.parts.i more general

    theorem Erdos1187.erdos_1187.parts.i (k : ℕ) : 3 ≤ k → ∀ (κ : Type) [Finite κ] (c : ℤ → κ), ∃ S, S.IsAPOfLength ↑k ∧ (∀ n ∈ S, ∃ p, Nat.Prime p ∧ ↑p = n) ∧ ∃ γ, ∀ n ∈ S, c n = γ

    FormalConjectures.ErdosProblems.«1187» · lines 47–51

    Why more general: The library result additionally asks that the progression be monochromatic for an arbitrary finite colouring of the integers.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key d53c02b718c7 · pair key a296fefafd46.
  106. Example · main statement · Analytic properties › Prime values of quadratic polynomials

    Not formalized
    Euler noted that the function n2 − n + 41 yields prime numbers for ⁠ 1 ≤ n ≤ 40 ⁠, although composite numbers appear among its later values.[89][90]

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 6 queries and 3 candidates examined (receipt 34c65efcc209).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  107. Conjecture · main statement · Analytic properties › Prime values of quadratic polynomials

    Statement only

    Statement only: Formal Conjectures states this up to a convention difference (statement only: the proof is not finished).

    Russian mathematician Viktor Bunyakovsky in 1857 conjectured that any one-variable polynomial f(x) with integer coefficients would produce infinitely many primes in the sequence f(1), f(2), f(3), …. A polynomial must meet the conditions that its leading coefficient is positive, it is irreducible over the rationals, and the value of such a sequence has no common factor larger than 1.

    Show in article · Read it in context on Wikipedia

    Bunyakovsky.bunyakovsky_conjecture close match

    theorem Bunyakovsky.bunyakovsky_conjecture (f : ℤ[X]) : BunyakovskyCondition f ∧ SchinzelCondition {f} → Infinite ↑{n | Nat.Prime (Polynomial.eval (↑n) f).natAbs}

    FormalConjectures.Wikipedia.Bunyakovsky · lines 37–40

    Why close, not exact: The library packages the hypotheses into two named conditions, phrases the common-factor hypothesis as the absence of a prime dividing all the values, and counts natural arguments at which the absolute value of f is prime.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 7d6571d93d3d · pair key 760ebf7f33f2.

    Schinzel.schinzel_conjecture more general

    theorem Schinzel.schinzel_conjecture (fs : Finset (ℤ[X])) : (∀ f ∈ fs, BunyakovskyCondition f) → SchinzelCondition fs → Infinite ↑{n | ∀ f ∈ fs, Nat.Prime (Polynomial.eval (↑n) f).natAbs}

    FormalConjectures.Wikipedia.Schinzel · lines 37–39

    Why more general: The library states the hypothesis for an arbitrary finite family of integer polynomials, asking all of them to be prime simultaneously.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 4116ea37d593 · pair key 8a1ccfcb2bac.
  108. Theorem · supporting · Analytic properties › Zeta function and the Riemann hypothesis

    Partial

    Partial: Mathlib states a special case (proved).

    This function is an analytic function on the complex numbers.[95]

    Show in article · Read it in context on Wikipedia

    analyticOn_riemannZeta special case

    theorem analyticOn_riemannZeta : AnalyticOnNhd ℂ riemannZeta {1}ᶜ

    Mathlib.NumberTheory.LSeries.RiemannZeta · lines 146–148

    Why a special case: The library result covers the complement of the single point one, where the zeta function has its pole; the passage asserts analyticity without that exception.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 0bd435022a7d · pair key ac95c94c3a34.

    differentiableOn_riemannZeta special case

    theorem differentiableOn_riemannZeta : DifferentiableOn ℂ riemannZeta {1}ᶜ

    Mathlib.NumberTheory.LSeries.RiemannZeta · lines 142–144

    Why a special case: The library phrases the same restricted regularity as differentiability on a set rather than as analyticity.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key f374b51f23f3 · pair key 6c779a48d1c3.
  109. Theorem · main statement · Analytic properties › Zeta function and the Riemann hypothesis

    Formalized

    Formalized: Mathlib states this exactly (proved).

    For complex numbers ⁠ s ⁠ with real part greater than one it equals both an infinite sum over all integers, and an infinite product over the prime numbers, ζ(s) = ∑∞n = 1 1ns = ∏p prime 11 − p−s. This equality between a sum and a product, discovered by Euler, is called an Euler product.

    Show in article · Read it in context on Wikipedia

    riemannZeta_eulerProduct_tprod exact match

    theorem riemannZeta_eulerProduct_tprod {s : ℂ} : 1 < s.re → ∏' (p : Nat.Primes), (1 - ↑↑p ^ (-s))⁻¹ = riemannZeta s

    Mathlib.NumberTheory.EulerProduct.DirichletLSeries · lines 98–100

    Note: Lean writes each factor as the inverse of one minus p raised to minus s, which is the fraction the passage displays, and takes the product over the subtype of prime naturals.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 01c7129387d1 · pair key 760794ccb911.
  110. Notation · supporting · Analytic properties › Zeta function and the Riemann hypothesis

    Partial

    Partial: Mathlib states this up to a convention difference, but as a proved theorem, not a definition; a notation passage is formalized only by a Lean definition.

    …s ⁠ with real part greater than one it equals both an infinite sum over all integers, and an infinite product over the prime numbers, ζ(s) = ∑∞n = 1 1ns = ∏p prime 11 − p−s. This equality between a sum and a product, discovered by Euler, is called an Euler product.[96]

    Show in article · Read it in context on Wikipedia

    riemannZeta_eulerProduct_tprod close match

    theorem riemannZeta_eulerProduct_tprod {s : ℂ} : 1 < s.re → ∏' (p : Nat.Primes), (1 - ↑↑p ^ (-s))⁻¹ = riemannZeta s

    Mathlib.NumberTheory.EulerProduct.DirichletLSeries · lines 98–100

    Why close, not exact: Mathlib states the identity between the zeta value and the product over primes and attaches the passage's term to it in the declaration's name and in the name of its module.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 6b94b2e5cbf2 · pair key c270058d5e89.
  111. Theorem · supporting · Analytic properties › Zeta function and the Riemann hypothesis

    Partial

    With community edits: Partial. As published it is Formalized.

    Partial, by a community edit: Mathlib states part of this (proved).

    It leads to another proof that there are infinitely many primes: if there were only finitely many, then the sum-product equality would also be valid at ⁠ s = 1 ⁠, but the sum would diverge (it is the harmonic series ⁠ 1 + 12 + 13 + … ⁠) while the product would be finite, a contradiction.

    Show in article · Read it in context on Wikipedia

    Real.not_summable_one_div_natCast states part

    theorem Real.not_summable_one_div_natCast : ¬Summable fun n ↦ 1 / ↑n

    Mathlib.Analysis.PSeries · lines 357–358

    Community Agent The pipeline said exact match; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.

    Why only part: The passage makes two claims: the sum diverges because it is the harmonic series, and the product would be finite, giving a contradiction. Real.not_summable_one_div_natCast states only the first: 1/n is not summable over the naturals (the n = 0 term is 0 by Lean's division convention). It says nothing about the product or the contradiction.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 46a747dc91f5 · pair key 6236a3a2f6a7.

    Real.tendsto_sum_range_one_div_nat_succ_atTop states part

    theorem Real.tendsto_sum_range_one_div_nat_succ_atTop : Filter.Tendsto (fun n ↦ ∑ i ∈ Finset.range n, 1 / (↑i + 1)) Filter.atTop Filter.atTop

    Mathlib.Analysis.PSeries · lines 361–365

    Community Agent The pipeline said more general; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.

    Why only part: Real.tendsto_sum_range_one_div_nat_succ_atTop says the partial sums of 1 + 1/2 + 1/3 + ... grow without bound, which is the passage's claim that the harmonic series diverges. The passage's other clauses, that the product would be finite and that this gives a contradiction, are not stated here.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 1b8702585382 · pair key b0b2bec6ebb4.
  112. Conjecture · main statement · Analytic properties › Zeta function and the Riemann hypothesis

    Statement only

    Statement only: Mathlib states this exactly (a Prop-valued definition: it states the claim without proving it).

    The Riemann hypothesis states that the zeros of the zeta-function are all either negative even numbers, or complex numbers with real part equal to 1/2.[99]

    Show in article · Read it in context on Wikipedia

    RiemannHypothesis exact match

    def RiemannHypothesis : Prop

    Mathlib.NumberTheory.LSeries.RiemannZeta · lines 185–186

    Note: The definition exempts the zeros at minus two times a positive integer, the negative even integers, and requires real part one half of all the others.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 4eba920eb7f5 · pair key 3c868cc24149.

    RiemannHypothesis.riemannHypothesis exact match

    theorem RiemannHypothesis.riemannHypothesis : RiemannHypothesis

    FormalConjectures.Millennium.RiemannHypothesis · lines 61–62

    Note: The conjecture library asserts the same proposition that Mathlib defines for the zeros of the zeta function.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 044be8e103ee · pair key 59a5d03d021c.
  113. Theorem · supporting · Analytic properties › Zeta function and the Riemann hypothesis

    Formalized

    Formalized: Mathlib states a more general result (proved).

    The original proof of the prime number theorem was based on a weak form of this hypothesis, that there are no zeros with real part equal to 1,[100][101] although other more elementary proofs have been found.[102]

    Show in article · Read it in context on Wikipedia

    riemannZeta_ne_zero_of_one_le_re more general

    theorem riemannZeta_ne_zero_of_one_le_re ⦃s : ℂ⦄ : 1 ≤ s.re → riemannZeta s ≠ 0

    Mathlib.NumberTheory.LSeries.Nonvanishing · lines 410–414

    Why more general: Mathlib proves the nonvanishing on the whole closed half-plane to the right of the line, and at the pole it returns a default value which is nonzero.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 89731daacdc7 · pair key d9a6d19cf50b.
  114. Theorem · main statement · Analytic properties › Zeta function and the Riemann hypothesis

    Not formalized
    The prime-counting function can be expressed by Riemann's explicit formula as a sum in which each term comes from one of the zeros of the zeta function; the main term of this sum is the logarithmic integral, and the remaining terms cause the sum to fluctuate above and below the main term.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 2aee391e907a).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  115. Theorem · supporting · Analytic properties › Zeta function and the Riemann hypothesis

    Not formalized
    The prime-counting function can be expressed by Riemann's explicit formula as a sum in which each term comes from one of the zeros of the zeta function; the main term of this sum is the logarithmic integral, and the remaining terms cause the sum to fluctuate above and below the main term.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 05cac48b1528).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  116. Theorem · supporting · Analytic properties › Zeta function and the Riemann hypothesis

    Not formalized
    The prime-counting function can be expressed by Riemann's explicit formula as a sum in which each term comes from one of the zeros of the zeta function; the main term of this sum is the logarithmic integral, and the remaining terms cause the sum to fluctuate above and below the main term.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt ed657af561a0).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  117. Theorem · main statement · Analytic properties › Zeta function and the Riemann hypothesis

    Not formalized
    If the Riemann hypothesis is true, these fluctuations will be small, and the asymptotic distribution of primes given by the prime number theorem will also hold over much shorter intervals (of length about the square root of ⁠ x ⁠ for intervals near a number ⁠ x ⁠).

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 4 candidates examined (receipt 78abf154f18b).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  118. Definition · main statement · Abstract algebra › Modular arithmetic and finite fields

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    Modular arithmetic modifies usual arithmetic by only using the numbers ⁠ {0, 1, 2, …, n − 1} ⁠, for a natural number ⁠ n ⁠ called the modulus.

    Show in article · Read it in context on Wikipedia

    ZMod more general

    def ZMod : ℕ → Type

    Mathlib.Data.ZMod.Defs · lines 139–141

    Why more general: Mathlib's type of integers modulo the modulus unfolds to the naturals below it whenever the modulus is positive, and reaches past the passage by returning the integers at modulus zero.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 2489a1d377ec · pair key 95c9c8826fdd.

    ZMod.val_lt states part

    theorem ZMod.val_lt {n : ℕ} [NeZero n] (a : ZMod n) : a.val < n

    Mathlib.Data.ZMod.Basic · lines 61–64

    Why only part: The declaration needs the modulus to be nonzero, which is exactly the range in which the passage's list of numbers exists.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 5150c2751e45 · pair key 45af70308bf2.
  119. Construction · supporting · Abstract algebra › Modular arithmetic and finite fields

    Partial

    Partial: Mathlib states this up to a convention difference, but as a proved theorem, not a definition; a construction passage is formalized only by a Lean definition.

    Any other natural number can be mapped into this system by replacing it by its remainder after division by ⁠ n ⁠.[104]

    Show in article · Read it in context on Wikipedia

    ZMod.val_natCast close match

    theorem ZMod.val_natCast (n a : ℕ) : (↑a).val = a % n

    Mathlib.Data.ZMod.Basic · lines 89–93

    Why close, not exact: Lean writes the carrying map as the canonical cast from the naturals into the type of integers modulo the modulus, and this equation unfolds the representative of that cast to the remainder after division.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key e471968d09be · pair key 7e655a948140.
  120. Definition · supporting · Abstract algebra › Modular arithmetic and finite fields

    Partial

    Partial: Lean core states part of this (proved).

    Modular sums, differences and products are calculated by performing the same replacement by the remainder on the result of the usual sum, difference, or product of integers.[105]

    Show in article · Read it in context on Wikipedia

    Fin.add_def states part

    theorem Fin.add_def {n : Nat} (a b : Fin n) : a + b = ⟨(↑a + ↑b) % n, ⋯⟩

    Init.Data.Fin.Lemmas · line 359

    Why only part: Lean defines addition on the numbers below the modulus by reducing the ordinary sum, and this equation exhibits that rule.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 044c08799bf8 · pair key ae72fd8a0c66.

    Fin.mul_def states part

    theorem Fin.mul_def {n : Nat} (a b : Fin n) : a * b = ⟨↑a * ↑b % n, ⋯⟩

    Init.Data.Fin.Lemmas · line 32

    Why only part: Lean defines multiplication on the numbers below the modulus by reducing the ordinary product, and this equation exhibits that rule.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 08b166d21a03 · pair key 57825500b5b9.

    Fin.sub_def states part

    theorem Fin.sub_def {n : Nat} (a b : Fin n) : a - b = ⟨(n - ↑b + ↑a) % n, ⋯⟩

    Init.Data.Fin.Lemmas · line 36

    Why only part: Because subtraction of naturals truncates, Lean writes the integer difference as the modulus less the subtrahend plus the minuend before reducing, which agrees with the remainder of the integer difference.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key ca1344831c67 · pair key 0409e35bb5b5.

    ZMod.val_add states part

    theorem ZMod.val_add {n : ℕ} [NeZero n] (a b : ZMod n) : (a + b).val = (a.val + b.val) % n

    Mathlib.Data.ZMod.Basic · lines 651–654

    Why only part: This is the addition rule stated for Mathlib's type of integers modulo the modulus rather than for the raw numbers below it.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key da55dc817eed · pair key 90aab2c0b83a.
  121. Definition · main statement · Abstract algebra › Modular arithmetic and finite fields

    Formalized

    Formalized: Mathlib states this exactly (a Prop-valued definition: it states the claim without proving it).

    Equality of integers corresponds to congruence in modular arithmetic: ⁠ x ⁠ and ⁠ y ⁠ are congruent (written x ≡ y mod ⁠ n ⁠) when they have the same remainder after division by ⁠ n ⁠.[106]

    Show in article · Read it in context on Wikipedia

    Int.ModEq exact match

    def Int.ModEq : ℤ → ℤ → ℤ → Prop

    Mathlib.Data.Int.ModEq · lines 31–32

    Note: Lean's modulus is allowed to be any integer rather than a natural number, which adds nothing: a negative modulus gives the very same relation as its absolute value, and the modulus zero collapses to equality of the two integers, a case the passage's arithmetic never leans on.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key f4440d44429d · pair key c96567a4c35e.

    Nat.ModEq special case

    def Nat.ModEq : ℕ → ℕ → ℕ → Prop

    Mathlib.Data.Nat.ModEq · lines 37–38

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key eda30a04fb54 · pair key 6370c220016e.
  122. Theorem · main statement · Abstract algebra › Modular arithmetic and finite fields

    Partial

    Partial: Mathlib states part of this (a definition).

    In this system of numbers, division by all nonzero numbers is possible if and only if the modulus is prime.

    Show in article · Read it in context on Wikipedia

    ZMod.instField states part

    instance ZMod.instField (p : ℕ) [hp : Fact (Nat.Prime p)] : Field (ZMod p)

    Mathlib.Algebra.Field.ZMod · lines 27–33

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 9c0965eabffa · pair key c76a0e7be5df.
  123. Example · supporting · Abstract algebra › Modular arithmetic and finite fields

    Partial

    Partial: Mathlib states part of this (proved).

    For instance, with the prime number 7 as modulus, division by 3 is possible: ⁠ 2/3 ≡ 3mod7 ⁠, because clearing denominators by multiplying both sides by 3 gives the valid formula ⁠ 2 ≡ 9mod7 ⁠.

    Show in article · Read it in context on Wikipedia

    ZMod.isUnit_iff_coprime states part

    theorem ZMod.isUnit_iff_coprime (m n : ℕ) : IsUnit ↑m ↔ m.Coprime n

    Mathlib.Data.ZMod.Basic · lines 813–818

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 6b5e26e99649 · pair key 100f30fca25f.

    ZMod.instField states part

    instance ZMod.instField (p : ℕ) [hp : Fact (Nat.Prime p)] : Field (ZMod p)

    Mathlib.Algebra.Field.ZMod · lines 27–33

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 707a5ecb8544 · pair key a65ae108bc5c.
  124. Example · supporting · Abstract algebra › Modular arithmetic and finite fields

    Formalized

    Formalized: Mathlib states a more general result (proved).

    However, with the composite modulus 6, division by 3 is impossible.

    Show in article · Read it in context on Wikipedia

    ZMod.isUnit_iff_coprime more general

    theorem ZMod.isUnit_iff_coprime (m n : ℕ) : IsUnit ↑m ↔ m.Coprime n

    Mathlib.Data.ZMod.Basic · lines 813–818

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 846d71768041 · pair key 699dcc2cd421.

    ZMod.not_isUnit_of_mem_primeFactors more general

    theorem ZMod.not_isUnit_of_mem_primeFactors {n p : ℕ} : p ∈ n.primeFactors → ¬IsUnit ↑p

    Mathlib.Data.ZMod.Units · lines 76–79

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 09dcdfbb3c02 · pair key 91ca5752335c.
  125. Theorem · supporting · Abstract algebra › Modular arithmetic and finite fields

    Not formalized
    There is no valid solution to 2/3 ≡ xmod6: clearing denominators by multiplying by 3 causes the left-hand side to become 2 while the right-hand side becomes either 0 or 3.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 9d41bea9979c).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  126. Theorem · main statement · Abstract algebra › Modular arithmetic and finite fields

    Partial

    Partial: Mathlib states part of this (a definition).

    In the terminology of abstract algebra, the ability to perform division means that modular arithmetic modulo a prime number forms a field or, more specifically, a finite field, while other moduli only give a ring but not a field.

    Show in article · Read it in context on Wikipedia

    ZMod.instField states part

    instance ZMod.instField (p : ℕ) [hp : Fact (Nat.Prime p)] : Field (ZMod p)

    Mathlib.Algebra.Field.ZMod · lines 27–33

    Why only part: It supplies the field structure alone; the finiteness that the first conjunct also asserts is not part of what it states.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 2f43f7d02cfa · pair key a517dc5f274f.

    ZMod.fintype states part

    instance ZMod.fintype (n : ℕ) [NeZero n] : Fintype (ZMod n)

    Mathlib.Data.ZMod.Defs · lines 155–157

    Why only part: It supplies finiteness alone and says nothing about the field structure the first conjunct also asserts.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 80fd58b6163e · pair key d5d186955b0b.

    ZMod.commRing states part

    instance ZMod.commRing (n : ℕ) : CommRing (ZMod n)

    Mathlib.Data.ZMod.Defs · lines 172–227

    Why only part: It gives the ring structure for every modulus and leaves unstated the second conjunct's further claim that for a composite modulus the ring fails to be a field.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 1346420c1349 · pair key 1b87dfa7c9e5.
  127. Theorem · main statement · Abstract algebra › Modular arithmetic and finite fields

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    For instance, Fermat's little theorem states that if a ≢ 0 (mod ⁠ p ⁠), then ap − 1 ≡ 1 (mod ⁠ p ⁠).[108]

    Show in article · Read it in context on Wikipedia

    Int.ModEq.pow_card_sub_one_eq_one close match

    theorem Int.ModEq.pow_card_sub_one_eq_one {p : ℕ} : Nat.Prime p → ∀ {n : ℤ}, IsCoprime n ↑p → n ^ (p - 1) ≡ 1 [ZMOD ↑p]

    Mathlib.FieldTheory.Finite.Basic · lines 609–615

    Why close, not exact: Lean writes the hypothesis as coprimality of the integer with the modulus, a natural number, which for a prime modulus is the same condition as the passage's requirement that the integer not be divisible by it.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key e36799564697 · pair key 29b08bdba8ef.

    ZMod.pow_card_sub_one_eq_one close match

    theorem ZMod.pow_card_sub_one_eq_one {p : ℕ} [Fact (Nat.Prime p)] {a : ZMod p} : a ≠ 0 → a ^ (p - 1) = 1

    Mathlib.FieldTheory.Finite.Basic · lines 580–583

    Why close, not exact: Lean records the congruence as an equation in the ring of residues to the natural number p, the passage's integer entering as its residue class; nonvanishing of that class is the passage's requirement on the integer.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 45c74ce1853a · pair key c4a635565743.

    Nat.ModEq.pow_card_sub_one_eq_one special case

    theorem Nat.ModEq.pow_card_sub_one_eq_one {p : ℕ} : Nat.Prime p → ∀ {n : ℕ}, n.Coprime p → n ^ (p - 1) ≡ 1 [MOD p]

    Mathlib.FieldTheory.Finite.Basic · lines 639–642

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 0a9e2ab7a164 · pair key c575aaadd0f5.
  128. Theorem · supporting · Abstract algebra › Modular arithmetic and finite fields

    Statement only

    Statement only: Formal Conjectures states a more general result (statement only: the proof is not finished).

    Summing this over all choices of ⁠ a ⁠ gives the equation ∑p − 1a = 1 ap − 1 ≡ (p − 1) ⋅ 1 ≡ −1 (mod p), valid whenever ⁠ p ⁠ is prime.

    Show in article · Read it in context on Wikipedia

    AgohGiuga.agoh_giuga.variants.giuga more general

    theorem AgohGiuga.agoh_giuga.variants.giuga : AgohGiuga.AgohGiugaSum

    FormalConjectures.Wikipedia.AgohGiuga · lines 70–71

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key ad7f5ce05330 · pair key 1e2f2c98c189.
  129. Conjecture · main statement · Abstract algebra › Modular arithmetic and finite fields

    Statement only

    Statement only: Formal Conjectures states a more general result (statement only: the proof is not finished).

    Giuga's conjecture says that this equation is also a sufficient condition for ⁠ p ⁠ to be prime.[109]

    Show in article · Read it in context on Wikipedia

    AgohGiuga.agoh_giuga.variants.giuga more general

    theorem AgohGiuga.agoh_giuga.variants.giuga : AgohGiuga.AgohGiugaSum

    FormalConjectures.Wikipedia.AgohGiuga · lines 70–71

    Why more general: Lean asserts both directions between primality of p and the power-sum congruence modulo p.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 6520bd6177c5 · pair key ad1029f91b80.

    AgohGiuga.AgohGiugaSum more general

    def AgohGiuga.AgohGiugaSum : Prop

    FormalConjectures.Wikipedia.AgohGiuga · lines 60–61

    Why more general: This is the proposition itself, an equivalence between primality and the power-sum congruence.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key e1a8eef3798e · pair key cea47f12ec71.
  130. Theorem · main statement · Abstract algebra › Modular arithmetic and finite fields

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    Wilson's theorem says that an integer p > 1 is prime if and only if the factorial (p − 1)! is congruent to −1 mod ⁠ p ⁠.

    Show in article · Read it in context on Wikipedia

    Nat.prime_iff_fac_equiv_neg_one close match

    theorem Nat.prime_iff_fac_equiv_neg_one {n : ℕ} : n ≠ 1 → (Nat.Prime n ↔ ↑(n - 1).factorial = -1)

    Mathlib.NumberTheory.Wilson · lines 128–131

    Why close, not exact: Lean writes the congruence as an equality in ZMod n and ranges over n : ℕ, so the article's integers above one are exactly the naturals above one it covers, and the admitted value n = 0 is one where both sides fail.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 54d6f5e4cf81 · pair key c3b6ea682730.

    ZMod.wilsons_lemma states part

    theorem ZMod.wilsons_lemma (p : ℕ) [Fact (Nat.Prime p)] : ↑(p - 1).factorial = -1

    Mathlib.NumberTheory.Wilson · lines 62–87

    Why only part: It gives the direction from primality to the congruence and does not state the converse.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 00e3409f3489 · pair key c96644241b4f.

    Nat.prime_of_fac_equiv_neg_one states part

    theorem Nat.prime_of_fac_equiv_neg_one {n : ℕ} : ↑(n - 1).factorial = -1 → n ≠ 1 → Nat.Prime n

    Mathlib.NumberTheory.Wilson · lines 117–125

    Why only part: It gives the direction from the congruence to primality and not the converse.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key fa908da5ce8b · pair key 287c2c0c338f.
  131. Theorem · supporting · Abstract algebra › Modular arithmetic and finite fields

    Formalized

    Formalized: Mathlib states a more general result (proved).

    For a composite number ⁠ n = r ⋅ s ⁠ this cannot hold, since one of its factors divides both n and ⁠ (n − 1)! ⁠, and so (n − 1)! ≡ −1 (mod n) is impossible.

    Show in article · Read it in context on Wikipedia

    Nat.prime_of_fac_equiv_neg_one more general

    theorem Nat.prime_of_fac_equiv_neg_one {n : ℕ} : ↑(n - 1).factorial = -1 → n ≠ 1 → Nat.Prime n

    Mathlib.NumberTheory.Wilson · lines 117–125

    Why more general: Lean records the congruence as an equality in ZMod n; being composite is being a number above one that is not prime, so the contrapositive is exactly the impossibility the passage records.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 8ddc6f84792b · pair key 2ad823517b93.

    Nat.prime_iff_fac_equiv_neg_one more general

    theorem Nat.prime_iff_fac_equiv_neg_one {n : ℕ} : n ≠ 1 → (Nat.Prime n ↔ ↑(n - 1).factorial = -1)

    Mathlib.NumberTheory.Wilson · lines 128–131

    Why more general: Lean states the criterion in both directions in ZMod n over naturals, and the composite case is the negative half of it.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 53d5e32997c4 · pair key 26b8623011f0.
  132. Theorem · supporting · Abstract algebra › Modular arithmetic and finite fields

    Partial

    Partial: Mathlib states part of this (proved).

    For a composite number ⁠ n = r ⋅ s ⁠ this cannot hold, since one of its factors divides both n and ⁠ (n − 1)! ⁠, and so (n − 1)! ≡ −1 (mod n) is impossible.

    Show in article · Read it in context on Wikipedia

    Nat.dvd_factorial states part

    theorem Nat.dvd_factorial {m n : ℕ} : 0 < m → m ≤ n → m ∣ n.factorial

    Mathlib.Data.Nat.Factorial.Basic · lines 82–83

    Why only part: It gives the divisibility of the factorial by the factor and does not state that the factor divides n.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key a92157842a36 · pair key b6e37d54b7eb.

    dvd_mul_right states part

    theorem dvd_mul_right {α : Type*} [Semigroup α] (a b : α) : a ∣ a * b

    Mathlib.Algebra.Divisibility.Basic · lines 81–82

    Why only part: It gives the divisibility of n by its factor and says nothing about the factorial.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 901e705d9b05 · pair key 6f39cc9e6e39.
  133. Definition · main statement · Abstract algebra › p-adic numbers

    Formalized

    Formalized: Mathlib states this up to a convention difference (a definition).

    The ⁠ p ⁠-adic order νp(n) of an integer ⁠ n ⁠ is the number of copies of ⁠ p ⁠ in the prime factorization of ⁠ n ⁠.

    Show in article · Read it in context on Wikipedia

    padicValInt close match

    def padicValInt : ℕ → ℤ → ℕ

    Mathlib.NumberTheory.Padics.PadicVal.Basic · lines 88–89

    Why close, not exact: Lean fixes the order as the largest k with the k-th power of p dividing the integer, which is how many copies of p its factorization holds, and returns 0 in the two settings set aside.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key a40dd808e7c4 · pair key 45e4f6597d7b.

    Nat.factorization special case

    def Nat.factorization : ℕ → ℕ →₀ ℕ

    Mathlib.Data.Nat.Factorization.Defs · lines 51–52

    Why a special case: Lean's finitely supported map counts the prime factors of a natural number, where the passage speaks of an integer.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 009304e79da4 · pair key d6c69700a2c3.

    padicValNat special case

    def padicValNat : ℕ → ℕ → ℕ

    Mathlib.Data.Nat.PadicValNat · line 21

    Why a special case: This is the same order restricted to natural arguments, with 0 returned at n = 0 and at p = 1.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key cd737f011b36 · pair key 23071088ad3f.
  134. Definition · supporting · Abstract algebra › p-adic numbers

    Formalized

    Formalized: Mathlib states this exactly (a definition).

    The same concept can be extended from integers to rational numbers by defining the ⁠ p ⁠-adic order of a fraction m/n to be ⁠ νp(m) − νp(n) ⁠.

    Show in article · Read it in context on Wikipedia

    padicValRat exact match

    def padicValRat : ℕ → ℚ → ℤ

    Mathlib.NumberTheory.Padics.PadicVal.Basic · lines 126–127

    Note: Lean defines the order of a rational as the order of its numerator minus the order of its denominator, and returns 0 at q = 0 and at p = 1, where the article counts no copies of p.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 1427562729b0 · pair key 7d0505ffea61.

    padicValRat.defn close match

    theorem padicValRat.defn (p : ℕ) [hp : Fact (Nat.Prime p)] {q : ℚ} {n d : ℤ} : q ≠ 0 → q = Rat.divInt n d → padicValRat p q = ↑(multiplicity (↑p) n) - ↑(multiplicity (↑p) d)

    Mathlib.NumberTheory.Padics.PadicVal.Basic · lines 207–220

    Why close, not exact: Lean writes each order as a multiplicity of p and allows any representation of q as a quotient of two integers.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key af6c38cc0d93 · pair key ef049beb6271.

    padicValRat_def close match

    theorem padicValRat_def (p : ℕ) (q : ℚ) : padicValRat p q = ↑(padicValInt p q.num) - ↑(padicValNat p q.den)

    Mathlib.NumberTheory.Padics.PadicVal.Basic · lines 129–131

    Why close, not exact: Lean reads m and n as the numerator and the denominator of q in lowest terms.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key ee52d76640ae · pair key ee440b97ce4c.
  135. Definition · main statement · Abstract algebra › p-adic numbers

    Formalized

    Formalized: Mathlib states this exactly (a definition).

    The ⁠ p ⁠-adic absolute value |q|p of any rational number ⁠ q ⁠ is then defined as ⁠ |q|p = p−νp(q) ⁠.

    Show in article · Read it in context on Wikipedia

    padicNorm exact match

    def padicNorm : ℕ → ℚ → ℚ

    Mathlib.NumberTheory.Padics.PadicNorm · lines 46–47

    Note: Lean raises p to minus the p-adic order of q and gives 0 at q = 0, the one argument where no order is counted.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 22878049777e · pair key efcde86a71d7.

    padicNorm.eq_zpow_of_nonzero close match

    theorem padicNorm.eq_zpow_of_nonzero {p : ℕ} {q : ℚ} : q ≠ 0 → padicNorm p q = ↑p ^ (-padicValRat p q)

    Mathlib.NumberTheory.Padics.PadicNorm · lines 57–58

    Why close, not exact: It writes out the defining formula of the library's object for every nonzero rational.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key d2723ede99d3 · pair key 6a0cadac5253.

    Rat.AbsoluteValue.padic close match

    def Rat.AbsoluteValue.padic (p : ℕ) [Fact (Nat.Prime p)] : AbsoluteValue ℚ ℝ

    Mathlib.NumberTheory.Ostrowski · lines 114–121

    Why close, not exact: Lean packages the same p-adic size of a rational as a real-valued absolute value structure carrying its own multiplicativity and triangle proofs.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 32d98f25fc7b · pair key 336ba6246bef.
  136. Theorem · supporting · Abstract algebra › p-adic numbers

    Partial

    Partial: Mathlib states a special case (proved).

    Multiplying an integer by its ⁠ p ⁠-adic absolute value cancels out the factors of ⁠ p ⁠ in its factorization, leaving only the other primes.

    Show in article · Read it in context on Wikipedia

    Nat.factorization_ordCompl special case

    theorem Nat.factorization_ordCompl (n p : ℕ) : (n / p ^ n.factorization p).factorization = Finsupp.erase p n.factorization

    Mathlib.Data.Nat.Factorization.Basic · lines 204–214

    Why a special case: Lean forms the article's product of n with its p-adic size as the quotient of n by p to its p-adic order, writes the order as the exponent map, and works with naturals rather than integers.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key fa724999f711 · pair key a626b32991ed.

    Nat.primeFactors_ordCompl special case

    theorem Nat.primeFactors_ordCompl (n p : ℕ) : (n / p ^ n.factorization p).primeFactors = n.primeFactors.erase p

    TauCeti.Data.Nat.Factorization.Basic · lines 34–37

    Why a special case: This records the same removal at the level of the set of prime factors, over naturals.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab.
    • Location key cca23dac9b42 · pair key 50c0a1aa22e8.

    Nat.not_dvd_ordCompl states part

    theorem Nat.not_dvd_ordCompl {n p : ℕ} : Nat.Prime p → n ≠ 0 → ¬p ∣ n / p ^ n.factorization p

    Mathlib.Data.Nat.Factorization.Basic · lines 196–199

    Why only part: It gives that no factor of p is left and says nothing about the other primes being kept.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 5255500e8162 · pair key d329ca4282f5.
  137. Definition · main statement · Abstract algebra › p-adic numbers

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    Just as the distance between two real numbers can be measured by the absolute value of their difference, the distance between two rational numbers can be measured by their ⁠ p ⁠-adic distance, the ⁠ p ⁠-adic absolute value of their difference.

    Show in article · Read it in context on Wikipedia

    WithAbs.normedField more general

    instance WithAbs.normedField {R : Type*} [Field R] (v : AbsoluteValue R ℝ) : NormedField (WithAbs v)

    Mathlib.Analysis.Normed.Field.WithAbs · lines 40–42

    Why more general: The instance equips a field carrying any real absolute value with the metric whose norm is that absolute value, so it covers the p-adic absolute value on the rationals among many other choices.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 7ad84b5712cf · pair key 7925af319ea1.

    Padic.metricSpace more general

    instance Padic.metricSpace (p : ℕ) [Fact (Nat.Prime p)] : MetricSpace ℚ_[p]

    Mathlib.NumberTheory.Padics.PadicNumbers · lines 787–798

    Why more general: The metric is carried by the whole field of p-adic numbers, a domain strictly larger than the rationals whose extra points have real content, and it agrees with the p-adic absolute value on rational arguments.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 8b0822c617e3 · pair key 9c756b52bdb9.
  138. Theorem · supporting · Abstract algebra › p-adic numbers

    Partial

    Partial: Mathlib states a special case (proved).

    For this definition of distance, two numbers are close together (they have a small distance) when their difference is divisible by a high power of ⁠ p ⁠.

    Show in article · Read it in context on Wikipedia

    padicNorm.dvd_iff_norm_le special case

    theorem padicNorm.dvd_iff_norm_le {p : ℕ} [hp : Fact (Nat.Prime p)] {n : ℕ} {z : ℤ} : ↑(p ^ n) ∣ z ↔ padicNorm p ↑z ≤ ↑p ^ (-↑n)

    Mathlib.NumberTheory.Padics.PadicNorm · lines 214–224

    Why a special case: Divisibility is stated of an integer argument, so the equivalence is the passage restricted to pairs of rationals whose difference is an integer.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key c6b0fc7ef8c8 · pair key 7ecc11ca3bec.

    Padic.norm_int_le_pow_iff_dvd special case

    theorem Padic.norm_int_le_pow_iff_dvd {p : ℕ} [hp : Fact (Nat.Prime p)] (k : ℤ) (n : ℕ) : ‖↑k‖ ≤ ↑p ^ (-↑n) ↔ ↑p ^ n ∣ k

    Mathlib.NumberTheory.Padics.PadicNumbers · lines 964–969

    Why a special case: The same equivalence is stated for an integer cast into the p-adic numbers, so it gives the passage only for pairs whose difference is an integer.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key dd6149c5ed2d · pair key 5b03f5b80438.
  139. Construction · main statement · Abstract algebra › p-adic numbers

    Formalized

    Formalized: Mathlib states this exactly (a definition).

    In the same way that the real numbers can be formed from the rational numbers and their distances, by adding extra limiting values to form a complete field, the rational numbers with the ⁠ p ⁠-adic distance can be extended to a different complete field, the ⁠ p ⁠-adic numbers.

    Show in article · Read it in context on Wikipedia

    Padic exact match

    def Padic (p : ℕ) [Fact (Nat.Prime p)] : Type

    Mathlib.NumberTheory.Padics.PadicNumbers · lines 536–538

    Note: The type is introduced as the Cauchy completion of the rationals for the p-adic norm, which is the construction the passage describes, and it carries the field and completeness structure the wording asks for.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key a57490b425a6 · pair key 21c66a0a2b7a.

    Padic.withValRingEquiv close match

    def Padic.withValRingEquiv {p : ℕ} [Fact (Nat.Prime p)] : (Rat.padicValuation p).Completion ≃+* ℚ_[p]

    Mathlib.NumberTheory.Padics.WithVal · lines 104–133

    Why close, not exact: It writes the p-adic distance through the p-adic valuation of the rationals and identifies the resulting completion with the field of p-adic numbers by a ring isomorphism.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key e43712f7c54d · pair key 5c9d4eb29b95.
  140. Definition · supporting · Abstract algebra › p-adic numbers

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    This picture of an order, absolute value, and complete field derived from them can be generalized to algebraic number fields and their valuations (certain mappings from the multiplicative group of the field to a totally ordered additive group, also called orders), absolute values (certain multiplicative mappings from the field to the real numbers, also called norms),[111] and places (extensions to complete fields in which the given field is a dense set, also called completions).

    Show in article · Read it in context on Wikipedia

    AddValuation more general

    def AddValuation (R : Type u_3) [Ring R] (Γ₀ : Type u_4) [LinearOrderedAddCommMonoidWithTop Γ₀] : Type (max u_3 u_4)

    Mathlib.RingTheory.Valuation.Basic · lines 1057–1058

    Why more general: Mathlib's additive valuation is written for any ring into any linearly ordered additive monoid with a top element, and it carries the multiplicativity and ultrametric conditions that the passage hides behind the word 'certain'.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key c3cb6ea121a2 · pair key fbb05282e541.

    Valuation more general

    structure Valuation (R : Type*) (Γ₀ : Type*) [LinearOrderedCommMonoidWithZero Γ₀] [Ring R]

    Mathlib.RingTheory.Valuation.Basic · lines 79–81

    Why more general: This is the same notion written multiplicatively, over an arbitrary ring and an arbitrary linearly ordered commutative target with a zero.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 62a4ea7282db · pair key ce68f870ab09.
  141. Definition · supporting · Abstract algebra › p-adic numbers

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    This picture of an order, absolute value, and complete field derived from them can be generalized to algebraic number fields and their valuations (certain mappings from the multiplicative group of the field to a totally ordered additive group, also called orders), absolute values (certain multiplicative mappings from the field to the real numbers, also called norms),[111] and places (extensions to complete fields in which the given field is a dense set, also called completions).

    Show in article · Read it in context on Wikipedia

    AbsoluteValue more general

    structure AbsoluteValue (R : Type*) (S : Type*) [Semiring R] [Semiring S] [PartialOrder S]

    Mathlib.Algebra.Order.AbsoluteValue.Basic · lines 36–43

    Why more general: The structure is written for an arbitrary semiring mapping into an arbitrary ordered semiring, and it bundles multiplicativity with nonnegativity, positive definiteness and the triangle inequality, the conditions the passage hides behind 'certain'.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key c7038e52a1cf · pair key bda17d623838.
  142. Definition · supporting · Abstract algebra › p-adic numbers

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    …derived from them can be generalized to algebraic number fields and their valuations (certain mappings from the multiplicative group of the field to a totally ordered additive group, also called orders), absolute values (certain multiplicative mappings from the field to the real numbers, also called norms),[111] and places (extensions to complete fields in which the given field is a dense set, also called completions).[113]

    Show in article · Read it in context on Wikipedia

    AbsoluteValue.Completion more general

    abbrev AbsoluteValue.Completion {K : Type u_1} [Field K] : AbsoluteValue K ℝ → Type u_1

    Mathlib.Analysis.Normed.Field.WithAbs · line 108

    Why more general: Mathlib forms the completion for any field equipped with a real absolute value, and the field maps into it with dense image, so it covers the passage's algebraic number fields among all other fields.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key e659d666f3e3 · pair key d47076f3a822.

    Rat.Place.CompletedField special case

    abbrev Rat.Place.CompletedField : Rat.Place → Type

    MathlibExt.NumberTheory.Rat.Place · line 81

    Why a special case: The construction is given only for the rationals, where the places are enumerated as the archimedean one and the p-adic ones.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key e4f3243d400d · pair key 0ebb76d453bd.

    NumberField.InfinitePlace.Completion special case

    structure NumberField.InfinitePlace.Completion {K : Type u_1} [Field K] : NumberField.InfinitePlace K → Type u_1

    Mathlib.NumberTheory.NumberField.Completion.InfinitePlace · lines 79–83

    Why a special case: Only the archimedean places of a number field are covered, so this is the passage's notion restricted to those places.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 0ab04d9654d0 · pair key 94c79a718185.
  143. Example · supporting · Abstract algebra › p-adic numbers

    Partial

    Partial: ATLAS (atlas-lean) states part of this (proved).

    The extension from the rational numbers to the real numbers, for instance, is a place in which the distance between numbers is the usual absolute value of their difference.

    Show in article · Read it in context on Wikipedia

    Rat.Place.completedField_infinite states part

    theorem Rat.Place.completedField_infinite : Rat.Place.infinite.CompletedField = ℝ

    MathlibExt.NumberTheory.Rat.Place · line 90

    Why only part: The library writes the ordinary absolute value of the rationals under the constructor name for the archimedean place, and states that the complete field attached to it is the reals.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key 1eeced2bf260 · pair key 9f003b48af98.
  144. Theorem · supporting · Abstract algebra › p-adic numbers

    Not formalized
    The corresponding mapping to an additive group would be the logarithm of the absolute value, although this does not meet all the requirements of a valuation.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 3 candidates examined (receipt 7f4455227cc9).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  145. Theorem · main statement · Abstract algebra › p-adic numbers

    Partial

    Partial: Mathlib states part of this (proved).

    According to Ostrowski's theorem, up to a natural notion of equivalence, the real numbers and ⁠ p ⁠-adic numbers, with their orders and absolute values, are the only valuations, absolute values, and places on the rational numbers.[111]

    Show in article · Read it in context on Wikipedia

    Rat.AbsoluteValue.equiv_real_or_padic states part

    theorem Rat.AbsoluteValue.equiv_real_or_padic (f : AbsoluteValue ℚ ℝ) : f.IsNontrivial → f ≈ Rat.AbsoluteValue.real ∨ ∃! p, ∃ (x : Fact (Nat.Prime p)), f ≈ Rat.AbsoluteValue.padic p

    Mathlib.NumberTheory.Ostrowski · lines 437–441

    Why only part: The declaration states the classification in its absolute-value form and assumes the absolute value is nontrivial; the passage's parallel claims for valuations and for places are not stated by it.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 4dafa914357e · pair key c3bc228b6759.
  146. Definition · main statement · Abstract algebra › Prime elements of a ring

    Formalized

    Formalized: Mathlib states this exactly (a definition).

    A commutative ring is an algebraic structure where addition, subtraction and multiplication are defined.

    Show in article · Read it in context on Wikipedia

    CommRing exact match

    class CommRing : Type u → Type u

    Mathlib.Algebra.Ring.Defs · line 413

    Note: This is the Lean class that the passage's phrase names, with subtraction given by the additive inverse the class carries.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key a49ea7eb3d76 · pair key e1fc2cb30985.
  147. Example · supporting · Abstract algebra › Prime elements of a ring

    Formalized

    Formalized: Mathlib states this exactly (a definition).

    The integers are a ring, and the prime numbers in the integers have been generalized to rings in two different ways, prime elements and irreducible elements.

    Show in article · Read it in context on Wikipedia

    Int.instCommRing exact match

    instance Int.instCommRing : CommRing ℤ

    Mathlib.Algebra.Ring.Int.Defs · lines 28–45

    Note: This is the integer type's own commutative ring instance, the declaration stated for the passage's objects.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 9adadcdd625d · pair key c3199e8df2a4.
  148. Definition · main statement · Abstract algebra › Prime elements of a ring

    Formalized

    Formalized: Mathlib states a more general result (a Prop-valued definition: it states the claim without proving it).

    An element ⁠ p ⁠ of a ring ⁠ R ⁠ is called prime if it is nonzero, has no multiplicative inverse (that is, it is not a unit), and satisfies the following requirement: whenever ⁠ p ⁠ divides the product xy of two elements of ⁠ R ⁠, it also divides at least one of ⁠ x ⁠ or ⁠ y ⁠.

    Show in article · Read it in context on Wikipedia

    Prime more general

    def Prime {M : Type*} [CommMonoidWithZero M] : M → Prop

    Mathlib.Algebra.Prime.Defs · lines 43–44

    Why more general: Mathlib defines the predicate over any commutative monoid with zero, which is a wider class of carriers than the passage's rings.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 28650f3af0b6 · pair key 1a755bc7e567.
  149. Definition · main statement · Abstract algebra › Prime elements of a ring

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    An element is irreducible if it is neither a unit nor the product of two other non-unit elements.

    Show in article · Read it in context on Wikipedia

    Irreducible more general

    structure Irreducible {M : Type*} [Monoid M] : M → Prop

    Mathlib.Algebra.Group.Irreducible.Defs · lines 45–49

    Why more general: Mathlib states the predicate for any monoid, a wider class of carriers than the passage's rings, and asks for no nonzero condition, matching the passage's wording.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 881f365868e0 · pair key dc9f4fb9fbd6.
  150. Theorem · main statement · Abstract algebra › Prime elements of a ring

    Partial

    Partial: Mathlib states part of this (proved).

    In the ring of integers, the prime and irreducible elements form the same set, {…, −11, −7, −5, −3, −2, 2, 3, 5, 7, 11, …} .

    Show in article · Read it in context on Wikipedia

    Int.prime_iff_natAbs_prime states part

    theorem Int.prime_iff_natAbs_prime {k : ℤ} : Prime k ↔ Nat.Prime k.natAbs

    Mathlib.RingTheory.Int.Basic · lines 103–104

    Why only part: It pins down which integers are prime elements, but it does not say that the irreducible integers are the same ones.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 774a39ea74c7 · pair key 5f2426d42453.

    irreducible_iff_prime states part

    theorem irreducible_iff_prime {M : Type*} [CommMonoidWithZero M] [IsCancelMulZero M] [DecompositionMonoid M] {a : M} : Irreducible a ↔ Prime a

    Mathlib.Algebra.Prime.Defs · lines 168–169

    Why only part: It gives the coincidence of the two notions but says nothing about which integers they are.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 156d43e0496c · pair key 17d79cf06a92.
  151. Theorem · main statement · Abstract algebra › Prime elements of a ring

    Partial

    Partial: Mathlib states a special case (proved).

    In an arbitrary ring, all prime elements are irreducible.

    Show in article · Read it in context on Wikipedia

    Prime.irreducible special case

    theorem Prime.irreducible {M : Type*} [CommMonoidWithZero M] [IsCancelMulZero M] {p : M} : Prime p → Irreducible p

    Mathlib.Algebra.Prime.Defs · lines 159–166

    Why a special case: The cancellation hypothesis is a genuine restriction of the passage's arbitrary rings: in the integers modulo six the element two is prime yet factors as two times four with neither factor a unit, so the passage's unrestricted claim fails there.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 72e1348fdff4 · pair key 87dec731940f.
  152. Theorem · supporting · Abstract algebra › Prime elements of a ring

    Partial

    Partial: Mathlib states part of this (proved).

    The converse does not hold in general, but does hold for unique factorization domains.

    Show in article · Read it in context on Wikipedia

    Irreducible.prime states part

    theorem Irreducible.prime {M : Type*} [CommMonoidWithZero M] [DecompositionMonoid M] {a : M} : Irreducible a → Prime a

    Mathlib.Algebra.Prime.Defs · lines 150–151

    Why only part: Mathlib proves it for decomposition monoids, a class that every unique factorization domain instantiates through its own instance.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 6493afe0c953 · pair key 4699cfd245f8.

    irreducible_iff_prime states part

    theorem irreducible_iff_prime {M : Type*} [CommMonoidWithZero M] [IsCancelMulZero M] [DecompositionMonoid M] {a : M} : Irreducible a ↔ Prime a

    Mathlib.Algebra.Prime.Defs · lines 168–169

    Why only part: The declaration also carries the converse direction, which the article states in the preceding sentence rather than in this passage.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key e0b7bddb3286 · pair key 450ae1eee493.
  153. Theorem · main statement · Abstract algebra › Prime elements of a ring

    Partial

    Partial: Mathlib states part of this (proved).

    The fundamental theorem of arithmetic continues to hold (by definition) in unique factorization domains.

    Show in article · Read it in context on Wikipedia

    UniqueFactorizationMonoid.factors_unique states part

    theorem UniqueFactorizationMonoid.factors_unique {α : Type*} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] {f g : Multiset α} : (∀ x ∈ f, Irreducible x) → (∀ x ∈ g, Irreducible x) → Associated f.prod g.prod → Multiset.Rel Associated f g

    Mathlib.RingTheory.UniqueFactorizationDomain.Basic · lines 109–112

    Why only part: This gives the uniqueness half of factorization into irreducibles in such a domain.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 88f65557406c · pair key 48698107fbb5.

    UniqueFactorizationMonoid.factors_prod states part

    theorem UniqueFactorizationMonoid.factors_prod {α : Type*} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] {a : α} : a ≠ 0 → Associated (UniqueFactorizationMonoid.factors a).prod a

    Mathlib.RingTheory.UniqueFactorizationDomain.Defs · lines 195–197

    Why only part: Together with the irreducibility of those factors this gives the existence half of the factorization.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key b1df14c8f32a · pair key 5f1146a578e8.

    UniqueFactorizationMonoid.irreducible_of_factor states part

    theorem UniqueFactorizationMonoid.irreducible_of_factor {α : Type*} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] {a : α} : ∀ x ∈ UniqueFactorizationMonoid.factors a, Irreducible x

    Mathlib.RingTheory.UniqueFactorizationDomain.Defs · lines 214–215

    Why only part: It supplies the irreducibility of the factors that the passage's factorization is into.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key a62f499527bc · pair key a09eb8de9c75.
  154. Definition · main statement · Abstract algebra › Prime elements of a ring

    Formalized

    Formalized: Mathlib states this up to a convention difference (a definition).

    An example of such a domain is the Gaussian integers ⁠ ℤ[i] ⁠, the ring of complex numbers of the form a + bi where ⁠ i ⁠ denotes the imaginary unit and ⁠ a ⁠ and ⁠ b ⁠ are arbitrary integers.

    Show in article · Read it in context on Wikipedia

    GaussianInt close match

    abbrev GaussianInt : Type

    Mathlib.NumberTheory.Zsqrtd.GaussianInt · lines 50–51

    Why close, not exact: Mathlib builds the ring as adjoining a square root of minus one to the integers, a pair of integer coordinates rather than a subset of the complex numbers, with GaussianInt.toComplex sending such a pair to a+bi.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 723e296c06cb · pair key 2cdf292a11e0.

    PrincipalIdealRing.to_uniqueFactorizationMonoid states part

    instance PrincipalIdealRing.to_uniqueFactorizationMonoid {R : Type u} [CommRing R] [IsDomain R] [IsPrincipalIdealRing R] : UniqueFactorizationMonoid R

    Mathlib.RingTheory.PrincipalIdealDomain · lines 370–371

    Why only part: The chain of instances from the Euclidean division on the Gaussian integers through principal ideals reaches this unique factorization instance.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 263ce3173032 · pair key e29d97beff7c.
  155. Definition · main statement · Abstract algebra › Prime elements of a ring

    Formalized

    Formalized: Mathlib states a more general result (a Prop-valued definition: it states the claim without proving it).

    Its prime elements are known as Gaussian primes.

    Show in article · Read it in context on Wikipedia

    Prime more general

    def Prime {M : Type*} [CommMonoidWithZero M] : M → Prop

    Mathlib.Algebra.Prime.Defs · lines 43–44

    Why more general: Mathlib defines the prime-element predicate for an arbitrary commutative monoid with zero, and the passage names its instance at the Gaussian integers.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 20348be0bf18 · pair key 7ffba473b582.
  156. Theorem · supporting · Abstract algebra › Prime elements of a ring

    Formalized

    Formalized: Mathlib states a more general result (proved).

    Not every number that is prime among the integers remains prime in the Gaussian integers; for instance, the number 2 can be written as a product of the two Gaussian primes 1 + i and ⁠ 1 − i ⁠.

    Show in article · Read it in context on Wikipedia

    GaussianInt.prime_iff_mod_four_eq_three_of_nat_prime more general

    theorem GaussianInt.prime_iff_mod_four_eq_three_of_nat_prime (p : ℕ) [Fact (Nat.Prime p)] : Prime ↑p ↔ p % 4 = 3

    Mathlib.NumberTheory.Zsqrtd.QuadraticReciprocity · lines 83–85

    Why more general: Mathlib indexes the rational prime by a natural number p : ℕ and casts it in; a prime of the integers in the passage's sense is such a natural prime up to a unit factor, so the passage's claim is the one stated here.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 97c2a4325b4b · pair key ed21804b921d.

    GaussianInt.mod_four_eq_three_of_nat_prime_of_prime more general

    theorem GaussianInt.mod_four_eq_three_of_nat_prime_of_prime (p : ℕ) [hp : Fact (Nat.Prime p)] : Prime ↑p → p % 4 = 3

    Mathlib.NumberTheory.Zsqrtd.QuadraticReciprocity · lines 34–71

    Why more general: The statement is over natural numbers, p : ℕ, and the integer primes of the passage are these natural primes together with their negatives, which are associates of them.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key e65ead9d86f1 · pair key 56265923abaf.
  157. Example · supporting · Abstract algebra › Prime elements of a ring

    Partial

    Partial: Mathlib states part of this (proved).

    Not every number that is prime among the integers remains prime in the Gaussian integers; for instance, the number 2 can be written as a product of the two Gaussian primes 1 + i and ⁠ 1 − i ⁠.

    Show in article · Read it in context on Wikipedia

    Zsqrtd.mul_star states part

    theorem Zsqrtd.mul_star {d x y : ℤ} : { re := x, im := y } * Star.star { re := x, im := y } = ↑x * ↑x - ↑d * ↑y * ↑y

    Mathlib.NumberTheory.Zsqrtd.Basic · lines 280–281

    Why only part: The declaration yields the product of the two factors the passage names, but says nothing about their primality.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 951ee2500324 · pair key 065d38859742.
  158. Theorem · main statement · Abstract algebra › Prime elements of a ring

    Formalized

    Formalized: Mathlib states a more general result (proved).

    Formalized by 2 parts together (more general):

    1. GaussianInt.prime_of_nat_prime_of_mod_four_eq_three Mathlib (proved)
      • a rational prime that is 3 modulo 4 is a Gaussian prime
    2. GaussianInt.mod_four_eq_three_of_nat_prime_of_prime Mathlib (proved)
      • a rational prime that is 1 modulo 4 is not a Gaussian prime
    Rational primes (the prime elements in the integers) congruent to 3 mod 4 are Gaussian primes, but rational primes congruent to 1 mod 4 are not.[116]

    Show in article · Read it in context on Wikipedia

    GaussianInt.prime_iff_mod_four_eq_three_of_nat_prime more general

    theorem GaussianInt.prime_iff_mod_four_eq_three_of_nat_prime (p : ℕ) [Fact (Nat.Prime p)] : Prime ↑p ↔ p % 4 = 3

    Mathlib.NumberTheory.Zsqrtd.QuadraticReciprocity · lines 83–85

    Why more general: The equivalence is stated for a natural number p : ℕ and settles every residue, including the prime two that the passage's two cases leave aside.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key e941185481fa · pair key 7f1f2a7eaccc.

    GaussianInt.prime_of_nat_prime_of_mod_four_eq_three states part

    theorem GaussianInt.prime_of_nat_prime_of_mod_four_eq_three (p : ℕ) [Fact (Nat.Prime p)] : p % 4 = 3 → Prime ↑p

    Mathlib.NumberTheory.Zsqrtd.QuadraticReciprocity · lines 73–80

    Why only part: Mathlib encodes the rational prime as a natural number p : ℕ and uses its cast into the Gaussian integers, which is how a positive prime of the integers is written there.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key f8669b07f05a · pair key ef168fb34541.

    GaussianInt.mod_four_eq_three_of_nat_prime_of_prime states part

    theorem GaussianInt.mod_four_eq_three_of_nat_prime_of_prime (p : ℕ) [hp : Fact (Nat.Prime p)] : Prime ↑p → p % 4 = 3

    Mathlib.NumberTheory.Zsqrtd.QuadraticReciprocity · lines 34–71

    Why only part: The binder is a natural number p : ℕ, and it also covers the prime two, a case the conjunct does not speak about.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 135c08cd9725 · pair key f437d0a811bd.
  159. Theorem · main statement · Abstract algebra › Prime elements of a ring

    Partial

    Partial: Mathlib states part of this (proved).

    This is a consequence of Fermat's theorem on sums of two squares, which states that an odd prime ⁠ p ⁠ is expressible as the sum of two squares, ⁠ p = x2 + y2 ⁠, and therefore factorable as ⁠ p = (x + iy)(x − iy) ⁠, exactly when ⁠ p ⁠ is 1 mod 4.

    Show in article · Read it in context on Wikipedia

    Nat.Prime.sq_add_sq states part

    theorem Nat.Prime.sq_add_sq {p : ℕ} [Fact (Nat.Prime p)] : p % 4 ≠ 3 → ∃ a b, a ^ 2 + b ^ 2 = p

    Mathlib.NumberTheory.SumTwoSquares · lines 36–39

    Why only part: It yields the representation as a sum of two squares, and not the converse direction of the passage's criterion.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 3ab8c7d11593 · pair key efdc718d7e71.
  160. Theorem · supporting · Abstract algebra › Prime ideals

    Formalized

    Formalized: FF.QuadraticAlgebras states a more general result (proved).

    Not every ring is a unique factorization domain.

    Show in article · Read it in context on Wikipedia

    QuadraticAlgebra.not_uniqueFactorizationMonoid_int_negFive more general

    theorem QuadraticAlgebra.not_uniqueFactorizationMonoid_int_negFive : ¬UniqueFactorizationMonoid (QuadraticAlgebra ℤ (-5) 0)

    QuadraticAlgebras.SqrtNegFive · lines 147–152

    Why more general: The library fixes one commutative ring and denies the UniqueFactorizationMonoid property of it, where the passage only asserts that some such ring exists.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 85a6b1b.
    • Location key 385b3e8feff1 · pair key 0d5fe1272905.
  161. Example · supporting · Abstract algebra › Prime ideals

    Not formalized
    For instance, in the ring of numbers a + b√−5 (for integers ⁠ a ⁠ and ⁠ b ⁠) the number 21 has two factorizations ⁠ 21 = 3 ⋅ 7 = (1 + 2√−5)(1 − 2√−5) ⁠, where none of the four factors can be reduced any further, so it does not have a unique factorization.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 983ebb87f651).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  162. Theorem · supporting · Abstract algebra › Prime ideals

    Formalized

    Formalized: FF.QuadraticAlgebras states this up to a convention difference (proved).

    …a + b√−5 (for integers ⁠ a ⁠ and ⁠ b ⁠) the number 21 has two factorizations ⁠ 21 = 3 ⋅ 7 = (1 + 2√−5)(1 − 2√−5) ⁠, where none of the four factors can be reduced any further, so it does not have a unique factorization.

    Show in article · Read it in context on Wikipedia

    QuadraticAlgebra.not_uniqueFactorizationMonoid_int_negFive close match

    theorem QuadraticAlgebra.not_uniqueFactorizationMonoid_int_negFive : ¬UniqueFactorizationMonoid (QuadraticAlgebra ℤ (-5) 0)

    QuadraticAlgebras.SqrtNegFive · lines 147–152

    Why close, not exact: Lean carries the ring as a two-field structure over ℤ, the quotient of the integer polynomial ring by X squared plus five, and names the property by the UniqueFactorizationMonoid class.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 85a6b1b.
    • Location key d61c0ad5a490 · pair key 19211f7de73d.
  163. Definition · main statement · Abstract algebra › Prime ideals

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    In order to extend unique factorization to a larger class of rings, the notion of a number can be replaced with that of an ideal, a subset of the elements of a ring that contains all sums of pairs of its elements, and all products of its elements with ring elements.

    Show in article · Read it in context on Wikipedia

    Ideal more general

    abbrev Ideal (R : Type u) [Semiring R] : Type u

    Mathlib.RingTheory.Ideal.Defs · lines 40–41

    Why more general: Mathlib defines an ideal of a semiring as a submodule of the ring over itself, so membership is closed under sums and under multiplication by arbitrary ring elements, and the semiring setting reaches past the passage's rings.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 834cb011985f · pair key 3060666cbbe4.
  164. Theorem · main statement · Abstract algebra › Prime ideals

    Formalized

    Formalized: Mathlib states a more general result (proved).

    Prime ideals, which generalize prime elements in the sense that the principal ideal generated by a prime element is a prime ideal, are an important tool and object of study in commutative algebra, algebraic number theory and algebraic geometry.

    Show in article · Read it in context on Wikipedia

    Ideal.isPrime_span_singleton_of_prime more general

    theorem Ideal.isPrime_span_singleton_of_prime {α : Type u} [CommSemiring α] {p : α} : Prime p → (Ideal.span {p}).IsPrime

    Mathlib.RingTheory.Ideal.Maximal · lines 151–152

    Why more general: Mathlib states it for commutative semirings, a class that reaches past the passage's rings, with the principal ideal written as the span of the one-element set.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 9eb6f5eb2ab6 · pair key e81279139e9e.

    Ideal.span_singleton_prime more general

    theorem Ideal.span_singleton_prime {α : Type u} [CommSemiring α] {p : α} : p ≠ 0 → ((Ideal.span {p}).IsPrime ↔ Prime p)

    Mathlib.RingTheory.Ideal.Maximal · lines 148–149

    Why more general: An equivalence between primality of the element and primality of the ideal it spans, assumed nonzero, over commutative semirings.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key ef48b56882bc · pair key e93b518c0397.
  165. Theorem · supporting · Abstract algebra › Prime ideals

    Formalized

    Formalized: Mathlib states this exactly (proved).

    The prime ideals of the ring of integers are the ideals ⁠ (0) ⁠, ⁠ (2) ⁠, ⁠ (3) ⁠, ⁠ (5) ⁠, ⁠ (7) ⁠, ⁠ (11) ⁠, ...

    Show in article · Read it in context on Wikipedia

    Ideal.isPrime_int_iff exact match

    theorem Ideal.isPrime_int_iff {P : Ideal ℤ} : P.IsPrime ↔ P = ⊥ ∨ ∃ p, Nat.Prime p ∧ P = Ideal.span {↑p}

    Mathlib.RingTheory.Ideal.NatInt · lines 85–89

    Note: The nonzero prime ideals are indexed by a natural number p with Nat.Prime p, cast into ℤ, so the generators are the ℕ-valued primes 2, 3, 5, 7, 11 and so on that the article lists, while the bottom ideal is the zero ideal; the ideals themselves are ideals of ℤ, so the integer setting of the passage is kept.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 5ec40ddd7c51 · pair key 823e4ae571c6.
  166. Theorem · main statement · Abstract algebra › Prime ideals

    Formalized

    Formalized: Mathlib states a more general result (proved).

    The fundamental theorem of arithmetic generalizes to the Lasker–Noether theorem, which expresses every ideal in a Noetherian commutative ring as an intersection of primary ideals, which are the appropriate generalizations of prime powers.

    Show in article · Read it in context on Wikipedia

    Submodule.isLasker more general

    theorem Submodule.isLasker (R : Type*) (M : Type*) [CommRing R] [AddCommGroup M] [_root_.Module R M] [IsNoetherian R M] : IsLasker R M

    Mathlib.RingTheory.Lasker · lines 275–276

    Why more general: Mathlib proves it for every Noetherian module over a commutative ring and phrases the conclusion as a decomposition into finitely many primary submodules, which for the ring as a module over itself are primary ideals.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 3334f969d336 · pair key 2fcc3299854c.
  167. Definition · main statement · Abstract algebra › Prime ideals

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    The spectrum of a ring is a geometric space whose points are the prime ideals of the ring.[119]

    Show in article · Read it in context on Wikipedia

    PrimeSpectrum more general

    structure PrimeSpectrum (R : Type*) [CommSemiring R]

    Mathlib.RingTheory.Spectrum.Prime.Defs · lines 34–36

    Why more general: Mathlib builds the spectrum for commutative semirings, beyond the passage's rings, as the type of prime ideals, and the Zariski topology that makes it a space is attached to it as an instance.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key d460f6821b95 · pair key 3684c15f6114.
  168. Theorem · main statement · Abstract algebra › Group theory

    Formalized

    Formalized: Mathlib states this exactly (proved).

    In the theory of finite groups the Sylow theorems imply that, if a power of a prime number pn divides the order of a group, then the group has a subgroup of order ⁠ pn ⁠.

    Show in article · Read it in context on Wikipedia

    Sylow.exists_subgroup_card_pow_prime exact match

    theorem Sylow.exists_subgroup_card_pow_prime {G : Type u} [Group G] [Finite G] (p : ℕ) {n : ℕ} [Fact (Nat.Prime p)] : p ^ n ∣ Nat.card G → ∃ K, Nat.card ↥K = p ^ n

    Mathlib.GroupTheory.Sylow · lines 723–727

    Note: Lean measures the order with Nat.card and returns the subgroup as an existential over subgroups of G.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key baa5d30694a9 · pair key e9f66ba23d4f.
  169. Theorem · main statement · Abstract algebra › Group theory

    Formalized

    Formalized: Mathlib states this exactly (proved).

    By Lagrange's theorem, any group of prime order is a cyclic group, and by Burnside's theorem any group whose order is divisible by only two primes is solvable.

    Show in article · Read it in context on Wikipedia

    isCyclic_of_prime_card exact match

    theorem isCyclic_of_prime_card {α : Type*} [Group α] {p : ℕ} [hp : Fact (Nat.Prime p)] : Nat.card α = p → IsCyclic α

    Mathlib.GroupTheory.SpecificGroups.Cyclic.Subgroup · lines 118–123

    Note: Lean records the order as Nat.card and the conclusion as the IsCyclic predicate.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 42e6c86121af · pair key c0ac0d15d7a0.
  170. Theorem · main statement · Abstract algebra › Group theory

    Formalized

    Formalized: ATLAS (atlas-lean) states a more general result (proved).

    By Lagrange's theorem, any group of prime order is a cyclic group, and by Burnside's theorem any group whose order is divisible by only two primes is solvable.

    Show in article · Read it in context on Wikipedia

    BurnsidePaqb.burnside_paqb more general

    theorem BurnsidePaqb.burnside_paqb {G : Type*} [Group G] [Fintype G] (p q a b : ℕ) : Nat.Prime p → Nat.Prime q → Fintype.card G = p ^ a * q ^ b → Group.IsSolvable G

    MathlibExt.GroupTheory.BurnsidePaqb · line 60

    Why more general: The Lean hypothesis is the factored shape of the order rather than a count of its prime divisors, and it also admits a zero exponent, so it reaches orders built from a single prime and the trivial order as well.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key bfed7fdaf3c2 · pair key cbbc7afa43f7.

    TauCeti.isSolvable_of_card_eq_prime_pow_mul_prime_pow more general

    theorem TauCeti.isSolvable_of_card_eq_prime_pow_mul_prime_pow {G : Type u} [Group G] [Finite G] {p q : ℕ} : Nat.Prime p → Nat.Prime q → ∀ {a b : ℕ}, Nat.card G = p ^ a * q ^ b → Group.IsSolvable G

    TauCeti.RepresentationTheory.CharacterTable.Solvable · lines 219–221

    Why more general: This version states the order with Nat.card and takes the group's finiteness through the Finite class; like the other it also covers a zero exponent.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab.
    • Location key dd7f6d7884de · pair key 8a8b2daedf2f.
  171. Definition · main statement · Computational methods › Trial division

    Not formalized
    The most basic method of checking the primality of a given integer ⁠ n ⁠ is called trial division.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 00769e0ab44b).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  172. Construction · supporting · Computational methods › Trial division

    Not formalized
    This method divides ⁠ n ⁠ by each integer from 2 up to the square root of ⁠ n ⁠.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 15da95f31df5).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  173. Theorem · supporting · Computational methods › Trial division

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    Any such integer dividing ⁠ n ⁠ evenly establishes ⁠ n ⁠ as composite; otherwise it is prime.

    Show in article · Read it in context on Wikipedia

    Nat.prime_def_le_sqrt close match

    theorem Nat.prime_def_le_sqrt {p : ℕ} : Nat.Prime p ↔ 2 ≤ p ∧ ∀ (m : ℕ), 2 ≤ m → m ≤ p.sqrt → ¬m ∣ p

    Mathlib.Data.Nat.Prime.Defs · lines 124–131

    Why close, not exact: Lean states this over ℕ, where the tested number and its candidate divisors already live, and it writes being composite as the failure of Nat.Prime together with the explicit bound two ≤ n that the passage leaves implicit for a number under test.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key a91d2688d9a0 · pair key 97f80b111cdb.
  174. Theorem · supporting · Computational methods › Trial division

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    Integers larger than the square root do not need to be checked because, whenever ⁠ n = a ⋅ b ⁠, one of the two factors ⁠ a ⁠ and ⁠ b ⁠ is less than or equal to the square root of ⁠ n ⁠.

    Show in article · Read it in context on Wikipedia

    Nat.le_sqrt_of_eq_mul close match

    theorem Nat.le_sqrt_of_eq_mul {a b c : ℕ} : a = b * c → b ≤ a.sqrt ∨ c ≤ a.sqrt

    Mathlib.Data.Nat.Sqrt · lines 134–137

    Why close, not exact: Lean writes the bound with the natural-number square root, the floor of the real one, and for a natural factor the two bounds agree.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key b0cda0b081a2 · pair key 47ced959b59d.
  175. Example · supporting · Computational methods › Trial division

    Formalized

    Formalized: TauCeti states a more general result (proved).

    Each division produces a nonzero remainder, so 37 is indeed prime.

    Show in article · Read it in context on Wikipedia

    TauCeti.fact_prime_thirtySeven_symmetricFour more general

    theorem TauCeti.fact_prime_thirtySeven_symmetricFour : Fact (Nat.Prime 37)

    TauCeti.RepresentationTheory.CharacterTable.Dixon.Rational.SymmetricFour.Solver · lines 56–57

    Why more general: Lean wraps the primality of 37 in the Fact class used for instance search; primality says more than the three divisions the passage reports.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab.
    • Location key ad3fbaab4f1b · pair key bd26115db194.

    PierpontPrime.thirtySeven_isPierpontPrime more general

    theorem PierpontPrime.thirtySeven_isPierpontPrime : PierpontPrime.IsPierpontPrime 37

    FormalConjectures.Wikipedia.PierpontPrime · lines 45–47

    Why more general: It asserts primality of 37 together with its shape as two to a power times three to a power plus one, which is extra content the passage does not mention.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, low confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 7f58d461832f · pair key 81f9d73ec8c3.
  176. Example · supporting · Computational methods › Trial division

    Formalized

    Formalized: TauCeti states this up to a convention difference (proved).

    Each division produces a nonzero remainder, so 37 is indeed prime.

    Show in article · Read it in context on Wikipedia

    TauCeti.fact_prime_thirtySeven_symmetricFour close match

    theorem TauCeti.fact_prime_thirtySeven_symmetricFour : Fact (Nat.Prime 37)

    TauCeti.RepresentationTheory.CharacterTable.Dixon.Rational.SymmetricFour.Solver · lines 56–57

    Why close, not exact: Lean wraps the primality of 37 in the Fact typeclass so instance search can find it; the wrapper has one field, that primality.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab.
    • Location key b2dc678dc37c · pair key 59f5f9ecdc87.

    PierpontPrime.thirtySeven_isPierpontPrime more general

    theorem PierpontPrime.thirtySeven_isPierpontPrime : PierpontPrime.IsPierpontPrime 37

    FormalConjectures.Wikipedia.PierpontPrime · lines 45–47

    Why more general: Besides primality the declaration records that 37 is one more than a product of powers of two and of three.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 8d6d5debaf84 · pair key f22c02b634b4.
  177. Theorem · supporting · Computational methods › Trial division

    Not formalized
    Although this method is simple to describe, it is impractical for testing the primality of large integers, because the number of tests that it performs grows exponentially as a function of the number of digits of these integers.[127]

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 858b8ab210eb).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  178. Construction · supporting · Computational methods › Primality testing versus primality proving

    Not formalized
    For instance the Solovay–Strassen primality test on a given number ⁠ p ⁠ chooses a number ⁠ a ⁠ randomly from 2 through p − 2 and uses modular exponentiation to check whether a(p − 1)/2 ± 1 is divisible by ⁠ p ⁠.[d] If so, it answers yes and otherwise it answers no.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 1e4d0d726d17).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  179. Theorem · supporting · Computational methods › Primality testing versus primality proving

    Partial

    Partial: Mathlib states part of this (proved).

    If ⁠ p ⁠ really is prime, it will always answer yes, but if ⁠ p ⁠ is composite then it answers yes with probability at most 1/2 and no with probability at least 1/2.[135]

    Show in article · Read it in context on Wikipedia

    ZMod.pow_div_two_eq_neg_one_or_one states part

    theorem ZMod.pow_div_two_eq_neg_one_or_one (p : ℕ) [Fact (Nat.Prime p)] {a : ZMod p} : a ≠ 0 → a ^ (p / 2) = 1 ∨ a ^ (p / 2) = -1

    Mathlib.NumberTheory.LegendreSymbol.Basic · lines 75–82

    Why only part: Lean writes the exponent as p/2, which is (p-1)/2 for every odd prime, and states the congruence in ZMod p rather than as divisibility of an integer; it ranges over all nonzero residues, not only the drawn ones, and it does not treat the composite input at all.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 8385e07772d0 · pair key b33e7dc8155b.
  180. Theorem · supporting · Computational methods › Primality testing versus primality proving

    Not formalized
    If this test is repeated ⁠ n ⁠ times on the same number, the probability that a composite number could pass the test every time is at most ⁠ 1/2n ⁠.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 5a737601e28b).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  181. Theorem · supporting · Computational methods › Primality testing versus primality proving

    Formalized

    Formalized: Mathlib states a more general result (proved).

    On the other hand, if the test ever fails, then the number is certainly composite.[136]

    Show in article · Read it in context on Wikipedia

    ZMod.pow_div_two_eq_neg_one_or_one more general

    theorem ZMod.pow_div_two_eq_neg_one_or_one (p : ℕ) [Fact (Nat.Prime p)] {a : ZMod p} : a ≠ 0 → a ^ (p / 2) = 1 ∨ a ^ (p / 2) = -1

    Mathlib.NumberTheory.LegendreSymbol.Basic · lines 75–82

    Why more general: Lean states the direction for a prime modulus in ZMod p; the passage's claim is its contrapositive, and the numbers the test is run on exceed one, so failing primality means being composite.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 691d97fb51bb · pair key 235e63ab2586.
  182. Definition · main statement · Computational methods › Primality testing versus primality proving

    Partial

    Partial: Mathlib states a special case (a Prop-valued definition: it states the claim without proving it).

    A composite number that passes such a test is called a pseudoprime.

    Show in article · Read it in context on Wikipedia

    Nat.FermatPsp special case

    def Nat.FermatPsp : ℕ → ℕ → Prop

    Mathlib.NumberTheory.FermatPsp · lines 66–67

    Why a special case: Mathlib pins the test down to the Fermat congruence at a base b, where the passage leaves which probabilistic test is meant open.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key d2a55edcade1 · pair key 67b0f64a3a72.

    OeisA307865.IsAbsoluteEulerPseudoprime special case

    def OeisA307865.IsAbsoluteEulerPseudoprime : ℕ → Prop

    FormalConjectures.OEIS.«307865» · lines 55–57

    Why a special case: Besides fixing the test to the Euler congruence it demands that every coprime base pass, where the passage speaks of passing a run of the test.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 74dcdd127f87 · pair key c11846b824d4.

    Nat.IsFrobeniusPseudoprime special case

    def Nat.IsFrobeniusPseudoprime : ℕ → ℤ[X] → Prop

    MathlibExt.NumberTheory.FrobeniusPseudoprime · line 98

    Why a special case: The test is fixed to the Frobenius condition with respect to a polynomial parameter, and compositeness is spelt out as failing primality above one.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key 4fa1bfec3108 · pair key 0b31566d454f.
  183. Theorem · supporting · Computational methods › Primality testing versus primality proving

    Not formalized
    The AKS primality test is proven to run in polynomial time, but with a higher polynomial exponent, making it slower in practice than the elliptic curve test.[139]

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt f207e1a69c8e).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  184. Conjecture · main statement · Computational methods › Special-purpose algorithms and the largest known prime

    Statement only

    Statement only: Formal Conjectures states this up to a convention difference (statement only: the proof is not finished).

    It is conjectured that there are infinitely many Mersenne primes.

    Show in article · Read it in context on Wikipedia

    Mersenne.infinitely_many_mersenne_primes close match

    theorem Mersenne.infinitely_many_mersenne_primes : {p | Nat.Prime (mersenne p)}.Infinite

    FormalConjectures.Wikipedia.Mersenne · lines 135–137

    Why close, not exact: The declaration indexes the Mersenne primes by their exponents, asserting that the set of p for which two to the p minus one is prime is infinite.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 7fd13a28471a · pair key bf04a9c33d63.
  185. Definition · main statement · Computational methods › Integer factorization

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    Given a composite integer ⁠ n ⁠, the task of providing one (or all) prime factors is referred to as factorization of ⁠ n ⁠.

    Show in article · Read it in context on Wikipedia

    Nat.primeFactorsList more general

    def Nat.primeFactorsList : ℕ → List ℕ

    Mathlib.Data.Nat.Factors · lines 38–44

    Why more general: Mathlib's function is stated over ℕ and returns the increasing list of prime divisors of any natural number, and the article's factorization discussion concerns positive whole numbers only.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 43a599d99db4 · pair key c79d32fe5fe2.

    Nat.primeFactors more general

    def Nat.primeFactors : ℕ → Finset ℕ

    Mathlib.Data.Nat.PrimeFin · line 37

    Why more general: This is the finset of distinct prime divisors of a natural number in ℕ, defined for every n rather than for composite ones alone.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 8b9eaa91f5d5 · pair key 67c95e3c8109.
  186. Theorem · supporting · Computational methods › Integer factorization

    Not formalized
    Shor's algorithm can factor any integer in a polynomial number of steps on a quantum computer.[160]

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt ef087ef27aea).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  187. Definition · supporting · Computational methods › Other computational applications

    Not formalized
    For instance the checksums used in International Standard Book Numbers are defined by taking the rest of the number modulo 11, a prime number.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt b87d2332da8d).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  188. Theorem · supporting · Computational methods › Other computational applications

    Not formalized
    Because 11 is prime this method can detect both single-digit errors and transpositions of adjacent digits.[166]

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 4a84ea1796e9).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  189. Theorem · supporting · Computational methods › Other computational applications

    Not formalized
    Another checksum method, Adler-32, uses arithmetic modulo 65521, the largest prime number less than ⁠ 216 ⁠.[167]

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt b9d549cd1326).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  190. Theorem · supporting · Other applications

    Not formalized
    For example, it is possible to place prime numbers of points in a two-dimensional grid so that no three are in a line, or so that every triangle formed by three of the points has large area.[170]

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 2 candidates examined (receipt e6d05a42e4a1).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  191. Definition · main statement · Other applications

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    For example, the prime field of a given field is its smallest subfield that contains both 0 and 1.

    Show in article · Read it in context on Wikipedia

    Subfield.closure more general

    def Subfield.closure {K : Type u} [DivisionRing K] : Set K → Subfield K

    Mathlib.Algebra.Field.Subfield.Basic · line 294

    Why more general: Mathlib builds the subfield generated by an arbitrary subset of a division ring, and the passage's object is that construction run on the two-element set of zero and one.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key f86551ed1faf · pair key 6d6a90109325.
  192. Theorem · main statement · Other applications

    Formalized

    Formalized by 2 parts together (close match):

    1. Subfield.botEquivRat Mathlib (definition)
      • in characteristic zero the prime field is the rationals
    2. Subfield.botEquivZMod Mathlib (definition)
      • otherwise the prime field is finite with a prime number of elements
    It is either the field of rational numbers or a finite field with a prime number of elements, whence the name.[172]

    Show in article · Read it in context on Wikipedia

    Subfield.botEquivRat states part

    def Subfield.botEquivRat (K : Type*) [Field K] [CharZero K] : ↥⊥ ≃+* ℚ

    Mathlib.FieldTheory.PrimeField · lines 54–56

    Why only part: Mathlib writes the prime field as the bottom subfield and delivers the identification as a ring isomorphism between fields.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key f0ff9067c8b9 · pair key 5217d4421c9a.

    Subfield.botEquivZMod states part

    def Subfield.botEquivZMod (K : Type*) [Field K] (p : ℕ) [Fact (Nat.Prime p)] [Algebra (ZMod p) K] : ↥⊥ ≃+* ZMod p

    Mathlib.FieldTheory.PrimeField · lines 74–77

    Why only part: Mathlib writes the field with p members as ZMod p and the prime field as the bottom subfield of K.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 1043fd8e7d1a · pair key bf29d8cf7c66.

    Subfield.card_bot states part

    theorem Subfield.card_bot (F : Type*) [Field F] (p : ℕ) [Fact (Nat.Prime p)] [CharP F p] : Nat.card ↥⊥ = p

    Mathlib.FieldTheory.Finite.Basic · lines 696–698

    Why only part: It reports the size of the bottom subfield, with the prime taken as a hypothesis rather than concluded.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 3d587a8b1813 · pair key c4f879965160.
  193. Definition · main statement · Other applications

    Not formalized
    For example, in knot theory, a prime knot is a knot that is indecomposable in the sense that it cannot be written as the connected sum of two nontrivial knots.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 9266e498d14e).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  194. Theorem · main statement · Other applications

    Not formalized
    Any knot can be uniquely expressed as a connected sum of prime knots.[173]

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 14561ef561c4).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  195. Definition · main statement · Other applications › Constructible polygons and polygon partitions

    Formalized

    Formalized: ATLAS (atlas-lean) states this exactly (a Prop-valued definition: it states the claim without proving it).

    Fermat primes are primes of the form Fk = 22k + 1, with ⁠ k ⁠ a nonnegative integer.[175]

    Show in article · Read it in context on Wikipedia

    MetaMathlibExt.IsFermatPrime exact match

    def MetaMathlibExt.IsFermatPrime : ℕ → Prop

    MathlibExt.NumberTheory.FermatPrime · line 28

    Note: The exponent runs over ℕ, the same range as the passage's nonnegative integers, so the two name the same numbers; the shape is written through Mathlib's Fermat number function.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key 8d5e2db0d1ae · pair key c2cc2c776642.
  196. Theorem · supporting · Other applications › Constructible polygons and polygon partitions

    Partial

    Partial: Formal Conjectures states part of this (statement only: the proof is not finished).

    The first five of these numbers – 3, 5, 17, 257, and 65,537 – are prime,[176] but F5 is composite and so are all other Fermat numbers that have been verified as of 2017.[177]

    Show in article · Read it in context on Wikipedia

    Fermat.fermat_number_are_composite states part

    theorem Fermat.fermat_number_are_composite : ∀ n > 4, ¬Prime n.fermatNumber

    FormalConjectures.Wikipedia.Fermat · lines 34–35

    Why only part: The library denies primality at every index past four, while the passage speaks of the indices checked so far; since a Fermat number exceeds two, failing primality is being composite.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 747d2df2feef · pair key 8b25a2dbac6e.

    Nat.prime_three states part

    theorem Nat.prime_three : Nat.Prime 3

    Mathlib.Data.Nat.Prime.Defs · line 173

    Why only part: It settles one entry of the list of five and says nothing about the other four.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key d2ea8caf78f2 · pair key cc58bd0c02d6.

    Nat.prime_five states part

    theorem Nat.prime_five : Nat.Prime 5

    Mathlib.Data.Nat.Prime.Defs · line 175

    Why only part: It settles a second entry of the list of five and leaves the remaining three untouched.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 3b5d21b6994d · pair key f8b014ae8e85.
  197. Theorem · main statement · Other applications › Constructible polygons and polygon partitions

    Statement only

    Statement only: ATLAS (atlas-lean) states this up to a convention difference (wanted: stated as a goal, with no proof).

    A regular ⁠ n ⁠-gon is constructible using straightedge and compass if and only if the odd prime factors of ⁠ n ⁠ (if any) are distinct Fermat primes.[176]

    Show in article · Read it in context on Wikipedia

    MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.gauss_wantzel_constructible_polygon close match

    theorem MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.gauss_wantzel_constructible_polygon (n : ℕ) : 3 ≤ n → (MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.IsConstructible (Real.cos (2 * π / ↑n)) ↔ MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.GaussWantzelNumber n)

    WantedExt.NumberTheory.GaussWantzelWanted · line 82

    Why close, not exact: The library records the polygon's drawability as that of the cosine of two pi over n, and packs the arithmetic condition on the odd prime factors of n into its own predicate.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key 6459f7f1b75b · pair key b17a124bb7a4.
  198. Theorem · main statement · Other applications › Constructible polygons and polygon partitions

    Not formalized
    Likewise, a regular ⁠ n ⁠-gon may be constructed using straightedge, compass, and an angle trisector if and only if the prime factors of ⁠ n ⁠ are any number of copies of 2 or 3 together with a (possibly empty) set of distinct Pierpont primes, primes of the form ⁠ 2a3b + 1 ⁠.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 5ef98f2f6728).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  199. Theorem · main statement · Other applications › Constructible polygons and polygon partitions

    Not formalized
    It is possible to partition any convex polygon into ⁠ n ⁠ smaller convex polygons of equal area and equal perimeter, when ⁠ n ⁠ is a power of a prime number, but this is not known for other values of ⁠ n ⁠.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 2 candidates examined (receipt a6d1d1bbb36f).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.

Data: view model (JSON) · Literature Links records (JSONL)