{"assessment":{"class":"GA","importance":"top"},"audit":{"blind":true,"ended":"2026-11-03T02:10:43.537Z","figures":[{"ci95":[0.4891,0.9935],"drawn":36,"id":"primary","label":"Strong links (exact, close or broad match) on supporting passages that have exactly the right relation","n_eff":5.1,"population":1029,"share":0.9234,"weights":"relation and library"},{"ci95":[0.3979,0.9202],"drawn":48,"id":"S2","label":"Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation","n_eff":8.1,"population":1740,"share":0.734,"weights":"relation and library"},{"ci95":[0.7268,0.9357],"drawn":44,"id":"CS","label":"Central and subject passages whose formalization status is right","n_eff":42.0,"population":1905,"share":0.8615,"weights":"recorded status"},{"ci95":[0.2519,0.8658],"drawn":12,"id":"S3","label":"'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it)","n_eff":6.1,"population":1236,"share":0.5957,"weights":"article"}],"independent":false,"items":224,"models":[{"model":"claude-opus-5-5","model_name":"Claude Opus 5.5"}],"operator":"jack","run_id":"tierA-batch1-audit","started":"2026-11-02T21:10:01.351Z"},"campaign":"run:loc-tierA-b1b+chal-tierA-b1","licence":{"mapping":"CC0-1.0","text":"CC-BY-SA-4.0"},"pageid":23666,"passages":[{"absence":null,"basis":"c91be2f98800dc4b6eb28e7f137df38b3c41203f4a5d142158aba28ae1a01f99","coverage":null,"id":"enwiki-23666-1373534600::In-text #09fee19c","item":"In-text #09fee19c","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.Prime","end_line":43,"library":"mathlib","line":42,"location_key":"c91be2f98800dc4b6eb28e7f137df38b3c41203f4a5d142158aba28ae1a01f99","module":"Mathlib.Data.Nat.Prime.Defs","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.","pair_key":"b0422c8ede0d75c50548ff0b721245708f3b6b119961c5c5099f4cf22a8b5886","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.Prime : ℕ → Prop"},"statement":true},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.prime_iff_not_exists_mul_eq","end_line":142,"library":"mathlib","line":133,"location_key":"e2815fe5a8cfb82bd50dace9823995dead28120020de988356112e9fe542bf3a","module":"Mathlib.Data.Nat.Prime.Defs","note":"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.","pair_key":"dd0ae3e8484534524be31beaaf82aeccd946bc5d0e9a105ce63a551417843e63","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prime_iff_not_exists_mul_eq {p : ℕ} : Nat.Prime p ↔ 2 ≤ p ∧ ¬∃ m n, m < p ∧ n < p ∧ m * n = p"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"723b8937f3587e8119cc280cbddbf3e35ed5bf46616b0e5ac12cbccf586d43b0","prominence":"subject","quote":{"exact":"A prime number (or a prime) is a natural number greater than"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers.","segments":[{"text":"A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers."}]},"unresolved":null},{"absence":null,"basis":"08ee9b6277c7871889082fd87d5b5c6061e01c69b1623dcec36216576dc50202","coverage":null,"id":"enwiki-23666-1373534600::In-text #3dceea24","item":"In-text #3dceea24","kind":"definition","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"Nat.IsComposite","library":"atlas","line":24,"location_key":"08ee9b6277c7871889082fd87d5b5c6061e01c69b1623dcec36216576dc50202","module":"MathlibExt.NumberTheory.Composite","note":"Atlas introduces this predicate on the natural numbers by the condition the passage gives: above one, and failing Mathlib's prime predicate.","pair_key":"2aec699d54639c8b6d5d7de40158297470e4413ec8ea200f658c78de7f223596","path":"MathlibExt/NumberTheory/Composite.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def Nat.IsComposite : ℕ → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"26288f4192232c17be718e42ee2aeee7a1c021a925da1722a81fdf7a499e9b8a","prominence":"central","quote":{"exact":"A natural number greater than 1 that is not prime is called"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"A natural number greater than 1 that is not prime is called a composite number.","segments":[{"text":"A natural number greater than 1 that is not prime is called a composite number."}]},"unresolved":null},{"absence":null,"basis":"aa4e6642e8899bbf738e77abf42230ca3dabea78edb584fabf6cff99daacac6b","coverage":null,"id":"enwiki-23666-1373534600::In-text #7e5002e5","item":"In-text #7e5002e5","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.prime_five","end_line":175,"library":"mathlib","line":175,"location_key":"aa4e6642e8899bbf738e77abf42230ca3dabea78edb584fabf6cff99daacac6b","module":"Mathlib.Data.Nat.Prime.Defs","note":"Mathlib records primality of five as a closed theorem over the natural numbers.","pair_key":"4292d17f66d9a2a1617e6f0ca825a8f8b3dd341765d5cfa495a7c9c51adcf94d","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prime_five : Nat.Prime 5"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"130175d9eed4b4824ff665b137b8b9a2de0e34d5a2f5a80f9b8171fa1f5dd2a8","prominence":"supporting","quote":{"exact":"For example, 5 is prime"},"quote_capped":false,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":" because the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself.","segments":[{"text":" because the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself."}]},"layer":"For example, 5 is prime","segments":[{"text":"For example, 5 is prime"}]},"unresolved":null},{"absence":null,"basis":"df0ef8b7b645ded96cb53a4fa0c7f56e8eea205500d365023cb6f1db3b3854ee","coverage":null,"id":"enwiki-23666-1373534600::In-text #d5b39003","item":"In-text #d5b39003","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.prime_five","end_line":175,"library":"mathlib","line":175,"location_key":"df0ef8b7b645ded96cb53a4fa0c7f56e8eea205500d365023cb6f1db3b3854ee","module":"Mathlib.Data.Nat.Prime.Defs","note":"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.","pair_key":"672e9756564a09a6154148671fa8ffce0fe955207c2376fc707fa63381465c58","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prime_five : Nat.Prime 5"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.Prime.eq_one_or_self_of_dvd","end_line":95,"library":"mathlib","line":88,"location_key":"92bdbf545373c089319d5f9e22494ef720402b649e552d86a1b859a48899af30","module":"Mathlib.Data.Nat.Prime.Defs","note":"Mathlib states for a prime p that every divisor of p is one or p; at five this yields the two products the passage lists.","pair_key":"eee4df2413bcae786ee819efae87118b4828a87c7c5712fe5f31f60797f0cca8","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.Prime.eq_one_or_self_of_dvd {p : ℕ} : Nat.Prime p → ∀ (m : ℕ), m ∣ p → m = 1 ∨ m = p"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"39f27dbb75efad85b90d96da30607acac073d541743e39799bf8e370f4ce6261","prominence":"supporting","quote":{"exact":"the only ways of writing it as a product, 1 × 5"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"For example, 5 is prime because ","segments":[{"text":"For example, 5 is prime because "}]},"layer":"the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself.","segments":[{"text":"the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself."}]},"unresolved":null},{"absence":null,"basis":"f9170eefeb5718766fa1835943a1d1a9b9fe71f65ce420c9ae4058d83c3aa244","coverage":null,"id":"enwiki-23666-1373534600::In-text #14454742","item":"In-text #14454742","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.not_prime_of_dvd_of_ne","end_line":74,"library":"mathlib","line":73,"location_key":"f9170eefeb5718766fa1835943a1d1a9b9fe71f65ce420c9ae4058d83c3aa244","module":"Mathlib.Data.Nat.Prime.Basic","note":"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.","pair_key":"45ab0e1bb25253024b10ffd14f3956c88d5ba806f9c8aa78a82994fd0d9e7bd4","path":"Mathlib/Data/Nat/Prime/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.not_prime_of_dvd_of_ne {m n : ℕ} : m ∣ n → m ≠ 1 → m ≠ n → ¬Nat.Prime n"},"statement":false},{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"Nat.IsComposite","library":"atlas","line":24,"location_key":"4fffe2cc685084db6b707ef82043a49b79e894308648a5034c53ee637fc9f41f","module":"MathlibExt.NumberTheory.Composite","note":"Atlas defines the property the passage attributes to four, but says nothing about the number four.","pair_key":"4ae696d551b2d65c21f573de66a7422bcddcd4fc35b4d0323697c97b05b0bab6","path":"MathlibExt/NumberTheory/Composite.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def Nat.IsComposite : ℕ → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"3c5196ac23496b7310a81ab71671b9067d89c931ec1c57a4fbebe7f5603c19b3","prominence":"supporting","quote":{"exact":"However, 4 is composite"},"quote_capped":false,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":" because it is a product (2 × 2) in which both numbers are smaller than 4.","segments":[{"text":" because it is a product (2 × 2) in which both numbers are smaller than 4."}]},"layer":"However, 4 is composite","segments":[{"text":"However, 4 is composite"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"029781becf5d9ec2cde72388685f9d3d39120d5db98c688e756f9f77a92ca811"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #5323a2bd","item":"In-text #5323a2bd","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.not_prime_iff_exists_mul_eq","end_line":87,"library":"mathlib","line":85,"location_key":"08117f7670a323ba29c99a430b145062da527cda5aa8a96897e589b9f7cea4de","module":"Mathlib.Data.Nat.Prime.Basic","note":"Mathlib records that a number above one failing the prime predicate has some pair of factors below it, leaving the particular pair for four unnamed.","pair_key":"c3ecced54d3e949ceb7cd08c31f51e77e09333f45f5cf4f704766216d5726247","path":"Mathlib/Data/Nat/Prime/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.not_prime_iff_exists_mul_eq {n : ℕ} : 2 ≤ n → (¬Nat.Prime n ↔ ∃ a b, a < n ∧ b < n ∧ a * b = n)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"6a1b29bea593083320ec5589da9bcb8ae6bd2fadb82c6a5adf3c9b1f8784752a","prominence":"supporting","quote":{"exact":"it is a product (2 × 2) in which both numbers are"},"quote_capped":true,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"However, 4 is composite because ","segments":[{"text":"However, 4 is composite because "}]},"layer":"it is a product (2 × 2) in which both numbers are smaller than 4.","segments":[{"text":"it is a product (2 × 2) in which both numbers are smaller than 4."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"7bd6574d01b6b0338b8e222895e38132f49d3877df47a8e7d46c660d1b655872","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"e42c5fa407510597a86a62362470fac52ebdb720f443c04c2da8f9f517c659c6","text":"every natural number above 1 is prime or factors as a product of primes"},{"id":"c2","part":"29bec2d7a371d1690399ab902697c085b48469702eb0c805fe538f43554c3687","text":"such a prime factorization is unique up to reordering the factors"}],"parts":["29bec2d7a371d1690399ab902697c085b48469702eb0c805fe538f43554c3687","e42c5fa407510597a86a62362470fac52ebdb720f443c04c2da8f9f517c659c6"],"relation":"broadMatch","status":"formalized"},"id":"enwiki-23666-1373534600::In-text #1016659f","item":"In-text #1016659f","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.primeFactorsList_unique","end_line":179,"library":"mathlib","line":168,"location_key":"29bec2d7a371d1690399ab902697c085b48469702eb0c805fe538f43554c3687","module":"Mathlib.Data.Nat.Factors","note":"Mathlib fixes one canonical prime list for n and says every prime factorisation of n is a rearrangement of that list.","pair_key":"4f29d548fc417d34b0c003be35007dd9c3355fbe677ea39357aec7e028a97710","path":"Mathlib/Data/Nat/Factors.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.primeFactorsList_unique {n : ℕ} {l : List ℕ} : l.prod = n → (∀ p ∈ l, Nat.Prime p) → l.Perm n.primeFactorsList"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"UniqueFactorizationMonoid.exists_prime_factors","end_line":153,"library":"mathlib","line":150,"location_key":"e42c5fa407510597a86a62362470fac52ebdb720f443c04c2da8f9f517c659c6","module":"Mathlib.RingTheory.UniqueFactorizationDomain.Defs","note":"Mathlib asserts the existence of a prime factorisation in any unique factorisation monoid; the natural numbers form one, and association there is equality.","pair_key":"244553f0ced52aa42cb79f185b1c4f2be2364ee481b9baff602caf12b06b9114","path":"Mathlib/RingTheory/UniqueFactorizationDomain/Defs.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem UniqueFactorizationMonoid.exists_prime_factors {α : Type*} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] (a : α) : a ≠ 0 → ∃ f, (∀ b ∈ f, Prime b) ∧ Associated f.prod a"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6995fb720393d802ab3a9ed85daf20bd6f4c8a295f4378ab8fcd41d202780d93","prominence":"central","quote":{"exact":"Primes are central in number theory because of the fundamental theorem of"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"88edbda5014a3c382307c84e7de879c2ea850aad941e496bdc941ebb09efb964","coverage":null,"id":"enwiki-23666-1373534600::In-text #c4055ac2","item":"In-text #c4055ac2","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.Prime","end_line":43,"library":"mathlib","line":42,"location_key":"88edbda5014a3c382307c84e7de879c2ea850aad941e496bdc941ebb09efb964","module":"Mathlib.Data.Nat.Prime.Defs","note":"Mathlib keeps this property of natural numbers under the name Nat.Prime, where the article gives it the name primality.","pair_key":"811f2ebdf39629ed5af14bde9bf95884de9339213e874403a2631d40e707574d","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.Prime : ℕ → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"279c4c5d35b6645604124775bc2f35c8e3669f014712405c54e9deaf4fe8b065","prominence":"supporting","quote":{"exact":"The property of being prime is called primality."},"quote_capped":false,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"The property of being prime is called primality.","segments":[{"text":"The property of being prime is called primality."}]},"unresolved":null},{"absence":null,"basis":"60428656f7382a1632868bd1555775626249da2b0d6e229b5d3e3c29247052be","coverage":null,"id":"enwiki-23666-1373534600::In-text #54fe80b4","item":"In-text #54fe80b4","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.prime_def_le_sqrt","end_line":131,"library":"mathlib","line":124,"location_key":"60428656f7382a1632868bd1555775626249da2b0d6e229b5d3e3c29247052be","module":"Mathlib.Data.Nat.Prime.Defs","note":"Lean writes the criterion as an equivalence that also carries the bound 2 ≤ p, and bounds the trial divisors by Nat.sqrt p, the integer square root; the divisors m run over ℕ, and any divisor the passage would try lies between 2 and the root and so is itself a natural number, so the ℕ quantifier covers the passage's trial range.","pair_key":"2b2f5aea30573b117241e5f5d8b8eada08b13f356ac675d0e7fb53dbfb837993","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prime_def_le_sqrt {p : ℕ} : Nat.Prime p ↔ 2 ≤ p ∧ ∀ (m : ℕ), 2 ≤ m → m ≤ p.sqrt → ¬m ∣ p"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.decidablePrime","end_line":163,"library":"mathlib","line":162,"location_key":"5a750e1df80a1ef4c724e7a7b45633315e55f5584a9327f06784e78f9122c298","module":"Mathlib.Data.Nat.Prime.Defs","note":"It supplies a decision procedure for primality of a natural number, but its statement fixes no bound on the numbers tried.","pair_key":"c51aaba24cbc63663c018938b9ac2df58c7f8bafb839609ae9a5773d849b7325","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Nat.decidablePrime (p : ℕ) : Decidable (Nat.Prime p)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7933ae2368ea91bd203d6f3217b2d7fff764b1217cbb0a21ae37b33b8ecc4ba7","prominence":"supporting","quote":{"exact":"A simple but slow method of checking the primality of a given"},"quote_capped":true,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"A simple but slow method of checking the primality of a given number ⁠ n {\\displaystyle n} ⁠, called trial division, tests whether ⁠ n {\\displaystyle n} ⁠ is a multiple of any integer between 2 and ⁠ n {\\displaystyle {\\sqrt {n}}} ⁠.","segments":[{"text":"A simple but slow method of checking the primality of a given number ⁠ "},{"tex":"n"},{"text":" ⁠, called trial division, tests whether ⁠ "},{"tex":"n"},{"text":" ⁠ is a multiple of any integer between 2 and ⁠ "},{"tex":"\\sqrt {n}"},{"text":" ⁠."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":4,"queries":6,"sha256":"3e2674d0c5fd2c53c59882bedacba0b3ee4f8ea54ffb67d73730812ceef3cbe8"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #e8787503","item":"In-text #e8787503","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"0f388216364941b7386985ea541737bfcdc57fc5b82d493ff4e10bcb324b6680","prominence":"supporting","quote":{"exact":"Faster algorithms include the Miller–Rabin primality test, which is fast but has"},"quote_capped":true,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"0d07409ef98bef5687fb11d4166214943d48db1962010b851e9408988fd005e4","coverage":null,"id":"enwiki-23666-1373534600::In-text #808b9892","item":"In-text #808b9892","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.infinite_setOf_prime","end_line":30,"library":"mathlib","line":30,"location_key":"0d07409ef98bef5687fb11d4166214943d48db1962010b851e9408988fd005e4","module":"Mathlib.Data.Nat.PrimeFin","note":"Lean states the infinitude as a property of the set of natural numbers satisfying the primality predicate.","pair_key":"1309ed7be2e23f8eda1c7166969767daa5acb2fd244335cca931e7b64ad4ec22","path":"Mathlib/Data/Nat/PrimeFin.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"deprecated_to":"Nat.infinite_setOfPred_prime","elided":false,"text":"theorem Nat.infinite_setOf_prime : {p | Nat.Prime p}.Infinite"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.exists_infinite_primes","end_line":45,"library":"mathlib","line":36,"location_key":"23d48ded3eece1fc386c3031544cdc0449e888dfee2e1682abdaafbc1e196632","module":"Mathlib.Data.Nat.Prime.Infinite","note":"Lean encodes Euclid's theorem as unboundedness: for each n it produces a prime at least n, as its docstring records.","pair_key":"9ec0635375f36e1f69ef43a51e8afc7b66c37c36210f9dbd5f323ebec57aff97","path":"Mathlib/Data/Nat/Prime/Infinite.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.exists_infinite_primes (n : ℕ) : ∃ p, n ≤ p ∧ Nat.Prime p"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.Primes.infinite","end_line":32,"library":"mathlib","line":32,"location_key":"3df6d1df59cd43d65ba8de0451e8bf368cbbe4e180eca0765e3c4c71e38008d6","module":"Mathlib.Data.Nat.PrimeFin","note":"Lean encodes the infinitude as a typeclass instance on the subtype of primes rather than as a property of a set.","pair_key":"5dc6518609d137e8b77931198682d9636e3b0735bb03f7bef77641bcac3711e5","path":"Mathlib/Data/Nat/PrimeFin.lean","proof_status":"proved","rank":3,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Nat.Primes.infinite : Infinite Nat.Primes"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"4e6271f8f406f9f0ffc86a53bab777a65dd108a1309f9c07f17e04d0487a82ad","prominence":"central","quote":{"exact":"There are infinitely many primes, as demonstrated by Euclid around 300 BC."},"quote_capped":false,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"There are infinitely many primes, as demonstrated by Euclid around 300 BC.","segments":[{"text":"There are infinitely many primes, as demonstrated by Euclid around 300 BC."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"85dd7f0acf8848409ae36e816d1c314b8fc155324e3581e012dcce32a72f3d9e","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"a66c70b5c7d4ea0b2b157552255a3b4bb5768d72b6bca36764a75733129f3655","text":"every even integer above 2 is the sum of two primes"},{"id":"c2","part":"9de7f49d4be7f6c6e15b76842fb4a20eb62f6562c53024dcdc9edec48e075f83","text":"infinitely many pairs of primes differ by two"}],"parts":["a66c70b5c7d4ea0b2b157552255a3b4bb5768d72b6bca36764a75733129f3655","9de7f49d4be7f6c6e15b76842fb4a20eb62f6562c53024dcdc9edec48e075f83"],"relation":"closeMatch","status":"statement_only"},"id":"enwiki-23666-1373534600::In-text #0b45701c","item":"In-text #0b45701c","kind":"conjecture","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"GoldbachConjecture.goldbach","end_line":38,"library":"formal-conjectures","line":36,"location_key":"a66c70b5c7d4ea0b2b157552255a3b4bb5768d72b6bca36764a75733129f3655","module":"FormalConjectures.Wikipedia.GoldbachConjecture","note":"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.","pair_key":"ebc6f56220b5ff4d11b482a1dd2dd74a98a929330413a888a74461ef7cd0654f","path":"FormalConjectures/Wikipedia/GoldbachConjecture.lean","proof_status":"statement_only","rank":1,"relation":"hasPart","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem GoldbachConjecture.goldbach (n : ℕ) : 2 < n → Even n → ∃ p q, Prime p ∧ Prime q ∧ n = p + q"},"statement":false},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"TwinPrimes.twin_primes","end_line":39,"library":"formal-conjectures","line":37,"location_key":"9de7f49d4be7f6c6e15b76842fb4a20eb62f6562c53024dcdc9edec48e075f83","module":"FormalConjectures.Wikipedia.TwinPrimes","note":"Lean encodes the pairs by their smaller member, stating the infinitude of the set of primes p for which p + 2 is prime.","pair_key":"b004a8633d7fe1debe03a7f4fe6d366134311b3da174ef847702103b0b7ce69d","path":"FormalConjectures/Wikipedia/TwinPrimes.lean","proof_status":"statement_only","rank":2,"relation":"hasPart","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem TwinPrimes.twin_primes : {p | Prime p ∧ Prime (p + 2)}.Infinite"},"statement":false},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"Dickson.generalized_twin_primes","end_line":56,"library":"formal-conjectures","line":54,"location_key":"4a5a7cf3721556fda486b795c8c1aca524d91182181bbea95a872812da141982","module":"FormalConjectures.Wikipedia.Dickson","note":"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.","pair_key":"2ef8d5047b6a9c625c736b5551b36514bff4ec8420bc90eff68a565edb94fdd3","path":"FormalConjectures/Wikipedia/Dickson.lean","proof_status":"statement_only","rank":3,"relation":"hasPart","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem Dickson.generalized_twin_primes (k : ℕ) : 0 < k → Infinite ↑{p | Nat.Prime p ∧ Nat.Prime (p + 2 * k)}"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6ef2535996bd360afe9ccbf02452ac43a0d1b7f824c206d7fe7075c146c67f0e","prominence":"central","quote":{"exact":"These include Goldbach's conjecture, that every even integer greater than 2 can"},"quote_capped":true,"section":[],"status":"statement_only","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"326792b39fee343e444ac6ad6d37c4085009c4d976d1869cd0be5686e0f2e65b","coverage":null,"id":"enwiki-23666-1373534600::In-text #bd730250","item":"In-text #bd730250","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.Prime","end_line":43,"library":"mathlib","line":42,"location_key":"326792b39fee343e444ac6ad6d37c4085009c4d976d1869cd0be5686e0f2e65b","module":"Mathlib.Data.Nat.Prime.Defs","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.","pair_key":"d6e1c65cea4c212e9ab29377c4026c12db37934147a1bf4706137a94f30f6db1","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.Prime : ℕ → Prop"},"statement":true},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.prime_iff_not_exists_mul_eq","end_line":142,"library":"mathlib","line":133,"location_key":"ffe00c556c09aef2b9422063bd0b03084c5e6fe448144bad2daa3ff9be1280da","module":"Mathlib.Data.Nat.Prime.Defs","note":"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.","pair_key":"5cd0311a6faf51eb0a35402ce2ac29ba70fa7bdca866bb26ea6b2c9aa3d3cd4e","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prime_iff_not_exists_mul_eq {p : ℕ} : Nat.Prime p ↔ 2 ≤ p ∧ ¬∃ m n, m < p ∧ n < p ∧ m * n = p"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7389377ccc717bb4f30e2e15d1c4aee3c8451f928dd48cff7630ec85bdf2f6a4","prominence":"central","quote":{"exact":"A natural number (1, 2, 3, 4, 5, 6, etc.) is called"},"quote_capped":true,"section":["Definition and examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"04ddc48023ed2e70904745f836960116d29fb3956df50552e71047b73e3b5c4c","coverage":null,"id":"enwiki-23666-1373534600::In-text #cf314844","item":"In-text #cf314844","kind":"definition","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"Nat.IsComposite","library":"atlas","line":24,"location_key":"04ddc48023ed2e70904745f836960116d29fb3956df50552e71047b73e3b5c4c","module":"MathlibExt.NumberTheory.Composite","note":"Lean defines the predicate as being above one and not prime, which its docstring states in those words.","pair_key":"65bca33e2066ec9652f06542856a1f3fc02e327ff0362ab3d09fe26f7307b9ff","path":"MathlibExt/NumberTheory/Composite.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def Nat.IsComposite : ℕ → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"bb088b29ef5aa0494c866d1dd606eb44a317e1c9a82aa0429861a76ec42a3c3f","prominence":"supporting","quote":{"exact":"The numbers greater than 1 that are not prime are called composite"},"quote_capped":true,"section":["Definition and examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"The numbers greater than 1 that are not prime are called composite numbers.[1]","segments":[{"text":"The numbers greater than 1 that are not prime are called composite numbers."},{"ref":"[1]"}]},"unresolved":null},{"absence":null,"basis":"4ebba18892045756d7d0ec0764f77d36b8ae4a07e4734a9df4f72ced9648bc19","coverage":null,"id":"enwiki-23666-1373534600::In-text #8f832147","item":"In-text #8f832147","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.prime_iff_not_exists_mul_eq","end_line":142,"library":"mathlib","line":133,"location_key":"4ebba18892045756d7d0ec0764f77d36b8ae4a07e4734a9df4f72ced9648bc19","module":"Mathlib.Data.Nat.Prime.Defs","note":"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.","pair_key":"d2aad900099afd5d11e91d0b9a176a10f537904deb1c4d82b65d9fcbee1e4ef3","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prime_iff_not_exists_mul_eq {p : ℕ} : Nat.Prime p ↔ 2 ≤ p ∧ ¬∃ m n, m < p ∧ n < p ∧ m * n = p"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f1fffaf48e52a9c519b76b5f18a2e8abeda005157fe4ef650144ca95c6220618","prominence":"supporting","quote":{"exact":"In other words, ⁠ n {\\displaystyle n} ⁠ is prime if ⁠"},"quote_capped":true,"section":["Definition and examples"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"In other words, ⁠ n {\\displaystyle n} ⁠ is prime if ⁠ n {\\displaystyle 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 {\\displaystyle n} ⁠ dots into a rectangular grid that is more than one dot wide and more than one dot high.[3]","segments":[{"text":"In other words, ⁠ "},{"tex":"n"},{"text":" ⁠ is prime if ⁠ "},{"tex":"n"},{"text":" ⁠ items cannot be divided up into smaller equal-size groups of more than one item,"},{"ref":"[2]"},{"text":" or if it is not possible to arrange ⁠ "},{"tex":"n"},{"text":" ⁠ dots into a rectangular grid that is more than one dot wide and more than one dot high."},{"ref":"[3]"}]},"unresolved":null},{"absence":null,"basis":"bf3e8e3ce3b51124bedacbfa11e4b5d3e86b52e211ad3fdd46f9c5e86bdb1a8b","coverage":null,"id":"enwiki-23666-1373534600::In-text #cb1a4752","item":"In-text #cb1a4752","kind":"example","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.prime_two","end_line":171,"library":"mathlib","line":171,"location_key":"bf3e8e3ce3b51124bedacbfa11e4b5d3e86b52e211ad3fdd46f9c5e86bdb1a8b","module":"Mathlib.Data.Nat.Prime.Defs","note":"A standalone fact about the number two, proved once in the primality file.","pair_key":"6be286f4d5fc4556f100c9146c4aefd2874dc89685f2690f531120a0313c188e","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prime_two : Nat.Prime 2"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.prime_three","end_line":173,"library":"mathlib","line":173,"location_key":"1a86c8a32614694e69ed19249ffc7d01b0ac72ce67556ab7068e938a83c9b2ff","module":"Mathlib.Data.Nat.Prime.Defs","note":"A standalone fact about the number three, proved once in the primality file.","pair_key":"429b47ac8d40e8461052951aa6483a4a485fc9f576dc8067c78905a49b8c9ffc","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prime_three : Nat.Prime 3"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.prime_five","end_line":175,"library":"mathlib","line":175,"location_key":"2b6969ba68f113a7cbf769804f83ec39a4f0ec04e09f34f3e3768a5fe4b65901","module":"Mathlib.Data.Nat.Prime.Defs","note":"A standalone fact about the number five, proved once in the primality file.","pair_key":"4e85c06181c22442ad4487798742fa6f02bbf64026c712430f33849b875d0623","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prime_five : Nat.Prime 5"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.not_prime_one","end_line":58,"library":"mathlib","line":57,"location_key":"bb12f14444518a3527a3dc6cc659f56dfa48e1ae2c5be113dd0b7f4479bab464","module":"Mathlib.Data.Nat.Prime.Defs","note":"A standalone fact about the number one, proved in the same primality file.","pair_key":"0af68e25b43470ecfa5f76061889c0e85d1602bd481175def66ce2d2b79cefd6","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"proved","rank":4,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.not_prime_one : ¬Nat.Prime 1"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6d01b134e0e2861e754823bb031269fb9496f079cc624cc6a268e070ae738248","prominence":"supporting","quote":{"exact":"For example, among the numbers 1 through 6, the numbers 2, 3,"},"quote_capped":true,"section":["Definition and examples"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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).","segments":[{"text":"For example, among the numbers 1 through 6, the numbers 2, 3, and 5 are the prime numbers,"},{"ref":"[4]"},{"text":" as there are no other numbers that divide them evenly (without a remainder)."}]},"unresolved":null},{"absence":null,"basis":"47bcbe976de973e5002e12a7b5d01d0ffe01cbea8704ed714c823e20433ec390","coverage":null,"id":"enwiki-23666-1373534600::In-text #05b7d772","item":"In-text #05b7d772","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.not_prime_one","end_line":58,"library":"mathlib","line":57,"location_key":"47bcbe976de973e5002e12a7b5d01d0ffe01cbea8704ed714c823e20433ec390","module":"Mathlib.Data.Nat.Prime.Defs","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.","pair_key":"908f2ea6f3159f732df812f1df9b14753986923b1dc4796bf51b6905e52f346e","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.not_prime_one : ¬Nat.Prime 1"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"not_prime_one","end_line":99,"library":"mathlib","line":99,"location_key":"86d4248ae6e0e0bff8ada22e4ca81cc0087edd411497bf16236287ad927abb73","module":"Mathlib.Algebra.Prime.Defs","note":"Stated for any commutative monoid with zero using Mathlib's algebraic primality predicate, which at the naturals is the same notion the passage uses.","pair_key":"2bb645a375ed93a2d7e1b8d6cb62f165442b42f6418aefe4b8dc70d90d667189","path":"Mathlib/Algebra/Prime/Defs.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem not_prime_one {M : Type*} [CommMonoidWithZero M] : ¬Prime 1"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"538d40cc4c43b2f96ef71efd4d892e4e45c85010d1fbfb612c7fd60bf6269dba","prominence":"supporting","quote":{"exact":"1 is not prime, as it is specifically excluded in the definition."},"quote_capped":false,"section":["Definition and examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"1 is not prime, as it is specifically excluded in the definition.","segments":[{"text":"1 is not prime, as it is specifically excluded in the definition."}]},"unresolved":null},{"absence":null,"basis":"7c39964b316df49c880abb11d99941924dc7a535a87a30c0683eaaf700a3a544","coverage":null,"id":"enwiki-23666-1373534600::In-text #8a77cda0","item":"In-text #8a77cda0","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.not_prime_of_mul_eq","end_line":32,"library":"mathlib","line":31,"location_key":"7c39964b316df49c880abb11d99941924dc7a535a87a30c0683eaaf700a3a544","module":"Mathlib.Data.Nat.Prime.Basic","note":"The product equation the passage writes out is this theorem's own hypothesis, taken at the factor 2 twice.","pair_key":"27087084b2476fa3603cd420e315cadfefae8cbb4e14c18c350f45616c883536","path":"Mathlib/Data/Nat/Prime/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.not_prime_of_mul_eq {a b n : ℕ} : a * b = n → a ≠ 1 → b ≠ 1 → ¬Nat.Prime n"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.not_prime_mul","end_line":29,"library":"mathlib","line":28,"location_key":"97489d8a3dd2b481ac4364698a7ea6c72fe707a4e0fe93cfcc348398ce29f3cd","module":"Mathlib.Data.Nat.Prime.Basic","note":"Stated about a product of two naturals neither of which is 1, the shape of the factorisation the passage gives for 4.","pair_key":"6813e74617836937f0eab8be582c896b07fc235f3c0d419594f6be8aea92f9f9","path":"Mathlib/Data/Nat/Prime/Basic.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.not_prime_mul {a b : ℕ} : a ≠ 1 → b ≠ 1 → ¬Nat.Prime (a * b)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"af47caf65785fd17da5181b2af84be29567273cf5b7da150aeb893d725e53559","prominence":"supporting","quote":{"exact":"4 = 2 × 2 and"},"quote_capped":false,"section":["Definition and examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":" 6 = 2 × 3 are both composite.","segments":[{"text":" 6 = 2 × 3 are both composite."}]},"layer":"4 = 2 × 2 and","segments":[{"text":"4 = 2 × 2 and"}]},"unresolved":null},{"absence":null,"basis":"62458e4cc9998f6486006dba541dcb93b934a65cc73cd7bee521dca0a58038c4","coverage":null,"id":"enwiki-23666-1373534600::In-text #c35ac6dd","item":"In-text #c35ac6dd","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.not_prime_of_mul_eq","end_line":32,"library":"mathlib","line":31,"location_key":"62458e4cc9998f6486006dba541dcb93b934a65cc73cd7bee521dca0a58038c4","module":"Mathlib.Data.Nat.Prime.Basic","note":"The product equation the passage writes out is this theorem's own hypothesis, taken at the factors 2 and 3.","pair_key":"57c8fdb74f1554b9edc6774cbaddca4c305ce38844c98395895fda12921c5504","path":"Mathlib/Data/Nat/Prime/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.not_prime_of_mul_eq {a b n : ℕ} : a * b = n → a ≠ 1 → b ≠ 1 → ¬Nat.Prime n"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.not_prime_mul","end_line":29,"library":"mathlib","line":28,"location_key":"e0314db82bc0c5a5a33fc5eeb756ccd05d0035beefe6517a292911bb830a3faa","module":"Mathlib.Data.Nat.Prime.Basic","note":"Stated about a product of two naturals neither of which is 1, the shape of the factorisation the passage gives for 6.","pair_key":"d1a46487462ceb09a861598badcead96f3ac73a704fd46c7956ca0df884f249e","path":"Mathlib/Data/Nat/Prime/Basic.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.not_prime_mul {a b : ℕ} : a ≠ 1 → b ≠ 1 → ¬Nat.Prime (a * b)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"92b1ab37d889592eaf4045ee22924661e8695a6582e8c3b82f31cda313e26293","prominence":"supporting","quote":{"exact":"6 = 2 × 3 are both composite."},"quote_capped":false,"section":["Definition and examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"4 = 2 × 2 and ","segments":[{"text":"4 = 2 × 2 and "}]},"layer":"6 = 2 × 3 are both composite.","segments":[{"text":"6 = 2 × 3 are both composite."}]},"unresolved":null},{"absence":null,"basis":"efc55598412c6f9e4bfc3bbeafebacdb2ef6e7ee28f730fa55b00e80a816cb0e","coverage":null,"id":"enwiki-23666-1373534600::In-text #cb06d4ed","item":"In-text #cb06d4ed","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.divisors","end_line":52,"library":"mathlib","line":52,"location_key":"efc55598412c6f9e4bfc3bbeafebacdb2ef6e7ee28f730fa55b00e80a816cb0e","module":"Mathlib.NumberTheory.Divisors","note":"Mathlib keeps the divisors as a finite set and, as its docstring records, fixes the divisor set of 0 to be empty.","pair_key":"a4ef95f2e0d77666dbf45a947fd9f48ce7068938fe12c2a7ccef6cf66d567a45","path":"Mathlib/NumberTheory/Divisors.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.divisors : ℕ → Finset ℕ"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.mem_divisors","end_line":112,"library":"mathlib","line":108,"location_key":"2b58b17ad4bb6e87e1e8efbea8328fdf94bbb136bd56c93d17e48ca275af6273","module":"Mathlib.NumberTheory.Divisors","note":"A membership lemma that unfolds what the divisor set means, restating the term rather than defining the object the passage defines.","pair_key":"77abf5ef3f97efc54d639ac6f07a19a84b3a127270b56b0b0778a8730ddb3bad","path":"Mathlib/NumberTheory/Divisors.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.mem_divisors {n m : ℕ} : n ∈ m.divisors ↔ n ∣ m ∧ m ≠ 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"24bb47b5fae5d95910fc2fe0765ff3f9b28dad48fcba953707caf96c28251cc3","prominence":"supporting","quote":{"exact":"The divisors of a natural number ⁠ n {\\displaystyle n} ⁠ are"},"quote_capped":true,"section":["Definition and examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"The divisors of a natural number ⁠ n {\\displaystyle n} ⁠ are the natural numbers that divide ⁠ n {\\displaystyle n} ⁠ evenly.","segments":[{"text":"The divisors of a natural number ⁠ "},{"tex":"n"},{"text":" ⁠ are the natural numbers that divide ⁠ "},{"tex":"n"},{"text":" ⁠ evenly."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"9fe33673b74c5c0dc2afeee22f0f66324dd4771ef182adbe8cc80509be3e417f","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"b5e1f523bf3efe4783c6cc7852371156abf0f39e0f02f5073da490f04e1a3e8d","text":"1 divides every natural number"},{"id":"c2","part":"5527de2fad5de9d178d7a882f3bfe9aedcae308b45da41b6ae3a0982b7091fe4","text":"every natural number divides itself"}],"parts":["b5e1f523bf3efe4783c6cc7852371156abf0f39e0f02f5073da490f04e1a3e8d","5527de2fad5de9d178d7a882f3bfe9aedcae308b45da41b6ae3a0982b7091fe4"],"relation":"exactMatch","status":"formalized"},"id":"enwiki-23666-1373534600::In-text #966d6c91","item":"In-text #966d6c91","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.one_dvd","end_line":84,"library":"lean-core","line":84,"location_key":"b5e1f523bf3efe4783c6cc7852371156abf0f39e0f02f5073da490f04e1a3e8d","module":"Init.Data.Nat.Dvd","note":"Stated for the natural numbers the passage speaks of, with 1 as the divisor.","pair_key":"78e3ccbeeb76b6c28eeb703b30ed0398e78d2457b0262d859770982c2d6ea3ff","path":"src/Init/Data/Nat/Dvd.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.one_dvd (n : Nat) : 1 ∣ n"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.dvd_refl","end_line":19,"library":"lean-core","line":19,"location_key":"5527de2fad5de9d178d7a882f3bfe9aedcae308b45da41b6ae3a0982b7091fe4","module":"Init.Data.Nat.Dvd","note":"Stated for the natural numbers the passage speaks of, with the number as its own divisor.","pair_key":"2978458e617e889a402fd7640008e04e87264c261d8301e640bba56ad80b24ad","path":"src/Init/Data/Nat/Dvd.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.dvd_refl (a : Nat) : a ∣ a"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2e2245b7fada491bacbe22c5303461afd8a3382441c6d25c0cdc223f38660e0c","prominence":"supporting","quote":{"exact":"Every natural number has both 1 and itself as a divisor."},"quote_capped":false,"section":["Definition and examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Every natural number has both 1 and itself as a divisor.","segments":[{"text":"Every natural number has both 1 and itself as a divisor."}]},"unresolved":null},{"absence":null,"basis":"d404d0647fa7b854bd8ccb25f349eaedf773a156763e9dfb55b886ff19227f2b","coverage":null,"id":"enwiki-23666-1373534600::In-text #84dbcfc7","item":"In-text #84dbcfc7","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.not_prime_of_dvd_of_lt","end_line":77,"library":"mathlib","line":76,"location_key":"d404d0647fa7b854bd8ccb25f349eaedf773a156763e9dfb55b886ff19227f2b","module":"Mathlib.Data.Nat.Prime.Basic","note":"Its two bounds on the divisor say that the divisor is neither 1 nor the number; the single value they leave out is n = 0, which is not prime regardless.","pair_key":"86dddca3e84377c6271451dca84d81fad3213a4d5ab2843bdc5967214440dc26","path":"Mathlib/Data/Nat/Prime/Basic.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.not_prime_of_dvd_of_lt {m n : ℕ} : m ∣ n → 2 ≤ m → m < n → ¬Nat.Prime n"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.Prime.eq_one_or_self_of_dvd","end_line":95,"library":"mathlib","line":88,"location_key":"17c96b572b8a13e59132fe7375ca405fb6ae04af4b69efb614ad7944182161cf","module":"Mathlib.Data.Nat.Prime.Defs","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.","pair_key":"63cd09fbcf0b0250b4c5e364956d2b9e0d2a01effad23feb10f97c01a7626744","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"proved","rank":2,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.Prime.eq_one_or_self_of_dvd {p : ℕ} : Nat.Prime p → ∀ (m : ℕ), m ∣ p → m = 1 ∨ m = p"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"79f26faaa22508358d269253e2d05968d210f0d62e3c638437f60f5e35b5af89","prominence":"supporting","quote":{"exact":"If it has any other divisor, it cannot be prime."},"quote_capped":false,"section":["Definition and examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"If it has any other divisor, it cannot be prime.","segments":[{"text":"If it has any other divisor, it cannot be prime."}]},"unresolved":null},{"absence":null,"basis":"966d40677965ec4df6a59f6e79bee984d5e70b1672c4f14adc46ceeb583c7a49","coverage":null,"id":"enwiki-23666-1373534600::In-text #baca4253","item":"In-text #baca4253","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.properDivisors_eq_singleton_one_iff_prime","end_line":481,"library":"mathlib","line":476,"location_key":"966d40677965ec4df6a59f6e79bee984d5e70b1672c4f14adc46ceeb583c7a49","module":"Mathlib.NumberTheory.Divisors","note":"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.","pair_key":"97d14bd0f47756582e1429a4cf9a1a48d3787c7f3221ef43b073cdc5c614234c","path":"Mathlib/NumberTheory/Divisors.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.properDivisors_eq_singleton_one_iff_prime {n : ℕ} : n.properDivisors = {1} ↔ Nat.Prime n"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.Prime.divisors","end_line":414,"library":"mathlib","line":412,"location_key":"09e5c6cb1a28447c758be5a8297dc0fbc0ea08d44fbfade6d67cb7499a5937f6","module":"Mathlib.NumberTheory.Divisors","note":"It runs from primality to the divisor set only, so on its own it does not give the equivalence the passage states.","pair_key":"7f755b7df846b645fe1d0c340979423f22acb25fb6d7e6f039d412903ec9b7e6","path":"Mathlib/NumberTheory/Divisors.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.Prime.divisors {p : ℕ} : Nat.Prime p → p.divisors = {1, p}"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"1473afe0de7ad1a1d71eb9a0de820d728a90e96514042b5f3b438ad59c6b53df","prominence":"central","quote":{"exact":"This leads to an equivalent definition of prime numbers: they are the"},"quote_capped":true,"section":["Definition and examples"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"This leads to an equivalent definition of prime numbers: they are the numbers with exactly two positive divisors.","segments":[{"text":"This leads to an equivalent definition of prime numbers: they are the numbers with exactly two positive divisors."}]},"unresolved":null},{"absence":null,"basis":"5e001bf79cdbd8404706f3266cd7551d5ed43d86395d47b70fa9a69493f66f5a","coverage":null,"id":"enwiki-23666-1373534600::In-text #d303910e","item":"In-text #d303910e","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.Prime.divisors","end_line":414,"library":"mathlib","line":412,"location_key":"5e001bf79cdbd8404706f3266cd7551d5ed43d86395d47b70fa9a69493f66f5a","module":"Mathlib.NumberTheory.Divisors","note":"Mathlib's divisor set collects the positive divisors, and the theorem equates it with the pair consisting of 1 and the prime.","pair_key":"b18b31bb6586b47da0e87acea4f3fb9d791926f131be5b6ba12fe1125364fca7","path":"Mathlib/NumberTheory/Divisors.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.Prime.divisors {p : ℕ} : Nat.Prime p → p.divisors = {1, p}"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.Prime.properDivisors","end_line":418,"library":"mathlib","line":416,"location_key":"de4ebfeb19858b873f31d82be550788cf4e38537475429efdc8882ad8e9a2afd","module":"Mathlib.NumberTheory.Divisors","note":"It names the divisors of a prime below the prime, leaving the prime itself out of the set it describes.","pair_key":"4a0e241525e251f64b0bf21811d49a3a13a0859004c5eb503d47c16fba3daa78","path":"Mathlib/NumberTheory/Divisors.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.Prime.properDivisors {p : ℕ} : Nat.Prime p → p.properDivisors = {1}"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"78f444d9badf8e228e2945972aae475409dcc50c483607763a772cb3ee7a6d18","prominence":"supporting","quote":{"exact":"Those two are 1 and the number itself."},"quote_capped":false,"section":["Definition and examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Those two are 1 and the number itself.","segments":[{"text":"Those two are 1 and the number itself."}]},"unresolved":null},{"absence":null,"basis":"445798c78498f4cfa687f6395de0a452c7a44b66a7213d2ef2896006e9213f02","coverage":null,"id":"enwiki-23666-1373534600::In-text #2d674bf4","item":"In-text #2d674bf4","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.not_prime_one","end_line":58,"library":"mathlib","line":57,"location_key":"445798c78498f4cfa687f6395de0a452c7a44b66a7213d2ef2896006e9213f02","module":"Mathlib.Data.Nat.Prime.Defs","note":null,"pair_key":"bf97a60b7005186fc72b39219c27e6cb0c80d8c5e9969cacb120055cb08337a9","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.not_prime_one : ¬Nat.Prime 1"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.divisors_one","end_line":267,"library":"mathlib","line":265,"location_key":"8edd77350adea151b0e9a2a8582367548507cea3b7abce577213e6d37a4be567","module":"Mathlib.NumberTheory.Divisors","note":null,"pair_key":"cba9f977e20d42b4cd6420e2a96b0c47f091a2aeae613d162595fa363ee81828","path":"Mathlib/NumberTheory/Divisors.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.divisors_one : Nat.divisors 1 = {1}"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.divisors_card_eq_one_iff","end_line":233,"library":"mathlib","line":229,"location_key":"2f9f644ea7742628eced3a13767d6794d1a717693683dddd84250e454fcb137e","module":"Mathlib.NumberTheory.ArithmeticFunction.Misc","note":null,"pair_key":"b7fe6757fb29e4ce098554e20fb0e37d221b1f95bc4f6d79c81a7c72ce13e03f","path":"Mathlib/NumberTheory/ArithmeticFunction/Misc.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.divisors_card_eq_one_iff (n : ℕ) : n.divisors.card = 1 ↔ n = 1"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d380f7139ee8fb86afa3ff28b372642a3989bd10abbffbe4c77a081c8bf97a15","prominence":"supporting","quote":{"exact":"As 1 has only one divisor, itself, it is not prime by"},"quote_capped":true,"section":["Definition and examples"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"As 1 has only one divisor, itself, it is not prime by this definition.[5]","segments":[{"text":"As 1 has only one divisor, itself, it is not prime by this definition."},{"ref":"[5]"}]},"unresolved":null},{"absence":null,"basis":"9874cbb45fa75848913e758f7f1c0d42df88cca54dfd6554cde3362e61e5eaad","coverage":null,"id":"enwiki-23666-1373534600::In-text #7219b09c","item":"In-text #7219b09c","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.prime_def_lt'","end_line":122,"library":"mathlib","line":114,"location_key":"9874cbb45fa75848913e758f7f1c0d42df88cca54dfd6554cde3362e61e5eaad","module":"Mathlib.Data.Nat.Prime.Defs","note":null,"pair_key":"fbe464a571eb7e9315537469a4de7501c3b0bd2acc4e2ae74fa5abb9c7b4d81a","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prime_def_lt' {p : ℕ} : Nat.Prime p ↔ 2 ≤ p ∧ ∀ (m : ℕ), 2 ≤ m → m < p → ¬m ∣ p"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.prime_def_lt","end_line":112,"library":"mathlib","line":107,"location_key":"ed43598e347edf9e68ad79fd95e07ce992ca57bb12822c83a93923d39cf030ef","module":"Mathlib.Data.Nat.Prime.Defs","note":"Mathlib encodes the trial-division condition as: every divisor of n that is below n equals one.","pair_key":"b65d7943c5fd61ac6acb66ebef663fe9cf32b007297ce916279a09f470b76178","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prime_def_lt {p : ℕ} : Nat.Prime p ↔ 2 ≤ p ∧ ∀ m < p, m ∣ p → m = 1"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"0e3c5e88a595a338360de4cc982ee99051f0bcbacba7fbc4e26fe83d09d607f8","prominence":"supporting","quote":{"exact":"Yet another way to express the same thing is that a number"},"quote_capped":true,"section":["Definition and examples"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Yet another way to express the same thing is that a number ⁠ n {\\displaystyle n} ⁠ is prime if it is greater than one and if none of the numbers 2 , 3 , … , n − 1 {\\displaystyle 2,3,\\dots ,n-1} divides ⁠ n {\\displaystyle n} ⁠ evenly.","segments":[{"text":"Yet another way to express the same thing is that a number ⁠ "},{"tex":"n"},{"text":" ⁠ is prime if it is greater than one and if none of the numbers "},{"tex":"2,3,\\dots ,n-1"},{"text":" divides ⁠ "},{"tex":"n"},{"text":" ⁠ evenly."}]},"unresolved":null},{"absence":null,"basis":"767b356674d7aca336c03a6d8edf419c0788aec28ce76e94734ef2d7a8513aae","coverage":null,"id":"enwiki-23666-1373534600::In-text #cda03537","item":"In-text #cda03537","kind":"example","locations":[{"challenge":"sampled_out","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"OeisA100474.nth_prime_thirteen","end_line":88,"library":"formal-conjectures","line":86,"location_key":"767b356674d7aca336c03a6d8edf419c0788aec28ce76e94734ef2d7a8513aae","module":"FormalConjectures.OEIS.«100474»","note":null,"pair_key":"f204dec61cebbe9d14dae1fefa2c0824026a78c7f2eb267f3e14de53a303397f","path":"FormalConjectures/OEIS/100474.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem OeisA100474.nth_prime_thirteen : Nat.nth Nat.Prime 13 = 43"},"statement":false},{"challenge":"sampled_out","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"OeisA100474.nth_prime_twelve","end_line":83,"library":"formal-conjectures","line":81,"location_key":"017320f54023cd1f807beddb43b842f2050691f534eb9faa4ed942d18fd2e4c9","module":"FormalConjectures.OEIS.«100474»","note":null,"pair_key":"d3bc2e5b58235f8eeed1c87bb5b94029eea61f5991f8feb777914ef2320c7b28","path":"FormalConjectures/OEIS/100474.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem OeisA100474.nth_prime_twelve : Nat.nth Nat.Prime 12 = 41"},"statement":false},{"challenge":"sampled_out","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"OeisA100474.nth_prime_eleven","end_line":78,"library":"formal-conjectures","line":76,"location_key":"c466693fdf2b8e1ae526ee755f2c0ff9f3a1d929ca8231c63659162e48d099ef","module":"FormalConjectures.OEIS.«100474»","note":null,"pair_key":"774972c4009b099c613f95a32f02518e30ea395766c173cb81681ba4c2177def","path":"FormalConjectures/OEIS/100474.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem OeisA100474.nth_prime_eleven : Nat.nth Nat.Prime 11 = 37"},"statement":false},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"OeisA100474.nth_prime_ten","end_line":73,"library":"formal-conjectures","line":71,"location_key":"aa5a640b5238e1143ddd6cc5489d8211def27a255bdad731c6b2df3055a178a9","module":"FormalConjectures.OEIS.«100474»","note":null,"pair_key":"47a1576ff9af3be5d40128bd6dfb14393651ff716cd5bc960082d9a433d8a248","path":"FormalConjectures/OEIS/100474.lean","proof_status":"proved","rank":4,"relation":"hasPart","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem OeisA100474.nth_prime_ten : Nat.nth Nat.Prime 10 = 31"},"statement":false},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"OeisA100474.nth_prime_nine","end_line":68,"library":"formal-conjectures","line":66,"location_key":"90172ea55298010aebc3853ec9ff618f2398ea7440c50e2264a180309b638bbb","module":"FormalConjectures.OEIS.«100474»","note":null,"pair_key":"f2ee56c086ed01a1e13acb17c21ec3be020f0f6fd18687de968fad4b6180e954","path":"FormalConjectures/OEIS/100474.lean","proof_status":"proved","rank":5,"relation":"hasPart","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem OeisA100474.nth_prime_nine : Nat.nth Nat.Prime 9 = 29"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"41ce1353cad999ef52d2d37ccf55becaa54f3b4d9e595eb45fa6782b1d3b5e46","prominence":"supporting","quote":{"exact":"2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37,"},"quote_capped":true,"section":["Definition and examples"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"The first 25 prime numbers (all the prime numbers less than 100) are:[7] ","lead_in":true,"segments":[{"text":"The first 25 prime numbers (all the prime numbers less than 100) are:"},{"ref":"[7]"},{"text":" "}]},"layer":"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).","segments":[{"text":"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)."}]},"unresolved":null},{"absence":null,"basis":"83d81a5128daec13690416ed41e48b4cc1115c6b4a76dbcfd9d5a149ee68b116","coverage":null,"id":"enwiki-23666-1373534600::In-text #4c8f1933","item":"In-text #4c8f1933","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.Prime.even_iff","end_line":97,"library":"mathlib","line":96,"location_key":"83d81a5128daec13690416ed41e48b4cc1115c6b4a76dbcfd9d5a149ee68b116","module":"Mathlib.Data.Nat.Prime.Basic","note":null,"pair_key":"280f810eb8c2b8b1d2e2470bf7b811ada71b4a4348c489fd2d8f9ccfdbb46181","path":"Mathlib/Data/Nat/Prime/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.Prime.even_iff {p : ℕ} : Nat.Prime p → (Even p ↔ p = 2)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.not_prime_of_dvd_of_lt","end_line":77,"library":"mathlib","line":76,"location_key":"5edf9e93080a3764365eea4230882457e39fad4eefa1793a518eb27b4a660a42","module":"Mathlib.Data.Nat.Prime.Basic","note":null,"pair_key":"622aaf2ad3ec3bf8b8698e0123010d44cfe7087bfbf9884298f4fb0255b4d1b6","path":"Mathlib/Data/Nat/Prime/Basic.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.not_prime_of_dvd_of_lt {m n : ℕ} : m ∣ n → 2 ≤ m → m < n → ¬Nat.Prime n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"1fed42013eb3b129f3ef23cbd07dc73b0bfc1ac1e73880bd9c8d3ede2debc599","prominence":"supporting","quote":{"exact":"No even number ⁠ n {\\displaystyle n} ⁠ greater than 2 is"},"quote_capped":true,"section":["Definition and examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":" because any such number can be expressed as the product ⁠ 2 × n / 2 {\\displaystyle 2\\times n/2} ⁠.","segments":[{"text":" because any such number can be expressed as the product ⁠ "},{"tex":"2\\times n/2"},{"text":" ⁠."}]},"layer":"No even number ⁠ n {\\displaystyle n} ⁠ greater than 2 is prime","segments":[{"text":"No even number ⁠ "},{"tex":"n"},{"text":" ⁠ greater than 2 is prime"}]},"unresolved":null},{"absence":null,"basis":"7dcf8f16013c899d2e9cb744b53aac95775224911722d237b047fa09252b8e3d","coverage":null,"id":"enwiki-23666-1373534600::In-text #5df54da7","item":"In-text #5df54da7","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.two_mul_div_two_of_even","end_line":74,"library":"mathlib","line":73,"location_key":"7dcf8f16013c899d2e9cb744b53aac95775224911722d237b047fa09252b8e3d","module":"Mathlib.Algebra.Group.Nat.Even","note":null,"pair_key":"4c70ecdcee9663bf40ac69d7fa0a967163a084b0a634671de11659eee84fd2ab","path":"Mathlib/Algebra/Group/Nat/Even.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.two_mul_div_two_of_even {n : ℕ} : Even n → 2 * (n / 2) = n"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.div_two_mul_two_of_even","end_line":77,"library":"mathlib","line":76,"location_key":"b617aff026882ffd206663d565101625321fa9ffb0fd752f1ef86d1c24d57317","module":"Mathlib.Algebra.Group.Nat.Even","note":"Mathlib writes the product with the half as the left factor.","pair_key":"000dfdcb74322cadd5cf20963df96b6622749844e8c71358de27f3997932d9cb","path":"Mathlib/Algebra/Group/Nat/Even.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.div_two_mul_two_of_even {n : ℕ} : Even n → n / 2 * 2 = n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"93590449b41f94240e4ed4f85413f881f846621f01c624aa3c6043322cc2bfe4","prominence":"supporting","quote":{"exact":"any such number can be expressed as the product ⁠ 2 ×"},"quote_capped":true,"section":["Definition and examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"No even number ⁠ n {\\displaystyle n} ⁠ greater than 2 is prime because ","segments":[{"text":"No even number ⁠ "},{"tex":"n"},{"text":" ⁠ greater than 2 is prime because "}]},"layer":"any such number can be expressed as the product ⁠ 2 × n / 2 {\\displaystyle 2\\times n/2} ⁠.","segments":[{"text":"any such number can be expressed as the product ⁠ "},{"tex":"2\\times n/2"},{"text":" ⁠."}]},"unresolved":null},{"absence":null,"basis":"36e7af95512719911118113d21a0f4203a3fac60722acd3a9b29acae879b5271","coverage":null,"id":"enwiki-23666-1373534600::In-text #59d9e298","item":"In-text #59d9e298","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.Prime.odd_of_ne_two","end_line":104,"library":"mathlib","line":103,"location_key":"36e7af95512719911118113d21a0f4203a3fac60722acd3a9b29acae879b5271","module":"Mathlib.Data.Nat.Prime.Basic","note":null,"pair_key":"46b7d715f7dfd542f9a5e2f499eaa67a5c42253a665c7e015b74c50218fb642c","path":"Mathlib/Data/Nat/Prime/Basic.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.Prime.odd_of_ne_two {p : ℕ} : Nat.Prime p → p ≠ 2 → Odd p"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.Prime.eq_two_or_odd'","end_line":46,"library":"mathlib","line":45,"location_key":"7e2ad30df02f3fa56c0c98d6e856ebdc5f81172a98b02cea4fa46918eab17022","module":"Mathlib.Data.Nat.Prime.Basic","note":null,"pair_key":"0077ce325a3d0a90e8c9696699b41938263fa77244275ad2a7834ea58e2e68ef","path":"Mathlib/Data/Nat/Prime/Basic.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.Prime.eq_two_or_odd' {p : ℕ} : Nat.Prime p → p = 2 ∨ Odd p"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e11c1890868affc8119908bb8d31e34bb919ecd6530fa4aee004904304d62239","prominence":"supporting","quote":{"exact":"Therefore, every prime number other than 2 is an odd number, and"},"quote_capped":true,"section":["Definition and examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Therefore, every prime number other than 2 is an odd number, and is called an odd prime.[8]","segments":[{"text":"Therefore, every prime number other than 2 is an odd number, and is called an odd prime."},{"ref":"[8]"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"2073af07ac2d7fc0a15b817ac870e5233d8b1828c0c2d60d3984bf96441f423d"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #298b9478","item":"In-text #298b9478","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e7bf669b1eba1f951b909edc3bf61ef41f1254c628a124e6812d0cedaaed466f","prominence":"supporting","quote":{"exact":"Similarly, when written in the usual decimal system, all prime numbers larger"},"quote_capped":true,"section":["Definition and examples"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Similarly, when written in the usual decimal system, all prime numbers larger than 5 end in 1, 3, 7, or 9.","segments":[{"text":"Similarly, when written in the usual decimal system, all prime numbers larger than 5 end in 1, 3, 7, or 9."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"f9685e44acd5b0b4cca5a76c5d8c3971927d54d9436077a47d2e38eb841c1daa"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #76bf2d86","item":"In-text #76bf2d86","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"8f24aab8952347cb493bad1e0395bcf28fa41f193e3dd140d0abae9bf8e688df","prominence":"supporting","quote":{"exact":"The numbers that end with other digits are all composite"},"quote_capped":false,"section":["Definition and examples"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":": 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.","segments":[{"text":": 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."}]},"layer":"The numbers that end with other digits are all composite","segments":[{"text":"The numbers that end with other digits are all composite"}]},"unresolved":null},{"absence":null,"basis":"f4c37f5ec839969dba2a2e77045677e7be7f466c230dc307add149e01abad6f5","coverage":null,"id":"enwiki-23666-1373534600::In-text #d6826ae1","item":"In-text #d6826ae1","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.dvd_iff_dvd_ofDigits","end_line":55,"library":"mathlib","line":51,"location_key":"f4c37f5ec839969dba2a2e77045677e7be7f466c230dc307add149e01abad6f5","module":"Mathlib.Data.Nat.Digits.Div","note":"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.","pair_key":"64f9f1186c5886315cf4aa6de0f80406591542365eed1e1bf7c1075373e685f7","path":"Mathlib/Data/Nat/Digits/Div.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.dvd_iff_dvd_ofDigits (b b' : ℕ) (c : ℤ) : ↑b ∣ ↑b' - c → ∀ (n : ℕ), b ∣ n ↔ ↑b ∣ Nat.ofDigits c (b'.digits n)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.head!_digits","end_line":268,"library":"mathlib","line":260,"location_key":"3518a83b3c2295e54e3fe98520628c5df11c66975b12e11000dda57b895c3bcd","module":"Mathlib.Data.Nat.Digits.Lemmas","note":"It identifies the first entry of the base-b digit list with the remainder of n on division by b, which is how the article's phrase about the ending digit is spelled in Lean.","pair_key":"4ebc301386d6715e940b0506eac0c42805c498ffa9c96ae974dbeeeb66fe9b12","path":"Mathlib/Data/Nat/Digits/Lemmas.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.head!_digits {b n : ℕ} : b ≠ 1 → (b.digits n).head! = n % b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"478ef22560c152bc5391a0503df0fa872dabe001b280c3baf4b3ddf9da839415","prominence":"supporting","quote":{"exact":"decimal numbers that end in 0, 2, 4, 6, or 8 are"},"quote_capped":true,"section":["Definition and examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":", and decimal numbers that end in 0 or 5 are divisible by 5.","segments":[{"text":", and decimal numbers that end in 0 or 5 are divisible by 5."}]},"before":{"layer":"The numbers that end with other digits are all composite: ","segments":[{"text":"The numbers that end with other digits are all composite: "}]},"layer":"decimal numbers that end in 0, 2, 4, 6, or 8 are even","segments":[{"text":"decimal numbers that end in 0, 2, 4, 6, or 8 are even"}]},"unresolved":null},{"absence":null,"basis":"1a8d49c540ff0e54c698d816d8d10c567f03e2d246dd1ef9bbf3df764f64608f","coverage":null,"id":"enwiki-23666-1373534600::In-text #bc99ce74","item":"In-text #bc99ce74","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.dvd_iff_dvd_ofDigits","end_line":55,"library":"mathlib","line":51,"location_key":"1a8d49c540ff0e54c698d816d8d10c567f03e2d246dd1ef9bbf3df764f64608f","module":"Mathlib.Data.Nat.Digits.Div","note":"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.","pair_key":"e0c54319e8a805ee55000d1fe715577dcc6d1ae4a5ee522b60b82335e286bb36","path":"Mathlib/Data/Nat/Digits/Div.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.dvd_iff_dvd_ofDigits (b b' : ℕ) (c : ℤ) : ↑b ∣ ↑b' - c → ∀ (n : ℕ), b ∣ n ↔ ↑b ∣ Nat.ofDigits c (b'.digits n)"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.head!_digits","end_line":268,"library":"mathlib","line":260,"location_key":"ac5e108b7b7158270264392cbf2f3244196382d57b7852efcbd1885c454303eb","module":"Mathlib.Data.Nat.Digits.Lemmas","note":"It identifies the first entry of the base-b digit list with the remainder of n on division by b, which is how the article's phrase about the ending digit is spelled in Lean.","pair_key":"554b17f46f4c02ec0d2900bb4ff7c533aec8a978cdbf50e98756707b03dba63d","path":"Mathlib/Data/Nat/Digits/Lemmas.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.head!_digits {b n : ℕ} : b ≠ 1 → (b.digits n).head! = n % b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"ebba2a105fd8e5cb8ea6d3507ee89a16b574ca3d7a8f46f1b3e8aadf4f593d77","prominence":"supporting","quote":{"exact":"decimal numbers that end in 0 or 5 are divisible by 5."},"quote_capped":false,"section":["Definition and examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"The numbers that end with other digits are all composite: decimal numbers that end in 0, 2, 4, 6, or 8 are even, and ","segments":[{"text":"The numbers that end with other digits are all composite: decimal numbers that end in 0, 2, 4, 6, or 8 are even, and "}]},"layer":"decimal numbers that end in 0 or 5 are divisible by 5.","segments":[{"text":"decimal numbers that end in 0 or 5 are divisible by 5."}]},"unresolved":null},{"absence":null,"basis":"85a33d2443e726f6493e3f3e8af38c25c07ab75c2f610067cd24bc05a8fb53c6","coverage":null,"id":"enwiki-23666-1373534600::In-text #f0995878","item":"In-text #f0995878","kind":"notation","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.Primes","end_line":440,"library":"mathlib","line":438,"location_key":"85a33d2443e726f6493e3f3e8af38c25c07ab75c2f610067cd24bc05a8fb53c6","module":"Mathlib.Data.Nat.Prime.Defs","note":"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.","pair_key":"74e2f54c231ce1adf6781df28bbe5d2029b020a9c1a8af6f68b7e2fa563d8b39","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.Primes : Type"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c6a1d9d4010070a3617783d022b4e4e508f7a65089102c510997bc1b8686f34a","prominence":"supporting","quote":{"exact":"The set of all primes is sometimes denoted by P {\\displaystyle \\mathbf"},"quote_capped":true,"section":["Definition and examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"The set of all primes is sometimes denoted by P {\\displaystyle \\mathbf {P} } (a boldface capital P)[10] or by P {\\displaystyle \\mathbb {P} } (a blackboard bold capital P).","segments":[{"text":"The set of all primes is sometimes denoted by "},{"tex":"\\mathbf {P}"},{"text":" (a boldface capital P)"},{"ref":"[10]"},{"text":" or by "},{"tex":"\\mathbb {P}"},{"text":" (a blackboard bold capital P)."}]},"unresolved":null},{"absence":null,"basis":"a41472eec02d1f35c74d4f9e5b5fdf53bc175fe2099da0bb205ffb6c676a1585","coverage":null,"id":"enwiki-23666-1373534600::In-text #8a5039a0","item":"In-text #8a5039a0","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.prime_iff_fac_equiv_neg_one","end_line":131,"library":"mathlib","line":128,"location_key":"a41472eec02d1f35c74d4f9e5b5fdf53bc175fe2099da0bb205ffb6c676a1585","module":"Mathlib.NumberTheory.Wilson","note":"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.","pair_key":"13b0acd24c84c30c7d939017c6e68bae8896d1c449ab9fd6f322bcf3751c82fe","path":"Mathlib/NumberTheory/Wilson.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prime_iff_fac_equiv_neg_one {n : ℕ} : n ≠ 1 → (Nat.Prime n ↔ ↑(n - 1).factorial = -1)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ZMod.wilsons_lemma","end_line":87,"library":"mathlib","line":62,"location_key":"f874d06cfead5186b6469826d335a60a229c86e978d21222343d3510d13f7eb9","module":"Mathlib.NumberTheory.Wilson","note":"It assumes primality through a Fact instance and concludes the congruence, so it carries the forward half of the article's characterization.","pair_key":"7f5ae82c738a6b036a15da9011847e61e3ce3e77212416b02c029a9a13495ba9","path":"Mathlib/NumberTheory/Wilson.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ZMod.wilsons_lemma (p : ℕ) [Fact (Nat.Prime p)] : ↑(p - 1).factorial = -1"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"3238f510f63a6d122567997f46e6ba30a75674c56f790b38d6dd567c18bf27ba","prominence":"central","quote":{"exact":"Around 1000 AD, the Islamic mathematician Ibn al-Haytham (Alhazen) found Wilson's theorem,"},"quote_capped":true,"section":["History"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Around 1000 AD, the Islamic mathematician Ibn al-Haytham (Alhazen) found Wilson's theorem, characterizing the prime numbers as the numbers ⁠ n {\\displaystyle n} ⁠ that evenly divide ⁠ ( n − 1 ) ! + 1 {\\displaystyle (n-1)!+1} ⁠.","segments":[{"text":"Around 1000 AD, the Islamic mathematician Ibn al-Haytham (Alhazen) found Wilson's theorem, characterizing the prime numbers as the numbers ⁠ "},{"tex":"n"},{"text":" ⁠ that evenly divide ⁠ "},{"tex":"(n-1)!+1"},{"text":" ⁠."}]},"unresolved":null},{"absence":null,"basis":"41df891910f5aca6995dea350da80e7486226fc4f0adf816925e6cd7925f886e","coverage":null,"id":"enwiki-23666-1373534600::In-text #6ff51de0","item":"In-text #6ff51de0","kind":"conjecture","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MetaMathlibExt.euler_characterization_of_even_perfect_numbers","library":"atlas","line":46,"location_key":"41df891910f5aca6995dea350da80e7486226fc4f0adf816925e6cd7925f886e","module":"MathlibExt.NumberTheory.EvenPerfectNumbers","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.","pair_key":"3f9d69b5ca4085a5626639b41a2e74d715c6ed99a273fe5c2baa8906746cfad3","path":"MathlibExt/NumberTheory/EvenPerfectNumbers.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"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)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f584d84f2cc32353d5a5a3e0e3342184c3d857058eb46634b82efe4e90ae1434","prominence":"supporting","quote":{"exact":"He also conjectured that all even perfect numbers come from Euclid's construction"},"quote_capped":true,"section":["History"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"He also conjectured that all even perfect numbers come from Euclid's construction using Mersenne primes, but was unable to prove it.[16]","segments":[{"text":"He also conjectured that all even perfect numbers come from Euclid's construction using Mersenne primes, but was unable to prove it."},{"ref":"[16]"}]},"unresolved":null},{"absence":null,"basis":"cdd7645b943821941082228d755eeb057263f55949896fea700b678966b23329","coverage":null,"id":"enwiki-23666-1373534600::In-text #8097167e","item":"In-text #8097167e","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"mersenne","end_line":40,"library":"mathlib","line":39,"location_key":"cdd7645b943821941082228d755eeb057263f55949896fea700b678966b23329","module":"Mathlib.NumberTheory.LucasLehmer","note":"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.","pair_key":"b87c464b962457a10dacd3b42dec2d43541a2299d36650267138442d2c27f339","path":"Mathlib/NumberTheory/LucasLehmer.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def mersenne : ℕ → ℕ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.Prime.of_mersenne","end_line":72,"library":"mathlib","line":69,"location_key":"b82d3786eababa4c017168c9842b8ad9bcb71a537c5d3cd57ec83dfdee73046e","module":"Mathlib.NumberTheory.LucasLehmer","note":"It shows that primality of 2^p − 1 forces the exponent p to be prime, so the article's requirement on the exponent is automatic.","pair_key":"979b09ab9a7b16e732c2c4b5593837f331dcf8dbc6c939906a9ca91266d8f45c","path":"Mathlib/NumberTheory/LucasLehmer.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.Prime.of_mersenne {p : ℕ} : Nat.Prime (mersenne p) → Nat.Prime p"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"dd65eedf19cf76e491fa95f3386c55a17f5319fc968b6eced1aac7a6a78633a5","prominence":"central","quote":{"exact":"Marin Mersenne studied the Mersenne primes, prime numbers of the form 2"},"quote_capped":true,"section":["History"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"Fermat also investigated the primality of the Fermat numbers ⁠ 2 2 n + 1 {\\displaystyle 2^{2^{n}}+1} ⁠,[18] and ","segments":[{"text":"Fermat also investigated the primality of the Fermat numbers ⁠ "},{"tex":"2^{2^{n}}+1"},{"text":" ⁠,"},{"ref":"[18]"},{"text":" and "}]},"layer":"Marin Mersenne studied the Mersenne primes, prime numbers of the form 2 p − 1 {\\displaystyle 2^{p}-1} with ⁠ p {\\displaystyle p} ⁠ itself a prime.[19]","segments":[{"text":"Marin Mersenne studied the Mersenne primes, prime numbers of the form "},{"tex":"2^{p}-1"},{"text":" with ⁠ "},{"tex":"p"},{"text":" ⁠ itself a prime."},{"ref":"[19]"}]},"unresolved":null},{"absence":null,"basis":"7f78883bdc8d26b7bbbcef6e670882e4cb25392e87057f83be1ede234fb24fc8","coverage":null,"id":"enwiki-23666-1373534600::In-text #e1d43100","item":"In-text #e1d43100","kind":"conjecture","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"GoldbachConjecture.goldbach","end_line":38,"library":"formal-conjectures","line":36,"location_key":"7f78883bdc8d26b7bbbcef6e670882e4cb25392e87057f83be1ede234fb24fc8","module":"FormalConjectures.Wikipedia.GoldbachConjecture","note":"Lean bounds the even number below by two, where the article's wording names no bound, and writes primality with the ring-theoretic predicate on ℕ.","pair_key":"fb7b883ced750f2af7b43bae181824bf12dd0c93401b88259f522df396eedde4","path":"FormalConjectures/Wikipedia/GoldbachConjecture.lean","proof_status":"statement_only","rank":1,"relation":"narrowMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem GoldbachConjecture.goldbach (n : ℕ) : 2 < n → Even n → ∃ p q, Prime p ∧ Prime q ∧ n = p + q"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2283991956724138ef42c22bcd025c24a1ad1eb887b86a5f6e6dd662b4b8a02a","prominence":"central","quote":{"exact":"Christian Goldbach formulated Goldbach's conjecture, that every even number is the sum"},"quote_capped":true,"section":["History"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Christian Goldbach formulated Goldbach's conjecture, that every even number is the sum of two primes, in a 1742 letter to Euler.[20]","segments":[{"text":"Christian Goldbach formulated Goldbach's conjecture, that every even number is the sum of two primes, in a 1742 letter to Euler."},{"ref":"[20]"}]},"unresolved":null},{"absence":null,"basis":"aefbea6c01f15ea5b81403a4f80148a1d61c7c027326b7952ce3d3c9dcc46b7b","coverage":null,"id":"enwiki-23666-1373534600::In-text #c783d187","item":"In-text #c783d187","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MetaMathlibExt.euler_characterization_of_even_perfect_numbers","library":"atlas","line":46,"location_key":"aefbea6c01f15ea5b81403a4f80148a1d61c7c027326b7952ce3d3c9dcc46b7b","module":"MathlibExt.NumberTheory.EvenPerfectNumbers","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.","pair_key":"7d21b4b2a309e04853553963e286f0def9981d658bf2a7e56923030d4a9b3333","path":"MathlibExt/NumberTheory/EvenPerfectNumbers.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"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)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"9df103467886a169820a9c84cbaea9bee75f47add9a62fdf0ac67751a468b334","prominence":"central","quote":{"exact":"Euler proved Alhazen's conjecture (now the Euclid–Euler theorem) that all even perfect"},"quote_capped":true,"section":["History"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Euler proved Alhazen's conjecture (now the Euclid–Euler theorem) that all even perfect numbers can be constructed from Mersenne primes.[13]","segments":[{"text":"Euler proved Alhazen's conjecture (now the Euclid–Euler theorem) that all even perfect numbers can be constructed from Mersenne primes."},{"ref":"[13]"}]},"unresolved":null},{"absence":null,"basis":"232782dc8f0b86c4504e09fc7e3273742eb38e4346a664361d66fc6f76c7eb39","coverage":null,"id":"enwiki-23666-1373534600::In-text #d9f5e6bf","item":"In-text #d9f5e6bf","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.Primes.not_summable_one_div","end_line":125,"library":"mathlib","line":124,"location_key":"232782dc8f0b86c4504e09fc7e3273742eb38e4346a664361d66fc6f76c7eb39","module":"Mathlib.NumberTheory.SumPrimeReciprocals","note":"Divergence is written as the failure of summability of the real-valued family of reciprocals indexed by the primes, and the declaration's own docstring states the sum over reciprocals of primes diverges.","pair_key":"09e6c1de451f62285d05dd865ac34c7a2661be72f577c10e0cfe0dae9f943f0b","path":"Mathlib/NumberTheory/SumPrimeReciprocals.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.Primes.not_summable_one_div : ¬Summable fun p ↦ 1 / ↑↑p"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"not_summable_one_div_on_primes","end_line":120,"library":"mathlib","line":102,"location_key":"b2249617647c6cf21dd0e76447d5eef67cec96222ebb6b3b383df10bb1719845","module":"Mathlib.NumberTheory.SumPrimeReciprocals","note":"The declaration indexes the series by all naturals and multiplies by the indicator of the prime set, so composite positions contribute zero.","pair_key":"0b74bd21c1fef704f2c7362b9964e75e8cb7f48482f4a25914f22f286d832c10","path":"Mathlib/NumberTheory/SumPrimeReciprocals.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem not_summable_one_div_on_primes : ¬Summable ({p | Nat.Prime p}.indicator fun n ↦ 1 / ↑n)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6b5d060a9fdf613079a49e2624f48609a18ddc4a2422c36eaf8563f82aeb59fc","prominence":"supporting","quote":{"exact":"He introduced methods from mathematical analysis to this area in his proofs"},"quote_capped":true,"section":["History"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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 ⁠ 1 2 + 1 3 + 1 5 + 1 7 + 1 11 + ⋯ {\\displaystyle {\\tfrac {1}{2}}+{\\tfrac {1}{3}}+{\\tfrac {1}{5}}+{\\tfrac {1}{7}}+{\\tfrac {1}{11}}+\\cdots } ⁠.[21]","segments":[{"text":"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 ⁠ "},{"tex":"{\\tfrac {1}{2}}+{\\tfrac {1}{3}}+{\\tfrac {1}{5}}+{\\tfrac {1}{7}}+{\\tfrac {1}{11}}+\\cdots"},{"text":" ⁠."},{"ref":"[21]"}]},"unresolved":null},{"absence":null,"basis":"75a855fcc0bf45c8a11f0a7b00c2b129c37a0737628210d8cd99403b74274d8f","coverage":null,"id":"enwiki-23666-1373534600::In-text #a8e5fb0c","item":"In-text #a8e5fb0c","kind":"conjecture","locations":[{"challenge":"downgraded","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.NumberTheory.PrimeNumberTheoremWanted.prime_number_theorem","library":"atlas","line":183,"location_key":"75a855fcc0bf45c8a11f0a7b00c2b129c37a0737628210d8cd99403b74274d8f","module":"MathlibExt.NumberTheory.PrimeNumberTheorem","note":"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.","pair_key":"1062c9f1b1cf3bd3bb410e2a64acc57099870b380a26e6a029977a8b3c80ff4e","path":"MathlibExt/NumberTheory/PrimeNumberTheorem.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.NumberTheory.PrimeNumberTheoremWanted.prime_number_theorem : Asymptotics.IsEquivalent Filter.atTop (fun n ↦ ↑n.primeCounting) fun n ↦ ↑n / Real.log ↑n"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"Chebyshev.primeCounting_isEquivalent_iff_theta_isEquivalent","library":"atlas","line":95,"location_key":"faf63ecee63704813b0f081ef210ca040e5598d55dd896167a8e1f4c1d352854","module":"MathlibExt.NumberTheory.PrimeCounting.Chebyshev","note":"It ties the asymptotic for the counting function to the asymptotic for Chebyshev's theta function instead of asserting either of them.","pair_key":"efd51d129f95eeb5a2e06185ac938e09d6ea7f479338c444f18bd6ad38bd0d64","path":"MathlibExt/NumberTheory/PrimeCounting/Chebyshev.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem Chebyshev.primeCounting_isEquivalent_iff_theta_isEquivalent : (Asymptotics.IsEquivalent Filter.atTop (fun x ↦ ↑⌊x⌋₊.primeCounting) fun x ↦ x / Real.log x) ↔ Asymptotics.IsEquivalent Filter.atTop Chebyshev.theta fun x ↦ x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"baf86a68ca66c2975b37be22e409e0e21ad016713d282b6d9b17f653fbc077af","prominence":"central","quote":{"exact":"At the start of the 19th century, Legendre and Gauss conjectured that"},"quote_capped":true,"section":["History"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"At the start of the 19th century, Legendre and Gauss conjectured that as ⁠ x {\\displaystyle x} ⁠ tends to infinity, the number of primes up to ⁠ x {\\displaystyle x} ⁠ is asymptotic to ⁠ x / log ⁡ x {\\displaystyle x/\\log x} ⁠, where log ⁡ x {\\displaystyle \\log x} is the natural logarithm of ⁠ x {\\displaystyle x} ⁠.","segments":[{"text":"At the start of the 19th century, Legendre and Gauss conjectured that as ⁠ "},{"tex":"x"},{"text":" ⁠ tends to infinity, the number of primes up to ⁠ "},{"tex":"x"},{"text":" ⁠ is asymptotic to ⁠ "},{"tex":"x/\\log x"},{"text":" ⁠, where "},{"tex":"\\log x"},{"text":" is the natural logarithm of ⁠ "},{"tex":"x"},{"text":" ⁠."}]},"unresolved":null},{"absence":null,"basis":"8ca85731925a0fe6117cdbb30c528481a3e016bdad2e1c49483b94123ecb7f25","coverage":null,"id":"enwiki-23666-1373534600::In-text #af4d4c3c","item":"In-text #af4d4c3c","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.bertrand","end_line":243,"library":"mathlib","line":243,"location_key":"8ca85731925a0fe6117cdbb30c528481a3e016bdad2e1c49483b94123ecb7f25","module":"Mathlib.NumberTheory.Bertrand","note":"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.","pair_key":"ef36e506367ad58e0a4059b8316b0ee1a3a9b9b812196bbf1cf17010409d9b49","path":"Mathlib/NumberTheory/Bertrand.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.bertrand (n : ℕ) : n ≠ 0 → ∃ p, Nat.Prime p ∧ n < p ∧ p ≤ 2 * n"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.NumberTheory.BreuschWanted.ramanujan_two_primes_between","library":"atlas","line":29,"location_key":"da80195ede851fd0b34d3ddbadd5bf4487972f2101c8223dfa4f2418e23f0a21","module":"MathlibExt.NumberTheory.PrimeInterval.RamanujanTwoPrimes","note":"It assumes n is at least 6 and produces two primes, so it covers the passage's claim only from that point on.","pair_key":"f0f8fa35a981642eacf02c8ddda27bd20dafdf9893452962fc00ae6d5b2ded79","path":"MathlibExt/NumberTheory/PrimeInterval/RamanujanTwoPrimes.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.exists_prime_lt_and_le_two_mul_eventually","end_line":210,"library":"mathlib","line":199,"location_key":"d91bc297508f64340e08e25c948a99cd42b0565616791ef6536b48d1f695eeff","module":"Mathlib.NumberTheory.Bertrand","note":"It assumes n is at least 512, so it settles only the tail of the range of n the passage speaks about.","pair_key":"f106abdc73b6942b7fc80f0fb1519a5501ba8f186ab217e4931246857787cb37","path":"Mathlib/NumberTheory/Bertrand.lean","proof_status":"proved","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.exists_prime_lt_and_le_two_mul_eventually (n : ℕ) : 512 ≤ n → ∃ p, Nat.Prime p ∧ n < p ∧ p ≤ 2 * n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b164a05613203e3336d7caccbf2c3c5793dbd05848e19227a1a16d3f733704b0","prominence":"central","quote":{"exact":"A weaker consequence of this high density of primes was Bertrand's postulate,"},"quote_capped":true,"section":["History"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"A weaker consequence of this high density of primes was Bertrand's postulate, that for every n > 1 {\\displaystyle n>1} there is a prime between ⁠ n {\\displaystyle n} ⁠ and ⁠ 2 n {\\displaystyle 2n} ⁠, proved in 1852 by Pafnuty Chebyshev.[22]","segments":[{"text":"A weaker consequence of this high density of primes was Bertrand's postulate, that for every "},{"tex":"n>1"},{"text":" there is a prime between ⁠ "},{"tex":"n"},{"text":" ⁠ and ⁠ "},{"tex":"2n"},{"text":" ⁠, proved in 1852 by Pafnuty Chebyshev."},{"ref":"[22]"}]},"unresolved":null},{"absence":null,"basis":"30a3cfe5f95397a7f7163d4eb4f491ec252296f60823858563b2cd7e74a08d70","coverage":null,"id":"enwiki-23666-1373534600::In-text #1ac407cf","item":"In-text #1ac407cf","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.forall_exists_prime_gt_and_modEq","end_line":465,"library":"mathlib","line":463,"location_key":"30a3cfe5f95397a7f7163d4eb4f491ec252296f60823858563b2cd7e74a08d70","module":"Mathlib.NumberTheory.LSeries.PrimesInAP","note":"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.","pair_key":"45d235c6b023a2c569bebcf3b1eb5bbc5e1a7aa3f697f4d5b9cb846618da90e4","path":"Mathlib/NumberTheory/LSeries/PrimesInAP.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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]"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.infinite_setOf_prime_and_eq_mod","end_line":438,"library":"mathlib","line":438,"location_key":"4146a3a480d347c8ac82f84117a4d97d077524e3cf12419784faa8bc5568e28a","module":"Mathlib.NumberTheory.LSeries.PrimesInAP","note":"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.","pair_key":"b8836c1e88f396b1cd26370d39dc035b18e6f6a1ccfb1fe15a3a223c2cedd790","path":"Mathlib/NumberTheory/LSeries/PrimesInAP.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"deprecated_to":"Nat.infinite_setOfPred_prime_and_eq_mod","elided":false,"text":"theorem Nat.infinite_setOf_prime_and_eq_mod {q : ℕ} [NeZero q] {a : ZMod q} : IsUnit a → {p | Nat.Prime p ∧ ↑p = a}.Infinite"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7a58c380873bb3c725ac206401540651aba50f711dae6c25ab0d049fbe8f6487","prominence":"central","quote":{"exact":"Another important 19th century result was Dirichlet's theorem on arithmetic progressions, that"},"quote_capped":true,"section":["History"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Another important 19th century result was Dirichlet's theorem on arithmetic progressions, that certain arithmetic progressions contain infinitely many primes.","segments":[{"text":"Another important 19th century result was Dirichlet's theorem on arithmetic progressions, that certain arithmetic progressions contain infinitely many primes."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"fed1e54330277992cab289e08f31c8e90dc2616eb0c51d3805b4e96f21451f91","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"892c6ff3bc6a1ec948593c56700e6b104b0cb65592be9e58a6252f67ce84b2ac","text":"the primes contain arithmetic progressions of every finite length"},{"id":"c2","part":"0238783116ae9653797edc472062fbd1c03c038b698388d5dc4c65f3ae54cd7c","text":"infinitely many consecutive prime pairs have gap below a fixed bound"}],"parts":["892c6ff3bc6a1ec948593c56700e6b104b0cb65592be9e58a6252f67ce84b2ac","0238783116ae9653797edc472062fbd1c03c038b698388d5dc4c65f3ae54cd7c"],"relation":"broadMatch","status":"statement_only"},"id":"enwiki-23666-1373534600::In-text #f05ec467","item":"In-text #f05ec467","kind":"theorem","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"Erdos219.erdos_219","end_line":81,"library":"formal-conjectures","line":80,"location_key":"892c6ff3bc6a1ec948593c56700e6b104b0cb65592be9e58a6252f67ce84b2ac","module":"FormalConjectures.ErdosProblems.«219»","note":"The declaration measures a progression's length as a lower bound on its cardinality and quantifies that over every N.","pair_key":"dc27a0b495b7d9dbe17691a1ccd4524c150df90328f3a6597c23d8eba463327d","path":"FormalConjectures/ErdosProblems/219.lean","proof_status":"statement_only","rank":1,"relation":"hasPart","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem Erdos219.erdos_219 (N : ℕ) : ∃ l ∈ Erdos219.primeArithmeticProgressions, ↑N ≤ ENat.card ↑l"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"WantedExt.NumberTheory.PrimeGapBounds.zhang2014UpperBound","library":"atlas","line":34,"location_key":"0238783116ae9653797edc472062fbd1c03c038b698388d5dc4c65f3ae54cd7c","module":"WantedExt.NumberTheory.PrimeGapBoundsWanted","note":"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.","pair_key":"00050003be7de141fe6b5841241353851a3512f7ae6418bca8fd8ef06880037b","path":"WantedExt/NumberTheory/PrimeGapBoundsWanted.lean","proof_status":"wanted","rank":2,"relation":"hasPart","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem WantedExt.NumberTheory.PrimeGapBounds.zhang2014UpperBound : MathlibExt.NumberTheory.primeGapLiminf ≤ 70000000"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e098fb2ee114a79da5ffd6c2c580b219527f4ff6e8263c16781bb5650154bfd2","prominence":"central","quote":{"exact":"The mathematical theory of prime numbers also moved forward with the Green–Tao"},"quote_capped":true,"section":["History"],"status":"statement_only","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"f444593fec7bdcce8df3e87a4d7a125a3f9f5242308e196e202b8184b1857c9f","coverage":null,"id":"enwiki-23666-1373534600::In-text #9a4b307c","item":"In-text #9a4b307c","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.primeFactorsList","end_line":44,"library":"mathlib","line":38,"location_key":"f444593fec7bdcce8df3e87a4d7a125a3f9f5242308e196e202b8184b1857c9f","module":"Mathlib.Data.Nat.Factors","note":"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.","pair_key":"306b19679102a12c738360898dd6b57fef5ceab25a6da9f5fe0a1cf2a3338ae0","path":"Mathlib/Data/Nat/Factors.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.primeFactorsList : ℕ → List ℕ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.prod_primeFactorsList","end_line":81,"library":"mathlib","line":70,"location_key":"841e7b7ca3e24de1b5196c0e75ffeea09d3a27cacbe8be54226cf60181b8abb4","module":"Mathlib.Data.Nat.Factors","note":"The declaration spells out the defining property of the library's object: multiplying its primes together returns the number.","pair_key":"0d7724920d1c815d5aa57a794691bea1f49d08e4cf76dd71ca6d63416683df3d","path":"Mathlib/Data/Nat/Factors.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prod_primeFactorsList {n : ℕ} : n ≠ 0 → n.primeFactorsList.prod = n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7453e59ae757dade00c3ccaf391555759bdaf91d01521e004fbd35e8654d37ea","prominence":"central","quote":{"exact":"Writing a number as a product of prime numbers is called a"},"quote_capped":true,"section":["Elementary properties","Unique factorization"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Writing a number as a product of prime numbers is called a prime factorization of the number.","segments":[{"text":"Writing a number as a product of prime numbers is called a prime factorization of the number."}]},"unresolved":null},{"absence":null,"basis":"c8c70671a3f398a4808888ffe7b147789acbf65f2b2227e6b2b654216588b1dd","coverage":null,"id":"enwiki-23666-1373534600::In-text #06bfdf4e","item":"In-text #06bfdf4e","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.prod_primeFactorsList","end_line":81,"library":"mathlib","line":70,"location_key":"c8c70671a3f398a4808888ffe7b147789acbf65f2b2227e6b2b654216588b1dd","module":"Mathlib.Data.Nat.Factors","note":"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.","pair_key":"8b492f93ee56386b0ef62f25511ad80f2dae13ed8434747519417e71ce361b20","path":"Mathlib/Data/Nat/Factors.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prod_primeFactorsList {n : ℕ} : n ≠ 0 → n.primeFactorsList.prod = n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"dd702cdb40a5287f0683d17cd01b6a82d1d1dde58b35224137a8e2e8525a935c","prominence":"supporting","quote":{"exact":"For example: 50 = 2 × 5 × 5 = 2 ×"},"quote_capped":true,"section":["Elementary properties","Unique factorization"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"For example: 50 = 2 × 5 × 5 = 2 × 5 2 . {\\displaystyle {\\begin{aligned}50&=2\\times 5\\times 5\\\\&=2\\times 5^{2}.\\end{aligned}}}","segments":[{"text":"For example: "},{"tex":"\\begin{aligned}50&=2\\times 5\\times 5\\\\&=2\\times 5^{2}.\\end{aligned}"}]},"unresolved":null},{"absence":null,"basis":"450f8002e258eed8353e1d918a87e44246bfe8dfc9daa6c81609028bfce53fd5","coverage":null,"id":"enwiki-23666-1373534600::In-text #c7782e00","item":"In-text #c7782e00","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.primeFactors","end_line":37,"library":"mathlib","line":37,"location_key":"450f8002e258eed8353e1d918a87e44246bfe8dfc9daa6c81609028bfce53fd5","module":"Mathlib.Data.Nat.PrimeFin","note":"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.","pair_key":"be84cbaa7a4e5f04bc6c18403ab12310cc42b64941ea293049d30359d64ebc38","path":"Mathlib/Data/Nat/PrimeFin.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.primeFactors : ℕ → Finset ℕ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.primeFactorsList","end_line":44,"library":"mathlib","line":38,"location_key":"60707aca3611e764dc035d3fa37b04db1b56026acee645a2a532916c0c7b7a8e","module":"Mathlib.Data.Nat.Factors","note":"The declaration lists the primes of the factorization in increasing order, repeating one as often as it occurs in the product.","pair_key":"0a76efff85a9abc100bbc8487f733b45a4a2812e75c472dfdb90818ffa7f84df","path":"Mathlib/Data/Nat/Factors.lean","proof_status":"definition","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.primeFactorsList : ℕ → List ℕ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a27e31a931dfe018d4104ec2bcd0526581efc78bfc8077ef635fb9f3f81038f4","prominence":"supporting","quote":{"exact":"The terms in the product are called prime factors."},"quote_capped":false,"section":["Elementary properties","Unique factorization"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"The terms in the product are called prime factors.","segments":[{"text":"The terms in the product are called prime factors."}]},"unresolved":null},{"absence":null,"basis":"d0afd51e3e14d63ef534e444499570f23f5b1a20bb43ee3b2fbff924bd7d0dfa","coverage":null,"id":"enwiki-23666-1373534600::In-text #4ee22b5f","item":"In-text #4ee22b5f","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.Prime.factorization_pow","end_line":239,"library":"mathlib","line":238,"location_key":"d0afd51e3e14d63ef534e444499570f23f5b1a20bb43ee3b2fbff924bd7d0dfa","module":"Mathlib.Data.Nat.Factorization.Defs","note":"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.","pair_key":"9618a59734192ebd79ca558a625825a1859e932334910f8331be5513beebed26","path":"Mathlib/Data/Nat/Factorization/Defs.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.Prime.factorization_pow {p k : ℕ} : Nat.Prime p → (p ^ k).factorization = fun₀ | p => k"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"683fbeddc768d9b451061db3ddd2472b59571e9d0ee5c95b6495c3ee7c4675a0","prominence":"supporting","quote":{"exact":"The same prime factor may occur more than once"},"quote_capped":false,"section":["Elementary properties","Unique factorization"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":"; this example has two copies of the prime factor 5. {\\displaystyle 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, 5 2 {\\displaystyle 5^{2}} denotes the square or second power of","segments":[{"text":"; this example has two copies of the prime factor "},{"tex":"5."},{"text":" 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, "},{"tex":"5^{2}"},{"text":" denotes the square or second power of"}],"trimmed":true},"layer":"The same prime factor may occur more than once","segments":[{"text":"The same prime factor may occur more than once"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"b0f809ee18798d1ffc32ac6b09e7e4acd067632661835b3c8c5cf5d01c39ebd7"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #4ee3e647","item":"In-text #4ee3e647","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"04c565fc9ef6a8833936fe658bf032255ff0830faf344f0bf7f0ccab51840490","prominence":"supporting","quote":{"exact":"this example has two copies of the prime factor 5. {\\displaystyle 5.}"},"quote_capped":false,"section":["Elementary properties","Unique factorization"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":" 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, 5 2 {\\displaystyle 5^{2}} denotes the square or second power of ⁠ 5 {\\displaystyle 5} ⁠.","segments":[{"text":" 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, "},{"tex":"5^{2}"},{"text":" denotes the square or second power of ⁠ "},{"tex":"5"},{"text":" ⁠."}]},"before":{"layer":"The same prime factor may occur more than once; ","segments":[{"text":"The same prime factor may occur more than once; "}]},"layer":"this example has two copies of the prime factor 5. {\\displaystyle 5.}","segments":[{"text":"this example has two copies of the prime factor "},{"tex":"5."}]},"unresolved":null},{"absence":null,"basis":"a450ae14059c49f3adcfce2b3c0acc7e6f187578153ffbe55b0393b8a877e985","coverage":null,"id":"enwiki-23666-1373534600::In-text #3377b123","item":"In-text #3377b123","kind":"notation","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.prod_primeFactors_pow_factorization","end_line":484,"library":"mathlib","line":482,"location_key":"783b8d20f4a080f0aab051d6251b29a895b378ebe97e814d736413ed90ee6df8","module":"Mathlib.Data.Nat.Factorization.Basic","note":"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.","pair_key":"98cf50180d41fc4839f76288828e98ea807f1f1d3890067b91fa23f45cce1865","path":"Mathlib/Data/Nat/Factorization/Basic.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prod_primeFactors_pow_factorization {n : ℕ} : n ≠ 0 → n = ∏ p ∈ n.primeFactors, p ^ n.factorization p"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.factorization","end_line":52,"library":"mathlib","line":51,"location_key":"a450ae14059c49f3adcfce2b3c0acc7e6f187578153ffbe55b0393b8a877e985","module":"Mathlib.Data.Nat.Factorization.Defs","note":"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.","pair_key":"859ed703c520ec20f6421fb0815b05a061f8cb3207a71f595f5394feca9f59f2","path":"Mathlib/Data/Nat/Factorization/Defs.lean","proof_status":"definition","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.factorization : ℕ → ℕ →₀ ℕ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"3b090348f1ced875e0dee31b4ad530f04ea840b11972b75d71ebc6499134ae35","prominence":"supporting","quote":{"exact":"When a prime occurs multiple times, exponentiation can be used to group"},"quote_capped":true,"section":["Elementary properties","Unique factorization"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"The same prime factor may occur more than once; this example has two copies of the prime factor 5. {\\displaystyle 5.} ","segments":[{"text":"The same prime factor may occur more than once; this example has two copies of the prime factor "},{"tex":"5."},{"text":" "}]},"layer":"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, 5 2 {\\displaystyle 5^{2}} denotes the square or second power of ⁠ 5 {\\displaystyle 5} ⁠.","segments":[{"text":"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, "},{"tex":"5^{2}"},{"text":" denotes the square or second power of ⁠ "},{"tex":"5"},{"text":" ⁠."}]},"unresolved":null},{"absence":null,"basis":"f885847d94993a17c90e6cb701bcb416df8fea98242a75a4f2761c8f6620d6fb","coverage":{"basis":false,"bundle_key":"a004712276d0265a2bad5fd0007759bcd6bb868076c595cce0465de06f0f42f5","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"0aeb60eb2617f4947125a080dd80bd71326557701cd5e0e0a692ba85c5b0041a","text":"every integer above 1 is a product of one or more primes"},{"id":"c2","part":"27ec08257e02d5b4e93e23efdde9776c3b8327d65591f5d223ffebe838005fd8","text":"two prime factorizations of one number agree in the multiplicity of each prime"}],"parts":["0aeb60eb2617f4947125a080dd80bd71326557701cd5e0e0a692ba85c5b0041a","27ec08257e02d5b4e93e23efdde9776c3b8327d65591f5d223ffebe838005fd8"],"relation":"broadMatch","status":"formalized"},"id":"enwiki-23666-1373534600::In-text #5caf3a51","item":"In-text #5caf3a51","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.instUniqueFactorizationMonoid","end_line":44,"library":"mathlib","line":43,"location_key":"f885847d94993a17c90e6cb701bcb416df8fea98242a75a4f2761c8f6620d6fb","module":"Mathlib.RingTheory.UniqueFactorizationDomain.Nat","note":"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.","pair_key":"48033a480181fecd433b9a97903350f3ef2646c4771073483a685e3398c97127","path":"Mathlib/RingTheory/UniqueFactorizationDomain/Nat.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Nat.instUniqueFactorizationMonoid : UniqueFactorizationMonoid ℕ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"UniqueFactorizationMonoid.exists_prime_factors","end_line":153,"library":"mathlib","line":150,"location_key":"0aeb60eb2617f4947125a080dd80bd71326557701cd5e0e0a692ba85c5b0041a","module":"Mathlib.RingTheory.UniqueFactorizationDomain.Defs","note":"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.","pair_key":"ce8615d44d3290ae4f0e92bc266f763c8285390fdccc5789cb7ab61df9f2bfdb","path":"Mathlib/RingTheory/UniqueFactorizationDomain/Defs.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem UniqueFactorizationMonoid.exists_prime_factors {α : Type*} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] (a : α) : a ≠ 0 → ∃ f, (∀ b ∈ f, Prime b) ∧ Associated f.prod a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.primeFactorsList_unique","end_line":179,"library":"mathlib","line":168,"location_key":"27ec08257e02d5b4e93e23efdde9776c3b8327d65591f5d223ffebe838005fd8","module":"Mathlib.Data.Nat.Factors","note":"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.","pair_key":"b8e550640e12e27c750ff9c25a80d7d4c45f813b39d2266628eedb6a94025f3e","path":"Mathlib/Data/Nat/Factors.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.primeFactorsList_unique {n : ℕ} {l : List ℕ} : l.prod = n → (∀ p ∈ l, Nat.Prime p) → l.Perm n.primeFactorsList"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f45401f0d2bbff2ca31207121bcd10daaf942b1cc2dff49694f9415dc93fb682","prominence":"central","quote":{"exact":"This theorem states that every integer larger than 1 can be written"},"quote_capped":true,"section":["Elementary properties","Unique factorization"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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]","segments":[{"text":"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."},{"ref":"[48]"}]},"unresolved":null},{"absence":null,"basis":"ca9feffe94fa3c1c62018ba3a2d35ae09d4cdd2826e2948e88286241f2799dc5","coverage":null,"id":"enwiki-23666-1373534600::In-text #53f5a282","item":"In-text #53f5a282","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Int.Prime.dvd_mul'","end_line":76,"library":"mathlib","line":73,"location_key":"ca9feffe94fa3c1c62018ba3a2d35ae09d4cdd2826e2948e88286241f2799dc5","module":"Mathlib.RingTheory.Int.Basic","note":"Lean takes the prime as a natural number cast into ℤ and the two factors as arbitrary integers, exactly as the passage does.","pair_key":"ef65b84cdf0df5730ee8e062d4252e70dc7b6d4f54151c8936e3308b9fcb8e05","path":"Mathlib/RingTheory/Int/Basic.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Int.Prime.dvd_mul' {m n : ℤ} {p : ℕ} : Nat.Prime p → ↑p ∣ m * n → ↑p ∣ m ∨ ↑p ∣ n"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.Prime.dvd_mul","end_line":419,"library":"mathlib","line":417,"location_key":"9ad6d715f1848cce993fac2c847ba4d6f6f784dcd5d703ed8449f960be5a590a","module":"Mathlib.Data.Nat.Prime.Defs","note":"Stated over ℕ, where the passage allows the two factors to be any integers.","pair_key":"cfd793e775878fba9ac9d5829f8a1b659dfa612c84e9a17c47a987891792be5f","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.Prime.dvd_mul {p m n : ℕ} : Nat.Prime p → (p ∣ m * n ↔ p ∣ m ∨ p ∣ n)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Prime.dvd_or_dvd","end_line":66,"library":"mathlib","line":65,"location_key":"cc41df644c728b8f5dedfc098f7dbf94d8ecab820f9e6d1b3ec7aef1f9f5ba6a","module":"Mathlib.Algebra.Prime.Defs","note":"Mathlib's Prime is defined by this very dividing-a-factor property, so a declaration stated with it presupposes what the passage asserts of a prime number rather than proving it.","pair_key":"487682a61a3e4b60ebdb64867cedece4b18a8c2db6dafe7b76fa1393e5ce1d1b","path":"Mathlib/Algebra/Prime/Defs.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Prime.dvd_or_dvd {M : Type*} [CommMonoidWithZero M] {p : M} : Prime p → ∀ {a b : M}, p ∣ a * b → p ∣ a ∨ p ∣ b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"219039fd314d6bcdb01328389a312862a79ffe5f53537dedf903a1954219a327","prominence":"central","quote":{"exact":"Some proofs of the uniqueness of prime factorizations are based on Euclid's"},"quote_capped":true,"section":["Elementary properties","Unique factorization"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Some proofs of the uniqueness of prime factorizations are based on Euclid's lemma: If ⁠ p {\\displaystyle p} ⁠ is a prime number and ⁠ p {\\displaystyle p} ⁠ divides a product a b {\\displaystyle ab} of integers ⁠ a {\\displaystyle a} ⁠ and b , {\\displaystyle b,} then ⁠ p {\\displaystyle p} ⁠ divides ⁠ a {\\displaystyle a} ⁠ or ⁠ p {\\displaystyle p} ⁠ divides ⁠ b {\\displaystyle b} ⁠ (or both).[50]","segments":[{"text":"Some proofs of the uniqueness of prime factorizations are based on Euclid's lemma: If ⁠ "},{"tex":"p"},{"text":" ⁠ is a prime number and ⁠ "},{"tex":"p"},{"text":" ⁠ divides a product "},{"tex":"ab"},{"text":" of integers ⁠ "},{"tex":"a"},{"text":" ⁠ and "},{"tex":"b,"},{"text":" then ⁠ "},{"tex":"p"},{"text":" ⁠ divides ⁠ "},{"tex":"a"},{"text":" ⁠ or ⁠ "},{"tex":"p"},{"text":" ⁠ divides ⁠ "},{"tex":"b"},{"text":" ⁠ (or both)."},{"ref":"[50]"}]},"unresolved":null},{"absence":null,"basis":"5a3f1564e1a849311024e309e484043eb4d7ed17477ef1b9037c20f77de8719f","coverage":null,"id":"enwiki-23666-1373534600::In-text #345afc52","item":"In-text #345afc52","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.prime_iff","end_line":424,"library":"mathlib","line":423,"location_key":"5a3f1564e1a849311024e309e484043eb4d7ed17477ef1b9037c20f77de8719f","module":"Mathlib.Data.Nat.Prime.Defs","note":"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.","pair_key":"8614da218e3fff3feaa4f1052d048602583135a1e4b78b2625aec3cde0f790b1","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prime_iff {p : ℕ} : Nat.Prime p ↔ Prime p"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"880aa932abb03a65ef962465ac591105881774ea2a04ad0d10065ba385d5e69d","prominence":"central","quote":{"exact":"Conversely, if a number ⁠ p {\\displaystyle p} ⁠ has the property"},"quote_capped":true,"section":["Elementary properties","Unique factorization"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Conversely, if a number ⁠ p {\\displaystyle p} ⁠ has the property that when it divides a product it always divides at least one factor of the product, then ⁠ p {\\displaystyle p} ⁠ must be prime.","segments":[{"text":"Conversely, if a number ⁠ "},{"tex":"p"},{"text":" ⁠ has the property that when it divides a product it always divides at least one factor of the product, then ⁠ "},{"tex":"p"},{"text":" ⁠ must be prime."}]},"unresolved":null},{"absence":null,"basis":"a9b1bbfca9959672a8743810feda782a623132565c4579b3ccd5497108f55991","coverage":null,"id":"enwiki-23666-1373534600::In-text #7b94d296","item":"In-text #7b94d296","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.infinite_setOf_prime","end_line":30,"library":"mathlib","line":30,"location_key":"a9b1bbfca9959672a8743810feda782a623132565c4579b3ccd5497108f55991","module":"Mathlib.Data.Nat.PrimeFin","note":"Lean names the primes as the natural numbers satisfying Nat.Prime and asserts that this collection is infinite.","pair_key":"13754c5df9c728cf76e29dc2d66750ccab6a9e01da5cc5d16a05107cb0be0874","path":"Mathlib/Data/Nat/PrimeFin.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"deprecated_to":"Nat.infinite_setOfPred_prime","elided":false,"text":"theorem Nat.infinite_setOf_prime : {p | Nat.Prime p}.Infinite"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.exists_infinite_primes","end_line":45,"library":"mathlib","line":36,"location_key":"4a57d25e94f10b0f8ac5dd7cabd7112b0b4c0e9dff6e50af8f4efd6d22cd2c2a","module":"Mathlib.Data.Nat.Prime.Infinite","note":"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.","pair_key":"f4bf15722636a00b3518d4b75667df35718f1968a2c1ec2a8a7744ac2ff432db","path":"Mathlib/Data/Nat/Prime/Infinite.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.exists_infinite_primes (n : ℕ) : ∃ p, n ≤ p ∧ Nat.Prime p"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"1dbf1e3bbc5cabc53d37daa7ca4a94e1c7f0a10ccc126a022c95485544570946","prominence":"central","quote":{"exact":"There are infinitely many prime numbers."},"quote_capped":false,"section":["Elementary properties","Infinitude"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"There are infinitely many prime numbers.","segments":[{"text":"There are infinitely many prime numbers."}]},"unresolved":null},{"absence":null,"basis":"f080374a4d02d7c5e4a27ff6107092545275d7a5307ee5925885ac2e7ce27936","coverage":null,"id":"enwiki-23666-1373534600::In-text #8a23d1a1","item":"In-text #8a23d1a1","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MetaMathlibExt.bonse_nth_strictMono","library":"atlas","line":34,"location_key":"f080374a4d02d7c5e4a27ff6107092545275d7a5307ee5925885ac2e7ce27936","module":"MathlibExt.NumberTheory.BonseInequality","note":"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.","pair_key":"eb7808af396f2a5233bd722fe48d977309fc62ef7f4cb75372bab3c8c9b4a5dc","path":"MathlibExt/NumberTheory/BonseInequality.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MetaMathlibExt.bonse_nth_strictMono : StrictMono (Nat.nth Prime)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.infinite_setOf_prime","end_line":30,"library":"mathlib","line":30,"location_key":"1015392f5d4baff034e99fbbf4bfb641fe6dd60da47392e4487921a78031c484","module":"Mathlib.Data.Nat.PrimeFin","note":"Lean states the size of the collection of primes rather than the behaviour of the increasing listing that the passage writes out.","pair_key":"0a70653476cd11d81ea50914e9fecb191cbf5f8299e9cc1cbf601c0e9f85b8a0","path":"Mathlib/Data/Nat/PrimeFin.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"deprecated_to":"Nat.infinite_setOfPred_prime","elided":false,"text":"theorem Nat.infinite_setOf_prime : {p | Nat.Prime p}.Infinite"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"196bfd4aa01a39ebaf56fa10fbe9ec5963be7eadf708c8d932e73346fa472b55","prominence":"central","quote":{"exact":"Another way of saying this is that the sequence 2 , 3"},"quote_capped":true,"section":["Elementary properties","Infinitude"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Another way of saying this is that the sequence 2 , 3 , 5 , 7 , 11 , 13 , . . . {\\displaystyle 2,3,5,7,11,13,...}","segments":[{"text":"Another way of saying this is that the sequence "},{"tex":"2,3,5,7,11,13,..."}]},"unresolved":null},{"absence":null,"basis":"bd1cddb9189a2a35f66aaea876819416f8a046775b11c045727b8489a54d567e","coverage":null,"id":"enwiki-23666-1373534600::In-text #351b4d5a","item":"In-text #351b4d5a","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.infinite_setOf_prime","end_line":30,"library":"mathlib","line":30,"location_key":"bd1cddb9189a2a35f66aaea876819416f8a046775b11c045727b8489a54d567e","module":"Mathlib.Data.Nat.PrimeFin","note":"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.","pair_key":"fa7a9c389fa0c9b393dfd208d41ca3b4e3d7b7c13f08660c02f9f3130ff0ac5b","path":"Mathlib/Data/Nat/PrimeFin.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"deprecated_to":"Nat.infinite_setOfPred_prime","elided":false,"text":"theorem Nat.infinite_setOf_prime : {p | Nat.Prime p}.Infinite"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.exists_infinite_primes","end_line":45,"library":"mathlib","line":36,"location_key":"4c3f53ab1c4a22daef69cd45a3cb50e9a2ccd27bcc2fd7122abe9fdeb7b6a7dc","module":"Mathlib.Data.Nat.Prime.Infinite","note":"It hands back a prime above any chosen bound; getting the list form out of it still needs a bound built from the list, which it does not supply.","pair_key":"854a48033e6d7457bbf858e89c24f062f13647b595c29d9803d39637026bcd2a","path":"Mathlib/Data/Nat/Prime/Infinite.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.exists_infinite_primes (n : ℕ) : ∃ p, n ≤ p ∧ Nat.Prime p"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a6ee250a4dcbbe3d58e137bed5fbe486ea99ec01dd63417b4a9768556c0d90e6","prominence":"supporting","quote":{"exact":"Euclid's proof shows that every finite list of primes is incomplete.[56]"},"quote_capped":false,"section":["Elementary properties","Infinitude"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Euclid's proof shows that every finite list of primes is incomplete.[56]","segments":[{"text":"Euclid's proof shows that every finite list of primes is incomplete."},{"ref":"[56]"}]},"unresolved":null},{"absence":null,"basis":"3cfa1c5f08f0d2cd92f7b0bc3af621cbe04bc351e7be0dd6b5b62b70f930431d","coverage":null,"id":"enwiki-23666-1373534600::In-text #1f9a192d","item":"In-text #1f9a192d","kind":"construction","locations":[{"challenge":"sampled_out","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"EuclidNumbers.Euclid","end_line":33,"library":"formal-conjectures","line":33,"location_key":"3cfa1c5f08f0d2cd92f7b0bc3af621cbe04bc351e7be0dd6b5b62b70f930431d","module":"FormalConjectures.Wikipedia.Euclid","note":"The library fixes the list to the first n primes rather than letting an arbitrary finite list of primes be given.","pair_key":"e3fec5e15c9ed47b74d64d11f7eb75d9b2cf1859e99262b4d9077082bda795b8","path":"FormalConjectures/Wikipedia/Euclid.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def EuclidNumbers.Euclid : ℕ → ℕ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"primorial","end_line":36,"library":"mathlib","line":36,"location_key":"4ad0befaa648fd04edaf2881d651701437f102befa066954311c73fec2f10143","module":"Mathlib.NumberTheory.Primorial","note":"It names the product of the primes up to a bound, the quantity the passage adds one to, and stops there.","pair_key":"a962ca2e2a2edcf2d57a4209b99f58381081d51fc847dc41f31f3c1ce7804140","path":"Mathlib/NumberTheory/Primorial.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def primorial : ℕ → ℕ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"cb56c5744efde7258df4a4fa239c15c3c5da626730be9f72f7f87a13378208f7","prominence":"supporting","quote":{"exact":"If the list consists of the primes p 1 , p 2"},"quote_capped":true,"section":["Elementary properties","Infinitude"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"The key idea is to multiply together the primes in any given list and add 1. {\\displaystyle 1.} ","segments":[{"text":"The key idea is to multiply together the primes in any given list and add "},{"tex":"1."},{"text":" "}]},"layer":"If the list consists of the primes p 1 , p 2 , … , p n , {\\displaystyle p_{1},p_{2},\\ldots ,p_{n},} this gives the number N = 1 + p 1 ⋅ p 2 ⋯ p n . {\\displaystyle N=1+p_{1}\\cdot p_{2}\\cdots p_{n}.}","segments":[{"text":"If the list consists of the primes "},{"tex":"p_{1},p_{2},\\ldots ,p_{n},"},{"text":" this gives the number "},{"tex":"N=1+p_{1}\\cdot p_{2}\\cdots p_{n}."}]},"unresolved":null},{"absence":null,"basis":"9a84bb79d8215ebdb8d4525fde70c62f18b11e5e0b7a3b1f88c91a0f0fe577ab","coverage":null,"id":"enwiki-23666-1373534600::In-text #30cf2dce","item":"In-text #30cf2dce","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.prod_primeFactorsList","end_line":81,"library":"mathlib","line":70,"location_key":"9a84bb79d8215ebdb8d4525fde70c62f18b11e5e0b7a3b1f88c91a0f0fe577ab","module":"Mathlib.Data.Nat.Factors","note":"It states the product equation and leaves the primality of the entries and their number to separate declarations.","pair_key":"a3b551baa713e664df3f90f894ed4e835073c1aaf232a2f81965421dbaccebe7","path":"Mathlib/Data/Nat/Factors.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prod_primeFactorsList {n : ℕ} : n ≠ 0 → n.primeFactorsList.prod = n"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.prime_of_mem_primeFactorsList","end_line":65,"library":"mathlib","line":55,"location_key":"f194635cf19eedf2e637def2aaf5a752fafd7e61b1613de7226e3757637508ec","module":"Mathlib.Data.Nat.Factors","note":"It supplies the primality of the factors and says nothing about their product or their number.","pair_key":"40f6ee35f69be341730712ed2505b3bac895b5ebaefb382b1c1b935e64b071c9","path":"Mathlib/Data/Nat/Factors.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prime_of_mem_primeFactorsList {n p : ℕ} : p ∈ n.primeFactorsList → Nat.Prime p"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.primeFactorsList_ne_nil","end_line":132,"library":"mathlib","line":131,"location_key":"1f83d09890f1d2d973ce4c017747abda4cbbd18cf29c6d214a4ce8b3e02515d6","module":"Mathlib.Data.Nat.Factors","note":"It settles how many factors there are and says nothing about what they multiply to.","pair_key":"a78bdc52eb303ee5bd9c780e411cdf19d57e4db91bb1b0b69ba4b6185e166d57","path":"Mathlib/Data/Nat/Factors.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.primeFactorsList_ne_nil (n : ℕ) : n.primeFactorsList ≠ [] ↔ 1 < n"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"UniqueFactorizationMonoid.exists_prime_factors","end_line":153,"library":"mathlib","line":150,"location_key":"2ee623dd2333dea51f146bb68f1fee72f44b4638f00e1d5dd50525a912500317","module":"Mathlib.RingTheory.UniqueFactorizationDomain.Defs","note":"It yields the existence of a prime collection with the right product and does not say that the collection is non-empty.","pair_key":"e4463a66a026eab7a77805a27a65d9b62af9a3653be4e29ebecb198c7dd69fa9","path":"Mathlib/RingTheory/UniqueFactorizationDomain/Defs.lean","proof_status":"proved","rank":4,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem UniqueFactorizationMonoid.exists_prime_factors {α : Type*} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] (a : α) : a ≠ 0 → ∃ f, (∀ b ∈ f, Prime b) ∧ Associated f.prod a"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"85a23560ed43a643c4222a5c6f8459c744f0d6b987c1aaddc6908f9a608ad6d9","prominence":"supporting","quote":{"exact":"By the fundamental theorem of arithmetic, ⁠ N {\\displaystyle N} ⁠ has"},"quote_capped":true,"section":["Elementary properties","Infinitude"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":" N {\\displaystyle N} ⁠ is evenly divisible by each of these factors, but ⁠ N {\\displaystyle 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 {\\displaystyle N} ⁠ can be in the given list.","segments":[{"text":" "},{"tex":"N"},{"text":" ⁠ is evenly divisible by each of these factors, but ⁠ "},{"tex":"N"},{"text":" ⁠ has a remainder of one when divided by any of the prime numbers in the given list, so none of the prime factors of ⁠ "},{"tex":"N"},{"text":" ⁠ can be in the given list."}]},"layer":"By the fundamental theorem of arithmetic, ⁠ N {\\displaystyle N} ⁠ has a prime factorization N = p 1 ′ ⋅ p 2 ′ ⋯ p m ′ {\\displaystyle N=p'_{1}\\cdot p'_{2}\\cdots p'_{m}} with one or more prime factors. ⁠","segments":[{"text":"By the fundamental theorem of arithmetic, ⁠ "},{"tex":"N"},{"text":" ⁠ has a prime factorization "},{"tex":"N=p'_{1}\\cdot p'_{2}\\cdots p'_{m}"},{"text":" with one or more prime factors. ⁠"}]},"unresolved":null},{"absence":null,"basis":"30b83f5155651ff77f08457411c94d485eb5454b5ecff19739884d0396d025be","coverage":null,"id":"enwiki-23666-1373534600::In-text #7c71c28f","item":"In-text #7c71c28f","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.dvd_of_mem_primeFactorsList","end_line":152,"library":"mathlib","line":149,"location_key":"30b83f5155651ff77f08457411c94d485eb5454b5ecff19739884d0396d025be","module":"Mathlib.Data.Nat.Factors","note":"Lean proves it for an arbitrary number and its factorization list, and at N it is the conjunct.","pair_key":"805d15078c2790204cec7597653d18f8728fdd24ce0814367df8ffd6539914d3","path":"Mathlib/Data/Nat/Factors.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.dvd_of_mem_primeFactorsList {n p : ℕ} : p ∈ n.primeFactorsList → p ∣ n"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"List.dvd_prod","end_line":155,"library":"mathlib","line":152,"location_key":"49c615d4d73271e3c1edb14b5aca96bc7e2b6e1915d14d5d340aba55cf23eba1","module":"Mathlib.Algebra.BigOperators.Group.List.Lemmas","note":"Lean states it of any commutative monoid and any list, and over the naturals it is the conjunct.","pair_key":"19329fa580b847b0c191e7d05a9a7a5207a35085ab3d8267b66cf9761681595a","path":"Mathlib/Algebra/BigOperators/Group/List/Lemmas.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem List.dvd_prod {M : Type*} [CommMonoid M] {a : M} {l : List M} : a ∈ l → a ∣ l.prod"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Nat.add_mul_mod_self_left","end_line":348,"library":"lean-core","line":345,"location_key":"befadedf54d34f21f171dec1af95c42682a358bee7c4086a4d92d0d202d43b09","module":"Init.Data.Nat.Div.Basic","note":"It computes a remainder when a multiple of the divisor is added; reading the second conjunct off it still needs the listed prime split out of the product and the remainder of one by that prime.","pair_key":"12e181d4752632f6b679d3490db0f77d5491c83faff730be63c4137eda566e1d","path":"src/Init/Data/Nat/Div/Basic.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.add_mul_mod_self_left (x y z : Nat) : (x + y * z) % y = x % y"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"fda9aad5a11a3dc0fab62752f994907c1e82ff02d4521e65d0fc473bb908f8a5","prominence":"supporting","quote":{"exact":"N {\\displaystyle N} ⁠ is evenly divisible by each of these factors,"},"quote_capped":true,"section":["Elementary properties","Infinitude"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":" so none of the prime factors of ⁠ N {\\displaystyle N} ⁠ can be in the given list.","segments":[{"text":" so none of the prime factors of ⁠ "},{"tex":"N"},{"text":" ⁠ can be in the given list."}]},"before":{"layer":"with one or more prime factors. ⁠ ","segments":[{"text":"with one or more prime factors. ⁠ "}]},"layer":"N {\\displaystyle N} ⁠ is evenly divisible by each of these factors, but ⁠ N {\\displaystyle N} ⁠ has a remainder of one when divided by any of the prime numbers in the given list,","segments":[{"tex":"N"},{"text":" ⁠ is evenly divisible by each of these factors, but ⁠ "},{"tex":"N"},{"text":" ⁠ has a remainder of one when divided by any of the prime numbers in the given list,"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":3,"sha256":"664e629ffb06c3d15b2060a0ecb7419a0a36b6a7076365abd2bb4283272b6272"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #c5c65bbf","item":"In-text #c5c65bbf","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.coprime_add_self_left","end_line":123,"library":"mathlib","line":122,"location_key":"62203dea78cfbe9accde77fd9572d39a14e851fc58628686d2735dcb85e94b1e","module":"Mathlib.Data.Nat.GCD.Basic","note":"At the passage's number it yields coprimality with the product of the list; ruling the listed primes out of the factors of that number needs a further named step.","pair_key":"fa42444b089d52aeeccd9a5582a4f38fce1253b4baa1d0849be9a0ce07b001ec","path":"Mathlib/Data/Nat/GCD/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.coprime_add_self_left {m n : ℕ} : (m + n).Coprime n ↔ m.Coprime n"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"IsCoprime.add_one_left_of_dvd","end_line":419,"library":"mathlib","line":416,"location_key":"6cd7ae025de2815aad843728c436125295e832424104f5b2e9f8a6133fe0b66f","module":"Mathlib.RingTheory.Coprime.Basic","note":"In a commutative ring it makes one more than a multiple of an element coprime to that element, which is not the statement that the factors of the passage's number avoid the given list.","pair_key":"88f392084db08604c33128925eb5474aff13a0247285a962eb0f1f1b11dd1480","path":"Mathlib/RingTheory/Coprime/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem IsCoprime.add_one_left_of_dvd {R : Type u} [CommRing R] {x y : R} : y ∣ x → IsCoprime (x + 1) y"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"30259dd354bf79f333babff4a9f3c9486cba65a9f852aeb6bcfd4507c0d9be36","prominence":"supporting","quote":{"exact":"none of the prime factors of ⁠ N {\\displaystyle N} ⁠ can"},"quote_capped":true,"section":["Elementary properties","Infinitude"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"with one or more prime factors. ⁠ N {\\displaystyle N} ⁠ is evenly divisible by each of these factors, but ⁠ N {\\displaystyle N} ⁠ has a remainder of one when divided by any of the prime numbers in the given list, so ","segments":[{"text":"with one or more prime factors. ⁠ "},{"tex":"N"},{"text":" ⁠ is evenly divisible by each of these factors, but ⁠ "},{"tex":"N"},{"text":" ⁠ has a remainder of one when divided by any of the prime numbers in the given list, so "}]},"layer":"none of the prime factors of ⁠ N {\\displaystyle N} ⁠ can be in the given list.","segments":[{"text":"none of the prime factors of ⁠ "},{"tex":"N"},{"text":" ⁠ can be in the given list."}]},"unresolved":null},{"absence":null,"basis":"045bbbda0fe80a7a17edf0eddf782aba015dbe526ac4cf82635514ba8b5bef34","coverage":null,"id":"enwiki-23666-1373534600::In-text #21c8c21e","item":"In-text #21c8c21e","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.infinite_setOf_prime","end_line":30,"library":"mathlib","line":30,"location_key":"045bbbda0fe80a7a17edf0eddf782aba015dbe526ac4cf82635514ba8b5bef34","module":"Mathlib.Data.Nat.PrimeFin","note":null,"pair_key":"742f1f7be5c5d699153b5e8b55fa4966f48de2d43288eb93359b916225e23008","path":"Mathlib/Data/Nat/PrimeFin.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"deprecated_to":"Nat.infinite_setOfPred_prime","elided":false,"text":"theorem Nat.infinite_setOf_prime : {p | Nat.Prime p}.Infinite"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.Primes.infinite","end_line":32,"library":"mathlib","line":32,"location_key":"10ee2fadda34fa3668bdbbfbcee82f6022296844c3624d6e01f9796ea8ac52a8","module":"Mathlib.Data.Nat.PrimeFin","note":"Lean packages the primes as a subtype and records infiniteness as a class instance on it.","pair_key":"16f957aaa6c81e93a772b3c31cad79d0c32c4888508a72080b6f578d5a5189db","path":"Mathlib/Data/Nat/PrimeFin.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Nat.Primes.infinite : Infinite Nat.Primes"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.exists_infinite_primes","end_line":45,"library":"mathlib","line":36,"location_key":"45564c1862b7d091bb3b476e61482794789fbf4787bd98b09d39d1f7140cb889","module":"Mathlib.Data.Nat.Prime.Infinite","note":"Lean encodes the count by producing, for each bound, a prime at least that large.","pair_key":"43ee982fae5d293308eb1d510360771a4f8e59d760a252f66d525591d545d463","path":"Mathlib/Data/Nat/Prime/Infinite.lean","proof_status":"proved","rank":3,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.exists_infinite_primes (n : ℕ) : ∃ p, n ≤ p ∧ Nat.Prime p"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"ddc48ae3ee2c07786b7d34f3cae1b89f8b81b9003ed651203ef3264c0d4e7db8","prominence":"supporting","quote":{"exact":"there must be infinitely many primes."},"quote_capped":false,"section":["Elementary properties","Infinitude"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"Because there is no finite list of all the primes, ","segments":[{"text":"Because there is no finite list of all the primes, "}]},"layer":"there must be infinitely many primes.","segments":[{"text":"there must be infinitely many primes."}]},"unresolved":null},{"absence":null,"basis":"3f36a41a4e53ebe3fbdb3dc89f9615536dcee36b74b372104067e8242bf77eb1","coverage":null,"id":"enwiki-23666-1373534600::In-text #8bdc67e2","item":"In-text #8bdc67e2","kind":"definition","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"EuclidNumbers.Euclid","end_line":33,"library":"formal-conjectures","line":33,"location_key":"3f36a41a4e53ebe3fbdb3dc89f9615536dcee36b74b372104067e8242bf77eb1","module":"FormalConjectures.Wikipedia.Euclid","note":"Lean indexes the family by the number of leading primes multiplied and settles the empty product at index zero.","pair_key":"1f58fe29a27e8dd19d0279994714660e9c3295241ea50859a9a7f792a61d0bb5","path":"FormalConjectures/Wikipedia/Euclid.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def EuclidNumbers.Euclid : ℕ → ℕ"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"primorial","end_line":36,"library":"mathlib","line":36,"location_key":"fd39e4f972d8eaf03ed6cc3d2df43cf77e78a666922062c4896fa336325b424d","module":"Mathlib.NumberTheory.Primorial","note":"It names the product of the primes up to a bound without adding one, so it is the ingredient rather than the family being named.","pair_key":"aa560e51d018ce155e5d02b76a82b7f11c2b3b841ddc34ff73611095702a64f0","path":"Mathlib/NumberTheory/Primorial.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def primorial : ℕ → ℕ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"41adae32fcfaaba9dffb455421966b292a4d49f41d9ed6c44ecb036f238139f4","prominence":"supporting","quote":{"exact":"The numbers formed by adding one to the products of the smallest"},"quote_capped":true,"section":["Elementary properties","Infinitude"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"The numbers formed by adding one to the products of the smallest primes are called Euclid numbers.[57]","segments":[{"text":"The numbers formed by adding one to the products of the smallest primes are called Euclid numbers."},{"ref":"[57]"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":4,"queries":5,"sha256":"9234f24511497eebffa3ba16902dc4fde54a0bacb499f3185e09fcd53152c002"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #982363bf","item":"In-text #982363bf","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"EuclidNumbers.infinite_prime_euclid_numbers","end_line":40,"library":"formal-conjectures","line":39,"location_key":"f640cc2bf4ad3931859cd956edac3989ca8c700dcd7a30a00d975a623d53b4e3","module":"FormalConjectures.Wikipedia.Euclid","note":"It asks how many Euclid numbers are prime altogether and settles the status of none of the six the passage lists.","pair_key":"3d1921b71ba2386783724b7c04d09fb7ceacaf40fd3b72ae97839a84a59a46fc","path":"FormalConjectures/Wikipedia/Euclid.lean","proof_status":"statement_only","rank":1,"relation":"relatedMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem EuclidNumbers.infinite_prime_euclid_numbers : {n | Nat.Prime (EuclidNumbers.Euclid n)}.Infinite"},"statement":false},{"challenge":"sampled_out","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"EuclidNumbers.euclid_numbers_are_square_free","end_line":47,"library":"formal-conjectures","line":46,"location_key":"ca16a710333bab641de1cb1c7582a18bde94ba16d26d6499fb6ded1e3d780465","module":"FormalConjectures.Wikipedia.Euclid","note":"Squarefreeness of every Euclid number leaves open which are prime and gives no factorisation of the sixth.","pair_key":"3664abd86b373c729a81e394e5ecc2dac470d6c18fee52e15d64f78a58569abf","path":"FormalConjectures/Wikipedia/Euclid.lean","proof_status":"statement_only","rank":2,"relation":"relatedMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem EuclidNumbers.euclid_numbers_are_square_free (n : ℕ) : Squarefree (EuclidNumbers.Euclid n)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"848dd7afa35890a182ecd2b2fe1dae810acef00ab850325e2af9da8dd493f0db","prominence":"supporting","quote":{"exact":"The first five of them are prime, but the sixth, 1 +"},"quote_capped":true,"section":["Elementary properties","Infinitude"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"The first five of them are prime, but the sixth, 1 + ( 2 ⋅ 3 ⋅ 5 ⋅ 7 ⋅ 11 ⋅ 13 ) = 30031 = 59 ⋅ 509 , {\\displaystyle 1+{\\big (}2\\cdot 3\\cdot 5\\cdot 7\\cdot 11\\cdot 13{\\big )}=30031=59\\cdot 509,} is a composite number.","segments":[{"text":"The first five of them are prime, but the sixth, "},{"tex":"1+{\\big (}2\\cdot 3\\cdot 5\\cdot 7\\cdot 11\\cdot 13{\\big )}=30031=59\\cdot 509,"},{"text":" is a composite number."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":5,"sha256":"dd9213b6fa73103dead37b834b03af264f8c96762aad538fb19d37663a4aa619"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #33d30ed2","item":"In-text #33d30ed2","kind":"theorem","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"Bunyakovsky.bunyakovsky_conjecture","end_line":40,"library":"formal-conjectures","line":37,"location_key":"a7c272e2fc66945c651b09ca784850ec33ac119d783e9a0e1d3169a172a46126","module":"FormalConjectures.Wikipedia.Bunyakovsky","note":null,"pair_key":"3018caf5eb91c71bc7a3bc7f77194039d8fffc6933a0cea9b7aaf61696e9629e","path":"FormalConjectures/Wikipedia/Bunyakovsky.lean","proof_status":"statement_only","rank":1,"relation":"relatedMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem Bunyakovsky.bunyakovsky_conjecture (f : ℤ[X]) : BunyakovskyCondition f ∧ SchinzelCondition {f} → Infinite ↑{n | Nat.Prime (Polynomial.eval (↑n) f).natAbs}"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"76c1a2c9568fd5d46a50b74f9190fd1ccc4e0f9f260979ebfa98838f84bf1320","prominence":"supporting","quote":{"exact":"For example, there is no non-constant polynomial, even in several variables, that"},"quote_capped":true,"section":["Elementary properties","Formulas for primes"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"For example, there is no non-constant polynomial, even in several variables, that takes only prime values.[58]","segments":[{"text":"For example, there is no non-constant polynomial, even in several variables, that takes only prime values."},{"ref":"[58]"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"c0eecb85e3c8eae97864ed519f513a585db66c1328ff52ff60148be774368db2"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #2d8baeca","item":"In-text #2d8baeca","kind":"construction","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.prime_iff_fac_equiv_neg_one","end_line":131,"library":"mathlib","line":128,"location_key":"bd469dc9523fe0c30b167cfae5219c257b86383e805f33f21da6c65f0bed6056","module":"Mathlib.NumberTheory.Wilson","note":null,"pair_key":"07dd4565aacab988510c02eef44c7e74fec2a83129214c537e63a67916e8fbf9","path":"Mathlib/NumberTheory/Wilson.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prime_iff_fac_equiv_neg_one {n : ℕ} : n ≠ 1 → (Nat.Prime n ↔ ↑(n - 1).factorial = -1)"},"statement":false},{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.NumberTheory.PrimeCounting.GandhiNthPrimeFormulaWanted.gandhi_nthPrimeFormula","library":"atlas","line":655,"location_key":"5eb3e60f2175234b69ba18e5186038a8cd49a3b8db5a981b979dd65485e8df3f","module":"MathlibExt.NumberTheory.PrimeCounting.GandhiNthPrimeFormula","note":null,"pair_key":"661bf125523c4f1194d593c7dbde1c825ff9334a335b8707fd0cc165b5abe6ec","path":"MathlibExt/NumberTheory/PrimeCounting/GandhiNthPrimeFormula.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.NumberTheory.PrimeCounting.GandhiNthPrimeFormulaWanted.gandhi_nthPrimeFormula (n : ℕ) : 0 < n → ↑(Nat.nth Nat.Prime (n - 1)) = ⌊1 - Real.logb 2 (-1 / 2 + ∑ d ∈ (∏ i ∈ Finset.Icc 1 (n - 1), Nat.nth Nat.Prime (i - 1)).divisors, ↑(ArithmeticFunction.moebius d) / (2 ^ d - 1))⌋"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"d1b454e24c3ad320d956d8b59cd2f4e70ea90c4f5fbc7d8c4b0e595b839bd51b","prominence":"supporting","quote":{"exact":"One possible formula is based on Wilson's theorem and generates the number"},"quote_capped":true,"section":["Elementary properties","Formulas for primes"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"One possible formula is based on Wilson's theorem and generates the number 2 many times and all other primes exactly once.[59]","segments":[{"text":"One possible formula is based on Wilson's theorem and generates the number 2 many times and all other primes exactly once."},{"ref":"[59]"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"0a22a7a71735c248f1af08a7d051232d95c1dab4a91715cab7aad0ee2316edf6"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #bba6823f","item":"In-text #bba6823f","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.NumberTheory.DPRMWanted.dprm_theorem","library":"atlas","line":2201,"location_key":"80c005e676e8501944b38b81ec7811c6f02d1391e20bf4aa8f9936321dfc25cc","module":"MathlibExt.NumberTheory.DPRM","note":null,"pair_key":"0558b2ab3a9150fbb1c0878a805f8987e61408e432763413950be055a0c3574e","path":"MathlibExt/NumberTheory/DPRM.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.NumberTheory.DPRMWanted.dprm_theorem (S : Set ℕ) : (REPred fun n ↦ n ∈ S) ↔ Dioph {v | v () ∈ S}"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"087de402f8550a745d98c41bbda2747a493923f75dfdb55081d7129392dd6455","prominence":"supporting","quote":{"exact":"There is also a set of Diophantine equations in nine variables and"},"quote_capped":true,"section":["Elementary properties","Formulas for primes"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"2f85ff488dd113d28f463c5907373124ab1f204689b8634184cf86d1cc28177e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #606357ac","item":"In-text #606357ac","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.NumberTheory.PrimeCounting.GandhiNthPrimeFormulaWanted.gandhi_nthPrimeFormula","library":"atlas","line":655,"location_key":"3d25ff64d84911bbd28d5e830b1d22f7d89eec527b74d87973ff04bdbe001c8c","module":"MathlibExt.NumberTheory.PrimeCounting.GandhiNthPrimeFormula","note":null,"pair_key":"2f512c7d4a60396b191a43beff7f93f4656bd571d5eb7d2e35b9c7b3cd406560","path":"MathlibExt/NumberTheory/PrimeCounting/GandhiNthPrimeFormula.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.NumberTheory.PrimeCounting.GandhiNthPrimeFormulaWanted.gandhi_nthPrimeFormula (n : ℕ) : 0 < n → ↑(Nat.nth Nat.Prime (n - 1)) = ⌊1 - Real.logb 2 (-1 / 2 + ∑ d ∈ (∏ i ∈ Finset.Icc 1 (n - 1), Nat.nth Nat.Prime (i - 1)).divisors, ↑(ArithmeticFunction.moebius d) / (2 ^ d - 1))⌋"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"1b502ba44999e131e95e969fc00fae42c8b3761448e225b0c2bc19238949259d","prominence":"supporting","quote":{"exact":"This can be used to obtain a single formula with the property"},"quote_capped":true,"section":["Elementary properties","Formulas for primes"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"This can be used to obtain a single formula with the property that all its positive values are prime.","segments":[{"text":"This can be used to obtain a single formula with the property that all its positive values are prime."}]},"unresolved":null},{"absence":null,"basis":"8c435de0d087fb2685a9b687bd2e38b2277f0172372c681e2e89dec571f6caab","coverage":null,"id":"enwiki-23666-1373534600::In-text #6dd0c03a","item":"In-text #6dd0c03a","kind":"theorem","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"Mills.exists'","end_line":57,"library":"formal-conjectures","line":56,"location_key":"8c435de0d087fb2685a9b687bd2e38b2277f0172372c681e2e89dec571f6caab","module":"FormalConjectures.Wikipedia.Mills","note":"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.","pair_key":"69966005431c3025851939e189c6b8ec564ac1eb1bd4503b3a4993f3f69dc6ba","path":"FormalConjectures/Wikipedia/Mills.lean","proof_status":"statement_only","rank":1,"relation":"hasPart","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem Mills.exists' : ∃ A > 1, Mills.IsMills A"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2287dcb97f25031bf7124846a62bd69df201fa89f068c93d7109b2fe521e8b83","prominence":"central","quote":{"exact":"These assert that there are real constants A > 1 {\\displaystyle A>1}"},"quote_capped":true,"section":["Elementary properties","Formulas for primes"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"These assert that there are real constants A > 1 {\\displaystyle A>1} and μ {\\displaystyle \\mu } such that ⌊ A 3 n ⌋ and ⌊ 2 ⋯ 2 2 μ ⌋ {\\displaystyle \\left\\lfloor A^{3^{n}}\\right\\rfloor {\\text{ and }}\\left\\lfloor 2^{\\cdots ^{2^{2^{\\mu }}}}\\right\\rfloor } are prime for any natural number ⁠ n {\\displaystyle n} ⁠ in the first formula, and any number of exponents in the second formula.[60]","segments":[{"text":"These assert that there are real constants "},{"tex":"A>1"},{"text":" and "},{"tex":"\\mu"},{"text":" such that "},{"tex":"\\left\\lfloor A^{3^{n}}\\right\\rfloor {\\text{ and }}\\left\\lfloor 2^{\\cdots ^{2^{2^{\\mu }}}}\\right\\rfloor"},{"text":" are prime for any natural number ⁠ "},{"tex":"n"},{"text":" ⁠ in the first formula, and any number of exponents in the second formula."},{"ref":"[60]"}]},"unresolved":null},{"absence":null,"basis":"4a9c806299bfdda10002a59613c8bd53f617f5316a22abcb7107c337aa75f1d6","coverage":null,"id":"enwiki-23666-1373534600::In-text #0e8a497b","item":"In-text #0e8a497b","kind":"notation","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Int.floor","end_line":257,"library":"mathlib","line":256,"location_key":"4a9c806299bfdda10002a59613c8bd53f617f5316a22abcb7107c337aa75f1d6","module":"Mathlib.Algebra.Order.Floor.Defs","note":"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.","pair_key":"eeb83b88d5fdbd22128afe4a83cebea03a2bc48d5ead0140f6ff4e31b6393b86","path":"Mathlib/Algebra/Order/Floor/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Int.floor {α : Type*} [Ring α] [LinearOrder α] [FloorRing α] : α → ℤ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"9f3c967b4a140a8d00c7200b88416703e0298ce630a487ca908895eb91aa0439","prominence":"supporting","quote":{"exact":"Here ⌊ ⋅ ⌋ {\\displaystyle \\lfloor {}\\cdot {}\\rfloor } represents the floor"},"quote_capped":true,"section":["Elementary properties","Formulas for primes"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Here ⌊ ⋅ ⌋ {\\displaystyle \\lfloor {}\\cdot {}\\rfloor } represents the floor function, the largest integer less than or equal to the number in question.","segments":[{"text":"Here "},{"tex":"\\lfloor {}\\cdot {}\\rfloor"},{"text":" represents the floor function, the largest integer less than or equal to the number in question."}]},"unresolved":null},{"absence":null,"basis":"7e332134715f268ad9386292a7096d63f76ca5efcd812cd9c72287557cdcd339","coverage":null,"id":"enwiki-23666-1373534600::In-text #50cc4491","item":"In-text #50cc4491","kind":"conjecture","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"GoldbachConjecture.goldbach","end_line":38,"library":"formal-conjectures","line":36,"location_key":"7e332134715f268ad9386292a7096d63f76ca5efcd812cd9c72287557cdcd339","module":"FormalConjectures.Wikipedia.GoldbachConjecture","note":"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.","pair_key":"f4e3364550dd5cd93424618cad41538f47c9f7b679dd71854f3831211904bf7c","path":"FormalConjectures/Wikipedia/GoldbachConjecture.lean","proof_status":"statement_only","rank":1,"relation":"closeMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem GoldbachConjecture.goldbach (n : ℕ) : 2 < n → Even n → ∃ p q, Prime p ∧ Prime q ∧ n = p + q"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c26a0d8d95f91d136a251fa4846fe371af11571130c05dc4edf8c5e1112fc28a","prominence":"central","quote":{"exact":"One of them is Goldbach's conjecture, which asserts that every even integer"},"quote_capped":true,"section":["Elementary properties","Open questions"],"status":"statement_only","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"One of them is Goldbach's conjecture, which asserts that every even integer ⁠ n {\\displaystyle n} ⁠ greater than ⁠ 2 {\\displaystyle 2} ⁠ can be written as a sum of two primes.","segments":[{"text":"One of them is Goldbach's conjecture, which asserts that every even integer ⁠ "},{"tex":"n"},{"text":" ⁠ greater than ⁠ "},{"tex":"2"},{"text":" ⁠ can be written as a sum of two primes."}]},"unresolved":null},{"absence":null,"basis":"1be2fe01ff1ba70931598144d50bd6a4007763b1dac6ffa021aff1ec5c17d678","coverage":null,"id":"enwiki-23666-1373534600::In-text #777af3ff","item":"In-text #777af3ff","kind":"theorem","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"GoldbachConjecture.goldbach","end_line":38,"library":"formal-conjectures","line":36,"location_key":"1be2fe01ff1ba70931598144d50bd6a4007763b1dac6ffa021aff1ec5c17d678","module":"FormalConjectures.Wikipedia.GoldbachConjecture","note":"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.","pair_key":"728f8cbd1b27d63da56a793c59e38bee4dc5310f92f5aef20674fbb6106503c2","path":"FormalConjectures/Wikipedia/GoldbachConjecture.lean","proof_status":"statement_only","rank":1,"relation":"broadMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem GoldbachConjecture.goldbach (n : ℕ) : 2 < n → Even n → ∃ p q, Prime p ∧ Prime q ∧ n = p + q"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a5e5f89509ab57c427bae09330da63b59749a52bdbf945dada17f72c8dcd2640","prominence":"supporting","quote":{"exact":"As of 2014[update], this conjecture has been verified for all numbers up"},"quote_capped":true,"section":["Elementary properties","Open questions"],"status":"statement_only","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":" 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.","segments":[{"text":" 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."}]},"layer":"As of 2014[update], this conjecture has been verified for all numbers up to n = 4 ⋅ 10 18 . {\\displaystyle n=4\\cdot 10^{18}.} [63]","segments":[{"text":"As of 2014[update], this conjecture has been verified for all numbers up to "},{"tex":"n=4\\cdot 10^{18}."},{"text":" "},{"ref":"[63]"}]},"unresolved":null},{"absence":null,"basis":"96c42d7eccb739ae2b309381f384fececbc7141fab55b3f70d250d64cb482476","coverage":null,"id":"enwiki-23666-1373534600::In-text #aab6ca70","item":"In-text #aab6ca70","kind":"theorem","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"TernaryGoldbachConjecture.ternaryGoldbach","end_line":54,"library":"formal-conjectures","line":52,"location_key":"96c42d7eccb739ae2b309381f384fececbc7141fab55b3f70d250d64cb482476","module":"FormalConjectures.Wikipedia.GoldbachConjecture","note":"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.","pair_key":"576c7d13ae867593e66d3f048fa92312cd48e0790a4319a0a53bd3914d4fee1f","path":"FormalConjectures/Wikipedia/GoldbachConjecture.lean","proof_status":"statement_only","rank":1,"relation":"broadMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem TernaryGoldbachConjecture.ternaryGoldbach (n : ℕ) : 5 < n → Odd n → ∃ p q r, Nat.Prime p ∧ Nat.Prime q ∧ Nat.Prime r ∧ n = p + q + r"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"bae446c0e98f2eb3bdeb017b79303b2e5d6b2dbae7ff1f91d15a357af786c97e","prominence":"central","quote":{"exact":"for example, Vinogradov's theorem says that every sufficiently large odd integer can"},"quote_capped":true,"section":["Elementary properties","Open questions"],"status":"statement_only","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"As of 2014[update], this conjecture has been verified for all numbers up to n = 4 ⋅ 10 18 . {\\displaystyle n=4\\cdot 10^{18}.} [63] Weaker statements than this have been proven; ","segments":[{"text":"As of 2014[update], this conjecture has been verified for all numbers up to "},{"tex":"n=4\\cdot 10^{18}."},{"text":" "},{"ref":"[63]"},{"text":" Weaker statements than this have been proven; "}]},"layer":"for example, Vinogradov's theorem says that every sufficiently large odd integer can be written as a sum of three primes.[64]","segments":[{"text":"for example, Vinogradov's theorem says that every sufficiently large odd integer can be written as a sum of three primes."},{"ref":"[64]"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"1ad7c139b4602a331ea29dc9091f1b2ce900e1bbd6b84c31db2d543765f19773"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #72f22636","item":"In-text #72f22636","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"0bed6ab3fa9c52a6e3b82236574dd677429393bcb123ca65e52d39274a594a1c","prominence":"central","quote":{"exact":"Chen's theorem says that every sufficiently large even number can be expressed"},"quote_capped":true,"section":["Elementary properties","Open questions"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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]","segments":[{"text":"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)."},{"ref":"[65]"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"cfebae4d132b213675b6567be70c5704ac8186a285a1658da0af3847e3cadff5"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #5c37df6e","item":"In-text #5c37df6e","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"67400b3784c5ea92faeea1e18155fabbed9dcddb1e45a10e69d432d334e004ad","prominence":"supporting","quote":{"exact":"Also, any even integer greater than 10 can be written as the"},"quote_capped":true,"section":["Elementary properties","Open questions"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Also, any even integer greater than 10 can be written as the sum of six primes.[66]","segments":[{"text":"Also, any even integer greater than 10 can be written as the sum of six primes."},{"ref":"[66]"}]},"unresolved":null},{"absence":null,"basis":"2ec4e7f39eb9a330b53a541ad86e0acfed4178a8020bc0ba4ea6a58dc90ea841","coverage":null,"id":"enwiki-23666-1373534600::In-text #ed90bea1","item":"In-text #ed90bea1","kind":"definition","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"primeGap","library":"atlas","line":27,"location_key":"2ec4e7f39eb9a330b53a541ad86e0acfed4178a8020bc0ba4ea6a58dc90ea841","module":"MathlibExt.NumberTheory.PrimeGap","note":"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.","pair_key":"07328b5ab1dce0c17f383c8198ed5228561ca013e691cc18e92c4917e36592bd","path":"MathlibExt/NumberTheory/PrimeGap.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def primeGap : ℕ → ℕ"},"statement":false},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"primeGap","end_line":27,"library":"formal-conjectures","line":27,"location_key":"3044dd2efa0d09d95e65e506810f2c87d03cc2ce2438e3547ac633d08c63bd14","module":"FormalConjecturesForMathlib.NumberTheory.PrimeGap","note":"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.","pair_key":"ce56458a85544bbf5f2d1bae46d93a8089fb7c3496783fd8c76ff9b248df82b8","path":"FormalConjecturesForMathlib/NumberTheory/PrimeGap.lean","proof_status":"definition","rank":2,"relation":"closeMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def primeGap : ℕ → ℕ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"52b9ccaf36b374540e57282bbd462d23558e584f7fcc3ee43446e0b04f81aa7a","prominence":"supporting","quote":{"exact":"Another type of problem concerns prime gaps, the differences between consecutive primes."},"quote_capped":false,"section":["Elementary properties","Open questions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Another type of problem concerns prime gaps, the differences between consecutive primes.","segments":[{"text":"Another type of problem concerns prime gaps, the differences between consecutive primes."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":5,"sha256":"d6c29bcb8c0babc5720cfef0d37722186bf1afecdb5b7314d8acd35b7d603e32"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #6819aa1b","item":"In-text #6819aa1b","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e37b8feefb3ae8a3407de5456035faf389ae3f3773a575dc01cd7cd3e3ae40b9","prominence":"central","quote":{"exact":"The existence of arbitrarily large prime gaps can be seen by noting"},"quote_capped":true,"section":["Elementary properties","Open questions"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":" However, large prime gaps occur much earlier than this argument shows.","segments":[{"text":" However, large prime gaps occur much earlier than this argument shows."}]},"layer":"The existence of arbitrarily large prime gaps can be seen by noting that the sequence n ! + 2 , n ! + 3 , … , n ! + n {\\displaystyle n!+2,n!+3,\\dots ,n!+n} consists of n − 1 {\\displaystyle n-1} composite numbers, for any natural number n . {\\displaystyle n.} [68]","segments":[{"text":"The existence of arbitrarily large prime gaps can be seen by noting that the sequence "},{"tex":"n!+2,n!+3,\\dots ,n!+n"},{"text":" consists of "},{"tex":"n-1"},{"text":" composite numbers, for any natural number "},{"tex":"n."},{"text":" "},{"ref":"[68]"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"350a3f15d996b3dd1690b15b8ef84648411d30a4427549f6ddd705d291a71c3e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #1ccf8dec","item":"In-text #1ccf8dec","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e987c003ff37e2845863c7215743b8735fdab0b538505a7c2e03e3d08a121109","prominence":"supporting","quote":{"exact":"For example, the first prime gap of length 8 is between the"},"quote_capped":true,"section":["Elementary properties","Open questions"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":" It is conjectured that there are infinitely many twin primes, pairs of primes with difference 2; this is the twin prime conjecture.","segments":[{"text":" It is conjectured that there are infinitely many twin primes, pairs of primes with difference 2; this is the twin prime conjecture."}]},"layer":"For example, the first prime gap of length 8 is between the primes 89 and 97,[70] much smaller than 8 ! = 40320. {\\displaystyle 8!=40320.}","segments":[{"text":"For example, the first prime gap of length 8 is between the primes 89 and 97,"},{"ref":"[70]"},{"text":" much smaller than "},{"tex":"8!=40320."}]},"unresolved":null},{"absence":null,"basis":"4cd75cbf2e2847908df0feda75b0e9f6fbc39b001b480ca0783b822e2a5eafc5","coverage":null,"id":"enwiki-23666-1373534600::In-text #6b574040","item":"In-text #6b574040","kind":"conjecture","locations":[{"challenge":"downgraded","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"TwinPrimes.twin_primes","end_line":39,"library":"formal-conjectures","line":37,"location_key":"4cd75cbf2e2847908df0feda75b0e9f6fbc39b001b480ca0783b822e2a5eafc5","module":"FormalConjectures.Wikipedia.TwinPrimes","note":"Mathlib's Prime predicate on ℕ picks out the prime numbers the passage speaks of, and an infinite set of such p is an infinite set of pairs two apart.","pair_key":"76e2ee5e8ac9f1416406b27215063b909f6c8ace3c773d2f6846ec96eb306aef","path":"FormalConjectures/Wikipedia/TwinPrimes.lean","proof_status":"statement_only","rank":1,"relation":"closeMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem TwinPrimes.twin_primes : {p | Prime p ∧ Prime (p + 2)}.Infinite"},"statement":false},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"Dickson.generalized_twin_primes","end_line":56,"library":"formal-conjectures","line":54,"location_key":"7c11494f64be0208b2725c5846759a1a2c222df6373e6722bf2fd0b4d08e18f0","module":"FormalConjectures.Wikipedia.Dickson","note":"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.","pair_key":"a17ed2cc9fde19913981d07c232cb8b35fcf8f1ea577e77bdb69ef71e8a350b3","path":"FormalConjectures/Wikipedia/Dickson.lean","proof_status":"statement_only","rank":2,"relation":"broadMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem Dickson.generalized_twin_primes (k : ℕ) : 0 < k → Infinite ↑{p | Nat.Prime p ∧ Nat.Prime (p + 2 * k)}"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.NumberTheory.primeGapLiminf_eq_two_iff","library":"atlas","line":149,"location_key":"6f16a56401617bae04fd324e34eec526bba6939c871189893f505bb0a7a63b23","module":"MathlibExt.NumberTheory.PrimeGapLiminf","note":"It ties the lower limit of prime gaps being two to the infinitude of pairs two apart, so it presupposes the passage's statement rather than asserting it.","pair_key":"9e447adaf242c63b7b9a986b8ccd9c42686d6c067d1e3703d17da8b71109868a","path":"MathlibExt/NumberTheory/PrimeGapLiminf.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.NumberTheory.primeGapLiminf_eq_two_iff : MathlibExt.NumberTheory.primeGapLiminf = 2 ↔ {p | Nat.Prime p ∧ Nat.Prime (p + 2)}.Infinite"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"70876a4714900db503cef499c2e963ac6ec32689ceba52484b45a4b36c7fbb19","prominence":"central","quote":{"exact":"It is conjectured that there are infinitely many twin primes, pairs of"},"quote_capped":true,"section":["Elementary properties","Open questions"],"status":"statement_only","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"For example, the first prime gap of length 8 is between the primes 89 and 97,[70] much smaller than 8 ! = 40320. {\\displaystyle 8!=40320.} ","segments":[{"text":"For example, the first prime gap of length 8 is between the primes 89 and 97,"},{"ref":"[70]"},{"text":" much smaller than "},{"tex":"8!=40320."},{"text":" "}]},"layer":"It is conjectured that there are infinitely many twin primes, pairs of primes with difference 2; this is the twin prime conjecture.","segments":[{"text":"It is conjectured that there are infinitely many twin primes, pairs of primes with difference 2; this is the twin prime conjecture."}]},"unresolved":null},{"absence":null,"basis":"2f100d13a239d53e39d7c912a503019769df487c80aedd174d24d7ebea639e0a","coverage":null,"id":"enwiki-23666-1373534600::In-text #9b6919ea","item":"In-text #9b6919ea","kind":"conjecture","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"TwinPrimes.twin_primes","end_line":39,"library":"formal-conjectures","line":37,"location_key":"2f100d13a239d53e39d7c912a503019769df487c80aedd174d24d7ebea639e0a","module":"FormalConjectures.Wikipedia.TwinPrimes","note":"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.","pair_key":"39a2fe27c4d9fef7ab4a3b9e3c31fd63ef910fe0387d0d63914b4d01c0a1e320","path":"FormalConjectures/Wikipedia/TwinPrimes.lean","proof_status":"statement_only","rank":1,"relation":"narrowMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem TwinPrimes.twin_primes : {p | Prime p ∧ Prime (p + 2)}.Infinite"},"statement":false},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"Dickson.generalized_twin_primes","end_line":56,"library":"formal-conjectures","line":54,"location_key":"597d4df020710dd2d879115c1615cb520a42ff56a87bf60370e8174b18f643f7","module":"FormalConjectures.Wikipedia.Dickson","note":"It drops the requirement that the two primes follow one another, asking only that p and p + 2k both be prime for infinitely many p, which the passage implies rather than the other way round.","pair_key":"73ef825c8bf2b599e384d7e4ba58db6711222880de823251f6dcda34a6fdaadb","path":"FormalConjectures/Wikipedia/Dickson.lean","proof_status":"statement_only","rank":2,"relation":"relatedMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem Dickson.generalized_twin_primes (k : ℕ) : 0 < k → Infinite ↑{p | Nat.Prime p ∧ Nat.Prime (p + 2 * k)}"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"53c2671b8730c4a346699cf36656aa3ca2ac5c11200f25cd17a968f8dbd8bb05","prominence":"central","quote":{"exact":"Polignac's conjecture states more generally that for every positive integer k ,"},"quote_capped":true,"section":["Elementary properties","Open questions"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":" 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 {\\displaystyle n} ⁠ should be at most approximately n , {\\displaystyle {\\sqrt {n}},} a result that is known to follow from the Riemann","segments":[{"text":" Andrica's conjecture,"},{"ref":"[71]"},{"text":" Brocard's conjecture,"},{"ref":"[72]"},{"text":" Legendre's conjecture,"},{"ref":"[73]"},{"text":" and Oppermann's conjecture"},{"ref":"[72]"},{"text":" all suggest that the largest gaps between primes from 1 to ⁠ "},{"tex":"n"},{"text":" ⁠ should be at most approximately "},{"tex":"{\\sqrt {n}},"},{"text":" a result that is known to follow from the Riemann"}],"trimmed":true},"layer":"Polignac's conjecture states more generally that for every positive integer k , {\\displaystyle k,} there are infinitely many pairs of consecutive primes that differ by 2 k . {\\displaystyle 2k.} [71]","segments":[{"text":"Polignac's conjecture states more generally that for every positive integer "},{"tex":"k,"},{"text":" there are infinitely many pairs of consecutive primes that differ by "},{"tex":"2k."},{"text":" "},{"ref":"[71]"}]},"unresolved":null},{"absence":null,"basis":"c6adc624f23d135dbc7cf4d0c5197a49f1029280e91a38b52ee63f7434427a12","coverage":null,"id":"enwiki-23666-1373534600::In-text #845ce9c8","item":"In-text #845ce9c8","kind":"conjecture","locations":[{"challenge":"sampled_out","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"Andrica.andrica_conjecture","end_line":40,"library":"formal-conjectures","line":38,"location_key":"c6adc624f23d135dbc7cf4d0c5197a49f1029280e91a38b52ee63f7434427a12","module":"FormalConjectures.Wikipedia.Andrica","note":"This is the Andrica statement the paragraph names first, in the square-root form the library records.","pair_key":"95b4df4de3ec7f7e791b067aa803ea16a2b65e108978fd7068c704b2fa2b6eb3","path":"FormalConjectures/Wikipedia/Andrica.lean","proof_status":"statement_only","rank":1,"relation":"hasPart","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem Andrica.andrica_conjecture (n : ℕ) : √↑(Nat.nth Nat.Prime (n + 1)) - √↑(Nat.nth Nat.Prime n) < 1"},"statement":false},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"LegendreConjecture.legendre_conjecture","end_line":40,"library":"formal-conjectures","line":38,"location_key":"8ea5372030db324b9fedeebb4c2cd1bea75c49fd24f84687f491600861c286dd","module":"FormalConjectures.Wikipedia.LegendreConjecture","note":"This is the Legendre statement the paragraph names, recorded as a prime in each interval between neighbouring squares.","pair_key":"4c175d777edbf866aabda7f3f35ed364d06b7391334e809a88b69596eb0c7aa9","path":"FormalConjectures/Wikipedia/LegendreConjecture.lean","proof_status":"statement_only","rank":2,"relation":"hasPart","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem LegendreConjecture.legendre_conjecture : ∀ n ≥ 1, ∃ p ∈ Set.Ioo (n ^ 2) ((n + 1) ^ 2), Nat.Prime p"},"statement":false},{"challenge":"sampled_out","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"Oppermann.oppermann_conjecture","end_line":60,"library":"formal-conjectures","line":57,"location_key":"834f190a285bc942975b095729340ba6c1a754df5ca039eb126f88a3a4473046","module":"FormalConjectures.Wikipedia.Oppermann","note":"This is the Oppermann statement the paragraph names, in its two-interval form.","pair_key":"4ea0d477aa6c88cda04bfeb491dc33fdcba98f58f931a80f855ab87b0d0f39e0","path":"FormalConjectures/Wikipedia/Oppermann.lean","proof_status":"statement_only","rank":3,"relation":"hasPart","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"Brocard.brocard_conjecture","end_line":44,"library":"formal-conjectures","line":40,"location_key":"4ee210105109d7561fef37d728b9027133a1e0015c715088c9b62ac49a2a1492","module":"FormalConjectures.Wikipedia.BrocardConjecture","note":null,"pair_key":"562d7a6d06e6bd7e1cbad58a349ea613aa8ef0c7f723c63cbbaa4c9677c31d3d","path":"FormalConjectures/Wikipedia/BrocardConjecture.lean","proof_status":"statement_only","rank":4,"relation":"relatedMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem Brocard.brocard_conjecture (n : ℕ) : 1 ≤ n → 4 ≤ (Finset.filter Nat.Prime (Finset.Ioo (Nat.nth Nat.Prime n ^ 2) (Nat.nth Nat.Prime (n + 1) ^ 2))).card"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"4182e0b09985042c7d4ce6efc5f433df5b1efeddf8593588852182d9e3fdfdac","prominence":"supporting","quote":{"exact":"Andrica's conjecture,[71] Brocard's conjecture,[72] Legendre's conjecture,[73] and Oppermann's conjecture[72] all suggest that"},"quote_capped":true,"section":["Elementary properties","Open questions"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"Polignac's conjecture states more generally that for every positive integer k , {\\displaystyle k,} there are infinitely many pairs of consecutive primes that differ by 2 k . {\\displaystyle 2k.} [71] ","segments":[{"text":"Polignac's conjecture states more generally that for every positive integer "},{"tex":"k,"},{"text":" there are infinitely many pairs of consecutive primes that differ by "},{"tex":"2k."},{"text":" "},{"ref":"[71]"},{"text":" "}]},"layer":"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 {\\displaystyle n} ⁠ should be at most approximately n , {\\displaystyle {\\sqrt {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 ) {\\displaystyle O((\\log n)^{2})} ⁠.[71]","segments":[{"text":"Andrica's conjecture,"},{"ref":"[71]"},{"text":" Brocard's conjecture,"},{"ref":"[72]"},{"text":" Legendre's conjecture,"},{"ref":"[73]"},{"text":" and Oppermann's conjecture"},{"ref":"[72]"},{"text":" all suggest that the largest gaps between primes from 1 to ⁠ "},{"tex":"n"},{"text":" ⁠ should be at most approximately "},{"tex":"{\\sqrt {n}},"},{"text":" a result that is known to follow from the Riemann hypothesis, while the much stronger Cramér conjecture sets the largest gap size at ⁠ "},{"tex":"O((\\log n)^{2})"},{"text":" ⁠."},{"ref":"[71]"}]},"unresolved":null},{"absence":null,"basis":"e23ea3a656404e78b0c6268606cacc6544696fdb889d1bb6d9ec5f6b2022bf85","coverage":null,"id":"enwiki-23666-1373534600::In-text #47af61ed","item":"In-text #47af61ed","kind":"definition","locations":[{"challenge":"downgraded","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"HardyLittlewood.IsPrimeConstellation","end_line":41,"library":"formal-conjectures","line":40,"location_key":"e23ea3a656404e78b0c6268606cacc6544696fdb889d1bb6d9ec5f6b2022bf85","module":"FormalConjectures.Wikipedia.HardyLittlewood","note":"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.","pair_key":"5facd65237fa46e70d78712f02eaf1c7d3ea6d1190af5ed307b4f2beed4885ce","path":"FormalConjectures/Wikipedia/HardyLittlewood.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def HardyLittlewood.IsPrimeConstellation {k : ℕ} : (Fin k.succ → ℕ) → ℕ → Prop"},"statement":true},{"challenge":"sampled_out","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"HardyLittlewood.IsAdmissiblePrimeConstellation","end_line":48,"library":"formal-conjectures","line":47,"location_key":"ca27e35ed1cfcc1be9430800ab4d6a3118847bd0db75cbdbc70d90d17920eea8","module":"FormalConjectures.Wikipedia.HardyLittlewood","note":null,"pair_key":"d90a81d987011f60443f2dfe032b965ff194e5a774e8145a40c66de7b07ec3cf","path":"FormalConjectures/Wikipedia/HardyLittlewood.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def HardyLittlewood.IsAdmissiblePrimeConstellation {k : ℕ} : (Fin k.succ → ℕ) → ℕ → Prop"},"statement":true},{"challenge":"sampled_out","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"HardyLittlewood.Nat.primeTupleCounting","end_line":62,"library":"formal-conjectures","line":60,"location_key":"b43927a0090ebc4a10bcd7c15ce53f83b57cf9f4288fffe5263abe34d177b346","module":"FormalConjectures.Wikipedia.HardyLittlewood","note":null,"pair_key":"efeb2455efc19187060fe539a7f5a3b345460cc461e22eed85ca704fe7d6f2e0","path":"FormalConjectures/Wikipedia/HardyLittlewood.lean","proof_status":"definition","rank":3,"relation":"relatedMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def HardyLittlewood.Nat.primeTupleCounting {k : ℕ} : (Fin k.succ → ℕ) → ℕ → ℕ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"ae23d9ec27e3df79673d006a79916cc8ac6f86118a181caaa9bed3432c00eae4","prominence":"supporting","quote":{"exact":"Prime gaps can be generalized to prime ⁠ k {\\displaystyle k} ⁠-tuples,"},"quote_capped":true,"section":["Elementary properties","Open questions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Prime gaps can be generalized to prime ⁠ k {\\displaystyle k} ⁠-tuples, patterns in the differences among more than two prime numbers.","segments":[{"text":"Prime gaps can be generalized to prime ⁠ "},{"tex":"k"},{"text":" ⁠-tuples, patterns in the differences among more than two prime numbers."}]},"unresolved":null},{"absence":null,"basis":"68d3f682cdd57e1d98ba8bd40978960e4ede491a02015f55b45392516cf71d34","coverage":null,"id":"enwiki-23666-1373534600::In-text #de39e4c0","item":"In-text #de39e4c0","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"zeta_nat_eq_tsum_of_gt_one","end_line":227,"library":"mathlib","line":223,"location_key":"68d3f682cdd57e1d98ba8bd40978960e4ede491a02015f55b45392516cf71d34","module":"Mathlib.NumberTheory.LSeries.RiemannZeta","note":"Lean sums over all naturals, and its zeroth term is zero, so the value is the passage's sum beginning at one.","pair_key":"ecaa85b4633895b1be47254120f0c7e687ebc2e54ddab05bf93ee120729a3b9d","path":"Mathlib/NumberTheory/LSeries/RiemannZeta.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem zeta_nat_eq_tsum_of_gt_one {k : ℕ} : 1 < k → riemannZeta ↑k = ∑' (n : ℕ), 1 / ↑n ^ k"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"zeta_eq_tsum_one_div_nat_cpow","end_line":210,"library":"mathlib","line":207,"location_key":"7dafd92c838fe0b8defc1c4d30ba8effa0a71d58062d751ea069de9e858234d4","module":"Mathlib.NumberTheory.LSeries.RiemannZeta","note":"The declaration holds for every complex argument to the right of the line through one, and the passage uses the point two.","pair_key":"de150f61f3aa93912f105b30220a176058ab09ec98df863dc235ff32b9c28d73","path":"Mathlib/NumberTheory/LSeries/RiemannZeta.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem zeta_eq_tsum_one_div_nat_cpow {s : ℂ} : 1 < s.re → riemannZeta s = ∑' (n : ℕ), 1 / ↑n ^ s"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"hasSum_zeta_two","end_line":456,"library":"mathlib","line":453,"location_key":"cb671090cc7a3ef6a69f48829beea127a43d60be194986e5bad7481b3fb6f27a","module":"Mathlib.NumberTheory.ZetaValues","note":null,"pair_key":"ab1874d0ee80170d3dbd04f8b9a962f7bc1832ff4582db1051ff16cb156f3f75","path":"Mathlib/NumberTheory/ZetaValues.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem hasSum_zeta_two : HasSum (fun n ↦ 1 / ↑n ^ 2) (π ^ 2 / 6)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7e1111bbbf11b1c27ced998b5f8d2d65ea322008349a6dc4f42e1a26844554f5","prominence":"supporting","quote":{"exact":"The problem asked for the value of the infinite sum 1 +"},"quote_capped":true,"section":["Analytic properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"The problem asked for the value of the infinite sum 1 + 1 4 + 1 9 + 1 16 + … , {\\displaystyle 1+{\\tfrac {1}{4}}+{\\tfrac {1}{9}}+{\\tfrac {1}{16}}+\\dots ,} which today can be recognized as the value ζ ( 2 ) {\\displaystyle \\zeta (2)} of the Riemann zeta function.","segments":[{"text":"The problem asked for the value of the infinite sum "},{"tex":"1+{\\tfrac {1}{4}}+{\\tfrac {1}{9}}+{\\tfrac {1}{16}}+\\dots ,"},{"text":" which today can be recognized as the value "},{"tex":"\\zeta (2)"},{"text":" of the Riemann zeta function."}]},"unresolved":null},{"absence":null,"basis":"bd95fccf3d69514c5e999bd89b3a4f41c2bb9200a91cfa7bb097a42082298a8e","coverage":null,"id":"enwiki-23666-1373534600::In-text #c52552c2","item":"In-text #c52552c2","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"riemannZeta_two","end_line":230,"library":"mathlib","line":226,"location_key":"bd95fccf3d69514c5e999bd89b3a4f41c2bb9200a91cfa7bb097a42082298a8e","module":"Mathlib.NumberTheory.LSeries.HurwitzZetaValues","note":null,"pair_key":"b690842da30bca33d5309358c19dddf241d33eedbb4b239d83170a3485cff638","path":"Mathlib/NumberTheory/LSeries/HurwitzZetaValues.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem riemannZeta_two : riemannZeta 2 = ↑π ^ 2 / 6"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"riemannZeta_two_mul_nat","end_line":212,"library":"mathlib","line":206,"location_key":"170abe40c1ff0ba7f8872fed61688f4d5113b006259b37cbf1f0f8ea6eef2058","module":"Mathlib.NumberTheory.LSeries.HurwitzZetaValues","note":null,"pair_key":"a52b12eac799183e67c7678d5189fe61b83308befd2f0d3093681adc315310df","path":"Mathlib/NumberTheory/LSeries/HurwitzZetaValues.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem riemannZeta_two_mul_nat {k : ℕ} : k ≠ 0 → riemannZeta (2 * ↑k) = (-1) ^ (k + 1) * 2 ^ (2 * k - 1) * ↑π ^ (2 * k) * ↑(bernoulli (2 * k)) / ↑(2 * k).factorial"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"hasSum_zeta_two","end_line":456,"library":"mathlib","line":453,"location_key":"d8b1380ab803ac8c4299ea69b7856cdd84211b3c8f1deb83cb407956f39cc1f4","module":"Mathlib.NumberTheory.ZetaValues","note":null,"pair_key":"2d120b6b9a6fee824bb35b7e44f92bae37a650708d330310880dd4ac8174c252","path":"Mathlib/NumberTheory/ZetaValues.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem hasSum_zeta_two : HasSum (fun n ↦ 1 / ↑n ^ 2) (π ^ 2 / 6)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"41bd2c294a69c32dc1e4a157ea5d297f42a87382fc9b08baa74772004b7edb00","prominence":"central","quote":{"exact":"Euler showed that ⁠ ζ ( 2 ) = π 2 /"},"quote_capped":true,"section":["Analytic properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Euler showed that ⁠ ζ ( 2 ) = π 2 / 6 {\\displaystyle \\zeta (2)=\\pi ^{2}/6} ⁠.[75]","segments":[{"text":"Euler showed that ⁠ "},{"tex":"\\zeta (2)=\\pi ^{2}/6"},{"text":" ⁠."},{"ref":"[75]"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":5,"sha256":"9a1d0b8f9ca22eb917f0e04a4d1b20ea8a33b28e90cd01b5596a0b12fd7dca46"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #68d281e8","item":"In-text #68d281e8","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"riemannZeta_two","end_line":230,"library":"mathlib","line":226,"location_key":"68aef9b25739f71e930edf074b595aa5d7f7169bdcdac857c661f6143002ede3","module":"Mathlib.NumberTheory.LSeries.HurwitzZetaValues","note":null,"pair_key":"4ee797113c02ecb6de57d5f735e36cc40ffc566a8a06d82dffaec8fe204c87bb","path":"Mathlib/NumberTheory/LSeries/HurwitzZetaValues.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem riemannZeta_two : riemannZeta 2 = ↑π ^ 2 / 6"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"39517a54c8db8a3dd4360ea925eea4c6c986aaf0873f7229bff633cfa7769a31","prominence":"central","quote":{"exact":"The reciprocal of this number, ⁠ 6 / π 2 {\\displaystyle 6/\\pi"},"quote_capped":true,"section":["Analytic properties"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"The reciprocal of this number, ⁠ 6 / π 2 {\\displaystyle 6/\\pi ^{2}} ⁠, is the limiting probability that two random numbers selected uniformly from a large range are relatively prime (have no factors in common).","segments":[{"text":"The reciprocal of this number, ⁠ "},{"tex":"6/\\pi ^{2}"},{"text":" ⁠, is the limiting probability that two random numbers selected uniformly from a large range are relatively prime (have no factors in common)."}]},"unresolved":null},{"absence":null,"basis":"abfd5652ffc863430d7ffcfee899fcbb994937682cc2b23ab37cd7cf43a4841a","coverage":null,"id":"enwiki-23666-1373534600::In-text #ebed986a","item":"In-text #ebed986a","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.forall_exists_prime_gt_and_zmodEq","end_line":458,"library":"mathlib","line":451,"location_key":"abfd5652ffc863430d7ffcfee899fcbb994937682cc2b23ab37cd7cf43a4841a","module":"Mathlib.NumberTheory.LSeries.PrimesInAP","note":"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.","pair_key":"07759c44904a465932b2baf796130a60763b03f30cc85a8a42d57ae29cbbf889","path":"Mathlib/NumberTheory/LSeries/PrimesInAP.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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]"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.infinite_setOfPred_prime_and_modEq","end_line":477,"library":"mathlib","line":475,"location_key":"ffd06a21c8fb01a25d8f9a5187290cf9b0f9607ab0c187e8f744f552b92b6cd1","module":"Mathlib.NumberTheory.LSeries.PrimesInAP","note":"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.","pair_key":"aabd868af9d49fe407443ca1fc2d2a1de2ba2d7471139ad77856115483f161c9","path":"Mathlib/NumberTheory/LSeries/PrimesInAP.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.infinite_setOfPred_prime_and_modEq {q a : ℕ} : q ≠ 0 → a.Coprime q → {p | Nat.Prime p ∧ p ≡ a [MOD q]}.Infinite"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MetaMathlibExt.NumberTheory.PrimeCounting.dirichlet_density_primes_arithmetic_progression","library":"atlas","line":515,"location_key":"cc8d6d8ccb99d3186c676e888923042de03258cc744ceebb2ef06d8d72df1816","module":"MathlibExt.NumberTheory.PrimeCounting.DirichletDensityArithmeticProgression","note":null,"pair_key":"772e9e0417c545651b4e8c4070c95d6eab194876aca8dfd318ca6c9ff107cc78","path":"MathlibExt/NumberTheory/PrimeCounting/DirichletDensityArithmeticProgression.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MetaMathlibExt.NumberTheory.PrimeCounting.dirichlet_density_primes_arithmetic_progression (a m : ℕ) : 0 < m → a.Coprime m → Filter.Tendsto (fun s ↦ (∑' (p : { p // Nat.Prime p ∧ p ≡ a [MOD m] }), ↑↑p ^ (-s)) / ∑' (p : { p // Nat.Prime p }), ↑↑p ^ (-s)) (𝓝[>] 1) (𝓝 (1 / ↑m.totient))"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a8146dcb011e6b5c42eab696133ab414f0abf5c20bcb6efc764ec06c28426cf9","prominence":"central","quote":{"exact":"Dirichlet's theorem on arithmetic progressions, in its basic form, asserts that linear"},"quote_capped":true,"section":["Analytic properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Dirichlet's theorem on arithmetic progressions, in its basic form, asserts that linear polynomials p ( n ) = a + b n {\\displaystyle p(n)=a+bn} with relatively prime integers ⁠ a {\\displaystyle a} ⁠ and ⁠ b {\\displaystyle b} ⁠ take infinitely many prime values.","segments":[{"text":"Dirichlet's theorem on arithmetic progressions, in its basic form, asserts that linear polynomials "},{"tex":"p(n)=a+bn"},{"text":" with relatively prime integers ⁠ "},{"tex":"a"},{"text":" ⁠ and ⁠ "},{"tex":"b"},{"text":" ⁠ take infinitely many prime values."}]},"unresolved":null},{"absence":null,"basis":"114dcb88d5cb15e46581b0334ed35cd378490382f96654d7326101d7e665c265","coverage":null,"id":"enwiki-23666-1373534600::In-text #32e7394a","item":"In-text #32e7394a","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.Primes.not_summable_one_div","end_line":125,"library":"mathlib","line":124,"location_key":"114dcb88d5cb15e46581b0334ed35cd378490382f96654d7326101d7e665c265","module":"Mathlib.NumberTheory.SumPrimeReciprocals","note":"Mathlib records the divergence of this positive series as the failure of summability over the subtype of primes.","pair_key":"22af5d24bb4dfe05e3a8d3226703383c9742b061aaea9f636872cd0c7ef57c61","path":"Mathlib/NumberTheory/SumPrimeReciprocals.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.Primes.not_summable_one_div : ¬Summable fun p ↦ 1 / ↑↑p"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"not_summable_one_div_on_primes","end_line":120,"library":"mathlib","line":102,"location_key":"d485ba08c0a5101babbd6c37483c7bc4bde3ca40da545f5d5d2cf57ab3d0f699","module":"Mathlib.NumberTheory.SumPrimeReciprocals","note":"Here the same divergence is written with an indicator on the primes inside a sum over all naturals, rather than over a subtype.","pair_key":"ebdb8b810415ac61ce9ce0e0529cbda1f87b6798a4656ac9e85313a085cf5537","path":"Mathlib/NumberTheory/SumPrimeReciprocals.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem not_summable_one_div_on_primes : ¬Summable ({p | Nat.Prime p}.indicator fun n ↦ 1 / ↑n)"},"statement":false},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"Erdos726.erdos_726.variants.mertens_estimate","end_line":60,"library":"formal-conjectures","line":57,"location_key":"2f9d96af62e2f011611105410847b00d1bd48f637c2c85206ff56114978c25b9","module":"FormalConjectures.ErdosProblems.«726»","note":null,"pair_key":"ed81d70289a90e4ad84f83a1d0dad1ef0dcd1537e989c676dbd69b29d1102e52","path":"FormalConjectures/ErdosProblems/726.lean","proof_status":"statement_only","rank":3,"relation":"relatedMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem Erdos726.erdos_726.variants.mertens_estimate : Asymptotics.IsEquivalent Filter.atTop (fun n ↦ ∑ p ∈ Finset.range (n + 1) with Nat.Prime p, 1 / ↑p) fun n ↦ Real.log (Real.log ↑n)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"db0defbba24ee5a5eec6fb835225733858b15e453739153a08b6f3f4c13137b4","prominence":"central","quote":{"exact":"Euler showed that, for any arbitrary real number ⁠ x {\\displaystyle x}"},"quote_capped":true,"section":["Analytic properties","Analytical proof of Euclid's theorem"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Euler showed that, for any arbitrary real number ⁠ x {\\displaystyle x} ⁠, there exists a prime ⁠ p {\\displaystyle p} ⁠ for which this sum is greater than ⁠ x {\\displaystyle x} ⁠.[77]","segments":[{"text":"Euler showed that, for any arbitrary real number ⁠ "},{"tex":"x"},{"text":" ⁠, there exists a prime ⁠ "},{"tex":"p"},{"text":" ⁠ for which this sum is greater than ⁠ "},{"tex":"x"},{"text":" ⁠."},{"ref":"[77]"}]},"unresolved":null},{"absence":null,"basis":"ae1d726479d7b9e358d5da97c2308e6eff62e86f6bd980d393ac1a65d2cd542a","coverage":null,"id":"enwiki-23666-1373534600::In-text #f5d1b15b","item":"In-text #f5d1b15b","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"hasSum_zeta_two","end_line":456,"library":"mathlib","line":453,"location_key":"ae1d726479d7b9e358d5da97c2308e6eff62e86f6bd980d393ac1a65d2cd542a","module":"Mathlib.NumberTheory.ZetaValues","note":"The declaration pins the limit at the square of pi over six, which gives the boundedness the passage records and more besides.","pair_key":"7ec1ccd593ffd043f45d910ad2031d02c44554fa8da0ee8b2a9ed3271c926e76","path":"Mathlib/NumberTheory/ZetaValues.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem hasSum_zeta_two : HasSum (fun n ↦ 1 / ↑n ^ 2) (π ^ 2 / 6)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.summable_one_div_nat_pow","end_line":332,"library":"mathlib","line":330,"location_key":"367d6ca9ad35b2f18d21eeb56e243f5dabcb9b099e2ec96f071ab774d03933f0","module":"Mathlib.Analysis.PSeries","note":"The declaration is an equivalence covering every exponent, and the passage uses its consequence at the exponent two.","pair_key":"4d69d1946406a232b7f16f55206e621df8d3e48e6ca5793c32ca8b39069d402e","path":"Mathlib/Analysis/PSeries.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.summable_one_div_nat_pow {p : ℕ} : (Summable fun n ↦ 1 / ↑n ^ p) ↔ 1 < p"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7561ca29d8b408c3dfb690baa8d0150e859fef8e97fecfa570de4905cb0a8b20","prominence":"supporting","quote":{"exact":"For comparison, the sum 1 1 2 + 1 2 2 +"},"quote_capped":true,"section":["Analytic properties","Analytical proof of Euclid's theorem"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"For comparison, the sum 1 1 2 + 1 2 2 + 1 3 2 + ⋯ + 1 n 2 {\\displaystyle {\\frac {1}{1^{2}}}+{\\frac {1}{2^{2}}}+{\\frac {1}{3^{2}}}+\\cdots +{\\frac {1}{n^{2}}}} does not grow to infinity as ⁠ n {\\displaystyle n} ⁠ goes to infinity (see the Basel problem).","segments":[{"text":"For comparison, the sum "},{"tex":"{\\frac {1}{1^{2}}}+{\\frac {1}{2^{2}}}+{\\frac {1}{3^{2}}}+\\cdots +{\\frac {1}{n^{2}}}"},{"text":" does not grow to infinity as ⁠ "},{"tex":"n"},{"text":" ⁠ goes to infinity (see the Basel problem)."}]},"unresolved":null},{"absence":null,"basis":"ac648787a5119135654ffc6e9a3d45c7d54d3e62e2d24d5ffda5ce60e92be2f8","coverage":null,"id":"enwiki-23666-1373534600::In-text #81b68605","item":"In-text #81b68605","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.NumberTheory.PrimeCounting.summable_brunTwinPrimeReciprocalTerm","library":"atlas","line":46,"location_key":"ac648787a5119135654ffc6e9a3d45c7d54d3e62e2d24d5ffda5ce60e92be2f8","module":"MathlibExt.NumberTheory.PrimeCounting.BrunConstant","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.","pair_key":"ef178f8c03be5e10ff6c81e8979824b456a69cfdbd779f033e06838f1a95f25a","path":"MathlibExt/NumberTheory/PrimeCounting/BrunConstant.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.NumberTheory.PrimeCounting.summable_brunTwinPrimeReciprocalTerm : Summable MathlibExt.NumberTheory.PrimeCounting.brunTwinPrimeReciprocalTerm"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.NumberTheory.PrimeCounting.BrunTwinPrimeReciprocalsWanted.brun_twin_prime_reciprocal_series_summable","library":"atlas","line":1325,"location_key":"89486424680a23896d8cd39cb5cafe8da2f642b1fd528d99f86552245ac7ad78","module":"MathlibExt.NumberTheory.PrimeCounting.BrunTwinPrimeReciprocals","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.","pair_key":"c73dc5690dc70493fdc5857d776d454c4518a7e07943b2d94e15f8f9ec416ea2","path":"MathlibExt/NumberTheory/PrimeCounting/BrunTwinPrimeReciprocals.lean","proof_status":"proved","rank":2,"relation":"exactMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.NumberTheory.PrimeCounting.hasSum_brunConstant","library":"atlas","line":55,"location_key":"6bc6b05c5678c9476554bdf12e6b5448abb55bcc5487e4639ef9d28e0f7e9a58","module":"MathlibExt.NumberTheory.PrimeCounting.BrunConstant","note":"It fixes the value of the sum, a real number called Brun's constant, and the passage asserts only that such a value exists.","pair_key":"24392e5da8ddad0d866dcdf0d65ed3efe72428ed8f4e904d0440a5970d8af67b","path":"MathlibExt/NumberTheory/PrimeCounting/BrunConstant.lean","proof_status":"proved","rank":3,"relation":"broadMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.NumberTheory.PrimeCounting.hasSum_brunConstant : HasSum MathlibExt.NumberTheory.PrimeCounting.brunTwinPrimeReciprocalTerm MathlibExt.NumberTheory.PrimeCounting.brunConstant"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"fda2c8cc6c4b016216e6b71f8e5f449b37494922133f7815f1f084cbbf484e57","prominence":"central","quote":{"exact":"Brun's theorem states that the sum of the reciprocals of twin primes,"},"quote_capped":true,"section":["Analytic properties","Analytical proof of Euclid's theorem"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Brun's theorem states that the sum of the reciprocals of twin primes, ( 1 3 + 1 5 ) + ( 1 5 + 1 7 ) + ( 1 11 + 1 13 ) + ⋯ , {\\displaystyle \\left({{\\frac {1}{3}}+{\\frac {1}{5}}}\\right)+\\left({{\\frac {1}{5}}+{\\frac {1}{7}}}\\right)+\\left({{\\frac {1}{11}}+{\\frac {1}{13}}}\\right)+\\cdots ,} is finite.","segments":[{"text":"Brun's theorem states that the sum of the reciprocals of twin primes, "},{"tex":"\\left({{\\frac {1}{3}}+{\\frac {1}{5}}}\\right)+\\left({{\\frac {1}{5}}+{\\frac {1}{7}}}\\right)+\\left({{\\frac {1}{11}}+{\\frac {1}{13}}}\\right)+\\cdots ,"},{"text":" is finite."}]},"unresolved":null},{"absence":null,"basis":"edcb56fb62a781a53f099e05a19c66e65143862af2cc2bf688ebf1dff263e74a","coverage":null,"id":"enwiki-23666-1373534600::In-text #4c21e4eb","item":"In-text #4c21e4eb","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.primeCounting","end_line":58,"library":"mathlib","line":57,"location_key":"edcb56fb62a781a53f099e05a19c66e65143862af2cc2bf688ebf1dff263e74a","module":"Mathlib.NumberTheory.PrimeCounting","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.","pair_key":"b7ddcbaaadb7fcd0b4591f57cf144b7ddff5ff55be61c49df4e504ef54e0ba04","path":"Mathlib/NumberTheory/PrimeCounting.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.primeCounting : ℕ → ℕ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.primesLE_card_eq_primeCounting","end_line":262,"library":"mathlib","line":261,"location_key":"85982d02e10ba86d1eb322c0ae8facb1dcf5dcbbd94ccdb4ba29f72d56b8f3ac","module":"Mathlib.NumberTheory.PrimeCounting","note":"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.","pair_key":"ae2a893ffa4ebf74059050d53c28661ebb962c556e8385d6a732c0602090c5e5","path":"Mathlib/NumberTheory/PrimeCounting.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.primesLE_card_eq_primeCounting (n : ℕ) : n.primesLE.card = n.primeCounting"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d49a4769bd8846c497a6abe7d31356b6f7a1d4861723f2793c1883cfe87a5b6f","prominence":"central","quote":{"exact":"The prime-counting function π ( n ) {\\displaystyle \\pi (n)} is defined"},"quote_capped":true,"section":["Analytic properties","Number of primes below a given bound"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"The prime-counting function π ( n ) {\\displaystyle \\pi (n)} is defined as the number of primes not greater than ⁠ n {\\displaystyle n} ⁠.[80]","segments":[{"text":"The prime-counting function "},{"tex":"\\pi (n)"},{"text":" is defined as the number of primes not greater than ⁠ "},{"tex":"n"},{"text":" ⁠."},{"ref":"[80]"}]},"unresolved":null},{"absence":null,"basis":"5e0d66e318ecf1d8b8c9083de0a3b31f203f4dd7b2fc09e05826641a05d88bf7","coverage":null,"id":"enwiki-23666-1373534600::In-text #c4584603","item":"In-text #c4584603","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.primesLE_card_eq_primeCounting","end_line":262,"library":"mathlib","line":261,"location_key":"5e0d66e318ecf1d8b8c9083de0a3b31f203f4dd7b2fc09e05826641a05d88bf7","module":"Mathlib.NumberTheory.PrimeCounting","note":"The equation holds at every bound, and at eleven both sides evaluate, giving the number the passage reads off.","pair_key":"c3b2db74a120714885c69411b1af90de2720dacfc63c10a94b0f8e6465a399b0","path":"Mathlib/NumberTheory/PrimeCounting.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.primesLE_card_eq_primeCounting (n : ℕ) : n.primesLE.card = n.primeCounting"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"55691abb3da2ac68ca167274bb3ea18c6bd2dfb8ade263c5b48dda437a005d31","prominence":"supporting","quote":{"exact":"For example, ⁠ π ( 11 ) = 5 {\\displaystyle \\pi (11)=5}"},"quote_capped":true,"section":["Analytic properties","Number of primes below a given bound"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"For example, ⁠ π ( 11 ) = 5 {\\displaystyle \\pi (11)=5} ⁠, since there are five primes less than or equal to 11.","segments":[{"text":"For example, ⁠ "},{"tex":"\\pi (11)=5"},{"text":" ⁠, since there are five primes less than or equal to 11."}]},"unresolved":null},{"absence":null,"basis":"862a39aab5441046feac5dca9cb7a838ec48c0fbbcec36cdbbb77c9bb0f596fd","coverage":null,"id":"enwiki-23666-1373534600::In-text #bdd39efb","item":"In-text #bdd39efb","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.NumberTheory.PrimeNumberTheoremWanted.prime_number_theorem","library":"atlas","line":183,"location_key":"862a39aab5441046feac5dca9cb7a838ec48c0fbbcec36cdbbb77c9bb0f596fd","module":"MathlibExt.NumberTheory.PrimeNumberTheorem","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.","pair_key":"cda065dfa00a385454427f4ea8a7eb65dbc9bac965b074710b52dcf3963482c0","path":"MathlibExt/NumberTheory/PrimeNumberTheorem.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.NumberTheory.PrimeNumberTheoremWanted.prime_number_theorem : Asymptotics.IsEquivalent Filter.atTop (fun n ↦ ↑n.primeCounting) fun n ↦ ↑n / Real.log ↑n"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"Chebyshev.primeCounting_isEquivalent_iff_theta_isEquivalent","library":"atlas","line":95,"location_key":"0bcb239026ae9d4dcdd44eba28547a2edb407d6a8e594d60d4455d0ba5a02f1e","module":"MathlibExt.NumberTheory.PrimeCounting.Chebyshev","note":"It trades the passage's asymptotic for the corresponding one about Chebyshev's first function, which is a different assertion.","pair_key":"a92e15ce80b6000d99f5f7b8fbad247992768da0ffc116e2a621c7995552f179","path":"MathlibExt/NumberTheory/PrimeCounting/Chebyshev.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem Chebyshev.primeCounting_isEquivalent_iff_theta_isEquivalent : (Asymptotics.IsEquivalent Filter.atTop (fun x ↦ ↑⌊x⌋₊.primeCounting) fun x ↦ x / Real.log x) ↔ Asymptotics.IsEquivalent Filter.atTop Chebyshev.theta fun x ↦ x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"80939f3b2a561ed436c8817bdfb6d904389ed1f0bf613d3041af43e5e459c6e2","prominence":"central","quote":{"exact":"The prime number theorem states that π ( n ) {\\displaystyle \\pi"},"quote_capped":true,"section":["Analytic properties","Number of primes below a given bound"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"The prime number theorem states that π ( n ) {\\displaystyle \\pi (n)} is asymptotic to ⁠ n / log ⁡ n {\\displaystyle n/\\log n} ⁠, which is denoted as π ( n ) ∼ n log ⁡ n , {\\displaystyle \\pi (n)\\sim {\\frac {n}{\\log n}},} and means that the ratio of π ( n ) {\\displaystyle \\pi (n)} to the right-hand fraction approaches 1 as ⁠ n {\\displaystyle n} ⁠ grows to infinity.[82]","segments":[{"text":"The prime number theorem states that "},{"tex":"\\pi (n)"},{"text":" is asymptotic to ⁠ "},{"tex":"n/\\log n"},{"text":" ⁠, which is denoted as "},{"tex":"\\pi (n)\\sim {\\frac {n}{\\log n}},"},{"text":" and means that the ratio of "},{"tex":"\\pi (n)"},{"text":" to the right-hand fraction approaches 1 as ⁠ "},{"tex":"n"},{"text":" ⁠ grows to infinity."},{"ref":"[82]"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":3,"sha256":"ce5febdf380f3b9df12e3d6ea6f745ca4399bf4670c79fd051b8ad7db292d6e1"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #ab792ab0","item":"In-text #ab792ab0","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"b92fa046404f6171825732fb6712b8af71a635603ea09d01b8e7ee60df287ce2","prominence":"supporting","quote":{"exact":"This implies that the likelihood that a randomly chosen number less than"},"quote_capped":true,"section":["Analytic properties","Number of primes below a given bound"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"This implies that the likelihood that a randomly chosen number less than ⁠ n {\\displaystyle n} ⁠ is prime is (approximately) inversely proportional to the number of digits in ⁠ n {\\displaystyle n} ⁠.[83]","segments":[{"text":"This implies that the likelihood that a randomly chosen number less than ⁠ "},{"tex":"n"},{"text":" ⁠ is prime is (approximately) inversely proportional to the number of digits in ⁠ "},{"tex":"n"},{"text":" ⁠."},{"ref":"[83]"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":4,"queries":4,"sha256":"43d058f6ce61287800f74f094f495302fc37330bff4bd6d5ee6410bbd3ae3eae"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #62f5f6b2","item":"In-text #62f5f6b2","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"33de287b48f334267dbbe64b16020e3268d184b36125d28195a063a12b0b245a","prominence":"supporting","quote":{"exact":"It also implies that the ⁠ n {\\displaystyle n} ⁠th prime number"},"quote_capped":true,"section":["Analytic properties","Number of primes below a given bound"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"It also implies that the ⁠ n {\\displaystyle n} ⁠th prime number is proportional to n log ⁡ n {\\displaystyle n\\log n} [84] and therefore that the average size of a prime gap is proportional to ⁠ log ⁡ n {\\displaystyle \\log n} ⁠.[69]","segments":[{"text":"It also implies that the ⁠ "},{"tex":"n"},{"text":" ⁠th prime number is proportional to "},{"tex":"n\\log n"},{"text":" "},{"ref":"[84]"},{"text":" and therefore that the average size of a prime gap is proportional to ⁠ "},{"tex":"\\log n"},{"text":" ⁠."},{"ref":"[69]"}]},"unresolved":null},{"absence":null,"basis":"5fc72840522a6fa8a2d65b6dd7c96183f1fceec91852a95696ba5a4ecbf58bb1","coverage":null,"id":"enwiki-23666-1373534600::In-text #6666409d","item":"In-text #6666409d","kind":"theorem","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.primeIdealTheorem","end_line":43,"library":"tauceti","line":39,"location_key":"5fc72840522a6fa8a2d65b6dd7c96183f1fceec91852a95696ba5a4ecbf58bb1","module":"TauCeti.NumberTheory.ArithmeticDirichletSeries.Prime.PrimeIdealTheorem","note":"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.","pair_key":"d1ce15c39092d8ee2bd591b2d911d4d56c4bd12a39a51631bb4a3e37f6ae0c26","path":"TauCeti/NumberTheory/ArithmeticDirichletSeries/Prime/PrimeIdealTheorem.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"NumberField.Chebotarev.primeCount_primesCongruent_isEquivalent_logIntegral","end_line":59,"library":"tauceti","line":50,"location_key":"0cc9ebcd09f1ac38c75b6fa3607c1acad1abb4c98ebbec328c7608b1949e00f8","module":"TauCeti.NumberTheory.Chebotarev.PrimeCounting.PrimesCongruent","note":"It counts the rational primes lying in a fixed residue class against a fraction of the offset logarithmic integral, which is a finer assertion than the passage's unrestricted one.","pair_key":"f5a8aa9cf045e7e0c5193f604a6e26a824f91a7f07e24b546a764e5c522e9a75","path":"TauCeti/NumberTheory/Chebotarev/PrimeCounting/PrimesCongruent.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem NumberField.Chebotarev.primeCount_primesCongruent_isEquivalent_logIntegral (m a : ℕ) [NeZero m] : IsUnit ↑a → Asymptotics.IsEquivalent Filter.atTop (fun x ↦ TauCeti.primeCount ℚ {p | Ideal.absNorm p.asIdeal % m = a % m} x) fun x ↦ 1 / ↑m.totient * TauCeti.Real.logIntegral x"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.Real.logIntegral","end_line":133,"library":"tauceti","line":133,"location_key":"280c4751caece8c9ce83f1f5041ee3d0a2cb965edd896b7ddb556d32800d76a0","module":"TauCeti.Analysis.SpecialFunctions.LogIntegral","note":"It is the offset logarithmic integral itself, the integral of the reciprocal logarithm from two, and asserts no estimate for the prime count.","pair_key":"074eecaab6a1cd7bb5274e68d4e8e4e243e6749d5dd294f97337a83b78cc7d33","path":"TauCeti/Analysis/SpecialFunctions/LogIntegral.lean","proof_status":"definition","rank":3,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def TauCeti.Real.logIntegral : ℝ → ℝ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"634a495079aa576ba4a90dc2d8bbf61c334ed363799aa5cdf4c219f61df8f7ee","prominence":"central","quote":{"exact":"A more accurate estimate for π ( n ) {\\displaystyle \\pi (n)}"},"quote_capped":true,"section":["Analytic properties","Number of primes below a given bound"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"A more accurate estimate for π ( n ) {\\displaystyle \\pi (n)} is given by the offset logarithmic integral[82] π ( n ) ∼ Li ⁡ ( n ) = ∫ 2 n d t log ⁡ t . {\\displaystyle \\pi (n)\\sim \\operatorname {Li} (n)=\\int _{2}^{n}{\\frac {dt}{\\log t}}.}","segments":[{"text":"A more accurate estimate for "},{"tex":"\\pi (n)"},{"text":" is given by the offset logarithmic integral"},{"ref":"[82]"},{"text":" "},{"tex":"\\pi (n)\\sim \\operatorname {Li} (n)=\\int _{2}^{n}{\\frac {dt}{\\log t}}."}]},"unresolved":null},{"absence":null,"basis":"17c91b596b9e9840dbac5dab9dcd1e1e2148367e1c1000da999d1f07f8e082c6","coverage":null,"id":"enwiki-23666-1373534600::In-text #f660beb9","item":"In-text #f660beb9","kind":"definition","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"Set.IsAPOfLength","library":"atlas","line":35,"location_key":"17c91b596b9e9840dbac5dab9dcd1e1e2148367e1c1000da999d1f07f8e082c6","module":"MathlibExt.Combinatorics.AP.Basic","note":"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.","pair_key":"aadaebb9db1394d43dc4b91837aa009f896db25393ff55a45e729a5308665454","path":"MathlibExt/Combinatorics/AP/Basic.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def Set.IsAPOfLength {α : Type*} [AddCommMonoid α] : Set α → ℕ∞ → Prop"},"statement":true},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"Set.IsAPOfLength","end_line":123,"library":"formal-conjectures","line":122,"location_key":"d50fb975e8d710cbda7310c76a189e3b67e120e9158dd1ea8e6313ab07667ec2","module":"FormalConjecturesForMathlib.Combinatorics.AP.Basic","note":"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.","pair_key":"9da86f10bb23b1210d19584fb39aba6a814632e4fba22ff04f9add341b15bfce","path":"FormalConjecturesForMathlib/Combinatorics/AP/Basic.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def Set.IsAPOfLength {α : Type*} [AddCommMonoid α] : Set α → ℕ∞ → Prop"},"statement":true},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"low","declaration":"List.IsAPOfLength","library":"atlas","line":59,"location_key":"c45b0f81da350e98d33bbb222b186919439629494734dbf5a90d198176f774b5","module":"MathlibExt.Combinatorics.AP.Basic","note":"The list-valued form of the predicate, whose length is an ordinary count, so it reaches the finite runs only.","pair_key":"de43a5bdaedd62470599a2a0cb8457bfb96f64aeb0bf2756e28df79fba5aff48","path":"MathlibExt/Combinatorics/AP/Basic.lean","proof_status":"definition","rank":3,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def List.IsAPOfLength {α : Type*} [AddCommMonoid α] : List α → ℕ → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"671d269ab75303490c4b50f777ddafbae0deccfff34f6e30f41fcc61ee1dfdc8","prominence":"central","quote":{"exact":"An arithmetic progression is a finite or infinite sequence of numbers such"},"quote_capped":true,"section":["Analytic properties","Arithmetic progressions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"An arithmetic progression is a finite or infinite sequence of numbers such that consecutive numbers in the sequence all have the same difference.[85]","segments":[{"text":"An arithmetic progression is a finite or infinite sequence of numbers such that consecutive numbers in the sequence all have the same difference."},{"ref":"[85]"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"569b4bcc54c8c602b636e8f2ea2561a1f3f52f905f8a15430e518b4be93caa8e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #2b1a452a","item":"In-text #2b1a452a","kind":"notation","locations":[{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"Set.IsAPOfLengthWith","library":"atlas","line":31,"location_key":"ef1c6245ecd47bcae216719bfcb7793d6fb76450ff193a3e51642dcf1fa2b5e9","module":"MathlibExt.Combinatorics.AP.Basic","note":"It carries the step of a progression as a parameter of the predicate instead of naming that step as an object attached to the progression.","pair_key":"f853ca339b01213ceb5cd034c8c82c30328432c478e38448411490116eb53743","path":"MathlibExt/Combinatorics/AP/Basic.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def Set.IsAPOfLengthWith {α : Type*} [AddCommMonoid α] : Set α → ℕ∞ → α → α → Prop"},"statement":true}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"36bca20fabfcac67ab22eaf7f9b40f59f4362e283a8bfc8f66c54004eaa708e5","prominence":"supporting","quote":{"exact":"This difference is called the modulus of the progression.[86]"},"quote_capped":false,"section":["Analytic properties","Arithmetic progressions"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"This difference is called the modulus of the progression.[86]","segments":[{"text":"This difference is called the modulus of the progression."},{"ref":"[86]"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"0f7d17325c6d8c13861ec98947a2f69e3ede7a3bedcac6d7a9b0077485f87252"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #78d0623b","item":"In-text #78d0623b","kind":"example","locations":[{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"Set.IsAPOfLengthWith","library":"atlas","line":31,"location_key":"4072ea15049fad8291362457da240aaf4bbbebc69860057826c91270e80eac4b","module":"MathlibExt.Combinatorics.AP.Basic","note":"It defines what it is for a set to be a progression of a given length with a given first term and step, over any additive commutative monoid.","pair_key":"ff22d5481244eb40c606e323e99f8a12d73b3564097f1345cf156d89b3959439","path":"MathlibExt/Combinatorics/AP/Basic.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def Set.IsAPOfLengthWith {α : Type*} [AddCommMonoid α] : Set α → ℕ∞ → α → α → Prop"},"statement":true}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"161e5b8e439a872310d3b4997eaf60724dad026c7dfe9e7422317f33cb3235dd","prominence":"supporting","quote":{"exact":"For example, 3 , 12 , 21 , 30 , 39 ,"},"quote_capped":true,"section":["Analytic properties","Arithmetic progressions"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"For example, 3 , 12 , 21 , 30 , 39 , . . . , {\\displaystyle 3,12,21,30,39,...,} is an infinite arithmetic progression with modulus 9.","segments":[{"text":"For example, "},{"tex":"3,12,21,30,39,...,"},{"text":" is an infinite arithmetic progression with modulus 9."}]},"unresolved":null},{"absence":null,"basis":"351cadbefe0dc09b1f3c5f422a7e85a593b27a80db2aa093cd28fae38afc81b9","coverage":null,"id":"enwiki-23666-1373534600::In-text #5ce256f7","item":"In-text #5ce256f7","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.add_mul_mod_self_left","end_line":348,"library":"lean-core","line":345,"location_key":"351cadbefe0dc09b1f3c5f422a7e85a593b27a80db2aa093cd28fae38afc81b9","module":"Init.Data.Nat.Div.Basic","note":"Lean writes a term of the progression as the first term plus the index times the modulus, and the remainder with the percent operator.","pair_key":"9e328e18ba18601f845566aeeb81c5584f9ec1645b79bb676b7dba1e93f0b5bf","path":"src/Init/Data/Nat/Div/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.add_mul_mod_self_left (x y z : Nat) : (x + y * z) % y = x % y"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Int.modEq_add_fac_self","end_line":370,"library":"mathlib","line":370,"location_key":"e1dc1dcbfae96928bf2f0b4923cb0ad051aea28205f48f2cff9bf8fbca8dd1c0","module":"Mathlib.Data.Int.ModEq","note":"Mathlib phrases the claim as a congruence to the modulus, which unfolds to the two remainders being equal, and states it over the integers.","pair_key":"2f3bb80dab8ac826dbcd88468320fff8145e91a6120ecc8ec8003262dcb72de6","path":"Mathlib/Data/Int/ModEq.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Int.modEq_add_fac_self {a t n : ℤ} : a + n * t ≡ a [ZMOD n]"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"fb4e9c80650d8a197e684c880cf5d145fb5bc400abc437da94441487bd713b0a","prominence":"supporting","quote":{"exact":"In an arithmetic progression, all the numbers have the same remainder when"},"quote_capped":true,"section":["Analytic properties","Arithmetic progressions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":"; in this example, the remainder is 3.","segments":[{"text":"; in this example, the remainder is 3."}]},"layer":"In an arithmetic progression, all the numbers have the same remainder when divided by the modulus","segments":[{"text":"In an arithmetic progression, all the numbers have the same remainder when divided by the modulus"}]},"unresolved":null},{"absence":null,"basis":"f4159f6665b203cb1efcf2d9889b6e196ad4caadad60f31ba12c504ab0657f7a","coverage":null,"id":"enwiki-23666-1373534600::In-text #9a15a1c4","item":"In-text #9a15a1c4","kind":"example","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Nat.add_mul_mod_self_left","end_line":348,"library":"lean-core","line":345,"location_key":"f4159f6665b203cb1efcf2d9889b6e196ad4caadad60f31ba12c504ab0657f7a","module":"Init.Data.Nat.Div.Basic","note":"Lean's percent operator is the remainder, and the term is written as three plus the index times nine.","pair_key":"1d94b13eca5065361e0a7c9d84c5bbe252002f2b54b53520f4bf88de7f722fba","path":"src/Init/Data/Nat/Div/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.add_mul_mod_self_left (x y z : Nat) : (x + y * z) % y = x % y"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.ModEq.modulus_mul_add","end_line":135,"library":"mathlib","line":135,"location_key":"bf42576de5d1c0bf1403e35d1bda4905b2d7f097c9dd835d07943ee7817997d9","module":"Mathlib.Data.Nat.ModEq","note":"Mathlib writes the terms as nine times the index plus three and phrases the claim as a congruence to the modulus.","pair_key":"b7c87d905b5b8114a7fac5baacdfa3ab7f09a4cd32af6e3152efeb962cf5220b","path":"Mathlib/Data/Nat/ModEq.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.ModEq.modulus_mul_add {m a b : ℕ} : m * a + b ≡ b [MOD m]"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c89988e20f7a4578a368db29cb2b7a3d0ee955729a074b5460fb2a8162034820","prominence":"supporting","quote":{"exact":"in this example, the remainder is 3."},"quote_capped":false,"section":["Analytic properties","Arithmetic progressions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"In an arithmetic progression, all the numbers have the same remainder when divided by the modulus; ","segments":[{"text":"In an arithmetic progression, all the numbers have the same remainder when divided by the modulus; "}]},"layer":"in this example, the remainder is 3.","segments":[{"text":"in this example, the remainder is 3."}]},"unresolved":null},{"absence":null,"basis":"413bdb4d3f85d708d45146410b6a1d351e18ca8902424fedfca2289f99dae21a","coverage":null,"id":"enwiki-23666-1373534600::In-text #2f67a641","item":"In-text #2f67a641","kind":"theorem","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"Nat.dvd_add_mul_self","end_line":26,"library":"formal-conjectures","line":25,"location_key":"413bdb4d3f85d708d45146410b6a1d351e18ca8902424fedfca2289f99dae21a","module":"FormalConjecturesForMathlib.Data.Nat.Init","note":"Lean states the criterion as an equivalence in the naturals; the modulus nine of this example enters as three times three times the index.","pair_key":"d5cd71ece0d9d9b84687e5448111e0a5182e6a147c1ef7b850b5aeeb2bfb2872","path":"FormalConjecturesForMathlib/Data/Nat/Init.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem Nat.dvd_add_mul_self {a b c : ℕ} : a ∣ b + c * a ↔ a ∣ b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f6ab313a29945e6be42c7637eca669390dcae8cf97ddce1ee6effa9953cd8777","prominence":"supporting","quote":{"exact":"Because both the modulus 9 and the remainder 3 are multiples of"},"quote_capped":true,"section":["Analytic properties","Arithmetic progressions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Because both the modulus 9 and the remainder 3 are multiples of 3, so is every element in the sequence.","segments":[{"text":"Because both the modulus 9 and the remainder 3 are multiples of 3, so is every element in the sequence."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"39c3f64291adeeee4f4de5badfd69cb40ee6ab5e063582f09d33638917cb1801"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #f56f697f","item":"In-text #f56f697f","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.Prime.dvd_iff_eq","end_line":39,"library":"mathlib","line":34,"location_key":"9a0d46a3d68a2432352bfee35f5fdc95a12b24d40da39e89fded9911438cece6","module":"Mathlib.Data.Nat.Prime.Basic","note":"It fixes which numbers may divide a prime, and by itself it says nothing about the sequence of the example or about how many primes it holds.","pair_key":"d80e8c2d3e03f0ec0bbb56d245dbb2a59aa777a1c0c0e2ca7b76ac14c16eef96","path":"Mathlib/Data/Nat/Prime/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.Prime.dvd_iff_eq {p a : ℕ} : Nat.Prime p → a ≠ 1 → (a ∣ p ↔ p = a)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"bea2ae93d683d0875368b4308a4ddfea72fbc4ef526ff2bf38470026fc3f4fc9","prominence":"supporting","quote":{"exact":"Therefore, this progression contains only one prime number, 3 itself."},"quote_capped":false,"section":["Analytic properties","Arithmetic progressions"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Therefore, this progression contains only one prime number, 3 itself.","segments":[{"text":"Therefore, this progression contains only one prime number, 3 itself."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"c0afeed3ac85f8b1d96bb62df2f2ec1af8a4cfdb2fa02c33d2c6fd7959291a8f"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #ae916db3","item":"In-text #ae916db3","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.Prime.not_coprime_iff_dvd","end_line":140,"library":"mathlib","line":132,"location_key":"071fc802151c6c14f43091c16ffa738e807a894141ee9316157bbb1f83f4154b","module":"Mathlib.Data.Nat.Prime.Basic","note":"It yields a prime dividing both numbers whenever they fail to be coprime, which is where an argument towards the passage would begin.","pair_key":"35889f32dcf7755dabefb1ce01a124d2569bcfa5349c53d86dbfd84a01457c2a","path":"Mathlib/Data/Nat/Prime/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.Prime.not_coprime_iff_dvd {m n : ℕ} : ¬m.Coprime n ↔ ∃ p, Nat.Prime p ∧ p ∣ m ∧ p ∣ n"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"c194a939dd7ff908b27c456fec50ca65e367a9cc143d43a216f7cf863a059a30","prominence":"central","quote":{"exact":"In general, the infinite progression a , a + q , a"},"quote_capped":true,"section":["Analytic properties","Arithmetic progressions"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"In general, the infinite progression a , a + q , a + 2 q , a + 3 q , … {\\displaystyle a,a+q,a+2q,a+3q,\\dots } can have more than one prime only when its remainder ⁠ a {\\displaystyle a} ⁠ and modulus ⁠ q {\\displaystyle q} ⁠ are relatively prime.","segments":[{"text":"In general, the infinite progression "},{"tex":"a,a+q,a+2q,a+3q,\\dots"},{"text":" can have more than one prime only when its remainder ⁠ "},{"tex":"a"},{"text":" ⁠ and modulus ⁠ "},{"tex":"q"},{"text":" ⁠ are relatively prime."}]},"unresolved":null},{"absence":null,"basis":"741df75661cf2d19845fdef8ac2111400d8a06ab2db8579679763b257c9320d7","coverage":null,"id":"enwiki-23666-1373534600::In-text #ca24b607","item":"In-text #ca24b607","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.infinite_setOfPred_prime_and_modEq","end_line":477,"library":"mathlib","line":475,"location_key":"741df75661cf2d19845fdef8ac2111400d8a06ab2db8579679763b257c9320d7","module":"Mathlib.NumberTheory.LSeries.PrimesInAP","note":"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.","pair_key":"e40fd84fe13bcee072a184ddd555ada0f0a78b40aa27a020389c990755323311","path":"Mathlib/NumberTheory/LSeries/PrimesInAP.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.infinite_setOfPred_prime_and_modEq {q a : ℕ} : q ≠ 0 → a.Coprime q → {p | Nat.Prime p ∧ p ≡ a [MOD q]}.Infinite"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.forall_exists_prime_gt_and_modEq","end_line":465,"library":"mathlib","line":463,"location_key":"8595b0676b5ecd8340f273dd19a888cff1077a7eb673785ae3a9a74c08edef4a","module":"Mathlib.NumberTheory.LSeries.PrimesInAP","note":"Mathlib names the terms by their residue class to the modulus q and says infinitude by producing such a prime above each bound.","pair_key":"5c89bb52bc2ba09431c0a8c5f3210d42a3ee4dfb7df75488d62c34d0ed4c7d6f","path":"Mathlib/NumberTheory/LSeries/PrimesInAP.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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]"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.infinite_setOfPred_prime_and_eq_mod","end_line":435,"library":"mathlib","line":431,"location_key":"5717fc374c47cbaf12b13b6d8f5e63a37c23eb7fcc12acf9946aa8fbb9ea8c66","module":"Mathlib.NumberTheory.LSeries.PrimesInAP","note":"Mathlib names the class in the ring of residues modulo q and writes coprimality as that class being a unit there.","pair_key":"4661a68cbc5bea7eff9634a3512cc1b5582771abd43591188fc5e66592b44cab","path":"Mathlib/NumberTheory/LSeries/PrimesInAP.lean","proof_status":"proved","rank":3,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.infinite_setOfPred_prime_and_eq_mod {q : ℕ} [NeZero q] {a : ZMod q} : IsUnit a → {p | Nat.Prime p ∧ ↑p = a}.Infinite"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"5209e3fcdcc44a51485e712d5af0dcfb9d9063f5e70c7f4b38c0f4b95699a4e4","prominence":"central","quote":{"exact":"If they are relatively prime, Dirichlet's theorem on arithmetic progressions asserts that"},"quote_capped":true,"section":["Analytic properties","Arithmetic progressions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"If they are relatively prime, Dirichlet's theorem on arithmetic progressions asserts that the progression contains infinitely many primes.","segments":[{"text":"If they are relatively prime, Dirichlet's theorem on arithmetic progressions asserts that the progression contains infinitely many primes."}]},"unresolved":null},{"absence":null,"basis":"425302082a8cb2b41fdcc7c693cea33b7b324626d6c31e8cd41a78087b39c860","coverage":null,"id":"enwiki-23666-1373534600::In-text #99ed0fbc","item":"In-text #99ed0fbc","kind":"theorem","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"Erdos219.erdos_219","end_line":81,"library":"formal-conjectures","line":80,"location_key":"425302082a8cb2b41fdcc7c693cea33b7b324626d6c31e8cd41a78087b39c860","module":"FormalConjectures.ErdosProblems.«219»","note":"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.","pair_key":"909d6cc0e1cc1e683be702bf5ff84f0f7319a616c1c06728c5c9b418a1bd2ee1","path":"FormalConjectures/ErdosProblems/219.lean","proof_status":"statement_only","rank":1,"relation":"closeMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem Erdos219.erdos_219 (N : ℕ) : ∃ l ∈ Erdos219.primeArithmeticProgressions, ↑N ≤ ENat.card ↑l"},"statement":false},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"Erdos1187.erdos_1187.parts.i","end_line":51,"library":"formal-conjectures","line":47,"location_key":"d53c02b718c7d2a89cb65b5ac32e131644113de3144ce7793b25467c187110c6","module":"FormalConjectures.ErdosProblems.«1187»","note":"The library result additionally asks that the progression be monochromatic for an arbitrary finite colouring of the integers.","pair_key":"a296fefafd46c1dd420028fe0831e3fddc34903fc2a04dbf088912db03a69854","path":"FormalConjectures/ErdosProblems/1187.lean","proof_status":"statement_only","rank":2,"relation":"broadMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"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 = γ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"bc39f448555292d6768841e5e128b8a5620ce667d2eea7596d3d9d02da657bd9","prominence":"central","quote":{"exact":"The Green–Tao theorem shows that there are arbitrarily long finite arithmetic progressions"},"quote_capped":true,"section":["Analytic properties","Arithmetic progressions"],"status":"statement_only","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"The Green–Tao theorem shows that there are arbitrarily long finite arithmetic progressions consisting only of primes.","segments":[{"text":"The Green–Tao theorem shows that there are arbitrarily long finite arithmetic progressions consisting only of primes."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":6,"sha256":"34c65efcc209e37d315dab3ddafe9868e2cbdb2885ace6ea44bba9e17fa446f8"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #649bc182","item":"In-text #649bc182","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"7f02f212f047209a5f63b1618c80c8469f552eec437c7ae2f46bd49697768ec1","prominence":"central","quote":{"exact":"Euler noted that the function n 2 − n + 41 {\\displaystyle"},"quote_capped":true,"section":["Analytic properties","Prime values of quadratic polynomials"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Euler noted that the function n 2 − n + 41 {\\displaystyle n^{2}-n+41} yields prime numbers for ⁠ 1 ≤ n ≤ 40 {\\displaystyle 1\\leq n\\leq 40} ⁠, although composite numbers appear among its later values.[89][90]","segments":[{"text":"Euler noted that the function "},{"tex":"n^{2}-n+41"},{"text":" yields prime numbers for ⁠ "},{"tex":"1\\leq n\\leq 40"},{"text":" ⁠, although composite numbers appear among its later values."},{"ref":"[89][90]"}]},"unresolved":null},{"absence":null,"basis":"7d6571d93d3d1a0d3236a27ee566934149c8a32b93657c8bf04d6b2411310345","coverage":null,"id":"enwiki-23666-1373534600::In-text #b2f22f99","item":"In-text #b2f22f99","kind":"conjecture","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"Bunyakovsky.bunyakovsky_conjecture","end_line":40,"library":"formal-conjectures","line":37,"location_key":"7d6571d93d3d1a0d3236a27ee566934149c8a32b93657c8bf04d6b2411310345","module":"FormalConjectures.Wikipedia.Bunyakovsky","note":"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.","pair_key":"760ebf7f33f233821129c9cee8e865c38d5efc055b3ce89f8309a5e46aac96a8","path":"FormalConjectures/Wikipedia/Bunyakovsky.lean","proof_status":"statement_only","rank":1,"relation":"closeMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem Bunyakovsky.bunyakovsky_conjecture (f : ℤ[X]) : BunyakovskyCondition f ∧ SchinzelCondition {f} → Infinite ↑{n | Nat.Prime (Polynomial.eval (↑n) f).natAbs}"},"statement":false},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"Schinzel.schinzel_conjecture","end_line":39,"library":"formal-conjectures","line":37,"location_key":"4116ea37d593abe540423c06786b61aba9433a64ba3245b8b33105a6c25064c2","module":"FormalConjectures.Wikipedia.Schinzel","note":"The library states the hypothesis for an arbitrary finite family of integer polynomials, asking all of them to be prime simultaneously.","pair_key":"8a1ccfcb2bac6155f3a173aaa08aeed67acdc77d9829700a0d9f3c5ad4e9a0d3","path":"FormalConjectures/Wikipedia/Schinzel.lean","proof_status":"statement_only","rank":2,"relation":"broadMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem Schinzel.schinzel_conjecture (fs : Finset (ℤ[X])) : (∀ f ∈ fs, BunyakovskyCondition f) → SchinzelCondition fs → Infinite ↑{n | ∀ f ∈ fs, Nat.Prime (Polynomial.eval (↑n) f).natAbs}"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"44a6d21b9a834b7ee38e8715fb3dfac5d933e779a156241fba4c6cb558dbc8e7","prominence":"central","quote":{"exact":"Russian mathematician Viktor Bunyakovsky in 1857 conjectured that any one-variable polynomial f"},"quote_capped":true,"section":["Analytic properties","Prime values of quadratic polynomials"],"status":"statement_only","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Russian mathematician Viktor Bunyakovsky in 1857 conjectured that any one-variable polynomial f ( x ) {\\displaystyle f(x)} with integer coefficients would produce infinitely many primes in the sequence f ( 1 ) , f ( 2 ) , f ( 3 ) , … {\\displaystyle f(1),f(2),f(3),\\dots } . 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.","segments":[{"text":"Russian mathematician Viktor Bunyakovsky in 1857 conjectured that any one-variable polynomial "},{"tex":"f(x)"},{"text":" with integer coefficients would produce infinitely many primes in the sequence "},{"tex":"f(1),f(2),f(3),\\dots"},{"text":" . 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."}]},"unresolved":null},{"absence":null,"basis":"0bd435022a7d45ccdb7a0c02b26dcc59c38bcfef3ad1113d660cacabb2053eae","coverage":null,"id":"enwiki-23666-1373534600::In-text #1a49265e","item":"In-text #1a49265e","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"analyticOn_riemannZeta","end_line":148,"library":"mathlib","line":146,"location_key":"0bd435022a7d45ccdb7a0c02b26dcc59c38bcfef3ad1113d660cacabb2053eae","module":"Mathlib.NumberTheory.LSeries.RiemannZeta","note":"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.","pair_key":"ac95c94c3a34a3e1b708d2f3e33a645c7287098e9489dbde98654c74cbbc67e6","path":"Mathlib/NumberTheory/LSeries/RiemannZeta.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem analyticOn_riemannZeta : AnalyticOnNhd ℂ riemannZeta {1}ᶜ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"differentiableOn_riemannZeta","end_line":144,"library":"mathlib","line":142,"location_key":"f374b51f23f397b1b0858039e199ca11fe9d9abf3eb73b1768d5003057ff6b62","module":"Mathlib.NumberTheory.LSeries.RiemannZeta","note":"The library phrases the same restricted regularity as differentiability on a set rather than as analyticity.","pair_key":"6c779a48d1c3b446b0515736ca1ecc1371c7f2906a6a7bbaf1b60c262baf86c6","path":"Mathlib/NumberTheory/LSeries/RiemannZeta.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem differentiableOn_riemannZeta : DifferentiableOn ℂ riemannZeta {1}ᶜ"},"statement":false},{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"meromorphicOn_riemannZeta","library":"atlas","line":25,"location_key":"106ec07c4b9b2f69a5542f33c5be33a0a2888114e16cbd54628dba31073f94b6","module":"MathlibExt.NumberTheory.LSeries.RiemannZeta","note":"The library states meromorphy of the zeta function on the whole plane, which is a different property from the analyticity the passage asserts.","pair_key":"1df3ce17f9a704c2fa63cce7e5caebe13daa89eee801d40d54739f697b506356","path":"MathlibExt/NumberTheory/LSeries/RiemannZeta.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem meromorphicOn_riemannZeta : MeromorphicOn riemannZeta Set.univ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d958b8870cce9477a8f1435d816e26f05607214a1df969b2d6e20c1a4243bb77","prominence":"supporting","quote":{"exact":"This function is an analytic function on the complex numbers.[95]"},"quote_capped":false,"section":["Analytic properties","Zeta function and the Riemann hypothesis"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"This function is an analytic function on the complex numbers.[95]","segments":[{"text":"This function is an analytic function on the complex numbers."},{"ref":"[95]"}]},"unresolved":null},{"absence":null,"basis":"01c7129387d11910ac28a3f5997a1a3d696606a1db05640da400494b61f85c32","coverage":null,"id":"enwiki-23666-1373534600::In-text #ff9a33ec","item":"In-text #ff9a33ec","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"riemannZeta_eulerProduct_tprod","end_line":100,"library":"mathlib","line":98,"location_key":"01c7129387d11910ac28a3f5997a1a3d696606a1db05640da400494b61f85c32","module":"Mathlib.NumberTheory.EulerProduct.DirichletLSeries","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.","pair_key":"760794ccb911cdbd0e0a7b7d9d58ced0ce6d6ea2e796eeeb985eabfd82fa3fd7","path":"Mathlib/NumberTheory/EulerProduct/DirichletLSeries.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem riemannZeta_eulerProduct_tprod {s : ℂ} : 1 < s.re → ∏' (p : Nat.Primes), (1 - ↑↑p ^ (-s))⁻¹ = riemannZeta s"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"zeta_eq_tsum_one_div_nat_cpow","end_line":210,"library":"mathlib","line":207,"location_key":"194a7d3ef44249bcc7e6e522d45557ddff7982a65934c320fc2eaaa7ec570176","module":"Mathlib.NumberTheory.LSeries.RiemannZeta","note":"This states the middle term of the passage's chain, the zeta value as a sum over naturals, which the chain passes through rather than asserts.","pair_key":"3f26f2965ffdf2000d3df141bbb7c8270b807977f8f3582d2663311eadf226f0","path":"Mathlib/NumberTheory/LSeries/RiemannZeta.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem zeta_eq_tsum_one_div_nat_cpow {s : ℂ} : 1 < s.re → riemannZeta s = ∑' (n : ℕ), 1 / ↑n ^ s"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7a3b3254b10ac04ad67164acb1286829adf014d429bc7c4bc2e2f4af5f2ba7a3","prominence":"central","quote":{"exact":"For complex numbers ⁠ s {\\displaystyle s} ⁠ with real part greater"},"quote_capped":true,"section":["Analytic properties","Zeta function and the Riemann hypothesis"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":" This equality between a sum and a product, discovered by Euler, is called an Euler product.","segments":[{"text":" This equality between a sum and a product, discovered by Euler, is called an Euler product."}]},"layer":"For complex numbers ⁠ s {\\displaystyle 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 ∞ 1 n s = ∏ p prime 1 1 − p − s . {\\displaystyle \\zeta (s)=\\sum _{n=1}^{\\infty }{\\frac {1}{n^{s}}}=\\prod _{p{\\text{ prime}}}{\\frac {1}{1-p^{-s}}}.}","segments":[{"text":"For complex numbers ⁠ "},{"tex":"s"},{"text":" ⁠ with real part greater than one it equals both an infinite sum over all integers, and an infinite product over the prime numbers, "},{"display":true,"tex":"\\zeta (s)=\\sum _{n=1}^{\\infty }{\\frac {1}{n^{s}}}=\\prod _{p{\\text{ prime}}}{\\frac {1}{1-p^{-s}}}."}]},"unresolved":null},{"absence":null,"basis":"6b94b2e5cbf21784c3a25a8d58796ae00c407c6bbed2784c63dbe716c31fc545","coverage":null,"id":"enwiki-23666-1373534600::In-text #de62c15e","item":"In-text #de62c15e","kind":"notation","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"riemannZeta_eulerProduct_tprod","end_line":100,"library":"mathlib","line":98,"location_key":"6b94b2e5cbf21784c3a25a8d58796ae00c407c6bbed2784c63dbe716c31fc545","module":"Mathlib.NumberTheory.EulerProduct.DirichletLSeries","note":"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.","pair_key":"c270058d5e892884b10db0bfd20dd5d75c4de4f45b11f4e71a57a7124397fed0","path":"Mathlib/NumberTheory/EulerProduct/DirichletLSeries.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem riemannZeta_eulerProduct_tprod {s : ℂ} : 1 < s.re → ∏' (p : Nat.Primes), (1 - ↑↑p ^ (-s))⁻¹ = riemannZeta s"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"EulerProduct.eulerProduct_completely_multiplicative_tprod","end_line":359,"library":"mathlib","line":357,"location_key":"e9b6b7f19622b094e38a1aa4a61cd677e5cfa4fc710c04120d0254ab64606d61","module":"Mathlib.NumberTheory.EulerProduct.Basic","note":"The library's general identity between a sum over naturals and a product over primes for a completely multiplicative summable function; reaching the zeta case from it needs the separate lemma identifying the zeta value with the sum.","pair_key":"7f4398c8607e1707c0c1c9b53de960a56a33632b0b477ef723860327d41a9f69","path":"Mathlib/NumberTheory/EulerProduct/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem EulerProduct.eulerProduct_completely_multiplicative_tprod {F : Type*} [NormedField F] [CompleteSpace F] {f : ℕ →*₀ F} : (Summable fun x ↦ ‖f x‖) → ∏' (p : Nat.Primes), (1 - f ↑p)⁻¹ = ∑' (n : ℕ), f n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e977efa8012f1eba15c227ca9e20e650e921c7b333d9d2542fbaba80c2d0d701","prominence":"supporting","quote":{"exact":"This equality between a sum and a product, discovered by Euler, is"},"quote_capped":true,"section":["Analytic properties","Zeta function and the Riemann hypothesis"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"s {\\displaystyle 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 ∞ 1 n s = ∏ p prime 1 1 − p − s . {\\displaystyle \\zeta (s)=\\sum _{n=1}^{\\infty }{\\frac {1}{n^{s}}}=\\prod _{p{\\text{ prime}}}{\\frac {1}{1-p^{-s}}}.} ","segments":[{"tex":"s"},{"text":" ⁠ with real part greater than one it equals both an infinite sum over all integers, and an infinite product over the prime numbers, "},{"display":true,"tex":"\\zeta (s)=\\sum _{n=1}^{\\infty }{\\frac {1}{n^{s}}}=\\prod _{p{\\text{ prime}}}{\\frac {1}{1-p^{-s}}}."},{"text":" "}],"trimmed":true},"layer":"This equality between a sum and a product, discovered by Euler, is called an Euler product.[96]","segments":[{"text":"This equality between a sum and a product, discovered by Euler, is called an Euler product."},{"ref":"[96]"}]},"unresolved":null},{"absence":null,"basis":"46a747dc91f598e490d399d7a3916c0e81ab8726fd1d785977951289412439c8","coverage":null,"id":"enwiki-23666-1373534600::In-text #6cef9a18","item":"In-text #6cef9a18","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.not_summable_one_div_natCast","end_line":358,"library":"mathlib","line":357,"location_key":"46a747dc91f598e490d399d7a3916c0e81ab8726fd1d785977951289412439c8","module":"Mathlib.Analysis.PSeries","note":"Lean sums over all the naturals and the term at zero is zero by its division convention, so the convergence question decided here is the passage's own.","pair_key":"6236a3a2f6a757db31422df502224c8114fc820b405ab8b131030adde5392953","path":"Mathlib/Analysis/PSeries.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.not_summable_one_div_natCast : ¬Summable fun n ↦ 1 / ↑n"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.tendsto_sum_range_one_div_nat_succ_atTop","end_line":365,"library":"mathlib","line":361,"location_key":"1b8702585382e27eae1f491d7443f53ae9c1d2488ccc5ee4de6d2d39c5543705","module":"Mathlib.Analysis.PSeries","note":"Lean indexes the terms from zero as one over i plus one and concludes that the partial sums grow without bound, which says more than non-convergence.","pair_key":"b0b2bec6ebb4fe1994bb61c678d3a053899fd1edcb8fc4672f7c0b2bda963d16","path":"Mathlib/Analysis/PSeries.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"1e7fe50ff4cab1557842f11b624dd93bbcb3769d736061cfb16534ea81b62fb4","prominence":"supporting","quote":{"exact":"the sum would diverge (it is the harmonic series ⁠ 1 +"},"quote_capped":true,"section":["Analytic properties","Zeta function and the Riemann hypothesis"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"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 {\\displaystyle s=1} ⁠, but ","segments":[{"text":"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 ⁠ "},{"tex":"s=1"},{"text":" ⁠, but "}]},"layer":"the sum would diverge (it is the harmonic series ⁠ 1 + 1 2 + 1 3 + … {\\displaystyle 1+{\\tfrac {1}{2}}+{\\tfrac {1}{3}}+\\dots } ⁠) while the product would be finite, a contradiction.","segments":[{"text":"the sum would diverge (it is the harmonic series ⁠ "},{"tex":"1+{\\tfrac {1}{2}}+{\\tfrac {1}{3}}+\\dots"},{"text":" ⁠) while the product would be finite, a contradiction."}]},"unresolved":null},{"absence":null,"basis":"4eba920eb7f5bf28014e04fe86537d800c7074b5ea2ff6139c6063e2074f57ea","coverage":null,"id":"enwiki-23666-1373534600::In-text #330973ef","item":"In-text #330973ef","kind":"conjecture","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"RiemannHypothesis","end_line":186,"library":"mathlib","line":185,"location_key":"4eba920eb7f5bf28014e04fe86537d800c7074b5ea2ff6139c6063e2074f57ea","module":"Mathlib.NumberTheory.LSeries.RiemannZeta","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.","pair_key":"3c868cc2414906eea5772891cff42a1f3cd62459b3c1c36076c51cfc18f40d08","path":"Mathlib/NumberTheory/LSeries/RiemannZeta.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def RiemannHypothesis : Prop"},"statement":true},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"RiemannHypothesis.riemannHypothesis","end_line":62,"library":"formal-conjectures","line":61,"location_key":"044be8e103ee66cca16ec59f05d6080ad397adea70d841464e22c703c09eb22d","module":"FormalConjectures.Millennium.RiemannHypothesis","note":"The conjecture library asserts the same proposition that Mathlib defines for the zeros of the zeta function.","pair_key":"59a5d03d021c56b6869dbfcf1068b3e127c829bd1cbde46c357aed90c0803c3d","path":"FormalConjectures/Millennium/RiemannHypothesis.lean","proof_status":"statement_only","rank":2,"relation":"exactMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem RiemannHypothesis.riemannHypothesis : RiemannHypothesis"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"987d59d3099ee129b59018f4ea860bbb41fa193f045e8a9a8dfdc9c14019b457","prominence":"central","quote":{"exact":"The Riemann hypothesis states that the zeros of the zeta-function are all"},"quote_capped":true,"section":["Analytic properties","Zeta function and the Riemann hypothesis"],"status":"statement_only","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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]","segments":[{"text":"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."},{"ref":"[99]"}]},"unresolved":null},{"absence":null,"basis":"89731daacdc73ba074d26a7af381883040b598d2ac79f1fd77eb0b9323b8bcde","coverage":null,"id":"enwiki-23666-1373534600::In-text #8300bc9c","item":"In-text #8300bc9c","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"riemannZeta_ne_zero_of_one_le_re","end_line":414,"library":"mathlib","line":410,"location_key":"89731daacdc73ba074d26a7af381883040b598d2ac79f1fd77eb0b9323b8bcde","module":"Mathlib.NumberTheory.LSeries.Nonvanishing","note":"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.","pair_key":"d9a6d19cf50b18b5bb45da5151badb7221376b950a358ff6a379ac270d1dc71d","path":"Mathlib/NumberTheory/LSeries/Nonvanishing.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem riemannZeta_ne_zero_of_one_le_re ⦃s : ℂ⦄ : 1 ≤ s.re → riemannZeta s ≠ 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"565881836980d7a0e28b02fa3979e604f1242a6ed3794df5261dcb6e7c0bf43a","prominence":"supporting","quote":{"exact":"The original proof of the prime number theorem was based on a"},"quote_capped":true,"section":["Analytic properties","Zeta function and the Riemann hypothesis"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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]","segments":[{"text":"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,"},{"ref":"[100][101]"},{"text":" although other more elementary proofs have been found."},{"ref":"[102]"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"2aee391e907ad9b7281be055a09ca51a2fb06bb2c3df1b9081a604bc84945117"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #eb65aa6c","item":"In-text #eb65aa6c","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"73a52eaeeac53c488bf6004af4484ba69a6daeb56fcbfdcb6c76ec2551cc9489","prominence":"central","quote":{"exact":"The prime-counting function can be expressed by Riemann's explicit formula as a"},"quote_capped":true,"section":["Analytic properties","Zeta function and the Riemann hypothesis"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":"; 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.","segments":[{"text":"; 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."}]},"layer":"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","segments":[{"text":"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"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"05cac48b1528982da0fdc9734831eb036df222311e0801ad79a562718964faa9"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #70bb83f7","item":"In-text #70bb83f7","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"b985ebf88a84bbd2196027365eb4a7d61a9707a4344bba07d566741ed71c02c0","prominence":"supporting","quote":{"exact":"the main term of this sum is the logarithmic integral"},"quote_capped":false,"section":["Analytic properties","Zeta function and the Riemann hypothesis"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":", and the remaining terms cause the sum to fluctuate above and below the main term.","segments":[{"text":", and the remaining terms cause the sum to fluctuate above and below the main term."}]},"before":{"layer":"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; ","segments":[{"text":"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; "}]},"layer":"the main term of this sum is the logarithmic integral","segments":[{"text":"the main term of this sum is the logarithmic integral"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"ed657af561a037ba58dcaf61270f8309943c784c88090b89dc39e6ce8be3ac80"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #8e46c803","item":"In-text #8e46c803","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"32a8ff31a38f6861ae303d52bb44fe5449b565dfce93f97026d80c8d03ed51c2","prominence":"supporting","quote":{"exact":"the remaining terms cause the sum to fluctuate above and below the"},"quote_capped":true,"section":["Analytic properties","Zeta function and the Riemann hypothesis"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"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 ","segments":[{"text":"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 "}]},"layer":"the remaining terms cause the sum to fluctuate above and below the main term.","segments":[{"text":"the remaining terms cause the sum to fluctuate above and below the main term."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":4,"queries":5,"sha256":"78abf154f18bea1f991de851928a95bd9c6fb363477b05a89d4532209fa6cf3c"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #f3a1ffd0","item":"In-text #f3a1ffd0","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"cbcb63cd2c41126df2259c49ae20e6e2d73e199c94466338693ce8bc5e2115a0","prominence":"central","quote":{"exact":"If the Riemann hypothesis is true, these fluctuations will be small, and"},"quote_capped":true,"section":["Analytic properties","Zeta function and the Riemann hypothesis"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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 {\\displaystyle x} ⁠ for intervals near a number ⁠ x {\\displaystyle x} ⁠).","segments":[{"text":"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 ⁠ "},{"tex":"x"},{"text":" ⁠ for intervals near a number ⁠ "},{"tex":"x"},{"text":" ⁠)."}]},"unresolved":null},{"absence":null,"basis":"2489a1d377ec46267ee445cd4cd2627a01ff26ae2d1276ef4c4cd661bbb4d4df","coverage":null,"id":"enwiki-23666-1373534600::In-text #0e3820bc","item":"In-text #0e3820bc","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ZMod","end_line":141,"library":"mathlib","line":139,"location_key":"2489a1d377ec46267ee445cd4cd2627a01ff26ae2d1276ef4c4cd661bbb4d4df","module":"Mathlib.Data.ZMod.Defs","note":"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.","pair_key":"95c9c8826fddeb1b4f803ab648556ce467642eb60c25310bfa284b72b2fb3def","path":"Mathlib/Data/ZMod/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def ZMod : ℕ → Type"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ZMod.val_lt","end_line":64,"library":"mathlib","line":61,"location_key":"5150c2751e45e45da5ce1c3daf9a3c739f9613b87d4c97b4937d6da2a5a718c5","module":"Mathlib.Data.ZMod.Basic","note":"The declaration needs the modulus to be nonzero, which is exactly the range in which the passage's list of numbers exists.","pair_key":"45af70308bf2b53d0f759eea75f022761c26e0c6b9be1bed97be2a6928cc2f7d","path":"Mathlib/Data/ZMod/Basic.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ZMod.val_lt {n : ℕ} [NeZero n] (a : ZMod n) : a.val < n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f68980fb0a2ddc3b69dde06bfb79a0e76dde92a8daac32b195ff648184c6a3a4","prominence":"central","quote":{"exact":"Modular arithmetic modifies usual arithmetic by only using the numbers ⁠ {"},"quote_capped":true,"section":["Abstract algebra","Modular arithmetic and finite fields"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Modular arithmetic modifies usual arithmetic by only using the numbers ⁠ { 0 , 1 , 2 , … , n − 1 } {\\displaystyle \\{0,1,2,\\dots ,n-1\\}} ⁠, for a natural number ⁠ n {\\displaystyle n} ⁠ called the modulus.","segments":[{"text":"Modular arithmetic modifies usual arithmetic by only using the numbers ⁠ "},{"tex":"\\{0,1,2,\\dots ,n-1\\}"},{"text":" ⁠, for a natural number ⁠ "},{"tex":"n"},{"text":" ⁠ called the modulus."}]},"unresolved":null},{"absence":null,"basis":"e471968d09be6f6a1f6d1e08dc35bee5321eb5c63fba21c38411e7f0f2ca48e5","coverage":null,"id":"enwiki-23666-1373534600::In-text #b7e8a374","item":"In-text #b7e8a374","kind":"construction","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ZMod.val_natCast","end_line":93,"library":"mathlib","line":89,"location_key":"e471968d09be6f6a1f6d1e08dc35bee5321eb5c63fba21c38411e7f0f2ca48e5","module":"Mathlib.Data.ZMod.Basic","note":"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.","pair_key":"7e655a94814021173f451d9ddcd06d97cecc8936580d6ac7df11adfaeaeade23","path":"Mathlib/Data/ZMod/Basic.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ZMod.val_natCast (n a : ℕ) : (↑a).val = a % n"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ZMod.natCast_mod","end_line":752,"library":"mathlib","line":751,"location_key":"ecd54a3779d632fca6a1bd695974a28c87da7782e9bd348ad46b6d5967b50227","module":"Mathlib.Data.ZMod.Basic","note":"It says that reducing a natural number before carrying it over changes nothing, which presupposes the carrying rule rather than giving it.","pair_key":"74eee71cc056e71572a5b65950318aab374dba5c2bdba803e1aaec142e1d8672","path":"Mathlib/Data/ZMod/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ZMod.natCast_mod (a n : ℕ) : ↑(a % n) = ↑a"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a2b581b13126a57d12ef66da1165400ab0381c4e4a58b6ce2d713b49d6e593d2","prominence":"supporting","quote":{"exact":"Any other natural number can be mapped into this system by replacing"},"quote_capped":true,"section":["Abstract algebra","Modular arithmetic and finite fields"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Any other natural number can be mapped into this system by replacing it by its remainder after division by ⁠ n {\\displaystyle n} ⁠.[104]","segments":[{"text":"Any other natural number can be mapped into this system by replacing it by its remainder after division by ⁠ "},{"tex":"n"},{"text":" ⁠."},{"ref":"[104]"}]},"unresolved":null},{"absence":null,"basis":"044c08799bf87d645ecf949032c2e2b4e5f8754a8d7b44a580c3d38df5d2e3c6","coverage":null,"id":"enwiki-23666-1373534600::In-text #fa145733","item":"In-text #fa145733","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Fin.add_def","end_line":359,"library":"lean-core","line":359,"location_key":"044c08799bf87d645ecf949032c2e2b4e5f8754a8d7b44a580c3d38df5d2e3c6","module":"Init.Data.Fin.Lemmas","note":"Lean defines addition on the numbers below the modulus by reducing the ordinary sum, and this equation exhibits that rule.","pair_key":"ae72fd8a0c66d71b85fac3159920f5d440c5b446133b96b8e75799eadaa78400","path":"src/Init/Data/Fin/Lemmas.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Fin.add_def {n : Nat} (a b : Fin n) : a + b = ⟨(↑a + ↑b) % n, ⋯⟩"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Fin.mul_def","end_line":32,"library":"lean-core","line":32,"location_key":"08b166d21a033209d58390bd52dd29a2893ed559a09f209e96b5f531854d2443","module":"Init.Data.Fin.Lemmas","note":"Lean defines multiplication on the numbers below the modulus by reducing the ordinary product, and this equation exhibits that rule.","pair_key":"57825500b5b9a2ce22bbdf05fa0ebfbca2c89ea53a3af2886c51a78632ff90a6","path":"src/Init/Data/Fin/Lemmas.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Fin.mul_def {n : Nat} (a b : Fin n) : a * b = ⟨↑a * ↑b % n, ⋯⟩"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Fin.sub_def","end_line":36,"library":"lean-core","line":36,"location_key":"ca1344831c6799c7e6917ef4763f2e5ff9400bd02225eef36b921d86a0125792","module":"Init.Data.Fin.Lemmas","note":"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.","pair_key":"0409e35bb5b58c2a0cd349ebd1a1715fd9aa07b1b6a9b1e9eaa2c3b99afcae8e","path":"src/Init/Data/Fin/Lemmas.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Fin.sub_def {n : Nat} (a b : Fin n) : a - b = ⟨(n - ↑b + ↑a) % n, ⋯⟩"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ZMod.val_add","end_line":654,"library":"mathlib","line":651,"location_key":"da55dc817eed107ca5f4ea2169d586ed090efbdeb1c1e4b1601fa0de3263907e","module":"Mathlib.Data.ZMod.Basic","note":"This is the addition rule stated for Mathlib's type of integers modulo the modulus rather than for the raw numbers below it.","pair_key":"90aab2c0b83abfcfb3d3b417687eb635abc9936f9c1703ff9ac33985d18253aa","path":"Mathlib/Data/ZMod/Basic.lean","proof_status":"proved","rank":4,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ZMod.val_add {n : ℕ} [NeZero n] (a b : ZMod n) : (a + b).val = (a.val + b.val) % n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e57c21b0a8f83d736f4af81667054f3120d6ed0a3e0e1bf368747cb022da6b25","prominence":"supporting","quote":{"exact":"Modular sums, differences and products are calculated by performing the same replacement"},"quote_capped":true,"section":["Abstract algebra","Modular arithmetic and finite fields"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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]","segments":[{"text":"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."},{"ref":"[105]"}]},"unresolved":null},{"absence":null,"basis":"f4440d44429d16edf0e0a7caa279bf126749b6c4bc483ca803591080cb6d5035","coverage":null,"id":"enwiki-23666-1373534600::In-text #400292ac","item":"In-text #400292ac","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Int.ModEq","end_line":32,"library":"mathlib","line":31,"location_key":"f4440d44429d16edf0e0a7caa279bf126749b6c4bc483ca803591080cb6d5035","module":"Mathlib.Data.Int.ModEq","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.","pair_key":"c96567a4c35e4e1e7a16714950a1983e5af6c88833daa49983ee304bb534e2d3","path":"Mathlib/Data/Int/ModEq.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Int.ModEq : ℤ → ℤ → ℤ → Prop"},"statement":true},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.ModEq","end_line":38,"library":"mathlib","line":37,"location_key":"eda30a04fb54f816d53e2438eee4b96e8de792cec010a3b4f84c7a8d3d406040","module":"Mathlib.Data.Nat.ModEq","note":null,"pair_key":"6370c220016ed70e9958d1ce093bf24ef1e95300065f94d9a02b2508dacb4499","path":"Mathlib/Data/Nat/ModEq.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.ModEq : ℕ → ℕ → ℕ → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"81888bc68d4b4732b267c07f7dd40ce5d96e21ebce128ccd655fa95124f31d86","prominence":"central","quote":{"exact":"Equality of integers corresponds to congruence in modular arithmetic: ⁠ x {\\displaystyle"},"quote_capped":true,"section":["Abstract algebra","Modular arithmetic and finite fields"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Equality of integers corresponds to congruence in modular arithmetic: ⁠ x {\\displaystyle x} ⁠ and ⁠ y {\\displaystyle y} ⁠ are congruent (written x ≡ y {\\displaystyle x\\equiv y} mod ⁠ n {\\displaystyle n} ⁠) when they have the same remainder after division by ⁠ n {\\displaystyle n} ⁠.[106]","segments":[{"text":"Equality of integers corresponds to congruence in modular arithmetic: ⁠ "},{"tex":"x"},{"text":" ⁠ and ⁠ "},{"tex":"y"},{"text":" ⁠ are congruent (written "},{"tex":"x\\equiv y"},{"text":" mod ⁠ "},{"tex":"n"},{"text":" ⁠) when they have the same remainder after division by ⁠ "},{"tex":"n"},{"text":" ⁠."},{"ref":"[106]"}]},"unresolved":null},{"absence":null,"basis":"9c0965eabffa531c3e0cc1575905713c85c878c7e184e7d73a6ce69a8e4b5dde","coverage":null,"id":"enwiki-23666-1373534600::In-text #3b3882a7","item":"In-text #3b3882a7","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ZMod.instField","end_line":33,"library":"mathlib","line":27,"location_key":"9c0965eabffa531c3e0cc1575905713c85c878c7e184e7d73a6ce69a8e4b5dde","module":"Mathlib.Algebra.Field.ZMod","note":null,"pair_key":"c76a0e7be5df1631c626d0bd0d6071a6179ad0f76cd67aa79810b463c28c5e41","path":"Mathlib/Algebra/Field/ZMod.lean","proof_status":"definition","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance ZMod.instField (p : ℕ) [hp : Fact (Nat.Prime p)] : Field (ZMod p)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.prime_iff_card_units","end_line":242,"library":"mathlib","line":238,"location_key":"b6f3fdc87fd35f98163dc24d50b658ae6df9ce8d95d751558c327432ad468cd5","module":"Mathlib.Data.Nat.Totient","note":"It equates primality with the count of invertible residues being one less than the modulus; reading that count back as 'all nonzero residues are invertible' takes a counting argument the declaration does not carry.","pair_key":"e4457ab6a9e6b90736d73ea977dd438aaba2eb740772d7f9b4f39ddfee12e1ee","path":"Mathlib/Data/Nat/Totient.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prime_iff_card_units (p : ℕ) [Fintype (ZMod p)ˣ] : Nat.Prime p ↔ Fintype.card (ZMod p)ˣ = p - 1"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"CharP.char_prime_of_ne_zero","end_line":254,"library":"mathlib","line":253,"location_key":"dd5c4ab18d17e4a880e5695fbcb3f384ace4044c63ff8992e48dbf8831430746","module":"Mathlib.Algebra.CharP.Defs","note":"It yields primality of a nonzero characteristic, so it bears on the converse direction, but only after the passage's divisibility hypothesis has first been turned into the absence of zero divisors.","pair_key":"da806eb61cd6b4d8b9ef84689825d04f97c9347125b8304d9726369f3bf5327d","path":"Mathlib/Algebra/CharP/Defs.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem CharP.char_prime_of_ne_zero (R : Type*) [NonAssocSemiring R] [NoZeroDivisors R] [Nontrivial R] {p : ℕ} [CharP R p] : p ≠ 0 → Nat.Prime p"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"1dc45b3c00f6d15111aef8a67ee1f777ab88ab403bb72e1842098917bd7ec77e","prominence":"central","quote":{"exact":"In this system of numbers, division by all nonzero numbers is possible"},"quote_capped":true,"section":["Abstract algebra","Modular arithmetic and finite fields"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"In this system of numbers, division by all nonzero numbers is possible if and only if the modulus is prime.","segments":[{"text":"In this system of numbers, division by all nonzero numbers is possible if and only if the modulus is prime."}]},"unresolved":null},{"absence":null,"basis":"6b5e26e99649a84033430c42f00460bda1032996fd41a7e45d6b7b0bf9b10fd2","coverage":null,"id":"enwiki-23666-1373534600::In-text #6ae0ea64","item":"In-text #6ae0ea64","kind":"example","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ZMod.isUnit_iff_coprime","end_line":818,"library":"mathlib","line":813,"location_key":"6b5e26e99649a84033430c42f00460bda1032996fd41a7e45d6b7b0bf9b10fd2","module":"Mathlib.Data.ZMod.Basic","note":null,"pair_key":"100f30fca25f35bf951158657d9e535cf3335c0508f0936409c868b5e61d2786","path":"Mathlib/Data/ZMod/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ZMod.isUnit_iff_coprime (m n : ℕ) : IsUnit ↑m ↔ m.Coprime n"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ZMod.instField","end_line":33,"library":"mathlib","line":27,"location_key":"707a5ecb8544def6539e14a570ddd2a7ec1a245ca766d95d413129a771e86b21","module":"Mathlib.Algebra.Field.ZMod","note":null,"pair_key":"a65ae108bc5c876412fad5183dd1c129df239aac2f07a71d1ac872e9c2137fc3","path":"Mathlib/Algebra/Field/ZMod.lean","proof_status":"definition","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance ZMod.instField (p : ℕ) [hp : Fact (Nat.Prime p)] : Field (ZMod p)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"5e2117a620e831362d4558842e8a3b96ce848066986e7b82eb05ac3fa5b00e85","prominence":"supporting","quote":{"exact":"For instance, with the prime number 7 as modulus, division by 3"},"quote_capped":true,"section":["Abstract algebra","Modular arithmetic and finite fields"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"For instance, with the prime number 7 as modulus, division by 3 is possible: ⁠ 2 / 3 ≡ 3 mod 7 {\\displaystyle 2/3\\equiv 3{\\bmod {7}}} ⁠, because clearing denominators by multiplying both sides by 3 gives the valid formula ⁠ 2 ≡ 9 mod 7 {\\displaystyle 2\\equiv 9{\\bmod {7}}} ⁠.","segments":[{"text":"For instance, with the prime number 7 as modulus, division by 3 is possible: ⁠ "},{"tex":"2/3\\equiv 3{\\bmod {7}}"},{"text":" ⁠, because clearing denominators by multiplying both sides by 3 gives the valid formula ⁠ "},{"tex":"2\\equiv 9{\\bmod {7}}"},{"text":" ⁠."}]},"unresolved":null},{"absence":null,"basis":"846d717680410291c4c980001efe566a0f3bbf365a9d96698d7877970a1ba9c5","coverage":null,"id":"enwiki-23666-1373534600::In-text #10afb49a","item":"In-text #10afb49a","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ZMod.isUnit_iff_coprime","end_line":818,"library":"mathlib","line":813,"location_key":"846d717680410291c4c980001efe566a0f3bbf365a9d96698d7877970a1ba9c5","module":"Mathlib.Data.ZMod.Basic","note":null,"pair_key":"699dcc2cd42192420943bcb96abe108fa962c3dcb4dc0b257f8206316fc50ced","path":"Mathlib/Data/ZMod/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ZMod.isUnit_iff_coprime (m n : ℕ) : IsUnit ↑m ↔ m.Coprime n"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ZMod.not_isUnit_of_mem_primeFactors","end_line":79,"library":"mathlib","line":76,"location_key":"09dcdfbb3c02a47f036a5daa3b8062dabd594aae01f54b4f8ee4522453dae808","module":"Mathlib.Data.ZMod.Units","note":null,"pair_key":"91ca5752335c85fcde4dc3afb9933617e9fbf6a9357fa07d3683e45d1f7175fe","path":"Mathlib/Data/ZMod/Units.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ZMod.not_isUnit_of_mem_primeFactors {n p : ℕ} : p ∈ n.primeFactors → ¬IsUnit ↑p"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"680e5c4967d5db2eb8d0377736491b25cde31a3a557ba22d152a54d7271b4338","prominence":"supporting","quote":{"exact":"However, with the composite modulus 6, division by 3 is impossible."},"quote_capped":false,"section":["Abstract algebra","Modular arithmetic and finite fields"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"However, with the composite modulus 6, division by 3 is impossible.","segments":[{"text":"However, with the composite modulus 6, division by 3 is impossible."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"9d41bea9979c6e1348b01e0b7f40606ddf6fc80bf85155d780238747fbfd798a"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #1164e929","item":"In-text #1164e929","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"92ae691431434634f924de3242e0e2351e27264466ea7dbdafe229ed2a46d7cb","prominence":"supporting","quote":{"exact":"There is no valid solution to 2 / 3 ≡ x mod"},"quote_capped":true,"section":["Abstract algebra","Modular arithmetic and finite fields"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"There is no valid solution to 2 / 3 ≡ x mod 6 {\\displaystyle 2/3\\equiv x{\\bmod {6}}} : clearing denominators by multiplying by 3 causes the left-hand side to become 2 while the right-hand side becomes either 0 or 3.","segments":[{"text":"There is no valid solution to "},{"tex":"2/3\\equiv x{\\bmod {6}}"},{"text":" : clearing denominators by multiplying by 3 causes the left-hand side to become 2 while the right-hand side becomes either 0 or 3."}]},"unresolved":null},{"absence":null,"basis":"2f43f7d02cfad92b465b0f6201236b5184d7edf6cd1169ec5f5eaa51201a8305","coverage":null,"id":"enwiki-23666-1373534600::In-text #16e10e6b","item":"In-text #16e10e6b","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ZMod.instField","end_line":33,"library":"mathlib","line":27,"location_key":"2f43f7d02cfad92b465b0f6201236b5184d7edf6cd1169ec5f5eaa51201a8305","module":"Mathlib.Algebra.Field.ZMod","note":"It supplies the field structure alone; the finiteness that the first conjunct also asserts is not part of what it states.","pair_key":"a517dc5f274f65b54805fdac884bb6168f42ecc429f27c89c3d9719497e01e74","path":"Mathlib/Algebra/Field/ZMod.lean","proof_status":"definition","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance ZMod.instField (p : ℕ) [hp : Fact (Nat.Prime p)] : Field (ZMod p)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ZMod.fintype","end_line":157,"library":"mathlib","line":155,"location_key":"80fd58b6163efea61cd4c3ff5f7214037b115505804c5bdf670e540040a1ef5e","module":"Mathlib.Data.ZMod.Defs","note":"It supplies finiteness alone and says nothing about the field structure the first conjunct also asserts.","pair_key":"d5d186955b0b80d0b2af5a668c42e4a0034a2378d2269242ee0840a1efe065d2","path":"Mathlib/Data/ZMod/Defs.lean","proof_status":"definition","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance ZMod.fintype (n : ℕ) [NeZero n] : Fintype (ZMod n)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ZMod.commRing","end_line":227,"library":"mathlib","line":172,"location_key":"1346420c13495e197c699140f1c893a2052611fe3eaf80fc982d4cf15c3f8bbe","module":"Mathlib.Data.ZMod.Defs","note":"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.","pair_key":"1b87dfa7c9e507313ebbdc077f44df7382acfecda1122452eaf8b492f0eededb","path":"Mathlib/Data/ZMod/Defs.lean","proof_status":"definition","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance ZMod.commRing (n : ℕ) : CommRing (ZMod n)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ZMod.not_isUnit_of_mem_primeFactors","end_line":79,"library":"mathlib","line":76,"location_key":"90e235c2139895a8e29bf554290fc2fcf3ba42d2fe2b4076d58a4318e9302fee","module":"Mathlib.Data.ZMod.Units","note":"It exhibits a residue without an inverse, but turning that into the failure of the field property also needs that the residue is nonzero and the characterisation of fields by invertibility.","pair_key":"b5d1c8dd6e2eee35e9cb175ba452ef9c8e1c532250d7ef11a5894225ee5ba6d9","path":"Mathlib/Data/ZMod/Units.lean","proof_status":"proved","rank":4,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ZMod.not_isUnit_of_mem_primeFactors {n p : ℕ} : p ∈ n.primeFactors → ¬IsUnit ↑p"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"9bbaf1a2380ef17acabd384a90b56597179439654902e742799c4114d1843d24","prominence":"central","quote":{"exact":"In the terminology of abstract algebra, the ability to perform division means"},"quote_capped":true,"section":["Abstract algebra","Modular arithmetic and finite fields"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"e36799564697c28fe0caa1783bd7d3f3556512bd7e64095cd5cf0b4961bf6173","coverage":null,"id":"enwiki-23666-1373534600::In-text #6db8cf12","item":"In-text #6db8cf12","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Int.ModEq.pow_card_sub_one_eq_one","end_line":615,"library":"mathlib","line":609,"location_key":"e36799564697c28fe0caa1783bd7d3f3556512bd7e64095cd5cf0b4961bf6173","module":"Mathlib.FieldTheory.Finite.Basic","note":"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.","pair_key":"29b08bdba8efdff3d38e92af6e38cc480298caa299b3a0fe5ebbc9ee9d2126ba","path":"Mathlib/FieldTheory/Finite/Basic.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Int.ModEq.pow_card_sub_one_eq_one {p : ℕ} : Nat.Prime p → ∀ {n : ℤ}, IsCoprime n ↑p → n ^ (p - 1) ≡ 1 [ZMOD ↑p]"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ZMod.pow_card_sub_one_eq_one","end_line":583,"library":"mathlib","line":580,"location_key":"45c74ce1853a186bc6253adca1400020763d1a6dd8479d283de109ebd8463887","module":"Mathlib.FieldTheory.Finite.Basic","note":"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.","pair_key":"c4a6355657431b9289f15337ebb88a6c31ee0a14a3fc2a4fdebae4527019ac1e","path":"Mathlib/FieldTheory/Finite/Basic.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ZMod.pow_card_sub_one_eq_one {p : ℕ} [Fact (Nat.Prime p)] {a : ZMod p} : a ≠ 0 → a ^ (p - 1) = 1"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.ModEq.pow_card_sub_one_eq_one","end_line":642,"library":"mathlib","line":639,"location_key":"0a9e2ab7a164d7a14fcc57f1e2ba1cd2b6a30175ee9be5ad7591759cdf075ef6","module":"Mathlib.FieldTheory.Finite.Basic","note":null,"pair_key":"c575aaadd0f5cdaece0dd30fba89d489cd4768e1679af6e442d5d95135cb7674","path":"Mathlib/FieldTheory/Finite/Basic.lean","proof_status":"proved","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.ModEq.pow_card_sub_one_eq_one {p : ℕ} : Nat.Prime p → ∀ {n : ℕ}, n.Coprime p → n ^ (p - 1) ≡ 1 [MOD p]"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6986d43292090172c604ea2629fea9dcb0d0443d98e2b3d3b399aac249bcfe8c","prominence":"central","quote":{"exact":"For instance, Fermat's little theorem states that if a ≢ 0 {\\displaystyle"},"quote_capped":true,"section":["Abstract algebra","Modular arithmetic and finite fields"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"For instance, Fermat's little theorem states that if a ≢ 0 {\\displaystyle a\\not \\equiv 0} (mod ⁠ p {\\displaystyle p} ⁠), then a p − 1 ≡ 1 {\\displaystyle a^{p-1}\\equiv 1} (mod ⁠ p {\\displaystyle p} ⁠).[108]","segments":[{"text":"For instance, Fermat's little theorem states that if "},{"tex":"a\\not \\equiv 0"},{"text":" (mod ⁠ "},{"tex":"p"},{"text":" ⁠), then "},{"tex":"a^{p-1}\\equiv 1"},{"text":" (mod ⁠ "},{"tex":"p"},{"text":" ⁠)."},{"ref":"[108]"}]},"unresolved":null},{"absence":null,"basis":"ad7f5ce053305aa0ea07a2e3b6b4f97984d66d211d85804bc041ec32e6d66b2c","coverage":null,"id":"enwiki-23666-1373534600::In-text #7d5dc2b2","item":"In-text #7d5dc2b2","kind":"theorem","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"AgohGiuga.agoh_giuga.variants.giuga","end_line":71,"library":"formal-conjectures","line":70,"location_key":"ad7f5ce053305aa0ea07a2e3b6b4f97984d66d211d85804bc041ec32e6d66b2c","module":"FormalConjectures.Wikipedia.AgohGiuga","note":null,"pair_key":"1e2f2c98c189ee7b71b07c1a4f2676ef4fb10a36dae4ef3fa462957c5342e2a7","path":"FormalConjectures/Wikipedia/AgohGiuga.lean","proof_status":"statement_only","rank":1,"relation":"broadMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem AgohGiuga.agoh_giuga.variants.giuga : AgohGiuga.AgohGiugaSum"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"FiniteField.sum_pow_units","end_line":308,"library":"mathlib","line":291,"location_key":"8dd881ba79591f229a7067087b513a4b4a24ed302d5e77ba82f0fe7594f12dfd","module":"Mathlib.FieldTheory.Finite.Basic","note":"It sums over the invertible elements of a finite field and gives minus one when the exponent is divisible by one less than the size; matching that sum with the passage's run over the bases from one upward takes a reindexing the declaration does not supply.","pair_key":"230383b9e04af5f1e0cc070fd594b5b3061fd5a9cd12d74d8863d59b131f1946","path":"Mathlib/FieldTheory/Finite/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem FiniteField.sum_pow_units (K : Type*) [Field K] [Fintype K] [DecidableEq K] (i : ℕ) : ∑ x, ↑x ^ i = if Fintype.card K - 1 ∣ i then -1 else 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"1eae2eb343673ccf4cc78d5e13826e6a310b2d4142c643520bc927e707a5d4fc","prominence":"supporting","quote":{"exact":"Summing this over all choices of ⁠ a {\\displaystyle a} ⁠ gives"},"quote_capped":true,"section":["Abstract algebra","Modular arithmetic and finite fields"],"status":"statement_only","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Summing this over all choices of ⁠ a {\\displaystyle a} ⁠ gives the equation ∑ a = 1 p − 1 a p − 1 ≡ ( p − 1 ) ⋅ 1 ≡ − 1 ( mod p ) , {\\displaystyle \\sum _{a=1}^{p-1}a^{p-1}\\equiv (p-1)\\cdot 1\\equiv -1{\\pmod {p}},} valid whenever ⁠ p {\\displaystyle p} ⁠ is prime.","segments":[{"text":"Summing this over all choices of ⁠ "},{"tex":"a"},{"text":" ⁠ gives the equation "},{"tex":"\\sum _{a=1}^{p-1}a^{p-1}\\equiv (p-1)\\cdot 1\\equiv -1{\\pmod {p}},"},{"text":" valid whenever ⁠ "},{"tex":"p"},{"text":" ⁠ is prime."}]},"unresolved":null},{"absence":null,"basis":"6520bd6177c55a7ad1873a646f083ae29f53050f03d5edf6a1d5af985527530b","coverage":null,"id":"enwiki-23666-1373534600::In-text #90258842","item":"In-text #90258842","kind":"conjecture","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"AgohGiuga.agoh_giuga.variants.giuga","end_line":71,"library":"formal-conjectures","line":70,"location_key":"6520bd6177c55a7ad1873a646f083ae29f53050f03d5edf6a1d5af985527530b","module":"FormalConjectures.Wikipedia.AgohGiuga","note":"Lean asserts both directions between primality of p and the power-sum congruence modulo p.","pair_key":"ad1029f91b80cafb82372828ae690505214610a1ac381a4ef805355fb35c09e4","path":"FormalConjectures/Wikipedia/AgohGiuga.lean","proof_status":"statement_only","rank":1,"relation":"broadMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem AgohGiuga.agoh_giuga.variants.giuga : AgohGiuga.AgohGiugaSum"},"statement":false},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"AgohGiuga.AgohGiugaSum","end_line":61,"library":"formal-conjectures","line":60,"location_key":"e1a8eef3798e767ad398874f7bcdffbcf1ae20a5161810365178007ac206a4ed","module":"FormalConjectures.Wikipedia.AgohGiuga","note":"This is the proposition itself, an equivalence between primality and the power-sum congruence.","pair_key":"cea47f12ec7129b28421465cb7e3b6564f293e1a8f7f4b1913289fd2477eefaf","path":"FormalConjectures/Wikipedia/AgohGiuga.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def AgohGiuga.AgohGiugaSum : Prop"},"statement":true},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"AgohGiuga.agoh_giuga","end_line":66,"library":"formal-conjectures","line":65,"location_key":"24c59b6a04bb5c203478b1f728e726e3e13c2a65f40d1648cc932d7334acf54d","module":"FormalConjectures.Wikipedia.AgohGiuga","note":"Agoh's form of the same conjecture uses a Bernoulli number in place of the power sum, so it asserts a different congruence.","pair_key":"1e4363eebc6804f1cef0f7812741bbcea4d85f9c868db7079cf6c34da09a86bd","path":"FormalConjectures/Wikipedia/AgohGiuga.lean","proof_status":"statement_only","rank":3,"relation":"relatedMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem AgohGiuga.agoh_giuga : AgohGiuga.AgohGiugaCongr"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"df1985ab928a47dbb22f15542e1a17ed9ad87da755cd99d4f770e9a6c400b19d","prominence":"central","quote":{"exact":"Giuga's conjecture says that this equation is also a sufficient condition for"},"quote_capped":true,"section":["Abstract algebra","Modular arithmetic and finite fields"],"status":"statement_only","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Giuga's conjecture says that this equation is also a sufficient condition for ⁠ p {\\displaystyle p} ⁠ to be prime.[109]","segments":[{"text":"Giuga's conjecture says that this equation is also a sufficient condition for ⁠ "},{"tex":"p"},{"text":" ⁠ to be prime."},{"ref":"[109]"}]},"unresolved":null},{"absence":null,"basis":"54d6f5e4cf81fce83c2839097764fd2de6b9bef69d0d2440c30fb0bba92be7b7","coverage":null,"id":"enwiki-23666-1373534600::In-text #4d8b5197","item":"In-text #4d8b5197","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.prime_iff_fac_equiv_neg_one","end_line":131,"library":"mathlib","line":128,"location_key":"54d6f5e4cf81fce83c2839097764fd2de6b9bef69d0d2440c30fb0bba92be7b7","module":"Mathlib.NumberTheory.Wilson","note":"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.","pair_key":"c3b6ea682730c14d19385ede249edaa34fa146b7da9d9d5fe70bda43e4f0f96f","path":"Mathlib/NumberTheory/Wilson.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prime_iff_fac_equiv_neg_one {n : ℕ} : n ≠ 1 → (Nat.Prime n ↔ ↑(n - 1).factorial = -1)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ZMod.wilsons_lemma","end_line":87,"library":"mathlib","line":62,"location_key":"00e3409f3489234e959372185f24df1fc36395f36552838c71e54c34d31d2998","module":"Mathlib.NumberTheory.Wilson","note":"It gives the direction from primality to the congruence and does not state the converse.","pair_key":"c96644241b4fff043bdae89cfbbccb2caeeb79dbe91b24e4e46953802f884cdb","path":"Mathlib/NumberTheory/Wilson.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ZMod.wilsons_lemma (p : ℕ) [Fact (Nat.Prime p)] : ↑(p - 1).factorial = -1"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.prime_of_fac_equiv_neg_one","end_line":125,"library":"mathlib","line":117,"location_key":"fa908da5ce8bc6996cc7f4005598792d0682efab09eb9523b75a9b80ce2a9716","module":"Mathlib.NumberTheory.Wilson","note":"It gives the direction from the congruence to primality and not the converse.","pair_key":"287c2c0c338f187d7e1e16cb078500de0206dbd89db32275b9bb94d33391459b","path":"Mathlib/NumberTheory/Wilson.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prime_of_fac_equiv_neg_one {n : ℕ} : ↑(n - 1).factorial = -1 → n ≠ 1 → Nat.Prime n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"68fe82a072e58c6289c1cc12431aba83e7c2d9bf54e42997208575790e376891","prominence":"central","quote":{"exact":"Wilson's theorem says that an integer p > 1 {\\displaystyle p>1} is"},"quote_capped":true,"section":["Abstract algebra","Modular arithmetic and finite fields"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Wilson's theorem says that an integer p > 1 {\\displaystyle p>1} is prime if and only if the factorial ( p − 1 ) ! {\\displaystyle (p-1)!} is congruent to − 1 {\\displaystyle -1} mod ⁠ p {\\displaystyle p} ⁠.","segments":[{"text":"Wilson's theorem says that an integer "},{"tex":"p>1"},{"text":" is prime if and only if the factorial "},{"tex":"(p-1)!"},{"text":" is congruent to "},{"tex":"-1"},{"text":" mod ⁠ "},{"tex":"p"},{"text":" ⁠."}]},"unresolved":null},{"absence":null,"basis":"8ddc6f84792b2f438f2a03a62663de9a6b248bc29f4cb3426a199bf1d9f1bc93","coverage":null,"id":"enwiki-23666-1373534600::In-text #b307116a","item":"In-text #b307116a","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.prime_of_fac_equiv_neg_one","end_line":125,"library":"mathlib","line":117,"location_key":"8ddc6f84792b2f438f2a03a62663de9a6b248bc29f4cb3426a199bf1d9f1bc93","module":"Mathlib.NumberTheory.Wilson","note":"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.","pair_key":"2ad823517b939f2ab17b03aab104cc365ba19acb9dc3f581e74f18f3ec35ede1","path":"Mathlib/NumberTheory/Wilson.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prime_of_fac_equiv_neg_one {n : ℕ} : ↑(n - 1).factorial = -1 → n ≠ 1 → Nat.Prime n"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.prime_iff_fac_equiv_neg_one","end_line":131,"library":"mathlib","line":128,"location_key":"53d5e32997c43ecafa10831563dc66180cbc5c6daf082eb844c3d8d508ce0bb1","module":"Mathlib.NumberTheory.Wilson","note":"Lean states the criterion in both directions in ZMod n over naturals, and the composite case is the negative half of it.","pair_key":"26b8623011f0997344aaf7f6079b94c8ed391ddd708e2e1e9a4c32f866f24f73","path":"Mathlib/NumberTheory/Wilson.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prime_iff_fac_equiv_neg_one {n : ℕ} : n ≠ 1 → (Nat.Prime n ↔ ↑(n - 1).factorial = -1)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a7e54d44c8ac46982b46a64c70e853162985ec704a6c50f901c0a47c3cb54541","prominence":"supporting","quote":{"exact":"For a composite number ⁠ n = r ⋅ s {\\displaystyle n=r\\cdot"},"quote_capped":true,"section":["Abstract algebra","Modular arithmetic and finite fields"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":", since one of its factors divides both n and ⁠ ( n − 1 ) ! {\\displaystyle (n-1)!} ⁠, and so ( n − 1 ) ! ≡ − 1 ( mod n ) {\\displaystyle (n-1)!\\equiv -1{\\pmod {n}}} is impossible.","segments":[{"text":", since one of its factors divides both n and ⁠ "},{"tex":"(n-1)!"},{"text":" ⁠, and so "},{"tex":"(n-1)!\\equiv -1{\\pmod {n}}"},{"text":" is impossible."}]},"layer":"For a composite number ⁠ n = r ⋅ s {\\displaystyle n=r\\cdot s} ⁠ this cannot hold","segments":[{"text":"For a composite number ⁠ "},{"tex":"n=r\\cdot s"},{"text":" ⁠ this cannot hold"}]},"unresolved":null},{"absence":null,"basis":"a92157842a36dc2a7c112cb0a359d69c4c932cb82820488f1797cd765999dd58","coverage":null,"id":"enwiki-23666-1373534600::In-text #8a30958a","item":"In-text #8a30958a","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.dvd_factorial","end_line":83,"library":"mathlib","line":82,"location_key":"a92157842a36dc2a7c112cb0a359d69c4c932cb82820488f1797cd765999dd58","module":"Mathlib.Data.Nat.Factorial.Basic","note":"It gives the divisibility of the factorial by the factor and does not state that the factor divides n.","pair_key":"b6e37d54b7eb213a07566e90b4894e781a7d9f8058ee630add68c612c3a57edd","path":"Mathlib/Data/Nat/Factorial/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.dvd_factorial {m n : ℕ} : 0 < m → m ≤ n → m ∣ n.factorial"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"dvd_mul_right","end_line":82,"library":"mathlib","line":81,"location_key":"901e705d9b05fc83426f14449db4c1e68d659507a2df82bf3d942d889da23b6e","module":"Mathlib.Algebra.Divisibility.Basic","note":"It gives the divisibility of n by its factor and says nothing about the factorial.","pair_key":"6f39cc9e6e39fd24002e9345a48d7ebbf28be1103a8fe373c2d7b2ae6680d343","path":"Mathlib/Algebra/Divisibility/Basic.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem dvd_mul_right {α : Type*} [Semigroup α] (a b : α) : a ∣ a * b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2278eaf3b72318377ce847e4ef4081b14747ad2c2fd52ff3f7459bf93a8a4a78","prominence":"supporting","quote":{"exact":"one of its factors divides both n and ⁠ ( n −"},"quote_capped":true,"section":["Abstract algebra","Modular arithmetic and finite fields"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"For a composite number ⁠ n = r ⋅ s {\\displaystyle n=r\\cdot s} ⁠ this cannot hold, since ","segments":[{"text":"For a composite number ⁠ "},{"tex":"n=r\\cdot s"},{"text":" ⁠ this cannot hold, since "}]},"layer":"one of its factors divides both n and ⁠ ( n − 1 ) ! {\\displaystyle (n-1)!} ⁠, and so ( n − 1 ) ! ≡ − 1 ( mod n ) {\\displaystyle (n-1)!\\equiv -1{\\pmod {n}}} is impossible.","segments":[{"text":"one of its factors divides both n and ⁠ "},{"tex":"(n-1)!"},{"text":" ⁠, and so "},{"tex":"(n-1)!\\equiv -1{\\pmod {n}}"},{"text":" is impossible."}]},"unresolved":null},{"absence":null,"basis":"a40dd808e7c4261c0412332de44757c78b995658d8c62056d2c598d6ea937b82","coverage":null,"id":"enwiki-23666-1373534600::In-text #3efa3228","item":"In-text #3efa3228","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"padicValInt","end_line":89,"library":"mathlib","line":88,"location_key":"a40dd808e7c4261c0412332de44757c78b995658d8c62056d2c598d6ea937b82","module":"Mathlib.NumberTheory.Padics.PadicVal.Basic","note":"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.","pair_key":"45e4f6597d7ba23df3ecdf029b9d2ffa9ba1e45af3c546e7036bc8f3df83524b","path":"Mathlib/NumberTheory/Padics/PadicVal/Basic.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def padicValInt : ℕ → ℤ → ℕ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.factorization","end_line":52,"library":"mathlib","line":51,"location_key":"009304e79da486cb905d67406dd560b2441e1627c547cf4bf5e538e1ac2e6db1","module":"Mathlib.Data.Nat.Factorization.Defs","note":"Lean's finitely supported map counts the prime factors of a natural number, where the passage speaks of an integer.","pair_key":"d6c69700a2c338160c03642ad54e9f21749c6f0429fc2d6d08ca35bd3d94505d","path":"Mathlib/Data/Nat/Factorization/Defs.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.factorization : ℕ → ℕ →₀ ℕ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"padicValNat","end_line":21,"library":"mathlib","line":21,"location_key":"cd737f011b36cae1da9d202b766678b44cb489b69bbb2198efd6185acaef931a","module":"Mathlib.Data.Nat.PadicValNat","note":"This is the same order restricted to natural arguments, with 0 returned at n = 0 and at p = 1.","pair_key":"23071088ad3f05bc842b17e15e18a43e4b9589f2843253e205da9dace138ec54","path":"Mathlib/Data/Nat/PadicValNat.lean","proof_status":"definition","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def padicValNat : ℕ → ℕ → ℕ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"4eda4e995b05e494bc8b3f2d6f543c87042731bce72cb4ff26fb23b543de97c8","prominence":"central","quote":{"exact":"The ⁠ p {\\displaystyle p} ⁠-adic order ν p ( n )"},"quote_capped":true,"section":["Abstract algebra","p-adic numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"The ⁠ p {\\displaystyle p} ⁠-adic order ν p ( n ) {\\displaystyle \\nu _{p}(n)} of an integer ⁠ n {\\displaystyle n} ⁠ is the number of copies of ⁠ p {\\displaystyle p} ⁠ in the prime factorization of ⁠ n {\\displaystyle n} ⁠.","segments":[{"text":"The ⁠ "},{"tex":"p"},{"text":" ⁠-adic order "},{"tex":"\\nu _{p}(n)"},{"text":" of an integer ⁠ "},{"tex":"n"},{"text":" ⁠ is the number of copies of ⁠ "},{"tex":"p"},{"text":" ⁠ in the prime factorization of ⁠ "},{"tex":"n"},{"text":" ⁠."}]},"unresolved":null},{"absence":null,"basis":"1427562729b08e959a5ac4a15b55646584bb833bd701ff91783240656aec77b3","coverage":null,"id":"enwiki-23666-1373534600::In-text #bf1cfd60","item":"In-text #bf1cfd60","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"padicValRat","end_line":127,"library":"mathlib","line":126,"location_key":"1427562729b08e959a5ac4a15b55646584bb833bd701ff91783240656aec77b3","module":"Mathlib.NumberTheory.Padics.PadicVal.Basic","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.","pair_key":"7d0505ffea61b99d3c8085c473c0f74dc2978c008dbd274650e50b548f33c13a","path":"Mathlib/NumberTheory/Padics/PadicVal/Basic.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def padicValRat : ℕ → ℚ → ℤ"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"padicValRat.defn","end_line":220,"library":"mathlib","line":207,"location_key":"af6c38cc0d933f3433522a43414ac904ef7cc3ffecedd82ef55463cf0ea4340c","module":"Mathlib.NumberTheory.Padics.PadicVal.Basic","note":"Lean writes each order as a multiplicity of p and allows any representation of q as a quotient of two integers.","pair_key":"ef049beb6271d5d470c342269e1055b3e7f6b69075777307c8dbbd09d33adad3","path":"Mathlib/NumberTheory/Padics/PadicVal/Basic.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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)"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"padicValRat_def","end_line":131,"library":"mathlib","line":129,"location_key":"ee52d76640ae1c136753944c5a6638a1a05c9fd694c03524331612261c5b797e","module":"Mathlib.NumberTheory.Padics.PadicVal.Basic","note":"Lean reads m and n as the numerator and the denominator of q in lowest terms.","pair_key":"ee440b97ce4c87b2658cb44834594d97de5e5ac07073b944be0bfa9dd3e348b5","path":"Mathlib/NumberTheory/Padics/PadicVal/Basic.lean","proof_status":"proved","rank":3,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem padicValRat_def (p : ℕ) (q : ℚ) : padicValRat p q = ↑(padicValInt p q.num) - ↑(padicValNat p q.den)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"75baf1458b615bf083a7d8fa75b8491f17282fcc2dc5e79679df94787cc9741b","prominence":"supporting","quote":{"exact":"The same concept can be extended from integers to rational numbers by"},"quote_capped":true,"section":["Abstract algebra","p-adic numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"The same concept can be extended from integers to rational numbers by defining the ⁠ p {\\displaystyle p} ⁠-adic order of a fraction m / n {\\displaystyle m/n} to be ⁠ ν p ( m ) − ν p ( n ) {\\displaystyle \\nu _{p}(m)-\\nu _{p}(n)} ⁠.","segments":[{"text":"The same concept can be extended from integers to rational numbers by defining the ⁠ "},{"tex":"p"},{"text":" ⁠-adic order of a fraction "},{"tex":"m/n"},{"text":" to be ⁠ "},{"tex":"\\nu _{p}(m)-\\nu _{p}(n)"},{"text":" ⁠."}]},"unresolved":null},{"absence":null,"basis":"22878049777edd2926f3be8985decadc86a048ec762b178466706e2acb2ddd23","coverage":null,"id":"enwiki-23666-1373534600::In-text #8c44eec6","item":"In-text #8c44eec6","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"padicNorm","end_line":47,"library":"mathlib","line":46,"location_key":"22878049777edd2926f3be8985decadc86a048ec762b178466706e2acb2ddd23","module":"Mathlib.NumberTheory.Padics.PadicNorm","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.","pair_key":"efcde86a71d7aa46dbd933120d2b09cc47f51b8a1ecbfeb20fbed5541fa606df","path":"Mathlib/NumberTheory/Padics/PadicNorm.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def padicNorm : ℕ → ℚ → ℚ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"padicNorm.eq_zpow_of_nonzero","end_line":58,"library":"mathlib","line":57,"location_key":"d2723ede99d3547285e1ad17eb1fb0ec082815d56de783cb1c44e4f618e85c4a","module":"Mathlib.NumberTheory.Padics.PadicNorm","note":"It writes out the defining formula of the library's object for every nonzero rational.","pair_key":"6a0cadac52537cf5ef60d411fde00c587bb408b82a4b7a70e602c5feed3ec231","path":"Mathlib/NumberTheory/Padics/PadicNorm.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem padicNorm.eq_zpow_of_nonzero {p : ℕ} {q : ℚ} : q ≠ 0 → padicNorm p q = ↑p ^ (-padicValRat p q)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Rat.AbsoluteValue.padic","end_line":121,"library":"mathlib","line":114,"location_key":"32d98f25fc7b4ce1f81bef087d95ffce6f115f0cace91cae886a688ca55d9e8e","module":"Mathlib.NumberTheory.Ostrowski","note":"Lean packages the same p-adic size of a rational as a real-valued absolute value structure carrying its own multiplicativity and triangle proofs.","pair_key":"336ba6246bef08cd23d8fba622534ad57d36b2f8357bbbf85a654451397459b5","path":"Mathlib/NumberTheory/Ostrowski.lean","proof_status":"definition","rank":3,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Rat.AbsoluteValue.padic (p : ℕ) [Fact (Nat.Prime p)] : AbsoluteValue ℚ ℝ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"67ccc849122f5f997ca5652a8fc2d9d3134a0d451d3dc84308739e8e7ea333d0","prominence":"central","quote":{"exact":"The ⁠ p {\\displaystyle p} ⁠-adic absolute value | q | p"},"quote_capped":true,"section":["Abstract algebra","p-adic numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"The ⁠ p {\\displaystyle p} ⁠-adic absolute value | q | p {\\displaystyle |q|_{p}} of any rational number ⁠ q {\\displaystyle q} ⁠ is then defined as ⁠ | q | p = p − ν p ( q ) {\\displaystyle \\vert q\\vert _{p}=p^{-\\nu _{p}(q)}} ⁠.","segments":[{"text":"The ⁠ "},{"tex":"p"},{"text":" ⁠-adic absolute value "},{"tex":"|q|_{p}"},{"text":" of any rational number ⁠ "},{"tex":"q"},{"text":" ⁠ is then defined as ⁠ "},{"tex":"\\vert q\\vert _{p}=p^{-\\nu _{p}(q)}"},{"text":" ⁠."}]},"unresolved":null},{"absence":null,"basis":"fa724999f7111eef8287c2e010d8fb8db39f07b7a1f43eb768ab5ac796703f73","coverage":null,"id":"enwiki-23666-1373534600::In-text #90fa08bf","item":"In-text #90fa08bf","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.factorization_ordCompl","end_line":214,"library":"mathlib","line":204,"location_key":"fa724999f7111eef8287c2e010d8fb8db39f07b7a1f43eb768ab5ac796703f73","module":"Mathlib.Data.Nat.Factorization.Basic","note":"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.","pair_key":"a626b32991ed6232b4fb7bfeaa4adcacdd75c7e29cb30688287fd1d560ef2418","path":"Mathlib/Data/Nat/Factorization/Basic.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.factorization_ordCompl (n p : ℕ) : (n / p ^ n.factorization p).factorization = Finsupp.erase p n.factorization"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"Nat.primeFactors_ordCompl","end_line":37,"library":"tauceti","line":34,"location_key":"cca23dac9b422558e1fa106980646584bdb977ddd44013629e2a4c89578c7d49","module":"TauCeti.Data.Nat.Factorization.Basic","note":"This records the same removal at the level of the set of prime factors, over naturals.","pair_key":"50c0a1aa22e8132d365bdb72ffa9cb2b65d7f60728082707a7f7adcd89df5494","path":"TauCeti/Data/Nat/Factorization/Basic.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem Nat.primeFactors_ordCompl (n p : ℕ) : (n / p ^ n.factorization p).primeFactors = n.primeFactors.erase p"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.not_dvd_ordCompl","end_line":199,"library":"mathlib","line":196,"location_key":"5255500e81621731e0e6777be688800bea04d366538bfbed5c44b9c16d107e1d","module":"Mathlib.Data.Nat.Factorization.Basic","note":"It gives that no factor of p is left and says nothing about the other primes being kept.","pair_key":"d329ca4282f517a5e87edeea24cbd3d8a9780162b4953e5c705128477a90205c","path":"Mathlib/Data/Nat/Factorization/Basic.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.not_dvd_ordCompl {n p : ℕ} : Nat.Prime p → n ≠ 0 → ¬p ∣ n / p ^ n.factorization p"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b8144d2409612529340a1b60504299b083abaef4bb3f47de210cc21f1576aac9","prominence":"supporting","quote":{"exact":"Multiplying an integer by its ⁠ p {\\displaystyle p} ⁠-adic absolute value"},"quote_capped":true,"section":["Abstract algebra","p-adic numbers"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Multiplying an integer by its ⁠ p {\\displaystyle p} ⁠-adic absolute value cancels out the factors of ⁠ p {\\displaystyle p} ⁠ in its factorization, leaving only the other primes.","segments":[{"text":"Multiplying an integer by its ⁠ "},{"tex":"p"},{"text":" ⁠-adic absolute value cancels out the factors of ⁠ "},{"tex":"p"},{"text":" ⁠ in its factorization, leaving only the other primes."}]},"unresolved":null},{"absence":null,"basis":"7ad84b5712cf9f7e7c6c11fa30abb8546b9887fbece95f6b529105ceeb03ef5e","coverage":null,"id":"enwiki-23666-1373534600::In-text #7643261e","item":"In-text #7643261e","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"WithAbs.normedField","end_line":42,"library":"mathlib","line":40,"location_key":"7ad84b5712cf9f7e7c6c11fa30abb8546b9887fbece95f6b529105ceeb03ef5e","module":"Mathlib.Analysis.Normed.Field.WithAbs","note":"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.","pair_key":"7925af319ea169173b472c1c31eda3c2bab7571a37ed694e92feeb8f029a188f","path":"Mathlib/Analysis/Normed/Field/WithAbs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance WithAbs.normedField {R : Type*} [Field R] (v : AbsoluteValue R ℝ) : NormedField (WithAbs v)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Padic.metricSpace","end_line":798,"library":"mathlib","line":787,"location_key":"8b0822c617e3e693ca9988eeffdffd99af9ba616be28d2ae85e93d492d424f4f","module":"Mathlib.NumberTheory.Padics.PadicNumbers","note":"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.","pair_key":"9c756b52bdb96dc642bf6f90b315c693eb6c2b4e1406f2d6172b6d563b695a93","path":"Mathlib/NumberTheory/Padics/PadicNumbers.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Padic.metricSpace (p : ℕ) [Fact (Nat.Prime p)] : MetricSpace ℚ_[p]"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"padicNorm","end_line":47,"library":"mathlib","line":46,"location_key":"12c04f460dc1189a5fdf527ce121c90fea03268247ba37c02331bbcb65fdfd7c","module":"Mathlib.NumberTheory.Padics.PadicNorm","note":"It defines the p-adic absolute value of a single rational, the ingredient of the passage's distance, but says nothing about a distance between two numbers.","pair_key":"3a782059f4c642eb5eb71c8e9b2c83e9955faaf8120670032cdf53626897adaa","path":"Mathlib/NumberTheory/Padics/PadicNorm.lean","proof_status":"definition","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def padicNorm : ℕ → ℚ → ℚ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6ea03339d82fe4e7140b73a5b03421055f212744cac32c1d4795ec0ebd5f7d57","prominence":"central","quote":{"exact":"Just as the distance between two real numbers can be measured by"},"quote_capped":true,"section":["Abstract algebra","p-adic numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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 {\\displaystyle p} ⁠-adic distance, the ⁠ p {\\displaystyle p} ⁠-adic absolute value of their difference.","segments":[{"text":"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 ⁠ "},{"tex":"p"},{"text":" ⁠-adic distance, the ⁠ "},{"tex":"p"},{"text":" ⁠-adic absolute value of their difference."}]},"unresolved":null},{"absence":null,"basis":"c6b0fc7ef8c898d8a6df3668949516114d3ee0a446f0169fd5c95aadbef1431f","coverage":null,"id":"enwiki-23666-1373534600::In-text #ba842bf5","item":"In-text #ba842bf5","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"padicNorm.dvd_iff_norm_le","end_line":224,"library":"mathlib","line":214,"location_key":"c6b0fc7ef8c898d8a6df3668949516114d3ee0a446f0169fd5c95aadbef1431f","module":"Mathlib.NumberTheory.Padics.PadicNorm","note":"Divisibility is stated of an integer argument, so the equivalence is the passage restricted to pairs of rationals whose difference is an integer.","pair_key":"7ecc11ca3bec6cc6a4fc9c1b4fc5fa60319c9570492313304a9974240238a12d","path":"Mathlib/NumberTheory/Padics/PadicNorm.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem padicNorm.dvd_iff_norm_le {p : ℕ} [hp : Fact (Nat.Prime p)] {n : ℕ} {z : ℤ} : ↑(p ^ n) ∣ z ↔ padicNorm p ↑z ≤ ↑p ^ (-↑n)"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Padic.norm_int_le_pow_iff_dvd","end_line":969,"library":"mathlib","line":964,"location_key":"dd6149c5ed2db0d7efe115e8e646082a3da6aae74666b493fbd0edf2d4623335","module":"Mathlib.NumberTheory.Padics.PadicNumbers","note":"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.","pair_key":"5b03f5b8043834492f914c7222a094069683ae3c27be6e2f67b9a90c64ad0749","path":"Mathlib/NumberTheory/Padics/PadicNumbers.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Padic.norm_int_le_pow_iff_dvd {p : ℕ} [hp : Fact (Nat.Prime p)] (k : ℤ) (n : ℕ) : ‖↑k‖ ≤ ↑p ^ (-↑n) ↔ ↑p ^ n ∣ k"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"5d94f254bfce92c08e600682fb9b8777fb5eafe41dd71a2e7eff95dfd6167511","prominence":"supporting","quote":{"exact":"For this definition of distance, two numbers are close together (they have"},"quote_capped":true,"section":["Abstract algebra","p-adic numbers"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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 {\\displaystyle p} ⁠.","segments":[{"text":"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 ⁠ "},{"tex":"p"},{"text":" ⁠."}]},"unresolved":null},{"absence":null,"basis":"a57490b425a6ece56025cde9c304007beb24ef98c344a637e5ad156edbc57922","coverage":null,"id":"enwiki-23666-1373534600::In-text #77454936","item":"In-text #77454936","kind":"construction","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Padic","end_line":538,"library":"mathlib","line":536,"location_key":"a57490b425a6ece56025cde9c304007beb24ef98c344a637e5ad156edbc57922","module":"Mathlib.NumberTheory.Padics.PadicNumbers","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.","pair_key":"21c66a0a2b7abfd4bd0cc45a062846ef356f7cb555d26bf202ac3494ba14cfc8","path":"Mathlib/NumberTheory/Padics/PadicNumbers.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Padic (p : ℕ) [Fact (Nat.Prime p)] : Type"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Padic.withValRingEquiv","end_line":133,"library":"mathlib","line":104,"location_key":"e43712f7c54d262f920b6d173b647d7c59f9170f2f3f81ce021a75c84bacbf5a","module":"Mathlib.NumberTheory.Padics.WithVal","note":"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.","pair_key":"5c9d4eb29b95ffb024eb9231edc4dd376fdbeab1901373c3be122b55af4aa803","path":"Mathlib/NumberTheory/Padics/WithVal.lean","proof_status":"definition","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Padic.withValRingEquiv {p : ℕ} [Fact (Nat.Prime p)] : (Rat.padicValuation p).Completion ≃+* ℚ_[p]"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b06740d019ea3adf3514287511c193aacb1dc5cd7398fe40e99effd962fe4a62","prominence":"central","quote":{"exact":"In the same way that the real numbers can be formed from"},"quote_capped":true,"section":["Abstract algebra","p-adic numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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 {\\displaystyle p} ⁠-adic distance can be extended to a different complete field, the ⁠ p {\\displaystyle p} ⁠-adic numbers.","segments":[{"text":"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 ⁠ "},{"tex":"p"},{"text":" ⁠-adic distance can be extended to a different complete field, the ⁠ "},{"tex":"p"},{"text":" ⁠-adic numbers."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #f03bf6ff","item":"In-text #f03bf6ff","kind":"definition","locations":[],"outcome":"unresolved","passage_ends_in_suffix":false,"passage_key":"27a97271c6d64862aef7110374660da73dd96d5a2bab3b4bd018199a94988708","prominence":"central","quote":{"exact":"This picture of an order, absolute value, and complete field derived from"},"quote_capped":true,"section":["Abstract algebra","p-adic numbers"],"status":null,"subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":" 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","segments":[{"text":" 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),"},{"ref":"[111]"},{"text":" and places (extensions to complete fields in which the given field is a dense"}],"trimmed":true},"layer":"This picture of an order, absolute value, and complete field derived from them can be generalized to algebraic number fields and their","segments":[{"text":"This picture of an order, absolute value, and complete field derived from them can be generalized to algebraic number fields and their"}]},"unresolved":{"challenge":"survived"}},{"absence":null,"basis":"c3cb6ea121a2686a09ba64f1a9bdac16cf93d45bb78d4b8d13620f6ac460afed","coverage":null,"id":"enwiki-23666-1373534600::In-text #ab8f1b34","item":"In-text #ab8f1b34","kind":"definition","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"AddValuation","end_line":1058,"library":"mathlib","line":1057,"location_key":"c3cb6ea121a2686a09ba64f1a9bdac16cf93d45bb78d4b8d13620f6ac460afed","module":"Mathlib.RingTheory.Valuation.Basic","note":"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'.","pair_key":"fbb05282e5412413f97d92796de286367045d1383b43e42a3d503022864e8bdb","path":"Mathlib/RingTheory/Valuation/Basic.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def AddValuation (R : Type u_3) [Ring R] (Γ₀ : Type u_4) [LinearOrderedAddCommMonoidWithTop Γ₀] : Type (max u_3 u_4)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Valuation","end_line":81,"library":"mathlib","line":79,"location_key":"62a4ea7282dbb1c8cfda29fbf2b21dc85dbe9a03771c0896b7130bb21bff988e","module":"Mathlib.RingTheory.Valuation.Basic","note":"This is the same notion written multiplicatively, over an arbitrary ring and an arbitrary linearly ordered commutative target with a zero.","pair_key":"ce68f870ab09c288e9c3843a4d16d26589e92417176e968d97703484909703b4","path":"Mathlib/RingTheory/Valuation/Basic.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure Valuation (R : Type*) (Γ₀ : Type*) [LinearOrderedCommMonoidWithZero Γ₀] [Ring R]"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"8afd61672115512715ee3d228fe96e7a893814e9f0489ac8fa310ff5cd3dad32","prominence":"supporting","quote":{"exact":"valuations (certain mappings from the multiplicative group of the field to a"},"quote_capped":true,"section":["Abstract algebra","p-adic numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":", 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).","segments":[{"text":", absolute values (certain multiplicative mappings from the field to the real numbers, also called norms),"},{"ref":"[111]"},{"text":" and places (extensions to complete fields in which the given field is a dense set, also called completions)."}]},"before":{"layer":"This picture of an order, absolute value, and complete field derived from them can be generalized to algebraic number fields and their ","segments":[{"text":"This picture of an order, absolute value, and complete field derived from them can be generalized to algebraic number fields and their "}]},"layer":"valuations (certain mappings from the multiplicative group of the field to a totally ordered additive group, also called orders)","segments":[{"text":"valuations (certain mappings from the multiplicative group of the field to a totally ordered additive group, also called orders)"}]},"unresolved":null},{"absence":null,"basis":"c7038e52a1cf1e2c3e8a7ecd96311621566e00e410685ce456826fc78833bfdd","coverage":null,"id":"enwiki-23666-1373534600::In-text #8b82b7ca","item":"In-text #8b82b7ca","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"AbsoluteValue","end_line":43,"library":"mathlib","line":36,"location_key":"c7038e52a1cf1e2c3e8a7ecd96311621566e00e410685ce456826fc78833bfdd","module":"Mathlib.Algebra.Order.AbsoluteValue.Basic","note":"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'.","pair_key":"bda17d623838562ff4a0354ec3afb8ef5366d5fe5e2651873b125eb98c5b33d3","path":"Mathlib/Algebra/Order/AbsoluteValue/Basic.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure AbsoluteValue (R : Type*) (S : Type*) [Semiring R] [Semiring S] [PartialOrder S]"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"bacbb6e3159102a596d19ec7c8eeb754c0a65c01a7b949d56425ee572c49a963","prominence":"supporting","quote":{"exact":"absolute values (certain multiplicative mappings from the field to the real numbers,"},"quote_capped":true,"section":["Abstract algebra","p-adic numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":" places (extensions to complete fields in which the given field is a dense set, also called completions).","segments":[{"text":" places (extensions to complete fields in which the given field is a dense set, also called completions)."}]},"before":{"layer":"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), ","segments":[{"text":"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), "}]},"layer":"absolute values (certain multiplicative mappings from the field to the real numbers, also called norms),[111] and","segments":[{"text":"absolute values (certain multiplicative mappings from the field to the real numbers, also called norms),"},{"ref":"[111]"},{"text":" and"}]},"unresolved":null},{"absence":null,"basis":"e659d666f3e383f7cc3f062a0562923e3b4be3e9ed20caf5097040c4eb998fd1","coverage":null,"id":"enwiki-23666-1373534600::In-text #47fc4eae","item":"In-text #47fc4eae","kind":"definition","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"AbsoluteValue.Completion","end_line":108,"library":"mathlib","line":108,"location_key":"e659d666f3e383f7cc3f062a0562923e3b4be3e9ed20caf5097040c4eb998fd1","module":"Mathlib.Analysis.Normed.Field.WithAbs","note":"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.","pair_key":"d47076f3a8227e6e8372840b52e2f0ba6ef0e4515c399af881c6dd2a82a268e4","path":"Mathlib/Analysis/Normed/Field/WithAbs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"abbrev AbsoluteValue.Completion {K : Type u_1} [Field K] : AbsoluteValue K ℝ → Type u_1"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"Rat.Place.CompletedField","library":"atlas","line":81,"location_key":"e4f3243d400daaa985b9ce7b350265708852b1955d603ee5af06fd546d341854","module":"MathlibExt.NumberTheory.Rat.Place","note":"The construction is given only for the rationals, where the places are enumerated as the archimedean one and the p-adic ones.","pair_key":"0ebb76d453bde6f922a65e446aa3b43865a97250e08722bb2839ad66e5eb4d2a","path":"MathlibExt/NumberTheory/Rat/Place.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"abbrev Rat.Place.CompletedField : Rat.Place → Type"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"NumberField.InfinitePlace.Completion","end_line":83,"library":"mathlib","line":79,"location_key":"0ab04d9654d09530e4e6b301999c6bd4106afa19b48deecb90468b5d5a26bac8","module":"Mathlib.NumberTheory.NumberField.Completion.InfinitePlace","note":"Only the archimedean places of a number field are covered, so this is the passage's notion restricted to those places.","pair_key":"94c79a7181852ecb097b1b4de9cbe8c18fc6ae30d1f6358fc7be4664bc449ac7","path":"Mathlib/NumberTheory/NumberField/Completion/InfinitePlace.lean","proof_status":"definition","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure NumberField.InfinitePlace.Completion {K : Type u_1} [Field K] : NumberField.InfinitePlace K → Type u_1"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a39808e25b9755d707bc27bb51f6957a3327bf4cd126196c1e1d4bbd527a56a9","prominence":"supporting","quote":{"exact":"places (extensions to complete fields in which the given field is a"},"quote_capped":true,"section":["Abstract algebra","p-adic numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"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 ","segments":[{"text":"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),"},{"ref":"[111]"},{"text":" and "}],"trimmed":true},"layer":"places (extensions to complete fields in which the given field is a dense set, also called completions).[113]","segments":[{"text":"places (extensions to complete fields in which the given field is a dense set, also called completions)."},{"ref":"[113]"}]},"unresolved":null},{"absence":null,"basis":"1eeced2bf260ae9fdae1532a4e958cc5e6bdc84608a16204b6157e12aba23490","coverage":null,"id":"enwiki-23666-1373534600::In-text #234eb921","item":"In-text #234eb921","kind":"example","locations":[{"challenge":"downgraded","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"Rat.Place.completedField_infinite","library":"atlas","line":90,"location_key":"1eeced2bf260ae9fdae1532a4e958cc5e6bdc84608a16204b6157e12aba23490","module":"MathlibExt.NumberTheory.Rat.Place","note":"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.","pair_key":"9f003b48af980256f87abacfbc8a28f79b110072fbc1e0e81eb02df1c2bd6df6","path":"MathlibExt/NumberTheory/Rat/Place.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem Rat.Place.completedField_infinite : Rat.Place.infinite.CompletedField = ℝ"},"statement":false},{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"Rat.Place.absoluteValue_infinite_apply","library":"atlas","line":110,"location_key":"b6b1e2bd9fa5966c3460dde60fb60258b042afe70edc577038da074f7a300825","module":"MathlibExt.NumberTheory.Rat.Place","note":"It evaluates the archimedean place of the rationals as the ordinary absolute value, which supports the identification the passage makes without saying that the resulting field is the reals.","pair_key":"2a305fdc6489977c1c5d7c5720b22294cc2cf2cc51f5a5c551a2576901bafc25","path":"MathlibExt/NumberTheory/Rat/Place.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem Rat.Place.absoluteValue_infinite_apply (q : ℚ) : Rat.Place.infinite.absoluteValue q = |↑q|"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"56b715f29d9adea8157313db18cf9da6f519c98c204001ffab75ce8a97b6f3f2","prominence":"supporting","quote":{"exact":"The extension from the rational numbers to the real numbers, for instance,"},"quote_capped":true,"section":["Abstract algebra","p-adic numbers"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":3,"sha256":"7f4455227cc97e8b3473f89d99bc35335477e73d8ae22088e09236e3dfa18890"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #47e6ab2d","item":"In-text #47e6ab2d","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"7efd76b3cfe7f4472d0824d31127528ddce08cc5e9d4c2b59a488879af2acdc6","prominence":"supporting","quote":{"exact":"The corresponding mapping to an additive group would be the logarithm of"},"quote_capped":true,"section":["Abstract algebra","p-adic numbers"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"4dafa914357eeba1fc0f3a5ff5f20e419d7620b73547ff12526bf2783ef88ccf","coverage":null,"id":"enwiki-23666-1373534600::In-text #9cbffde4","item":"In-text #9cbffde4","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Rat.AbsoluteValue.equiv_real_or_padic","end_line":441,"library":"mathlib","line":437,"location_key":"4dafa914357eeba1fc0f3a5ff5f20e419d7620b73547ff12526bf2783ef88ccf","module":"Mathlib.NumberTheory.Ostrowski","note":"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.","pair_key":"c3bc228b67594fa1dd4e8173e34be61b6d5b0adc9b9b478b4786336250eb7186","path":"Mathlib/NumberTheory/Ostrowski.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f05676683c4b2494ccf1658a7af687d44d794e5844939b48b4c4c45acd1a5ac9","prominence":"central","quote":{"exact":"According to Ostrowski's theorem, up to a natural notion of equivalence, the"},"quote_capped":true,"section":["Abstract algebra","p-adic numbers"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"According to Ostrowski's theorem, up to a natural notion of equivalence, the real numbers and ⁠ p {\\displaystyle p} ⁠-adic numbers, with their orders and absolute values, are the only valuations, absolute values, and places on the rational numbers.[111]","segments":[{"text":"According to Ostrowski's theorem, up to a natural notion of equivalence, the real numbers and ⁠ "},{"tex":"p"},{"text":" ⁠-adic numbers, with their orders and absolute values, are the only valuations, absolute values, and places on the rational numbers."},{"ref":"[111]"}]},"unresolved":null},{"absence":null,"basis":"a49ea7eb3d761bb71f79a73dbb0fa29b537e6628e3b8c47b0ae6d4a3cf3b1eb7","coverage":null,"id":"enwiki-23666-1373534600::In-text #8e8bf373","item":"In-text #8e8bf373","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"CommRing","end_line":413,"library":"mathlib","line":413,"location_key":"a49ea7eb3d761bb71f79a73dbb0fa29b537e6628e3b8c47b0ae6d4a3cf3b1eb7","module":"Mathlib.Algebra.Ring.Defs","note":"This is the Lean class that the passage's phrase names, with subtraction given by the additive inverse the class carries.","pair_key":"e1fc2cb309856d92c53858164eab6bc9059b1fb8d00dca997a5178b3a475c03f","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class CommRing : Type u → Type u"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7eb161bd70b046d6a7c4f2a7c52f5fdece8a4cf2a7bbeb3a07da6c13ab2b6f1e","prominence":"central","quote":{"exact":"A commutative ring is an algebraic structure where addition, subtraction and multiplication"},"quote_capped":true,"section":["Abstract algebra","Prime elements of a ring"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"A commutative ring is an algebraic structure where addition, subtraction and multiplication are defined.","segments":[{"text":"A commutative ring is an algebraic structure where addition, subtraction and multiplication are defined."}]},"unresolved":null},{"absence":null,"basis":"9adadcdd625d1a6320f5c0c813eb0db6efc437334d24dd56d0a0eac9f5b06ccc","coverage":null,"id":"enwiki-23666-1373534600::In-text #fc2d388d","item":"In-text #fc2d388d","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Int.instCommRing","end_line":45,"library":"mathlib","line":28,"location_key":"9adadcdd625d1a6320f5c0c813eb0db6efc437334d24dd56d0a0eac9f5b06ccc","module":"Mathlib.Algebra.Ring.Int.Defs","note":"This is the integer type's own commutative ring instance, the declaration stated for the passage's objects.","pair_key":"c3199e8df2a43b20e0b3cc6a2847cfacbc124c9dd6d38e7e547342eeaa739549","path":"Mathlib/Algebra/Ring/Int/Defs.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Int.instCommRing : CommRing ℤ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a47634686e2a9c7911043829daa5ac5151acacdfbb3ecc438b0d52409da69ce8","prominence":"supporting","quote":{"exact":"The integers are a ring"},"quote_capped":false,"section":["Abstract algebra","Prime elements of a ring"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":", and the prime numbers in the integers have been generalized to rings in two different ways, prime elements and irreducible elements.","segments":[{"text":", and the prime numbers in the integers have been generalized to rings in two different ways, prime elements and irreducible elements."}]},"layer":"The integers are a ring","segments":[{"text":"The integers are a ring"}]},"unresolved":null},{"absence":null,"basis":"28650f3af0b6de2305dccb89b6aa2c2006f964325659b01d6d419b3087b339a0","coverage":null,"id":"enwiki-23666-1373534600::In-text #a437338e","item":"In-text #a437338e","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Prime","end_line":44,"library":"mathlib","line":43,"location_key":"28650f3af0b6de2305dccb89b6aa2c2006f964325659b01d6d419b3087b339a0","module":"Mathlib.Algebra.Prime.Defs","note":"Mathlib defines the predicate over any commutative monoid with zero, which is a wider class of carriers than the passage's rings.","pair_key":"1a755bc7e567444281cedb88b3b3bc169b1a4304ae41217aa3261902abf44093","path":"Mathlib/Algebra/Prime/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Prime {M : Type*} [CommMonoidWithZero M] : M → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"0ed3e250b236dacaeace6d382174dd202467ef9e3d3a95e96cb97d4b39629652","prominence":"central","quote":{"exact":"An element ⁠ p {\\displaystyle p} ⁠ of a ring ⁠ R"},"quote_capped":true,"section":["Abstract algebra","Prime elements of a ring"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"An element ⁠ p {\\displaystyle p} ⁠ of a ring ⁠ R {\\displaystyle 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 {\\displaystyle p} ⁠ divides the product x y {\\displaystyle xy} of two elements of ⁠ R {\\displaystyle R} ⁠, it also divides at least one of ⁠ x {\\displaystyle x} ⁠ or ⁠ y {\\displaystyle y} ⁠.","segments":[{"text":"An element ⁠ "},{"tex":"p"},{"text":" ⁠ of a ring ⁠ "},{"tex":"R"},{"text":" ⁠ is called prime if it is nonzero, has no multiplicative inverse (that is, it is not a unit), and satisfies the following requirement: whenever ⁠ "},{"tex":"p"},{"text":" ⁠ divides the product "},{"tex":"xy"},{"text":" of two elements of ⁠ "},{"tex":"R"},{"text":" ⁠, it also divides at least one of ⁠ "},{"tex":"x"},{"text":" ⁠ or ⁠ "},{"tex":"y"},{"text":" ⁠."}]},"unresolved":null},{"absence":null,"basis":"881f365868e0d7da6f44d0c98e3811d4fa358ad9be7b86599a8c775e0bb909f6","coverage":null,"id":"enwiki-23666-1373534600::In-text #d1bc0669","item":"In-text #d1bc0669","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Irreducible","end_line":49,"library":"mathlib","line":45,"location_key":"881f365868e0d7da6f44d0c98e3811d4fa358ad9be7b86599a8c775e0bb909f6","module":"Mathlib.Algebra.Group.Irreducible.Defs","note":"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.","pair_key":"dc9f4fb9fbd66e609778e6398553e1921949e2abc0bc5b6951bbebe1756aff59","path":"Mathlib/Algebra/Group/Irreducible/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure Irreducible {M : Type*} [Monoid M] : M → Prop"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"db9938da272b2ab682729cea4a6aaf57836a9337f7dd565d1e0d116b756dfd4a","prominence":"central","quote":{"exact":"An element is irreducible if it is neither a unit nor the"},"quote_capped":true,"section":["Abstract algebra","Prime elements of a ring"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"An element is irreducible if it is neither a unit nor the product of two other non-unit elements.","segments":[{"text":"An element is irreducible if it is neither a unit nor the product of two other non-unit elements."}]},"unresolved":null},{"absence":null,"basis":"774a39ea74c7209ccd3693f112297f307fddecc73d10e3388a3e65c90514a007","coverage":null,"id":"enwiki-23666-1373534600::In-text #9e8b2c18","item":"In-text #9e8b2c18","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Int.prime_iff_natAbs_prime","end_line":104,"library":"mathlib","line":103,"location_key":"774a39ea74c7209ccd3693f112297f307fddecc73d10e3388a3e65c90514a007","module":"Mathlib.RingTheory.Int.Basic","note":"It pins down which integers are prime elements, but it does not say that the irreducible integers are the same ones.","pair_key":"5f2426d4245318d623e08e421b7cdc9dee898b05509ae47596036549003fe9c7","path":"Mathlib/RingTheory/Int/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Int.prime_iff_natAbs_prime {k : ℤ} : Prime k ↔ Nat.Prime k.natAbs"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"irreducible_iff_prime","end_line":169,"library":"mathlib","line":168,"location_key":"156d43e0496cac42af7a9be0b68f15fc6c351423e69931123b2aa959f29437dd","module":"Mathlib.Algebra.Prime.Defs","note":"It gives the coincidence of the two notions but says nothing about which integers they are.","pair_key":"17d79cf06a921fab3a6d475c63bfb194bc53f372c06c5ab0c851b617955b575a","path":"Mathlib/Algebra/Prime/Defs.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem irreducible_iff_prime {M : Type*} [CommMonoidWithZero M] [IsCancelMulZero M] [DecompositionMonoid M] {a : M} : Irreducible a ↔ Prime a"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e336a2aeb3cc8650ec0b689e498b36af1bd1108a8ae1f3c0886c7ee1f2e1be67","prominence":"central","quote":{"exact":"In the ring of integers, the prime and irreducible elements form the"},"quote_capped":true,"section":["Abstract algebra","Prime elements of a ring"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"In the ring of integers, the prime and irreducible elements form the same set, { … , − 11 , − 7 , − 5 , − 3 , − 2 , 2 , 3 , 5 , 7 , 11 , … } . {\\displaystyle \\{\\dots ,-11,-7,-5,-3,-2,2,3,5,7,11,\\dots \\}\\,.}","segments":[{"text":"In the ring of integers, the prime and irreducible elements form the same set, "},{"tex":"\\{\\dots ,-11,-7,-5,-3,-2,2,3,5,7,11,\\dots \\}\\,."}]},"unresolved":null},{"absence":null,"basis":"72e1348fdff49be9d6847199118460c7b8845cb556ce308a6476d1517207b291","coverage":null,"id":"enwiki-23666-1373534600::In-text #9a8464ad","item":"In-text #9a8464ad","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Prime.irreducible","end_line":166,"library":"mathlib","line":159,"location_key":"72e1348fdff49be9d6847199118460c7b8845cb556ce308a6476d1517207b291","module":"Mathlib.Algebra.Prime.Defs","note":"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.","pair_key":"87dec731940f7d5cf906ac496d27f57db93f9a3e059b0f1572f187906563e2dc","path":"Mathlib/Algebra/Prime/Defs.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Prime.irreducible {M : Type*} [CommMonoidWithZero M] [IsCancelMulZero M] {p : M} : Prime p → Irreducible p"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"42575056e13304d27cbc981dd305cfb21916f7047f1f00e7a2d322729d429e71","prominence":"central","quote":{"exact":"In an arbitrary ring, all prime elements are irreducible."},"quote_capped":false,"section":["Abstract algebra","Prime elements of a ring"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"In an arbitrary ring, all prime elements are irreducible.","segments":[{"text":"In an arbitrary ring, all prime elements are irreducible."}]},"unresolved":null},{"absence":null,"basis":"6493afe0c953dcb3ecf980878469423e290d8600f0e17e1c8f852a17c7fca22a","coverage":null,"id":"enwiki-23666-1373534600::In-text #d7c2fe33","item":"In-text #d7c2fe33","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Irreducible.prime","end_line":151,"library":"mathlib","line":150,"location_key":"6493afe0c953dcb3ecf980878469423e290d8600f0e17e1c8f852a17c7fca22a","module":"Mathlib.Algebra.Prime.Defs","note":"Mathlib proves it for decomposition monoids, a class that every unique factorization domain instantiates through its own instance.","pair_key":"4699cfd245f895fbf0367201fd90471456be9c57e57e4044f7f6bbbfd0673d95","path":"Mathlib/Algebra/Prime/Defs.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Irreducible.prime {M : Type*} [CommMonoidWithZero M] [DecompositionMonoid M] {a : M} : Irreducible a → Prime a"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"irreducible_iff_prime","end_line":169,"library":"mathlib","line":168,"location_key":"e0b7bddb3286affdde1692990fd851febede9f599df0ae7fd98245e79ba4ac51","module":"Mathlib.Algebra.Prime.Defs","note":"The declaration also carries the converse direction, which the article states in the preceding sentence rather than in this passage.","pair_key":"450ae1eee4937a20343bcdc7c4acccb3dd0541a70c23ce5bb75b718bb7d5dbb9","path":"Mathlib/Algebra/Prime/Defs.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem irreducible_iff_prime {M : Type*} [CommMonoidWithZero M] [IsCancelMulZero M] [DecompositionMonoid M] {a : M} : Irreducible a ↔ Prime a"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f0e98bbac6fe3454b2b81d933bd5af2933a473b5bf4f1cfcaacb706139aaad0a","prominence":"supporting","quote":{"exact":"The converse does not hold in general, but does hold for unique"},"quote_capped":true,"section":["Abstract algebra","Prime elements of a ring"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"The converse does not hold in general, but does hold for unique factorization domains.","segments":[{"text":"The converse does not hold in general, but does hold for unique factorization domains."}]},"unresolved":null},{"absence":null,"basis":"88f65557406cb3c57e2e12b48c5647365b667e8c464555f5d0aa8d24e00698f8","coverage":null,"id":"enwiki-23666-1373534600::In-text #27a4f649","item":"In-text #27a4f649","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"UniqueFactorizationMonoid.factors_unique","end_line":112,"library":"mathlib","line":109,"location_key":"88f65557406cb3c57e2e12b48c5647365b667e8c464555f5d0aa8d24e00698f8","module":"Mathlib.RingTheory.UniqueFactorizationDomain.Basic","note":"This gives the uniqueness half of factorization into irreducibles in such a domain.","pair_key":"48698107fbb52ddfe52246eb4a51b882faa52b37754a9d973d7f9580ca7e0b09","path":"Mathlib/RingTheory/UniqueFactorizationDomain/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"UniqueFactorizationMonoid.factors_prod","end_line":197,"library":"mathlib","line":195,"location_key":"b1df14c8f32ab055a4e696ce1f1098a087816254df3ce954484f780c157b6d00","module":"Mathlib.RingTheory.UniqueFactorizationDomain.Defs","note":"Together with the irreducibility of those factors this gives the existence half of the factorization.","pair_key":"5f1146a578e81ae4189095e42ae21069a629f1dc5920e079c37f82ae54ad0970","path":"Mathlib/RingTheory/UniqueFactorizationDomain/Defs.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem UniqueFactorizationMonoid.factors_prod {α : Type*} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] {a : α} : a ≠ 0 → Associated (UniqueFactorizationMonoid.factors a).prod a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"UniqueFactorizationMonoid.irreducible_of_factor","end_line":215,"library":"mathlib","line":214,"location_key":"a62f499527bc51ecce736f4e3b0ae087f96b2607a4ac92d72c6eff1e20024c24","module":"Mathlib.RingTheory.UniqueFactorizationDomain.Defs","note":"It supplies the irreducibility of the factors that the passage's factorization is into.","pair_key":"a09eb8de9c750d7722d538051c924c2eacdba0f164771414e7934f304fd7d78e","path":"Mathlib/RingTheory/UniqueFactorizationDomain/Defs.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem UniqueFactorizationMonoid.irreducible_of_factor {α : Type*} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] {a : α} : ∀ x ∈ UniqueFactorizationMonoid.factors a, Irreducible x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a98c252c6826c58356444644c89bf921da9dc0462dc4c866a7213f917035befe","prominence":"central","quote":{"exact":"The fundamental theorem of arithmetic continues to hold (by definition) in unique"},"quote_capped":true,"section":["Abstract algebra","Prime elements of a ring"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"The fundamental theorem of arithmetic continues to hold (by definition) in unique factorization domains.","segments":[{"text":"The fundamental theorem of arithmetic continues to hold (by definition) in unique factorization domains."}]},"unresolved":null},{"absence":null,"basis":"723e296c06cb4d251317ce78608e2664bdebcb6f270057b063a5699296fdddc4","coverage":null,"id":"enwiki-23666-1373534600::In-text #944ca355","item":"In-text #944ca355","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"GaussianInt","end_line":51,"library":"mathlib","line":50,"location_key":"723e296c06cb4d251317ce78608e2664bdebcb6f270057b063a5699296fdddc4","module":"Mathlib.NumberTheory.Zsqrtd.GaussianInt","note":"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.","pair_key":"2cdf292a11e04a6910e45b21ec1095ee115da62c1172d7a9f5165c3de4f79785","path":"Mathlib/NumberTheory/Zsqrtd/GaussianInt.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"abbrev GaussianInt : Type"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"PrincipalIdealRing.to_uniqueFactorizationMonoid","end_line":371,"library":"mathlib","line":370,"location_key":"263ce31730322b09918fd3bed247a3a6df3ae75c375c4c923c692c7c0ea737c5","module":"Mathlib.RingTheory.PrincipalIdealDomain","note":"The chain of instances from the Euclidean division on the Gaussian integers through principal ideals reaches this unique factorization instance.","pair_key":"e29d97beff7ca137ddee0d6932db44c6649158c1bf5203ce9f2cb965257fbcee","path":"Mathlib/RingTheory/PrincipalIdealDomain.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance PrincipalIdealRing.to_uniqueFactorizationMonoid {R : Type u} [CommRing R] [IsDomain R] [IsPrincipalIdealRing R] : UniqueFactorizationMonoid R"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"574ccdd9edc8e44c21ddc9f0aeef4f5672b9453a594143af458d9417d2aaf637","prominence":"central","quote":{"exact":"An example of such a domain is the Gaussian integers ⁠ Z"},"quote_capped":true,"section":["Abstract algebra","Prime elements of a ring"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"An example of such a domain is the Gaussian integers ⁠ Z [ i ] {\\displaystyle \\mathbb {Z} [i]} ⁠, the ring of complex numbers of the form a + b i {\\displaystyle a+bi} where ⁠ i {\\displaystyle i} ⁠ denotes the imaginary unit and ⁠ a {\\displaystyle a} ⁠ and ⁠ b {\\displaystyle b} ⁠ are arbitrary integers.","segments":[{"text":"An example of such a domain is the Gaussian integers ⁠ "},{"tex":"\\mathbb {Z} [i]"},{"text":" ⁠, the ring of complex numbers of the form "},{"tex":"a+bi"},{"text":" where ⁠ "},{"tex":"i"},{"text":" ⁠ denotes the imaginary unit and ⁠ "},{"tex":"a"},{"text":" ⁠ and ⁠ "},{"tex":"b"},{"text":" ⁠ are arbitrary integers."}]},"unresolved":null},{"absence":null,"basis":"20348be0bf18da9368ad8049cf2b3172fe5cf1c178841fa2db9a71c21af3b835","coverage":null,"id":"enwiki-23666-1373534600::In-text #aa6ade87","item":"In-text #aa6ade87","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Prime","end_line":44,"library":"mathlib","line":43,"location_key":"20348be0bf18da9368ad8049cf2b3172fe5cf1c178841fa2db9a71c21af3b835","module":"Mathlib.Algebra.Prime.Defs","note":"Mathlib defines the prime-element predicate for an arbitrary commutative monoid with zero, and the passage names its instance at the Gaussian integers.","pair_key":"7ffba473b5825144ebae27a16e54a49cd9169bf0a499c7b5e4159667c16a5891","path":"Mathlib/Algebra/Prime/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Prime {M : Type*} [CommMonoidWithZero M] : M → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c1386c420f08328a95b3d4abe2d13049eab67ef31f2587d9e292ed94111b3ee4","prominence":"central","quote":{"exact":"Its prime elements are known as Gaussian primes."},"quote_capped":false,"section":["Abstract algebra","Prime elements of a ring"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Its prime elements are known as Gaussian primes.","segments":[{"text":"Its prime elements are known as Gaussian primes."}]},"unresolved":null},{"absence":null,"basis":"97c2a4325b4b2131b50221e908f34b843d2539f2d60f66e82545b8aceede46b9","coverage":null,"id":"enwiki-23666-1373534600::In-text #e2a06fca","item":"In-text #e2a06fca","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"GaussianInt.prime_iff_mod_four_eq_three_of_nat_prime","end_line":85,"library":"mathlib","line":83,"location_key":"97c2a4325b4b2131b50221e908f34b843d2539f2d60f66e82545b8aceede46b9","module":"Mathlib.NumberTheory.Zsqrtd.QuadraticReciprocity","note":"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.","pair_key":"ed21804b921d0617f31c9b5b2ab6d5ca22a2d0087e4ac28f43691585b540a67d","path":"Mathlib/NumberTheory/Zsqrtd/QuadraticReciprocity.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem GaussianInt.prime_iff_mod_four_eq_three_of_nat_prime (p : ℕ) [Fact (Nat.Prime p)] : Prime ↑p ↔ p % 4 = 3"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"GaussianInt.mod_four_eq_three_of_nat_prime_of_prime","end_line":71,"library":"mathlib","line":34,"location_key":"e65ead9d86f10ffc1a4da9778d557672e4e91589f0f87b0b4a90d8ced15c4ca0","module":"Mathlib.NumberTheory.Zsqrtd.QuadraticReciprocity","note":"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.","pair_key":"56265923abaf4d785d0e978981391df11f27ea09f58b28e3d68ce727f7d94aeb","path":"Mathlib/NumberTheory/Zsqrtd/QuadraticReciprocity.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem GaussianInt.mod_four_eq_three_of_nat_prime_of_prime (p : ℕ) [hp : Fact (Nat.Prime p)] : Prime ↑p → p % 4 = 3"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b337cbe17137fcf4828ab2b40f897bf9792bf876546c2b75e00da6550e937e46","prominence":"supporting","quote":{"exact":"Not every number that is prime among the integers remains prime in"},"quote_capped":true,"section":["Abstract algebra","Prime elements of a ring"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":"; for instance, the number 2 can be written as a product of the two Gaussian primes 1 + i {\\displaystyle 1+i} and ⁠ 1 − i {\\displaystyle 1-i} ⁠.","segments":[{"text":"; for instance, the number 2 can be written as a product of the two Gaussian primes "},{"tex":"1+i"},{"text":" and ⁠ "},{"tex":"1-i"},{"text":" ⁠."}]},"layer":"Not every number that is prime among the integers remains prime in the Gaussian integers","segments":[{"text":"Not every number that is prime among the integers remains prime in the Gaussian integers"}]},"unresolved":null},{"absence":null,"basis":"951ee2500324a34628ec33140f6b0094ef90413e041d8c025777469a021c941f","coverage":null,"id":"enwiki-23666-1373534600::In-text #f0427ddb","item":"In-text #f0427ddb","kind":"example","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Zsqrtd.mul_star","end_line":281,"library":"mathlib","line":280,"location_key":"951ee2500324a34628ec33140f6b0094ef90413e041d8c025777469a021c941f","module":"Mathlib.NumberTheory.Zsqrtd.Basic","note":"The declaration yields the product of the two factors the passage names, but says nothing about their primality.","pair_key":"065d38859742764fd9d3c875622835d78939577dfbf54abc59ede34c43950910","path":"Mathlib/NumberTheory/Zsqrtd/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Zsqrtd.mul_star {d x y : ℤ} : { re := x, im := y } * Star.star { re := x, im := y } = ↑x * ↑x - ↑d * ↑y * ↑y"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"49a8ff87d81a363581efcfab15daddcc4a3bdd3eb620ab92ff960b6df9d423c1","prominence":"supporting","quote":{"exact":"for instance, the number 2 can be written as a product of"},"quote_capped":true,"section":["Abstract algebra","Prime elements of a ring"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"Not every number that is prime among the integers remains prime in the Gaussian integers; ","segments":[{"text":"Not every number that is prime among the integers remains prime in the Gaussian integers; "}]},"layer":"for instance, the number 2 can be written as a product of the two Gaussian primes 1 + i {\\displaystyle 1+i} and ⁠ 1 − i {\\displaystyle 1-i} ⁠.","segments":[{"text":"for instance, the number 2 can be written as a product of the two Gaussian primes "},{"tex":"1+i"},{"text":" and ⁠ "},{"tex":"1-i"},{"text":" ⁠."}]},"unresolved":null},{"absence":null,"basis":"e941185481fa4dd1a7b00b5c3cba02fd8cfc6d3083ac1073d363e21bf29a37aa","coverage":{"basis":false,"bundle_key":"553343746fa56eaad6a5da513608f8bc5e771e4cc26fbc139358aa98b1777aea","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"f8669b07f05a1e925ad0cb81270f8801d6031f4be89cde894bc5172cfb9332fc","text":"a rational prime that is 3 modulo 4 is a Gaussian prime"},{"id":"c2","part":"135c08cd972582c2464baa37b6db1f23d71203b653f0d4490b8d6a6e436efa9e","text":"a rational prime that is 1 modulo 4 is not a Gaussian prime"}],"parts":["f8669b07f05a1e925ad0cb81270f8801d6031f4be89cde894bc5172cfb9332fc","135c08cd972582c2464baa37b6db1f23d71203b653f0d4490b8d6a6e436efa9e"],"relation":"broadMatch","status":"formalized"},"id":"enwiki-23666-1373534600::In-text #7a8acb45","item":"In-text #7a8acb45","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"GaussianInt.prime_iff_mod_four_eq_three_of_nat_prime","end_line":85,"library":"mathlib","line":83,"location_key":"e941185481fa4dd1a7b00b5c3cba02fd8cfc6d3083ac1073d363e21bf29a37aa","module":"Mathlib.NumberTheory.Zsqrtd.QuadraticReciprocity","note":"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.","pair_key":"7f1f2a7eaccc16e321329892b27a5bc74493f092388286db5fa161aec09ceaf3","path":"Mathlib/NumberTheory/Zsqrtd/QuadraticReciprocity.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem GaussianInt.prime_iff_mod_four_eq_three_of_nat_prime (p : ℕ) [Fact (Nat.Prime p)] : Prime ↑p ↔ p % 4 = 3"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"GaussianInt.prime_of_nat_prime_of_mod_four_eq_three","end_line":80,"library":"mathlib","line":73,"location_key":"f8669b07f05a1e925ad0cb81270f8801d6031f4be89cde894bc5172cfb9332fc","module":"Mathlib.NumberTheory.Zsqrtd.QuadraticReciprocity","note":"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.","pair_key":"ef168fb34541667735bc0a8771344b4d9f3f04c8973438be2c1a798fb197d3d5","path":"Mathlib/NumberTheory/Zsqrtd/QuadraticReciprocity.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem GaussianInt.prime_of_nat_prime_of_mod_four_eq_three (p : ℕ) [Fact (Nat.Prime p)] : p % 4 = 3 → Prime ↑p"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"GaussianInt.mod_four_eq_three_of_nat_prime_of_prime","end_line":71,"library":"mathlib","line":34,"location_key":"135c08cd972582c2464baa37b6db1f23d71203b653f0d4490b8d6a6e436efa9e","module":"Mathlib.NumberTheory.Zsqrtd.QuadraticReciprocity","note":"The binder is a natural number p : ℕ, and it also covers the prime two, a case the conjunct does not speak about.","pair_key":"f437d0a811bd05d9055bde2f893105d31bf9dc5f00ef6df26ba1f7a0e745b958","path":"Mathlib/NumberTheory/Zsqrtd/QuadraticReciprocity.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem GaussianInt.mod_four_eq_three_of_nat_prime_of_prime (p : ℕ) [hp : Fact (Nat.Prime p)] : Prime ↑p → p % 4 = 3"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"322d6e93296c1239f54a7b78144725f967134f2945e95f13b6271502f82a6b2f","prominence":"central","quote":{"exact":"Rational primes (the prime elements in the integers) congruent to 3 mod"},"quote_capped":true,"section":["Abstract algebra","Prime elements of a ring"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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]","segments":[{"text":"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."},{"ref":"[116]"}]},"unresolved":null},{"absence":null,"basis":"3ab8c7d115931458df9387fbd610b4daf93a3e863f8b764c1429d43b12c1e191","coverage":null,"id":"enwiki-23666-1373534600::In-text #86cbc369","item":"In-text #86cbc369","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.Prime.sq_add_sq","end_line":39,"library":"mathlib","line":36,"location_key":"3ab8c7d115931458df9387fbd610b4daf93a3e863f8b764c1429d43b12c1e191","module":"Mathlib.NumberTheory.SumTwoSquares","note":"It yields the representation as a sum of two squares, and not the converse direction of the passage's criterion.","pair_key":"efdc718d7e71a23864ad7e1d85dcaed10a682386e813c5c174b91c20d9210a75","path":"Mathlib/NumberTheory/SumTwoSquares.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.Prime.sq_add_sq {p : ℕ} [Fact (Nat.Prime p)] : p % 4 ≠ 3 → ∃ a b, a ^ 2 + b ^ 2 = p"},"statement":false},{"challenge":"downgraded","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Zsqrtd.mul_star","end_line":281,"library":"mathlib","line":280,"location_key":"ada603e20b7a2d904d796996ff17ecc80c44c6c90d98f604a291ccd77885c73e","module":"Mathlib.NumberTheory.Zsqrtd.Basic","note":"It supplies the factoring step of the passage, with the sum of two squares taken as given.","pair_key":"dbce0348e9a4c68848ac5ee52604d490beadeb574aedbf210087dbdbc739da05","path":"Mathlib/NumberTheory/Zsqrtd/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Zsqrtd.mul_star {d x y : ℤ} : { re := x, im := y } * Star.star { re := x, im := y } = ↑x * ↑x - ↑d * ↑y * ↑y"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d488f63c214fbe5a06e0356b76f53d27d539fc396d53fdada2a4e19c3465e232","prominence":"central","quote":{"exact":"This is a consequence of Fermat's theorem on sums of two squares,"},"quote_capped":true,"section":["Abstract algebra","Prime elements of a ring"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"This is a consequence of Fermat's theorem on sums of two squares, which states that an odd prime ⁠ p {\\displaystyle p} ⁠ is expressible as the sum of two squares, ⁠ p = x 2 + y 2 {\\displaystyle p=x^{2}+y^{2}} ⁠, and therefore factorable as ⁠ p = ( x + i y ) ( x − i y ) {\\displaystyle p=(x+iy)(x-iy)} ⁠, exactly when ⁠ p {\\displaystyle p} ⁠ is 1 mod 4.","segments":[{"text":"This is a consequence of Fermat's theorem on sums of two squares, which states that an odd prime ⁠ "},{"tex":"p"},{"text":" ⁠ is expressible as the sum of two squares, ⁠ "},{"tex":"p=x^{2}+y^{2}"},{"text":" ⁠, and therefore factorable as ⁠ "},{"tex":"p=(x+iy)(x-iy)"},{"text":" ⁠, exactly when ⁠ "},{"tex":"p"},{"text":" ⁠ is 1 mod 4."}]},"unresolved":null},{"absence":null,"basis":"385b3e8feff159cff8b47d81bf1ffc60366db96f294c098e7ede692268cdff42","coverage":null,"id":"enwiki-23666-1373534600::In-text #58bd5161","item":"In-text #58bd5161","kind":"theorem","locations":[{"challenge":"survived","commit":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d","confidence":"medium","declaration":"QuadraticAlgebra.not_uniqueFactorizationMonoid_int_negFive","end_line":152,"library":"ff-quadratic-algebras","line":147,"location_key":"385b3e8feff159cff8b47d81bf1ffc60366db96f294c098e7ede692268cdff42","module":"QuadraticAlgebras.SqrtNegFive","note":"The library fixes one commutative ring and denies the UniqueFactorizationMonoid property of it, where the passage only asserts that some such ring exists.","pair_key":"0d5fe1272905264b8d2e29d4b4cb1900c0f99f011f5a7a9509abd10a4cb87963","path":"QuadraticAlgebras/SqrtNegFive.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/FormalFrontier/quadratic-algebras","signature":{"elided":false,"text":"theorem QuadraticAlgebra.not_uniqueFactorizationMonoid_int_negFive : ¬UniqueFactorizationMonoid (QuadraticAlgebra ℤ (-5) 0)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"ba8af854f4666f1a566f47ebbf949359942ee39fbd692b5eea2666c4d6b8c0f0","prominence":"supporting","quote":{"exact":"Not every ring is a unique factorization domain."},"quote_capped":false,"section":["Abstract algebra","Prime ideals"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Not every ring is a unique factorization domain.","segments":[{"text":"Not every ring is a unique factorization domain."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"983ebb87f65147bea9bf9fc0329f75c1a7553b17d3c915e181fa30dd862bd93b"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #078cff4d","item":"In-text #078cff4d","kind":"example","locations":[{"challenge":"sampled_out","commit":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d","confidence":"high","declaration":"QuadraticAlgebra.not_uniqueFactorizationMonoid_int_negFive","end_line":152,"library":"ff-quadratic-algebras","line":147,"location_key":"275f6357eaca1da5b2b0b7de5f41585f2a3ca125f79e4af7f8b03b20fc174f88","module":"QuadraticAlgebras.SqrtNegFive","note":"It denies the unique factorization property of the same ring, but names neither 21, nor its two factorizations, nor the irreducibility of the four factors.","pair_key":"59ed3b2b49f24f0578e9d484ca312d60bee8b60a8e8a896020caca9f2280c01c","path":"QuadraticAlgebras/SqrtNegFive.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/FormalFrontier/quadratic-algebras","signature":{"elided":false,"text":"theorem QuadraticAlgebra.not_uniqueFactorizationMonoid_int_negFive : ¬UniqueFactorizationMonoid (QuadraticAlgebra ℤ (-5) 0)"},"statement":false},{"challenge":"survived","commit":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d","confidence":"high","declaration":"QuadraticAlgebra.irreducible_two_int_negFive","end_line":110,"library":"ff-quadratic-algebras","line":76,"location_key":"d6242f8b5378882ea85d874c62f3fa5452b7dff559090287763ae095208eaeae","module":"QuadraticAlgebras.SqrtNegFive","note":"It states irreducibility of the element 2 of the same ring, an element that does not occur in the passage's factorizations of 21.","pair_key":"7710a4fb537e85d2113f89ea36e4312fe0afe906cf10c37c957d1456b3808db5","path":"QuadraticAlgebras/SqrtNegFive.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/FormalFrontier/quadratic-algebras","signature":{"elided":false,"text":"theorem QuadraticAlgebra.irreducible_two_int_negFive : Irreducible 2"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"3f83b9307915659ac84eaa2fee4ca170621547decae40da463aaceb6199fbea4","prominence":"supporting","quote":{"exact":"For instance, in the ring of numbers a + b − 5"},"quote_capped":true,"section":["Abstract algebra","Prime ideals"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":", so it does not have a unique factorization.","segments":[{"text":", so it does not have a unique factorization."}]},"layer":"For instance, in the ring of numbers a + b − 5 {\\displaystyle a+b{\\sqrt {-5}}} (for integers ⁠ a {\\displaystyle a} ⁠ and ⁠ b {\\displaystyle b} ⁠) the number 21 {\\displaystyle 21} has two factorizations ⁠ 21 = 3 ⋅ 7 = ( 1 + 2 − 5 ) ( 1 − 2 − 5 ) {\\displaystyle 21=3\\cdot 7=(1+2{\\sqrt {-5}})(1-2{\\sqrt {-5}})} ⁠, where none of the four factors can be reduced any further","segments":[{"text":"For instance, in the ring of numbers "},{"tex":"a+b{\\sqrt {-5}}"},{"text":" (for integers ⁠ "},{"tex":"a"},{"text":" ⁠ and ⁠ "},{"tex":"b"},{"text":" ⁠) the number "},{"tex":"21"},{"text":" has two factorizations ⁠ "},{"tex":"21=3\\cdot 7=(1+2{\\sqrt {-5}})(1-2{\\sqrt {-5}})"},{"text":" ⁠, where none of the four factors can be reduced any further"}]},"unresolved":null},{"absence":null,"basis":"d61c0ad5a49031c710088a4d0b31c2ee000ef9811613c7b2f14e210b9796b8d2","coverage":null,"id":"enwiki-23666-1373534600::In-text #5eaa2cb1","item":"In-text #5eaa2cb1","kind":"theorem","locations":[{"challenge":"survived","commit":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d","confidence":"high","declaration":"QuadraticAlgebra.not_uniqueFactorizationMonoid_int_negFive","end_line":152,"library":"ff-quadratic-algebras","line":147,"location_key":"d61c0ad5a49031c710088a4d0b31c2ee000ef9811613c7b2f14e210b9796b8d2","module":"QuadraticAlgebras.SqrtNegFive","note":"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.","pair_key":"19211f7de73dc9085fb48865ab89a4f7b5a8c1260d34949b163d785915ee99ad","path":"QuadraticAlgebras/SqrtNegFive.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/FormalFrontier/quadratic-algebras","signature":{"elided":false,"text":"theorem QuadraticAlgebra.not_uniqueFactorizationMonoid_int_negFive : ¬UniqueFactorizationMonoid (QuadraticAlgebra ℤ (-5) 0)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"ecf619045431286f527a74af878838d1b00e7837968bac30845fb4bffc673c56","prominence":"supporting","quote":{"exact":"it does not have a unique factorization."},"quote_capped":false,"section":["Abstract algebra","Prime ideals"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"a + b − 5 {\\displaystyle a+b{\\sqrt {-5}}} (for integers ⁠ a {\\displaystyle a} ⁠ and ⁠ b {\\displaystyle b} ⁠) the number 21 {\\displaystyle 21} has two factorizations ⁠ 21 = 3 ⋅ 7 = ( 1 + 2 − 5 ) ( 1 − 2 − 5 ) {\\displaystyle 21=3\\cdot 7=(1+2{\\sqrt {-5}})(1-2{\\sqrt {-5}})} ⁠, where none of the four factors can be reduced any further, so ","segments":[{"tex":"a+b{\\sqrt {-5}}"},{"text":" (for integers ⁠ "},{"tex":"a"},{"text":" ⁠ and ⁠ "},{"tex":"b"},{"text":" ⁠) the number "},{"tex":"21"},{"text":" has two factorizations ⁠ "},{"tex":"21=3\\cdot 7=(1+2{\\sqrt {-5}})(1-2{\\sqrt {-5}})"},{"text":" ⁠, where none of the four factors can be reduced any further, so "}],"trimmed":true},"layer":"it does not have a unique factorization.","segments":[{"text":"it does not have a unique factorization."}]},"unresolved":null},{"absence":null,"basis":"834cb011985fa28b94336e1cb0e7f37df95f267a56d19e55eb2c7c46dd443685","coverage":null,"id":"enwiki-23666-1373534600::In-text #5248bae8","item":"In-text #5248bae8","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Ideal","end_line":41,"library":"mathlib","line":40,"location_key":"834cb011985fa28b94336e1cb0e7f37df95f267a56d19e55eb2c7c46dd443685","module":"Mathlib.RingTheory.Ideal.Defs","note":"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.","pair_key":"3060666cbbe4163d106118cd515137acad987f3bcf9834a2e455dff852a16773","path":"Mathlib/RingTheory/Ideal/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"abbrev Ideal (R : Type u) [Semiring R] : Type u"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f7be3c79170ded7a17ca155f62d96d5c9336dfe03d4900a2483f2f6b7648a145","prominence":"central","quote":{"exact":"In order to extend unique factorization to a larger class of rings,"},"quote_capped":true,"section":["Abstract algebra","Prime ideals"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"9eb6f5eb2ab6376b1cf4b014bbc4a4380fb8e05d01b0a6b2872588b89a44fe98","coverage":null,"id":"enwiki-23666-1373534600::In-text #33c70904","item":"In-text #33c70904","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Ideal.isPrime_span_singleton_of_prime","end_line":152,"library":"mathlib","line":151,"location_key":"9eb6f5eb2ab6376b1cf4b014bbc4a4380fb8e05d01b0a6b2872588b89a44fe98","module":"Mathlib.RingTheory.Ideal.Maximal","note":"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.","pair_key":"e81279139e9edf4486cad2bd1282e021ad7e84805088b2368341e15898887616","path":"Mathlib/RingTheory/Ideal/Maximal.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Ideal.isPrime_span_singleton_of_prime {α : Type u} [CommSemiring α] {p : α} : Prime p → (Ideal.span {p}).IsPrime"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Ideal.span_singleton_prime","end_line":149,"library":"mathlib","line":148,"location_key":"ef48b56882bc25af8db32bb5f5a4edf61dc970b631b5d6af3c482372d44cbbd7","module":"Mathlib.RingTheory.Ideal.Maximal","note":"An equivalence between primality of the element and primality of the ideal it spans, assumed nonzero, over commutative semirings.","pair_key":"e93b518c039786cfcfd795cd38efcea7f0128709b256bd8bfc7ab198b813cca5","path":"Mathlib/RingTheory/Ideal/Maximal.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Ideal.span_singleton_prime {α : Type u} [CommSemiring α] {p : α} : p ≠ 0 → ((Ideal.span {p}).IsPrime ↔ Prime p)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"73c97a0a61a3434a1a0258b72282e436f7751bd3d8add16c51ef36b4df10faec","prominence":"central","quote":{"exact":"Prime ideals, which generalize prime elements in the sense that the principal"},"quote_capped":true,"section":["Abstract algebra","Prime ideals"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"5ec40ddd7c51b61064e495bf4ac40df5065f8bd2037cc9bab794a13eea57b753","coverage":null,"id":"enwiki-23666-1373534600::In-text #54c080cc","item":"In-text #54c080cc","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Ideal.isPrime_int_iff","end_line":89,"library":"mathlib","line":85,"location_key":"5ec40ddd7c51b61064e495bf4ac40df5065f8bd2037cc9bab794a13eea57b753","module":"Mathlib.RingTheory.Ideal.NatInt","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.","pair_key":"823e4ae571c6fb26661a4b2e097ea220d7fcc4507d5aaa51b5170a38d4634c31","path":"Mathlib/RingTheory/Ideal/NatInt.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Ideal.isPrime_int_iff {P : Ideal ℤ} : P.IsPrime ↔ P = ⊥ ∨ ∃ p, Nat.Prime p ∧ P = Ideal.span {↑p}"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Ideal.isPrime_iff_of_isPrincipalIdealRing_of_noZeroDivisors","end_line":275,"library":"mathlib","line":271,"location_key":"a6e558b63b247726571cdb52c73da41bab7aa3c95ce3bdd6996004abd5202eea","module":"Mathlib.RingTheory.Ideal.Maximal","note":"At ℤ it gives the zero ideal or a span of a prime ring element, and matching that with the article's list of positive prime numbers needs a further named lemma about integer primes.","pair_key":"763caeb1230ec577e893007c89e04ac9b2c3f22b99b0b033b1ac5dfd5955f1e7","path":"Mathlib/RingTheory/Ideal/Maximal.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Ideal.isPrime_iff_of_isPrincipalIdealRing_of_noZeroDivisors {α : Type u} [CommSemiring α] [IsPrincipalIdealRing α] [NoZeroDivisors α] [Nontrivial α] {P : Ideal α} : P.IsPrime ↔ P = ⊥ ∨ ∃ p, Prime p ∧ P = Ideal.span {p}"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"fbc0b7be86db32702c3cd892c07a4c8e0b9ce9de103e07385d0992a1936d9574","prominence":"supporting","quote":{"exact":"The prime ideals of the ring of integers are the ideals ⁠"},"quote_capped":true,"section":["Abstract algebra","Prime ideals"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"The prime ideals of the ring of integers are the ideals ⁠ ( 0 ) {\\displaystyle (0)} ⁠, ⁠ ( 2 ) {\\displaystyle (2)} ⁠, ⁠ ( 3 ) {\\displaystyle (3)} ⁠, ⁠ ( 5 ) {\\displaystyle (5)} ⁠, ⁠ ( 7 ) {\\displaystyle (7)} ⁠, ⁠ ( 11 ) {\\displaystyle (11)} ⁠, ...","segments":[{"text":"The prime ideals of the ring of integers are the ideals ⁠ "},{"tex":"(0)"},{"text":" ⁠, ⁠ "},{"tex":"(2)"},{"text":" ⁠, ⁠ "},{"tex":"(3)"},{"text":" ⁠, ⁠ "},{"tex":"(5)"},{"text":" ⁠, ⁠ "},{"tex":"(7)"},{"text":" ⁠, ⁠ "},{"tex":"(11)"},{"text":" ⁠, ..."}]},"unresolved":null},{"absence":null,"basis":"3334f969d336338f05db73e4e0356aaaf4f075cefdd5af64edb1253fddf029db","coverage":null,"id":"enwiki-23666-1373534600::In-text #076c72a6","item":"In-text #076c72a6","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Submodule.isLasker","end_line":276,"library":"mathlib","line":275,"location_key":"3334f969d336338f05db73e4e0356aaaf4f075cefdd5af64edb1253fddf029db","module":"Mathlib.RingTheory.Lasker","note":"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.","pair_key":"2fcc3299854c13b18941dc917b453318e64e9c1c6d7fe7e2c59ea2e9bfd32283","path":"Mathlib/RingTheory/Lasker.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Submodule.isLasker (R : Type*) (M : Type*) [CommRing R] [AddCommGroup M] [_root_.Module R M] [IsNoetherian R M] : IsLasker R M"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Submodule.IsLasker.exists_isMinimalPrimaryDecomposition","end_line":116,"library":"mathlib","line":110,"location_key":"ece109ac98d4f7e1e5177fe97e813fea801d120d5785a31f3018e3cf3fdbfdbf","module":"Mathlib.RingTheory.Lasker","note":"It refines a decomposition to a minimal one but takes the decomposition property as a hypothesis instead of deriving it from the Noetherian condition.","pair_key":"47e28e02b098e0b1ea9f7a8f4d83beacd2bf2cbc34aa00d5ea403104704f6b8a","path":"Mathlib/RingTheory/Lasker.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Submodule.IsLasker.exists_isMinimalPrimaryDecomposition {R : Type*} {M : Type*} [CommSemiring R] [AddCommMonoid M] [_root_.Module R M] : IsLasker R M → ∀ (N : Submodule R M), ∃ t, N.IsMinimalPrimaryDecomposition t"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"9c04105f5fa37946e2c8c9220908283ce21358d68097e7f0e5fcfed64d976c01","prominence":"central","quote":{"exact":"The fundamental theorem of arithmetic generalizes to the Lasker–Noether theorem, which expresses"},"quote_capped":true,"section":["Abstract algebra","Prime ideals"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"d460f6821b9544154c35bef3095382da63a974e189df224ba2f43cfcfb4667ee","coverage":null,"id":"enwiki-23666-1373534600::In-text #8131cc27","item":"In-text #8131cc27","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"PrimeSpectrum","end_line":36,"library":"mathlib","line":34,"location_key":"d460f6821b9544154c35bef3095382da63a974e189df224ba2f43cfcfb4667ee","module":"Mathlib.RingTheory.Spectrum.Prime.Defs","note":"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.","pair_key":"3684c15f6114dfc17ae0eb40086a57bfb9c9c3648c81fd5c3fd1099991bd6121","path":"Mathlib/RingTheory/Spectrum/Prime/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure PrimeSpectrum (R : Type*) [CommSemiring R]"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"PrimeSpectrum.zariskiTopology","end_line":135,"library":"mathlib","line":125,"location_key":"204ebc2c36adc82b441976013bbcb6b4f03e626f984fd79aceaa543a8338fd61","module":"Mathlib.RingTheory.Spectrum.Prime.Topology","note":"It equips the prime spectrum with the topology that makes it geometric, without itself saying what the points of the spectrum are.","pair_key":"3bdcaa565fb9c2da064af0a96b3610c53ffca1c7d33d002b576268ecf9c6476c","path":"Mathlib/RingTheory/Spectrum/Prime/Topology.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance PrimeSpectrum.zariskiTopology {R : Type u} [CommSemiring R] : TopologicalSpace (PrimeSpectrum R)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c65c5d673c4c02e7b2f6619353fdb347f46fede0685e9f6dccaa17badcf3a183","prominence":"central","quote":{"exact":"The spectrum of a ring is a geometric space whose points are"},"quote_capped":true,"section":["Abstract algebra","Prime ideals"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"The spectrum of a ring is a geometric space whose points are the prime ideals of the ring.[119]","segments":[{"text":"The spectrum of a ring is a geometric space whose points are the prime ideals of the ring."},{"ref":"[119]"}]},"unresolved":null},{"absence":null,"basis":"baa5d30694a955b65dd7c2a55b37473cdf13ab32f999acfa742fee9bef11ec89","coverage":null,"id":"enwiki-23666-1373534600::In-text #63e893da","item":"In-text #63e893da","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Sylow.exists_subgroup_card_pow_prime","end_line":727,"library":"mathlib","line":723,"location_key":"baa5d30694a955b65dd7c2a55b37473cdf13ab32f999acfa742fee9bef11ec89","module":"Mathlib.GroupTheory.Sylow","note":"Lean measures the order with Nat.card and returns the subgroup as an existential over subgroups of G.","pair_key":"e9f66ba23d4fa6717a08a9879fe95766e9aeab201c1599ef31422688a7cce7c6","path":"Mathlib/GroupTheory/Sylow.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f643608738828a3efc4cc9aff4e5fad33c4c0c22c850c3a3353684bf7aa11dce","prominence":"central","quote":{"exact":"In the theory of finite groups the Sylow theorems imply that, if"},"quote_capped":true,"section":["Abstract algebra","Group theory"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"In the theory of finite groups the Sylow theorems imply that, if a power of a prime number p n {\\displaystyle p^{n}} divides the order of a group, then the group has a subgroup of order ⁠ p n {\\displaystyle p^{n}} ⁠.","segments":[{"text":"In the theory of finite groups the Sylow theorems imply that, if a power of a prime number "},{"tex":"p^{n}"},{"text":" divides the order of a group, then the group has a subgroup of order ⁠ "},{"tex":"p^{n}"},{"text":" ⁠."}]},"unresolved":null},{"absence":null,"basis":"42e6c86121afc8ed625fb3a9cd11b20010da6252b356c79132dced8098065b59","coverage":null,"id":"enwiki-23666-1373534600::In-text #d57ce5c9","item":"In-text #d57ce5c9","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"isCyclic_of_prime_card","end_line":123,"library":"mathlib","line":118,"location_key":"42e6c86121afc8ed625fb3a9cd11b20010da6252b356c79132dced8098065b59","module":"Mathlib.GroupTheory.SpecificGroups.Cyclic.Subgroup","note":"Lean records the order as Nat.card and the conclusion as the IsCyclic predicate.","pair_key":"c0ac0d15d7a0fa965490a90be9b91f9b08e468290c29247ed0749355278ff6d0","path":"Mathlib/GroupTheory/SpecificGroups/Cyclic/Subgroup.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem isCyclic_of_prime_card {α : Type*} [Group α] {p : ℕ} [hp : Fact (Nat.Prime p)] : Nat.card α = p → IsCyclic α"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"0752fc53ef6108c36950695a2fc4071fe897b0396d301a1bcdf548f883d0ba42","prominence":"central","quote":{"exact":"By Lagrange's theorem, any group of prime order is a cyclic group"},"quote_capped":false,"section":["Abstract algebra","Group theory"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":", and by Burnside's theorem any group whose order is divisible by only two primes is solvable.","segments":[{"text":", and by Burnside's theorem any group whose order is divisible by only two primes is solvable."}]},"layer":"By Lagrange's theorem, any group of prime order is a cyclic group","segments":[{"text":"By Lagrange's theorem, any group of prime order is a cyclic group"}]},"unresolved":null},{"absence":null,"basis":"bfed7fdaf3c211152b20fa6f9866e85321ccbd9d11a0ebb4436e38e458463979","coverage":null,"id":"enwiki-23666-1373534600::In-text #a7dd065d","item":"In-text #a7dd065d","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"BurnsidePaqb.burnside_paqb","library":"atlas","line":60,"location_key":"bfed7fdaf3c211152b20fa6f9866e85321ccbd9d11a0ebb4436e38e458463979","module":"MathlibExt.GroupTheory.BurnsidePaqb","note":"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.","pair_key":"cbbc7afa43f723c8e3242a43f3d54158590c39a0d8ce38e85a2a000505881adc","path":"MathlibExt/GroupTheory/BurnsidePaqb.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.isSolvable_of_card_eq_prime_pow_mul_prime_pow","end_line":221,"library":"tauceti","line":219,"location_key":"dd7f6d7884deb21c7fa89ba80a8b7c5e6596e1e9ca3f4c600be5aabaca08d52e","module":"TauCeti.RepresentationTheory.CharacterTable.Solvable","note":"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.","pair_key":"8a8b2daedf2fb8955a1e0009b3cea21413f19d684b74f74057eabc41bda04ce3","path":"TauCeti/RepresentationTheory/CharacterTable/Solvable.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d32c3c30327b0d21c5e6041b63bcd58f3b881e76e105a736915876d408e322da","prominence":"central","quote":{"exact":"by Burnside's theorem any group whose order is divisible by only two"},"quote_capped":true,"section":["Abstract algebra","Group theory"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"By Lagrange's theorem, any group of prime order is a cyclic group, and ","segments":[{"text":"By Lagrange's theorem, any group of prime order is a cyclic group, and "}]},"layer":"by Burnside's theorem any group whose order is divisible by only two primes is solvable.","segments":[{"text":"by Burnside's theorem any group whose order is divisible by only two primes is solvable."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"00769e0ab44b74d0b00759beb85aa5165b63adcac8962fcf5f167fbe54e9054e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #ca8fd072","item":"In-text #ca8fd072","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.decidablePrime","end_line":163,"library":"mathlib","line":162,"location_key":"90ef40f2c013f93a6af43807bf0dc4f72cb79766de1796a16f6c8c52465fc758","module":"Mathlib.Data.Nat.Prime.Defs","note":"This is the kernel-facing decision procedure for primality of a natural number; what it states is that primality can be decided, not that the check proceeds by dividing by the numbers up to the square root.","pair_key":"d6a343536b5871deb9023d9de18253320e55215b59c7edf70ac30a2e243ca3db","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Nat.decidablePrime (p : ℕ) : Decidable (Nat.Prime p)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e41182ec7cc32a1554df23ee2bc8f89150b8f0d4ba570d4550acaf94d83c6a84","prominence":"central","quote":{"exact":"The most basic method of checking the primality of a given integer"},"quote_capped":true,"section":["Computational methods","Trial division"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"The most basic method of checking the primality of a given integer ⁠ n {\\displaystyle n} ⁠ is called trial division.","segments":[{"text":"The most basic method of checking the primality of a given integer ⁠ "},{"tex":"n"},{"text":" ⁠ is called trial division."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"15da95f31df5ee79966237e293e231e05dab9b297facf21096ab1e581127f012"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #6108731d","item":"In-text #6108731d","kind":"construction","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.prime_def_le_sqrt","end_line":131,"library":"mathlib","line":124,"location_key":"5b6378babc8479e637ffd2c78652989d8ade37efa70ffd86732d1e3bd7991559","module":"Mathlib.Data.Nat.Prime.Defs","note":"This fixes the same range of candidate divisors, from two up to the integer square root, but it states a criterion for primality rather than describing a procedure that performs those divisions.","pair_key":"46ef414e83a0ef94d3feabb6c8b0021a85c834de75c5a685bf75c595b8b47047","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prime_def_le_sqrt {p : ℕ} : Nat.Prime p ↔ 2 ≤ p ∧ ∀ (m : ℕ), 2 ≤ m → m ≤ p.sqrt → ¬m ∣ p"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"262ff225998ab5c6ae3e3c0ea5fcafb2776fc161ad3f8ba45bd7e367b1182eee","prominence":"supporting","quote":{"exact":"This method divides ⁠ n {\\displaystyle n} ⁠ by each integer from"},"quote_capped":true,"section":["Computational methods","Trial division"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"This method divides ⁠ n {\\displaystyle n} ⁠ by each integer from 2 up to the square root of ⁠ n {\\displaystyle n} ⁠.","segments":[{"text":"This method divides ⁠ "},{"tex":"n"},{"text":" ⁠ by each integer from 2 up to the square root of ⁠ "},{"tex":"n"},{"text":" ⁠."}]},"unresolved":null},{"absence":null,"basis":"a91d2688d9a00f257b49c164b1b02045737290980d984d82ee43531b24a2f01e","coverage":null,"id":"enwiki-23666-1373534600::In-text #f683ba4f","item":"In-text #f683ba4f","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.prime_def_le_sqrt","end_line":131,"library":"mathlib","line":124,"location_key":"a91d2688d9a00f257b49c164b1b02045737290980d984d82ee43531b24a2f01e","module":"Mathlib.Data.Nat.Prime.Defs","note":"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.","pair_key":"97f80b111cdba0e78d6b2bcefa9524bd7c1b2c0af1f25d97847fc60f50bf2344","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prime_def_le_sqrt {p : ℕ} : Nat.Prime p ↔ 2 ≤ p ∧ ∀ (m : ℕ), 2 ≤ m → m ≤ p.sqrt → ¬m ∣ p"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"40cd8a1722584e1ae102d7b052534c2a03948f383d50df227297df47f655ffec","prominence":"supporting","quote":{"exact":"Any such integer dividing ⁠ n {\\displaystyle n} ⁠ evenly establishes ⁠"},"quote_capped":true,"section":["Computational methods","Trial division"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Any such integer dividing ⁠ n {\\displaystyle n} ⁠ evenly establishes ⁠ n {\\displaystyle n} ⁠ as composite; otherwise it is prime.","segments":[{"text":"Any such integer dividing ⁠ "},{"tex":"n"},{"text":" ⁠ evenly establishes ⁠ "},{"tex":"n"},{"text":" ⁠ as composite; otherwise it is prime."}]},"unresolved":null},{"absence":null,"basis":"b0cda0b081a258a01ac1a01bfed1a69bd6501de9c41f73aa88f2168e4641b9d8","coverage":null,"id":"enwiki-23666-1373534600::In-text #1dee6a26","item":"In-text #1dee6a26","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.le_sqrt_of_eq_mul","end_line":137,"library":"mathlib","line":134,"location_key":"b0cda0b081a258a01ac1a01bfed1a69bd6501de9c41f73aa88f2168e4641b9d8","module":"Mathlib.Data.Nat.Sqrt","note":"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.","pair_key":"47ced959b59d77d6895dc3812a46d79bc5ed544e85bd99283cde507deee644ea","path":"Mathlib/Data/Nat/Sqrt.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.le_sqrt_of_eq_mul {a b c : ℕ} : a = b * c → b ≤ a.sqrt ∨ c ≤ a.sqrt"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f87c51313dc0784a21baa66e35f43e68c5d656d8bc5226381dd434800d3cb5e0","prominence":"supporting","quote":{"exact":"whenever ⁠ n = a ⋅ b {\\displaystyle n=a\\cdot b} ⁠, one"},"quote_capped":true,"section":["Computational methods","Trial division"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"Integers larger than the square root do not need to be checked because, ","segments":[{"text":"Integers larger than the square root do not need to be checked because, "}]},"layer":"whenever ⁠ n = a ⋅ b {\\displaystyle n=a\\cdot b} ⁠, one of the two factors ⁠ a {\\displaystyle a} ⁠ and ⁠ b {\\displaystyle b} ⁠ is less than or equal to the square root of ⁠ n {\\displaystyle n} ⁠.","segments":[{"text":"whenever ⁠ "},{"tex":"n=a\\cdot b"},{"text":" ⁠, one of the two factors ⁠ "},{"tex":"a"},{"text":" ⁠ and ⁠ "},{"tex":"b"},{"text":" ⁠ is less than or equal to the square root of ⁠ "},{"tex":"n"},{"text":" ⁠."}]},"unresolved":null},{"absence":null,"basis":"ad3fbaab4f1b80d061e5493d21e7a30ca48ef17a047e0b47093345e8ff4796fa","coverage":null,"id":"enwiki-23666-1373534600::In-text #73d00cdf","item":"In-text #73d00cdf","kind":"example","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.fact_prime_thirtySeven_symmetricFour","end_line":57,"library":"tauceti","line":56,"location_key":"ad3fbaab4f1b80d061e5493d21e7a30ca48ef17a047e0b47093345e8ff4796fa","module":"TauCeti.RepresentationTheory.CharacterTable.Dixon.Rational.SymmetricFour.Solver","note":"Lean wraps the primality of 37 in the Fact class used for instance search; primality says more than the three divisions the passage reports.","pair_key":"bd26115db19447b5649ab5d61d410ae14f8f9fec66cca3b6fb08c928468dea8e","path":"TauCeti/RepresentationTheory/CharacterTable/Dixon/Rational/SymmetricFour/Solver.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.fact_prime_thirtySeven_symmetricFour : Fact (Nat.Prime 37)"},"statement":false},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"low","declaration":"PierpontPrime.thirtySeven_isPierpontPrime","end_line":47,"library":"formal-conjectures","line":45,"location_key":"7f58d461832ffb6407bdc2bedda37deedca172ad5eb6ae4fee93d231659b80ff","module":"FormalConjectures.Wikipedia.PierpontPrime","note":"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.","pair_key":"81f9d73ec8c3e7893ac74669463eb870ec41de8a04d7aa7004e94d3c4f8d4bdc","path":"FormalConjectures/Wikipedia/PierpontPrime.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem PierpontPrime.thirtySeven_isPierpontPrime : PierpontPrime.IsPierpontPrime 37"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"5fc59d83ca7db13c1678e92a13d6deb342adb07c467ec92e69cfb7aafe4802e9","prominence":"supporting","quote":{"exact":"Each division produces a nonzero remainder"},"quote_capped":false,"section":["Computational methods","Trial division"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"after":{"layer":", so 37 is indeed prime.","segments":[{"text":", so 37 is indeed prime."}]},"layer":"Each division produces a nonzero remainder","segments":[{"text":"Each division produces a nonzero remainder"}]},"unresolved":null},{"absence":null,"basis":"b2dc678dc37c42b86d42566e8c13376ad42cc1339e5f89d3ae9a917541964187","coverage":null,"id":"enwiki-23666-1373534600::In-text #e53660d6","item":"In-text #e53660d6","kind":"example","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.fact_prime_thirtySeven_symmetricFour","end_line":57,"library":"tauceti","line":56,"location_key":"b2dc678dc37c42b86d42566e8c13376ad42cc1339e5f89d3ae9a917541964187","module":"TauCeti.RepresentationTheory.CharacterTable.Dixon.Rational.SymmetricFour.Solver","note":"Lean wraps the primality of 37 in the Fact typeclass so instance search can find it; the wrapper has one field, that primality.","pair_key":"59f5f9ecdc8799810a5126d015237f387616e1c113b78eaa0a0e94400d3b0cd5","path":"TauCeti/RepresentationTheory/CharacterTable/Dixon/Rational/SymmetricFour/Solver.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.fact_prime_thirtySeven_symmetricFour : Fact (Nat.Prime 37)"},"statement":false},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"PierpontPrime.thirtySeven_isPierpontPrime","end_line":47,"library":"formal-conjectures","line":45,"location_key":"8d6d5debaf849161f7e1b790b80cf1127b1316803eff019f35a91b19dbc65c39","module":"FormalConjectures.Wikipedia.PierpontPrime","note":"Besides primality the declaration records that 37 is one more than a product of powers of two and of three.","pair_key":"f22c02b634b447b197664aa47d68544c7edf2fdc78020ef4521355563efe9b6f","path":"FormalConjectures/Wikipedia/PierpontPrime.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem PierpontPrime.thirtySeven_isPierpontPrime : PierpontPrime.IsPierpontPrime 37"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7a13309ac47ef94949e0a23c1dae98d3711f7e624d20b74fd094aeb1dcb42835","prominence":"supporting","quote":{"exact":"37 is indeed prime."},"quote_capped":false,"section":["Computational methods","Trial division"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"Each division produces a nonzero remainder, so ","segments":[{"text":"Each division produces a nonzero remainder, so "}]},"layer":"37 is indeed prime.","segments":[{"text":"37 is indeed prime."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"858b8ab210eba0d19673dbf78f9100431f4f01478d2653f52f6f37e6a9b9b834"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #d8b7a33f","item":"In-text #d8b7a33f","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"22a82a6b89e0b9dfa20e66fde0aa2c20a993af65a67ef8d0e9612f7f95ca60b1","prominence":"supporting","quote":{"exact":"the number of tests that it performs grows exponentially as a function"},"quote_capped":true,"section":["Computational methods","Trial division"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"before":{"layer":"Although this method is simple to describe, it is impractical for testing the primality of large integers, because ","segments":[{"text":"Although this method is simple to describe, it is impractical for testing the primality of large integers, because "}]},"layer":"the number of tests that it performs grows exponentially as a function of the number of digits of these integers.[127]","segments":[{"text":"the number of tests that it performs grows exponentially as a function of the number of digits of these integers."},{"ref":"[127]"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"1e4d0d726d17ec1a1a99547215d3fe9cf54ffa8f44976e14482e55689dbc2786"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #96f18da7","item":"In-text #96f18da7","kind":"construction","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"79cd4b5641f4ca29db936f9fd5577eb095d2ec6d712251b0d8f309bdf63fbe14","prominence":"supporting","quote":{"exact":"For instance the Solovay–Strassen primality test on a given number ⁠ p"},"quote_capped":true,"section":["Computational methods","Primality testing versus primality proving"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"For instance the Solovay–Strassen primality test on a given number ⁠ p {\\displaystyle p} ⁠ chooses a number ⁠ a {\\displaystyle a} ⁠ randomly from 2 through p − 2 {\\displaystyle p-2} and uses modular exponentiation to check whether a ( p − 1 ) / 2 ± 1 {\\displaystyle a^{(p-1)/2}\\pm 1} is divisible by ⁠ p {\\displaystyle p} ⁠.[d] If so, it answers yes and otherwise it answers no.","segments":[{"text":"For instance the Solovay–Strassen primality test on a given number ⁠ "},{"tex":"p"},{"text":" ⁠ chooses a number ⁠ "},{"tex":"a"},{"text":" ⁠ randomly from 2 through "},{"tex":"p-2"},{"text":" and uses modular exponentiation to check whether "},{"tex":"a^{(p-1)/2}\\pm 1"},{"text":" is divisible by ⁠ "},{"tex":"p"},{"text":" ⁠."},{"ref":"[d]"},{"text":" If so, it answers yes and otherwise it answers no."}]},"unresolved":null},{"absence":null,"basis":"8385e07772d09078bbed376972f24010ce8ed5c3d905357e55653b50281b70d3","coverage":null,"id":"enwiki-23666-1373534600::In-text #dab1823f","item":"In-text #dab1823f","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ZMod.pow_div_two_eq_neg_one_or_one","end_line":82,"library":"mathlib","line":75,"location_key":"8385e07772d09078bbed376972f24010ce8ed5c3d905357e55653b50281b70d3","module":"Mathlib.NumberTheory.LegendreSymbol.Basic","note":"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.","pair_key":"b33e7dc8155b92fc34f7c8564c0eab7a4bd354c8d7cf3e5199fb15f35edfb336","path":"Mathlib/NumberTheory/LegendreSymbol/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6db87e680be5a1f68ac3b30fc7f28ec40a6cac5fce261f8cc92d5baf5e1b1ead","prominence":"supporting","quote":{"exact":"If ⁠ p {\\displaystyle p} ⁠ really is prime, it will always"},"quote_capped":true,"section":["Computational methods","Primality testing versus primality proving"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"If ⁠ p {\\displaystyle p} ⁠ really is prime, it will always answer yes, but if ⁠ p {\\displaystyle p} ⁠ is composite then it answers yes with probability at most 1/2 and no with probability at least 1/2.[135]","segments":[{"text":"If ⁠ "},{"tex":"p"},{"text":" ⁠ really is prime, it will always answer yes, but if ⁠ "},{"tex":"p"},{"text":" ⁠ is composite then it answers yes with probability at most 1/2 and no with probability at least 1/2."},{"ref":"[135]"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"5a737601e28bfb4a9634e83a912960b7f55a0aa0488c2b8f82ffb25483def3ec"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #e58257c4","item":"In-text #e58257c4","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"ca89131a340e191cf155dc9e2fdfb5b401bf58f80bc82b2776bce605c1277778","prominence":"supporting","quote":{"exact":"If this test is repeated ⁠ n {\\displaystyle n} ⁠ times on"},"quote_capped":true,"section":["Computational methods","Primality testing versus primality proving"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"If this test is repeated ⁠ n {\\displaystyle n} ⁠ times on the same number, the probability that a composite number could pass the test every time is at most ⁠ 1 / 2 n {\\displaystyle 1/2^{n}} ⁠.","segments":[{"text":"If this test is repeated ⁠ "},{"tex":"n"},{"text":" ⁠ times on the same number, the probability that a composite number could pass the test every time is at most ⁠ "},{"tex":"1/2^{n}"},{"text":" ⁠."}]},"unresolved":null},{"absence":null,"basis":"691d97fb51bbdb059d5c923baf625d0e28478f53c958717eeea7ccc419c51ee8","coverage":null,"id":"enwiki-23666-1373534600::In-text #24137207","item":"In-text #24137207","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ZMod.pow_div_two_eq_neg_one_or_one","end_line":82,"library":"mathlib","line":75,"location_key":"691d97fb51bbdb059d5c923baf625d0e28478f53c958717eeea7ccc419c51ee8","module":"Mathlib.NumberTheory.LegendreSymbol.Basic","note":"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.","pair_key":"235e63ab2586bc5070f7bb78299d277661d14b85673543c04b923820cdd87c8e","path":"Mathlib/NumberTheory/LegendreSymbol/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"83d09a0fb36db005d1aee5a9f41591ce198269bd766d4178dd23b9cc4ac4264f","prominence":"supporting","quote":{"exact":"On the other hand, if the test ever fails, then the number"},"quote_capped":true,"section":["Computational methods","Primality testing versus primality proving"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"On the other hand, if the test ever fails, then the number is certainly composite.[136]","segments":[{"text":"On the other hand, if the test ever fails, then the number is certainly composite."},{"ref":"[136]"}]},"unresolved":null},{"absence":null,"basis":"d2a55edcade1cfce47d2c1439d964e7c63e9d7fb6373ee10587016b951cd695c","coverage":null,"id":"enwiki-23666-1373534600::In-text #c47ca751","item":"In-text #c47ca751","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.FermatPsp","end_line":67,"library":"mathlib","line":66,"location_key":"d2a55edcade1cfce47d2c1439d964e7c63e9d7fb6373ee10587016b951cd695c","module":"Mathlib.NumberTheory.FermatPsp","note":"Mathlib pins the test down to the Fermat congruence at a base b, where the passage leaves which probabilistic test is meant open.","pair_key":"67b0f64a3a7237c9e815b4890a61511d22ead7700e3d7d8c8694640345e404a0","path":"Mathlib/NumberTheory/FermatPsp.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.FermatPsp : ℕ → ℕ → Prop"},"statement":true},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"OeisA307865.IsAbsoluteEulerPseudoprime","end_line":57,"library":"formal-conjectures","line":55,"location_key":"74dcdd127f87af7bc6a1dd66abf0bc239f1bd98c02412d6900976a2afe983215","module":"FormalConjectures.OEIS.«307865»","note":"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.","pair_key":"c11846b824d4f2993b9c2441d89449b30510ea96ef3fd1d273dd78b3987241ff","path":"FormalConjectures/OEIS/307865.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def OeisA307865.IsAbsoluteEulerPseudoprime : ℕ → Prop"},"statement":true},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"Nat.IsFrobeniusPseudoprime","library":"atlas","line":98,"location_key":"4fa1bfec3108b708baf602af762e6ae1e8def9c1a95a0d210da48e37fac97d7b","module":"MathlibExt.NumberTheory.FrobeniusPseudoprime","note":"The test is fixed to the Frobenius condition with respect to a polynomial parameter, and compositeness is spelt out as failing primality above one.","pair_key":"0b31566d454f0e2347d0181e81873f39d60b8063b0ea5a383df35cdd28eccfc1","path":"MathlibExt/NumberTheory/FrobeniusPseudoprime.lean","proof_status":"definition","rank":3,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def Nat.IsFrobeniusPseudoprime : ℕ → ℤ[X] → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"31b04cf17cf75d34aa0947e13223966de0246b50616a95050a48cd9b510d26b9","prominence":"central","quote":{"exact":"A composite number that passes such a test is called a pseudoprime."},"quote_capped":false,"section":["Computational methods","Primality testing versus primality proving"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"A composite number that passes such a test is called a pseudoprime.","segments":[{"text":"A composite number that passes such a test is called a pseudoprime."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"f207e1a69c8ec26fddfbfe85eb299dc8e470f6615cffeeec3fbd0e26c31fae6c"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #66e8d9e3","item":"In-text #66e8d9e3","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"2cc0c6fa07f7d99736b947fbcf19c8f20805a54d4f073e3eb0cc5c1dfc765aea","prominence":"supporting","quote":{"exact":"The AKS primality test is proven to run in polynomial time, but"},"quote_capped":true,"section":["Computational methods","Primality testing versus primality proving"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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]","segments":[{"text":"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."},{"ref":"[139]"}]},"unresolved":null},{"absence":null,"basis":"7fd13a28471ae43fdd60605eb71dd1ce005a1a03045e16cd1d18f717604db09d","coverage":null,"id":"enwiki-23666-1373534600::In-text #acb0dd10","item":"In-text #acb0dd10","kind":"conjecture","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"Mersenne.infinitely_many_mersenne_primes","end_line":137,"library":"formal-conjectures","line":135,"location_key":"7fd13a28471ae43fdd60605eb71dd1ce005a1a03045e16cd1d18f717604db09d","module":"FormalConjectures.Wikipedia.Mersenne","note":"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.","pair_key":"bf04a9c33d63bb9236d53aae4aa8153a72d8dfbfc48a4df70be9b6f760c35e2a","path":"FormalConjectures/Wikipedia/Mersenne.lean","proof_status":"statement_only","rank":1,"relation":"closeMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem Mersenne.infinitely_many_mersenne_primes : {p | Nat.Prime (mersenne p)}.Infinite"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"acb31be8f1c0e843b4cd6aaf60ca5d243f8637656c087259107e35aa28e204c5","prominence":"central","quote":{"exact":"It is conjectured that there are infinitely many Mersenne primes."},"quote_capped":false,"section":["Computational methods","Special-purpose algorithms and the largest known prime"],"status":"statement_only","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"It is conjectured that there are infinitely many Mersenne primes.","segments":[{"text":"It is conjectured that there are infinitely many Mersenne primes."}]},"unresolved":null},{"absence":null,"basis":"43a599d99db4f51a5715ad06cd2239c323dd1ec1fdd1232474d28cd445a46051","coverage":null,"id":"enwiki-23666-1373534600::In-text #2378ac4b","item":"In-text #2378ac4b","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.primeFactorsList","end_line":44,"library":"mathlib","line":38,"location_key":"43a599d99db4f51a5715ad06cd2239c323dd1ec1fdd1232474d28cd445a46051","module":"Mathlib.Data.Nat.Factors","note":"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.","pair_key":"c79d32fe5fe227367f0a6013f3f296d1d15e7071ca159f35bb16ee9591a8b05f","path":"Mathlib/Data/Nat/Factors.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.primeFactorsList : ℕ → List ℕ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.primeFactors","end_line":37,"library":"mathlib","line":37,"location_key":"8b9eaa91f5d514a8585e60fd74453abc469fee0cf3ecf70a999318d7863d50fc","module":"Mathlib.Data.Nat.PrimeFin","note":"This is the finset of distinct prime divisors of a natural number in ℕ, defined for every n rather than for composite ones alone.","pair_key":"67c95e3c81093bad68e1a060b1430c4492dbf12819f6cac2d8f0736d74da56a2","path":"Mathlib/Data/Nat/PrimeFin.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.primeFactors : ℕ → Finset ℕ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d28382932e097be4d09edff157249c0a3123a03aa5e17c789db594e58868f8f7","prominence":"central","quote":{"exact":"Given a composite integer ⁠ n {\\displaystyle n} ⁠, the task of"},"quote_capped":true,"section":["Computational methods","Integer factorization"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Given a composite integer ⁠ n {\\displaystyle n} ⁠, the task of providing one (or all) prime factors is referred to as factorization of ⁠ n {\\displaystyle n} ⁠.","segments":[{"text":"Given a composite integer ⁠ "},{"tex":"n"},{"text":" ⁠, the task of providing one (or all) prime factors is referred to as factorization of ⁠ "},{"tex":"n"},{"text":" ⁠."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"ef087ef27aeab6de0e158602e852de3c7af46bbb5e83bc40f3b1ea92f1724ec9"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #2b33263e","item":"In-text #2b33263e","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"10138c5a88f6b36253ee57a749e35774b7393c6def598158fb53c1c8a9e33b51","prominence":"supporting","quote":{"exact":"Shor's algorithm can factor any integer in a polynomial number of steps"},"quote_capped":true,"section":["Computational methods","Integer factorization"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Shor's algorithm can factor any integer in a polynomial number of steps on a quantum computer.[160]","segments":[{"text":"Shor's algorithm can factor any integer in a polynomial number of steps on a quantum computer."},{"ref":"[160]"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"b87d2332da8dc1e59ecb6705184eb92f901220a8d32c7f2460e027cca45eebee"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #7da59842","item":"In-text #7da59842","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"943d7b51f6d4cf6cc44c19011adf4b4610e52a1761632a25935cfbce98ca5273","prominence":"supporting","quote":{"exact":"For instance the checksums used in International Standard Book Numbers are defined"},"quote_capped":true,"section":["Computational methods","Other computational applications"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"For instance the checksums used in International Standard Book Numbers are defined by taking the rest of the number modulo 11, a prime number.","segments":[{"text":"For instance the checksums used in International Standard Book Numbers are defined by taking the rest of the number modulo 11, a prime number."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"4a84ea1796e9eca72b40cdebd49cd32c21c7083cfcd7ad1d81f99177792f7846"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #8d1100f3","item":"In-text #8d1100f3","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"f977a1d36a0a947bc2990c5b02185eb281518a3ea7b2234379f8e94504c722fd","prominence":"supporting","quote":{"exact":"Because 11 is prime this method can detect both single-digit errors and"},"quote_capped":true,"section":["Computational methods","Other computational applications"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Because 11 is prime this method can detect both single-digit errors and transpositions of adjacent digits.[166]","segments":[{"text":"Because 11 is prime this method can detect both single-digit errors and transpositions of adjacent digits."},{"ref":"[166]"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"b9d549cd13263133561fe890fdbe416bb2b223c659ef095299507ed7ec34375d"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #6e05af05","item":"In-text #6e05af05","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"da877f021a74c0568b6dea40533bddb0b7649d727f3e32cce5c3b1bc685a3b0f","prominence":"supporting","quote":{"exact":"Another checksum method, Adler-32, uses arithmetic modulo 65521, the largest prime number"},"quote_capped":true,"section":["Computational methods","Other computational applications"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Another checksum method, Adler-32, uses arithmetic modulo 65521, the largest prime number less than ⁠ 2 16 {\\displaystyle 2^{16}} ⁠.[167]","segments":[{"text":"Another checksum method, Adler-32, uses arithmetic modulo 65521, the largest prime number less than ⁠ "},{"tex":"2^{16}"},{"text":" ⁠."},{"ref":"[167]"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":5,"sha256":"e6d05a42e4a109719b515f2eeba2aa5e6d1b87394a402c6efdd6ee536e3a4a16"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #aaedbdee","item":"In-text #aaedbdee","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"Green72.no_three_in_line_le","end_line":123,"library":"formal-conjectures","line":121,"location_key":"b350d91141913ec5a1fb6b501233d63d0dce4d15a00ea5034d96a6ebcc8dd4c2","module":"FormalConjectures.GreensOpenProblems.«72»","note":null,"pair_key":"0f3455fa723677eead1e70430ade1668614f74b2e594e41a5eb0cb35d4bff95d","path":"FormalConjectures/GreensOpenProblems/72.lean","proof_status":"statement_only","rank":1,"relation":"relatedMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem Green72.no_three_in_line_le {N : ℕ} : 3 ≤ N → N ≤ 60 → Green72.NoKInLineFor 3 N"},"statement":false},{"challenge":"sampled_out","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"Erdos507.minTriangleArea","end_line":49,"library":"formal-conjectures","line":47,"location_key":"30df8cd10f25307bdad932616ae89c010a698964cb7787a750073c53902d1bba","module":"FormalConjectures.ErdosProblems.«507»","note":null,"pair_key":"4e94eace1f7364a09cc6b79ab4de42579f4abc4cb5fc68fdeee999271bebc5f8","path":"FormalConjectures/ErdosProblems/507.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def Erdos507.minTriangleArea : Finset (EuclideanSpace ℝ (Fin 2)) → ℝ"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"5a8827cae69f53ce13de7b82edc28267e175edcbeb3ae2ac16ed39c10a4db335","prominence":"supporting","quote":{"exact":"For example, it is possible to place prime numbers of points in"},"quote_capped":true,"section":["Other applications"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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]","segments":[{"text":"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."},{"ref":"[170]"}]},"unresolved":null},{"absence":null,"basis":"f86551ed1faf6b31e742a565ce42d458347adb1cfce189b0d37ec9f283750dc6","coverage":null,"id":"enwiki-23666-1373534600::In-text #fc43604f","item":"In-text #fc43604f","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Subfield.closure","end_line":294,"library":"mathlib","line":294,"location_key":"f86551ed1faf6b31e742a565ce42d458347adb1cfce189b0d37ec9f283750dc6","module":"Mathlib.Algebra.Field.Subfield.Basic","note":"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.","pair_key":"6d6a90109325eacb5a91562b7845cf7162ea53a3f38b4fc3f943a8b45cac2d8e","path":"Mathlib/Algebra/Field/Subfield/Basic.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Subfield.closure {K : Type u} [DivisionRing K] : Set K → Subfield K"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Subfield.closure_empty","end_line":364,"library":"mathlib","line":363,"location_key":"9f071609cc6fbf8c1f2593c5e9a0cd41e7c3cb386f61beb26b771902c7d62651","module":"Mathlib.Algebra.Field.Subfield.Basic","note":null,"pair_key":"8de1f345b3b25cb124d799075c634d0fc30ab03fb44d393ceed91a6e5c6dba34","path":"Mathlib/Algebra/Field/Subfield/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Subfield.closure_empty {K : Type u} [DivisionRing K] : Subfield.closure ∅ = ⊥"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"011d629dfbec216cc8e9a9593979f783e4aee02e3732dc78709dc4b495673738","prominence":"central","quote":{"exact":"For example, the prime field of a given field is its smallest"},"quote_capped":true,"section":["Other applications"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"For example, the prime field of a given field is its smallest subfield that contains both 0 and 1.","segments":[{"text":"For example, the prime field of a given field is its smallest subfield that contains both 0 and 1."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"6dc5afa297b6f1a207b8a71b43bde674ac9cfd4095b012453e403c3bc3d06d38","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"f0ff9067c8b94b15197a0fbcb075c7f58154f937f5240549a522989cf6e33d61","text":"in characteristic zero the prime field is the rationals"},{"id":"c2","part":"1043fd8e7d1a1d9eb3e472ee5f3414cdee162cae06de4c6e3b916c65b9857626","text":"otherwise the prime field is finite with a prime number of elements"}],"parts":["f0ff9067c8b94b15197a0fbcb075c7f58154f937f5240549a522989cf6e33d61","1043fd8e7d1a1d9eb3e472ee5f3414cdee162cae06de4c6e3b916c65b9857626"],"relation":"closeMatch","status":"formalized"},"id":"enwiki-23666-1373534600::In-text #cbd41269","item":"In-text #cbd41269","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Subfield.botEquivRat","end_line":56,"library":"mathlib","line":54,"location_key":"f0ff9067c8b94b15197a0fbcb075c7f58154f937f5240549a522989cf6e33d61","module":"Mathlib.FieldTheory.PrimeField","note":"Mathlib writes the prime field as the bottom subfield and delivers the identification as a ring isomorphism between fields.","pair_key":"5217d4421c9a51b029d8f7edf1e8b4489f0063ded34a7e7dccde45558df10cea","path":"Mathlib/FieldTheory/PrimeField.lean","proof_status":"definition","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Subfield.botEquivRat (K : Type*) [Field K] [CharZero K] : ↥⊥ ≃+* ℚ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Subfield.botEquivZMod","end_line":77,"library":"mathlib","line":74,"location_key":"1043fd8e7d1a1d9eb3e472ee5f3414cdee162cae06de4c6e3b916c65b9857626","module":"Mathlib.FieldTheory.PrimeField","note":"Mathlib writes the field with p members as ZMod p and the prime field as the bottom subfield of K.","pair_key":"bf29d8cf7c665d9954ca99af71b58261e3455059563ce9a4a008934048ad9f16","path":"Mathlib/FieldTheory/PrimeField.lean","proof_status":"definition","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Subfield.botEquivZMod (K : Type*) [Field K] (p : ℕ) [Fact (Nat.Prime p)] [Algebra (ZMod p) K] : ↥⊥ ≃+* ZMod p"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Subfield.card_bot","end_line":698,"library":"mathlib","line":696,"location_key":"3d587a8b18131d4f4d7dd2a11ca6a17f5ad4d51973dcd5125fb60bc5d7167932","module":"Mathlib.FieldTheory.Finite.Basic","note":"It reports the size of the bottom subfield, with the prime taken as a hypothesis rather than concluded.","pair_key":"c4f879965160611cdc869bbb67b119dcf514dfcb1d9634ef90b4f1e543fe6acc","path":"Mathlib/FieldTheory/Finite/Basic.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Subfield.card_bot (F : Type*) [Field F] (p : ℕ) [Fact (Nat.Prime p)] [CharP F p] : Nat.card ↥⊥ = p"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"43cefe41f48219b3f97903a531e5f4d6d5d58a54bd9a7f6f5b47d8cacb537889","prominence":"central","quote":{"exact":"It is either the field of rational numbers or a finite field"},"quote_capped":true,"section":["Other applications"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"It is either the field of rational numbers or a finite field with a prime number of elements, whence the name.[172]","segments":[{"text":"It is either the field of rational numbers or a finite field with a prime number of elements, whence the name."},{"ref":"[172]"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"9266e498d14e965fbd8347d1486b3f6486ecf3bbec754ac07761c8f89c3fdbd6"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #828f1946","item":"In-text #828f1946","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"91d0a89de488cfdf3d92b54dc26b1cceb73588e218b80118f6f87fd573984831","prominence":"central","quote":{"exact":"For example, in knot theory, a prime knot is a knot that"},"quote_capped":true,"section":["Other applications"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"14561ef561c46612cfdfb8ed58c180a4bad886457e13fd904f93349829ba3fe1"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #de87d773","item":"In-text #de87d773","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"209ee7403e17038b24f2011de5091d7d88329d98b833b2caec87c452557b5f64","prominence":"central","quote":{"exact":"Any knot can be uniquely expressed as a connected sum of prime"},"quote_capped":true,"section":["Other applications"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Any knot can be uniquely expressed as a connected sum of prime knots.[173]","segments":[{"text":"Any knot can be uniquely expressed as a connected sum of prime knots."},{"ref":"[173]"}]},"unresolved":null},{"absence":null,"basis":"8d5e2db0d1aef83eff30cc1e7a64072b9fb10c45cfedd3cfe67821bc33e809da","coverage":null,"id":"enwiki-23666-1373534600::In-text #9aeddeb5","item":"In-text #9aeddeb5","kind":"definition","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MetaMathlibExt.IsFermatPrime","library":"atlas","line":28,"location_key":"8d5e2db0d1aef83eff30cc1e7a64072b9fb10c45cfedd3cfe67821bc33e809da","module":"MathlibExt.NumberTheory.FermatPrime","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.","pair_key":"c2cc2c776642de88764bdae2aa77dd5626a3b926e489b18da52cec596eaabdb7","path":"MathlibExt/NumberTheory/FermatPrime.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def MetaMathlibExt.IsFermatPrime : ℕ → Prop"},"statement":true},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.fermatNumber","end_line":35,"library":"mathlib","line":35,"location_key":"a95aef05f99f0d6679092ce646091cae55fbb19f0ab1433bb62cfc4c301d76f2","module":"Mathlib.NumberTheory.Fermat","note":"It supplies the sequence the passage's formula names, without the primality the passage demands.","pair_key":"35f033d7ff63f58e60f48c80672f36489df83d6783a14a1d20b546ba86876e6f","path":"Mathlib/NumberTheory/Fermat.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.fermatNumber : ℕ → ℕ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b4ac254c433c2406f53122d533f4d71a373311a6af041c083eb8f60190b30784","prominence":"central","quote":{"exact":"Fermat primes are primes of the form F k = 2 2"},"quote_capped":true,"section":["Other applications","Constructible polygons and polygon partitions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Fermat primes are primes of the form F k = 2 2 k + 1 , {\\displaystyle F_{k}=2^{2^{k}}+1,} with ⁠ k {\\displaystyle k} ⁠ a nonnegative integer.[175]","segments":[{"text":"Fermat primes are primes of the form "},{"tex":"F_{k}=2^{2^{k}}+1,"},{"text":" with ⁠ "},{"tex":"k"},{"text":" ⁠ a nonnegative integer."},{"ref":"[175]"}]},"unresolved":null},{"absence":null,"basis":"747d2df2feef0d49e76d32604b223c02ed47ade1f4ee8b9a741c6bb80892f381","coverage":null,"id":"enwiki-23666-1373534600::In-text #126dfe21","item":"In-text #126dfe21","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"Fermat.fermat_number_are_composite","end_line":35,"library":"formal-conjectures","line":34,"location_key":"747d2df2feef0d49e76d32604b223c02ed47ade1f4ee8b9a741c6bb80892f381","module":"FormalConjectures.Wikipedia.Fermat","note":"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.","pair_key":"8b25a2dbac6edf21dc253138f874fb58b8365e4677de1d6144eea80251d827ca","path":"FormalConjectures/Wikipedia/Fermat.lean","proof_status":"statement_only","rank":1,"relation":"hasPart","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem Fermat.fermat_number_are_composite : ∀ n > 4, ¬Prime n.fermatNumber"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.prime_three","end_line":173,"library":"mathlib","line":173,"location_key":"d2ea8caf78f2c2c49772c7a3d93b83b102837ad4bdb767e1ded34f1751abd019","module":"Mathlib.Data.Nat.Prime.Defs","note":"It settles one entry of the list of five and says nothing about the other four.","pair_key":"cc58bd0c02d6d3acbf2d357469cb607af382234e6ec77d96805446ec1d4fac1a","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prime_three : Nat.Prime 3"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.prime_five","end_line":175,"library":"mathlib","line":175,"location_key":"3b5d21b6994db936d10fedf4e494d9d83b9589e692bcb5e3568c04180bc42c29","module":"Mathlib.Data.Nat.Prime.Defs","note":"It settles a second entry of the list of five and leaves the remaining three untouched.","pair_key":"f8b014ae8e8582822c3efcb6ad7bb99470a226116514d170462973d79111b5eb","path":"Mathlib/Data/Nat/Prime/Defs.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prime_five : Nat.Prime 5"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.pepin_primality","end_line":142,"library":"mathlib","line":132,"location_key":"16265b2bb5471d357e559414584eb8f790877c1642fd1814647dff4fa69f7ee1","module":"Mathlib.NumberTheory.Fermat","note":"It decides primality of a Fermat number from a congruence condition, leaving the listed numbers unjudged.","pair_key":"5e9ac9a3eec17e9c31aa9086f50498df1f3abdbee2b0784883bd5171b3b55820","path":"Mathlib/NumberTheory/Fermat.lean","proof_status":"proved","rank":4,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.pepin_primality (n : ℕ) : 3 ^ 2 ^ (2 ^ n - 1) = -1 → Nat.Prime n.fermatNumber"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"40a67ff39cc2b6764b283f0f9964037e1a61739d1fbf855e90e71d1f31b24cd3","prominence":"supporting","quote":{"exact":"The first five of these numbers – 3, 5, 17, 257, and"},"quote_capped":true,"section":["Other applications","Constructible polygons and polygon partitions"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"The first five of these numbers – 3, 5, 17, 257, and 65,537 – are prime,[176] but F 5 {\\displaystyle F_{5}} is composite and so are all other Fermat numbers that have been verified as of 2017.[177]","segments":[{"text":"The first five of these numbers – 3, 5, 17, 257, and 65,537 – are prime,"},{"ref":"[176]"},{"text":" but "},{"tex":"F_{5}"},{"text":" is composite and so are all other Fermat numbers that have been verified as of 2017."},{"ref":"[177]"}]},"unresolved":null},{"absence":null,"basis":"6459f7f1b75b768ae58dc23a6cbbde137de020e62805367d7b3b3a1ec62a2470","coverage":null,"id":"enwiki-23666-1373534600::In-text #b23d5ad1","item":"In-text #b23d5ad1","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.gauss_wantzel_constructible_polygon","library":"atlas","line":82,"location_key":"6459f7f1b75b768ae58dc23a6cbbde137de020e62805367d7b3b3a1ec62a2470","module":"WantedExt.NumberTheory.GaussWantzelWanted","note":"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.","pair_key":"b17a124bb7a44274a1f098bc70fb553a6e5aa5dac2b658f861a11b945d2986dd","path":"WantedExt/NumberTheory/GaussWantzelWanted.lean","proof_status":"wanted","rank":1,"relation":"closeMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"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)"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.GaussWantzelNumber","library":"atlas","line":73,"location_key":"ecfea518ce1d1e23a5a2e178bf06a0e3d215bacd04c085604f7ca6ef5b08a141","module":"WantedExt.NumberTheory.GaussWantzelWanted","note":"It names only the arithmetic side of the criterion, with no claim about drawing anything.","pair_key":"0b714455ff5d323a5a9fecaf90e7831fa65c107dc9ebcd442e23bd0a6da860be","path":"WantedExt/NumberTheory/GaussWantzelWanted.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.GaussWantzelNumber : ℕ → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7561fdeae6a70408452c0bb1e4767ad5ef99a59e680214b974437c496c297c38","prominence":"central","quote":{"exact":"A regular ⁠ n {\\displaystyle n} ⁠-gon is constructible using straightedge and"},"quote_capped":true,"section":["Other applications","Constructible polygons and polygon partitions"],"status":"statement_only","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"A regular ⁠ n {\\displaystyle n} ⁠-gon is constructible using straightedge and compass if and only if the odd prime factors of ⁠ n {\\displaystyle n} ⁠ (if any) are distinct Fermat primes.[176]","segments":[{"text":"A regular ⁠ "},{"tex":"n"},{"text":" ⁠-gon is constructible using straightedge and compass if and only if the odd prime factors of ⁠ "},{"tex":"n"},{"text":" ⁠ (if any) are distinct Fermat primes."},{"ref":"[176]"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"5ef98f2f6728f0e250cd9ad1d6cb19be3efba60e11ebaa9265b8af6ae1a978fe"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #8fc7160d","item":"In-text #8fc7160d","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"d1307b4a7eba41b1ab5b6e9ae0bf68f3847aa58cdd0a98f0b78f0213a047e441","prominence":"central","quote":{"exact":"Likewise, a regular ⁠ n {\\displaystyle n} ⁠-gon may be constructed using"},"quote_capped":true,"section":["Other applications","Constructible polygons and polygon partitions"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"Likewise, a regular ⁠ n {\\displaystyle n} ⁠-gon may be constructed using straightedge, compass, and an angle trisector if and only if the prime factors of ⁠ n {\\displaystyle n} ⁠ are any number of copies of 2 or 3 together with a (possibly empty) set of distinct Pierpont primes, primes of the form ⁠ 2 a 3 b + 1 {\\displaystyle 2^{a}3^{b}+1} ⁠.","segments":[{"text":"Likewise, a regular ⁠ "},{"tex":"n"},{"text":" ⁠-gon may be constructed using straightedge, compass, and an angle trisector if and only if the prime factors of ⁠ "},{"tex":"n"},{"text":" ⁠ are any number of copies of 2 or 3 together with a (possibly empty) set of distinct Pierpont primes, primes of the form ⁠ "},{"tex":"2^{a}3^{b}+1"},{"text":" ⁠."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":5,"sha256":"a6d1d1bbb36fa810b8e6dd0fa5720604cabf3d7bd3fe9536e4d028de3db3eb4f"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23666-1373534600::In-text #eedc91a4","item":"In-text #eedc91a4","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"7921d6e36dba353c8647e7bf46386fe8570b4568e371a159aac2e5d9dcfce906","prominence":"central","quote":{"exact":"It is possible to partition any convex polygon into ⁠ n {\\displaystyle"},"quote_capped":true,"section":["Other applications","Constructible polygons and polygon partitions"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23666&oldid=1373534600","text":{"layer":"It is possible to partition any convex polygon into ⁠ n {\\displaystyle n} ⁠ smaller convex polygons of equal area and equal perimeter, when ⁠ n {\\displaystyle n} ⁠ is a power of a prime number, but this is not known for other values of ⁠ n {\\displaystyle n} ⁠.","segments":[{"text":"It is possible to partition any convex polygon into ⁠ "},{"tex":"n"},{"text":" ⁠ smaller convex polygons of equal area and equal perimeter, when ⁠ "},{"tex":"n"},{"text":" ⁠ is a power of a prime number, but this is not known for other values of ⁠ "},{"tex":"n"},{"text":" ⁠."}]},"unresolved":null}],"provenance":{"challenge":{"harvested":"2026-11-01T14:25:17Z","mode":"locate-challenge","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"chal-tierA-b1","sampling":{"absence_sample_rate":0.25,"sample_rate":0.2,"seed":0,"strong_sample_rate":0.5},"skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-11-01T03:19:32Z"},"inventory":{"harvested":"2026-10-30T20:00:47Z","mode":"locate-inventory","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"inv-tierA-b1r","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-10-30T07:23:03Z"},"locate":{"harvested":"2026-11-01T03:06:57Z","mode":"locate","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"loc-tierA-b1b","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-10-31T04:59:09Z"}},"reader":{"bytes":877701,"images":[{"author":"This vector image was created with Inkscape by Elembis, and then manually replaced.","file":"Arithmetic_symbols.svg","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"Д.Ильин: vectorization Obscure2020: optimization","file":"Gaussian_primes.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"Jared C. Benedict (user Redjar)","file":"Gears_large.jpg","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0/","project":"commons"},{"author":"No machine-readable author provided. Ed g2s assumed (based on copyright claims).","file":"Lattice_of_the_divisibility_of_60.svg","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0/","project":"commons"},{"author":"Headbomb","file":"Lock-gray-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"User:Trappist the monk","file":"Lock-green.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"VulpesVulpes42, Headbomb","file":"Lock-red-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"David Brewster","file":"Newton's_reflecting_telescope.jpg","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"David Vignoni, SVG version by Bobarino","file":"Nuvola_apps_kalzium.svg","licence":"LGPL","licence_url":"https://www.gnu.org/licenses/lgpl.html","project":"commons"},{"author":"https://phabricator.wikimedia.org/diffusion/GOJU/browse/master/AUTHORS.txt","file":"OOjs_UI_icon_edit-ltr-progressive.svg","licence":"PD","licence_url":null,"project":"en"},{"author":"TokyoJunkie at the English Wikipedia","file":"Pentagon_construct.gif","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"David Eppstein","file":"Prime-counting_relative_error.svg","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"},{"author":"Hyacinth","file":"Prime_number_Cuisenaire_rods_7.png","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"},{"author":"Jakob.scholbach","file":"Prime_numbers_in_arithmetic_progression_mod_9_zoom_in.png","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0","project":"commons"},{"author":"David Eppstein","file":"Primes-vs-composites.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"unknown (c. 2000 B.C)","file":"Rhind_Mathematical_Papyrus.jpg","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"No machine-readable author provided. Conscious assumed (based on copyright claims).","file":"Riemann_zeta_function_absolute_value.png","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0/","project":"commons"},{"author":"SKopp at German Wikipedia","file":"Sieve_of_Eratosthenes_animation.gif","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0/","project":"commons"},{"author":"Newbzy","file":"Square_root_of_x.svg","licence":"GPL","licence_url":"https://www.gnu.org/licenses/gpl.html","project":"commons"},{"author":"derivative work: Pbroks13 (talk) Sum_of_knots3.png: Maksim","file":"Sum_of_knots3.svg","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0/","project":"commons"},{"author":"PC78, based on work by Julian Herzog, Zscout370, Ed g2s and Erin Silversmith","file":"Symbol_category_class.svg","licence":"PD","licence_url":null,"project":"en"},{"author":"Mysid","file":"Symbol_list_class.svg","licence":"Public domain","licence_url":null,"project":"en"},{"author":"PC78, based on work by RomanLier","file":"Symbol_portal_class.svg","licence":"CC-BY-SA-4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/","project":"en"},{"author":"Will Orrick","file":"Ulam_2.png","licence":"Public domain","licence_url":null,"project":"commons"}],"marks":1440,"passages":199,"sha256":"3c60d456bce692762536f58210896f62fedb70472639a975d8f97ebab3e55366","unplaced":["enwiki-23666-1373534600::In-text #f03bf6ff"]},"record_set":"23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602","records_sha256":"68d4c9d08c8c674f4f09c75789f6b66dc67267d665ebb5ad01859245d86baac6","revision":1373534600,"schema":"wikilean.articles.article/1","seal":{"created":"2026-11-01T14:25:17Z","schema":"cf-locate-recordset/2","set_id":"tierA-b1b","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","status_rule":3},"source":{"html_sha256":"2406fb15f49c84cd1e7b0d51fafa0757ce9a51413e80e86140b5b8dea0a891f8","layer_sha256":"9b334576f0319abb1795a8dba98d2b33455b8eaac788aab9faa5db1b95d4c3f8","renderer":"web-html/3"},"source_id":"enwiki-23666-1373534600","summary":{"by_library":{"atlas":{"complete":19,"incomplete":2,"locations":21,"passages":18,"related":13},"ff-quadratic-algebras":{"complete":2,"incomplete":0,"locations":2,"passages":2,"related":2},"formal-conjectures":{"complete":15,"incomplete":24,"locations":39,"passages":27,"related":11},"lean-core":{"complete":7,"incomplete":0,"locations":7,"passages":4,"related":1},"mathlib":{"complete":197,"incomplete":0,"locations":197,"passages":115,"related":38},"tauceti":{"complete":5,"incomplete":0,"locations":5,"passages":5,"related":2}},"by_prominence":{"central":{"by_status":{"formalized":50,"not_formalized":12,"partial":13,"statement_only":11,"unresolved":1},"passages":87},"subject":{"by_status":{"formalized":1,"not_formalized":0,"partial":0,"statement_only":0,"unresolved":0},"passages":1},"supporting":{"by_status":{"formalized":54,"not_formalized":33,"partial":23,"statement_only":2,"unresolved":0},"passages":112}},"by_proof_status":{"definition":80,"proved":224,"statement_only":32,"wanted":2},"by_relation":{"broadMatch":76,"closeMatch":62,"exactMatch":38,"hasPart":71,"narrowMatch":24,"relatedMatch":67},"by_status":{"formalized":105,"not_formalized":45,"partial":36,"statement_only":13,"unresolved":1},"locations":271,"passages":200,"related":67},"supplements":{"audit_summary":{"schema":"wikilean.articles.audit-summary/1","sha256":"53b29c5773caa9a3a339ccb36db38548137820e05477c4eff49dfb63a91b74df"},"passage_text":{"schema":"wikilean.articles.passage-text/1","sha256":"c0c740562cd14bdcabe43ac1d7ba81039d8e41ef850fd199d7151de6bb774885"},"provenance":{"schema":"wikilean.articles.provenance/1","sha256":"ea245b590ba9078bc0b79003dc1e311dc1421475fe49483e3e3a905ed7c7ec4e"},"reader_html":{"schema":"wikilean.articles.reader-html/1","sha256":"738196c11695087fc8e74590f5ac362acd61af48a8950c0a049559dd3902d2df"},"signatures":{"corpus_built":"2026-10-18T06:14:30Z","corpus_sha256":"a364fd6aede529da1c9f2fa13fda6230a26381f27dafc8801c4205e2b5cf5221","schema":"wikilean.articles.signatures/1","sha256":"2ebb5eebf8b2ebd1f615518abce6169661140cc54d5fcad5f4443150cc62d874","universe":"u1"}},"title":"Prime number","universe":{"frozen":"2026-10-17","id":"u1","libraries":48,"sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"wikidata":"Q49008"}
