{"assessment":{"class":"C","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":20845,"passages":[{"absence":null,"basis":"d3279b819288607f0391b7550f409a098f5218e80b148e1fa6c91a2ef9d2b9d9","coverage":null,"id":"enwiki-20845-1375745567::In-text #4de9be41","item":"In-text #4de9be41","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Mul","end_line":1656,"library":"lean-core","line":1654,"location_key":"d3279b819288607f0391b7550f409a098f5218e80b148e1fa6c91a2ef9d2b9d9","module":"Init.Prelude","note":"lean-core declares the multiplication of two elements of one type, and its value at two numbers is what the passage calls the product.","pair_key":"860b0ae9e3db8220086ba29aa27dad8ea4787ede85ddc79690b84f339fa893df","path":"src/Init/Prelude.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"class Mul : Type u → Type u"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Nat.mul","end_line":1919,"library":"lean-core","line":1917,"location_key":"c65167c1451b949d3f93cc5d7693fea92704584c9b095e204bf05a3dc27b064d","module":"Init.Prelude","note":"lean-core's multiplication on the naturals, documented as the operation reached through the asterisk.","pair_key":"97daeb1c9390e3937f80ee3f513ee2adac6e2e0dab7613a31d3a57a0d241b5f1","path":"src/Init/Prelude.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Nat.mul : Nat → Nat → Nat"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"49f6d2ad1b8e6d5b9a88f5f859473f449807caf05ca625e6ee453fe84641df4f","prominence":"central","quote":{"exact":"The result of a multiplication operation is called a product."},"quote_capped":false,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"The result of a multiplication operation is called a product.","segments":[{"text":"The result of a multiplication operation is called a product."}]},"unresolved":null},{"absence":null,"basis":"995633d776f551cfe9f7642750be6c3c6ae74fe8ef93b7121bc125f92c1b17ec","coverage":null,"id":"enwiki-20845-1375745567::In-text #e8e9279a","item":"In-text #e8e9279a","kind":"notation","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"HMul","end_line":1508,"library":"lean-core","line":1505,"location_key":"995633d776f551cfe9f7642750be6c3c6ae74fe8ef93b7121bc125f92c1b17ec","module":"Init.Prelude","note":"lean-core's notation class is what gives multiplication its asterisk infix form in the language; the cross, the raised dot and juxtaposition are not declared anywhere in the universe.","pair_key":"6a9a18d6905bd8d1a0585e71c0c6d1901467a985b862ddbd3178e061aeac4a09","path":"src/Init/Prelude.lean","proof_status":"definition","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"class HMul : Type u → Type v → outParam (Type w) → Type (max (max u v) w)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"cad57a0140633a5da30a511eba0d7de0c4b4d0e17b49c25bbd18fd49a11beb88","prominence":"supporting","quote":{"exact":"Multiplication is often denoted by the cross symbol, ×, by the mid-line"},"quote_capped":true,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"Multiplication is often denoted by the cross symbol, ×, by the mid-line dot operator, ⋅, by juxtaposition, or, in programming languages, by an asterisk, *.","segments":[{"text":"Multiplication is often denoted by the cross symbol, ×, by the mid-line dot operator, ⋅, by juxtaposition, or, in programming languages, by an asterisk, *."}]},"unresolved":null},{"absence":null,"basis":"e9f5ef0392f4c83be2e7ad7e378267e697bc8334b0968630feacbe9b4356ce90","coverage":null,"id":"enwiki-20845-1375745567::In-text #d9ce9d17","item":"In-text #d9ce9d17","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"List.sum_replicate_nat","end_line":39,"library":"lean-core","line":38,"location_key":"e9f5ef0392f4c83be2e7ad7e378267e697bc8334b0968630feacbe9b4356ce90","module":"Init.Data.List.Nat.Sum","note":"lean-core writes the repeated sum as the sum of a list holding as many copies of the multiplicand as the multiplier says, and proves it equals their product.","pair_key":"46c85a621814180852b28aab4351eb2016c5ca7e80a036279f1b035196432aee","path":"src/Init/Data/List/Nat/Sum.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem List.sum_replicate_nat {n a : Nat} : (List.replicate n a).sum = n * a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"List.sum_const_nat","end_line":386,"library":"mathlib","line":385,"location_key":"f83ccf488a3e50916ad53ca78e7063d9d798eb14271745519577f61edd20e5cc","module":"Mathlib.Algebra.BigOperators.Group.List.Basic","note":"mathlib states the same equation for naturals, the sum of a list of repeats against the product.","pair_key":"ffc475f80570543c6035990bda6d30cfd008412c85506cf7084696c0fc2019c8","path":"Mathlib/Algebra/BigOperators/Group/List/Basic.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem List.sum_const_nat (m n : ℕ) : (List.replicate m n).sum = m * n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"76aff48296382e720bf406417cdb38a58ea9e3b6b1d8a41bac66a28c759bcbe6","prominence":"central","quote":{"exact":"The multiplication of whole numbers may be thought of as repeated addition;"},"quote_capped":true,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"The multiplication of whole numbers may be thought of as repeated addition; that is, the multiplication of two numbers is equivalent to adding as many copies of one of them, the multiplicand, as the quantity of the other one, the multiplier.","segments":[{"text":"The multiplication of whole numbers may be thought of as repeated addition; that is, the multiplication of two numbers is equivalent to adding as many copies of one of them, the multiplicand, as the quantity of the other one, the multiplier."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #8483c9c5","item":"In-text #8483c9c5","kind":"definition","locations":[],"outcome":"unresolved","passage_ends_in_suffix":false,"passage_key":"d818365f57b5c45ab7c13bc8b45a0d98be2beeeccbaadedec061b87df514097b","prominence":"supporting","quote":{"exact":"Both numbers can be referred to as factors."},"quote_capped":false,"section":[],"status":null,"subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"Both numbers can be referred to as factors.","segments":[{"text":"Both numbers can be referred to as factors."}]},"unresolved":{"challenge":"sampled_out"}},{"absence":null,"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #4c139e78","item":"In-text #4c139e78","kind":"definition","locations":[],"outcome":"unresolved","passage_ends_in_suffix":false,"passage_key":"66a9bad177f24f3eb4a6e11d2680c858dbf1684a24f290ed2412336681432ceb","prominence":"supporting","quote":{"exact":"This is to be distinguished from terms, which are added."},"quote_capped":false,"section":[],"status":null,"subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"This is to be distinguished from terms, which are added.","segments":[{"text":"This is to be distinguished from terms, which are added."}]},"unresolved":{"challenge":"sampled_out"}},{"absence":null,"basis":"1f89e34e66b865ff8826794b73b4a2dfb18c2d3956575ad30bd040e43e50cdf8","coverage":null,"id":"enwiki-20845-1375745567::In-text #ad79a4a7","item":"In-text #ad79a4a7","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"List.sum_replicate_nat","end_line":39,"library":"lean-core","line":38,"location_key":"1f89e34e66b865ff8826794b73b4a2dfb18c2d3956575ad30bd040e43e50cdf8","module":"Init.Data.List.Nat.Sum","note":"lean-core states that the product of two naturals equals the sum of a list made of a copies of b, which is the displayed formula with the row of copies written as a list.","pair_key":"c1f6b1854029d47880416bbb3252b0d01de834f5a9cdbd5a3a43e1406be3408b","path":"src/Init/Data/List/Nat/Sum.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem List.sum_replicate_nat {n a : Nat} : (List.replicate n a).sum = n * a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"List.sum_const_nat","end_line":386,"library":"mathlib","line":385,"location_key":"757e8a5c004e78ff2136343608479c537d372c3af8e5150e31e5a31af87bdefc","module":"Mathlib.Algebra.BigOperators.Group.List.Basic","note":"mathlib proves the same equation over the naturals with the repeated summands held in a list.","pair_key":"151e7ec933af5e623a5c1abdbc4053b13c50fa7934283d06a45df71d6be74caa","path":"Mathlib/Algebra/BigOperators/Group/List/Basic.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem List.sum_const_nat (m n : ℕ) : (List.replicate m n).sum = m * n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"fd6b33292cced0b3f92c0674281be978e684136d64a40cb6362f651426526522","prominence":"central","quote":{"exact":"a × b = b + ⋯ + b ⏟ a times"},"quote_capped":true,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"a × b = b + ⋯ + b ⏟ a times . {\\displaystyle a\\times b=\\underbrace {b+\\cdots +b} _{a{\\text{ times}}}.}","segments":[{"display":true,"tex":"a\\times b=\\underbrace {b+\\cdots +b} _{a{\\text{ times}}}."}]},"unresolved":null},{"absence":null,"basis":"8cb792596bddf9396ff45975915f1e2a5dbd10a24cb9c9cc29442aa6c6126b95","coverage":null,"id":"enwiki-20845-1375745567::In-text #ed25bcd2","item":"In-text #ed25bcd2","kind":"example","locations":[{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"List.sum_replicate_nat","end_line":39,"library":"lean-core","line":38,"location_key":"8cb792596bddf9396ff45975915f1e2a5dbd10a24cb9c9cc29442aa6c6126b95","module":"Init.Data.List.Nat.Sum","note":"It yields the arithmetic the example performs, while which of the two numbers is called multiplier or multiplicand is left unsaid.","pair_key":"9a3685c66d5f9e0a4e004f247cfe78d4eaa8a2d55ce9a69cec14b90233731529","path":"src/Init/Data/List/Nat/Sum.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem List.sum_replicate_nat {n a : Nat} : (List.replicate n a).sum = n * a"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"List.sum_const_nat","end_line":386,"library":"mathlib","line":385,"location_key":"25a237a161e493c27d1939abf03b82e4db7f40e46639bb6b3123a358fe00fe5a","module":"Mathlib.Algebra.BigOperators.Group.List.Basic","note":"mathlib's version entails the same evaluation of the example and says nothing about the naming of the two roles.","pair_key":"563960ff290ac7c62ee6bb9a933e7c7efe1d5c2b790f827c8b7c1967e71b6156","path":"Mathlib/Algebra/BigOperators/Group/List/Basic.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem List.sum_const_nat (m n : ℕ) : (List.replicate m n).sum = m * n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7f6ef729c5c9df57695893490f89f90729dbb1681bf2d2063360a9b691066b99","prominence":"supporting","quote":{"exact":"For example, the expression 3 × 4 {\\displaystyle 3\\times 4} can be"},"quote_capped":true,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"For example, the expression 3 × 4 {\\displaystyle 3\\times 4} can be phrased as \"3 times 4\", or \"Three groups of four\", notating the multiplication symbol with the word of, and evaluated as 4 + 4 + 4 {\\displaystyle 4+4+4} , where 3 is the multiplier, but also as \"3 multiplied by 4\", in which case 3 becomes the multiplicand.","segments":[{"text":"For example, the expression "},{"tex":"3\\times 4"},{"text":" can be phrased as \"3 times 4\", or \"Three groups of four\", notating the multiplication symbol with the word of, and evaluated as "},{"tex":"4+4+4"},{"text":" , where 3 is the multiplier, but also as \"3 multiplied by 4\", in which case 3 becomes the multiplicand."}]},"unresolved":null},{"absence":null,"basis":"06e83308ad4419b02c5752438182870fd94c901e4fe0b134efd8a3dac555c462","coverage":null,"id":"enwiki-20845-1375745567::In-text #c877e216","item":"In-text #c877e216","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.mul_comm","end_line":213,"library":"lean-core","line":211,"location_key":"06e83308ad4419b02c5752438182870fd94c901e4fe0b134efd8a3dac555c462","module":"Init.Data.Nat.Basic","note":"lean-core proves that the two orders of a product of naturals agree, which is the property the passage appeals to for three and four.","pair_key":"68ebbe31fd748f20d75c0e14366f0c022415676aa90f4eeadc3ff3f745d792d3","path":"src/Init/Data/Nat/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.mul_comm (n m : Nat) : n * m = m * n"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_comm","end_line":258,"library":"mathlib","line":258,"location_key":"c1525cd81270ff73484fc92627e780a1cf9ff19f206354027ed38981c6fde96b","module":"Mathlib.Algebra.Group.Semigroup","note":"mathlib states the commutative law wherever a commutative multiplication is available, the naturals included.","pair_key":"67e7ae2d97d78376f8d86bf199d3f0e005a2c9831573698b4dd1576eae64bb13","path":"Mathlib/Algebra/Group/Semigroup.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_comm {G : Type*} [CommMagma G] (a b : G) : a * b = b * a"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"162e6957f44a71c37ac9970cd7c71bb4bee7436776553e9fb81191e824c31ba6","prominence":"central","quote":{"exact":"One of the main properties of multiplication is the commutative property, which"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"One of the main properties of multiplication is the commutative property, which states in this case that adding 3 copies of 4 gives the same result as adding 4 copies of 3.","segments":[{"text":"One of the main properties of multiplication is the commutative property, which states in this case that adding 3 copies of 4 gives the same result as adding 4 copies of 3."}]},"unresolved":null},{"absence":null,"basis":"d79219f7989a0aa595cd31ec94dd89b8590a839e99e82fbed7abb055e2d77fed","coverage":null,"id":"enwiki-20845-1375745567::In-text #8007b043","item":"In-text #8007b043","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.mul_comm","end_line":213,"library":"lean-core","line":211,"location_key":"d79219f7989a0aa595cd31ec94dd89b8590a839e99e82fbed7abb055e2d77fed","module":"Init.Data.Nat.Basic","note":null,"pair_key":"1e868e2d6e2c46ae4ed7261794c0d0e8d0e87de3cae5635d10cd86740c20ed68","path":"src/Init/Data/Nat/Basic.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.mul_comm (n m : Nat) : n * m = m * n"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_comm","end_line":258,"library":"mathlib","line":258,"location_key":"e8ccfc2a377c79bc065220e205bf39d6fdbe30a8e629352eceba85a80f5ab173","module":"Mathlib.Algebra.Group.Semigroup","note":"Stated for an arbitrary type whose multiplication commutes, and the passage's whole numbers are one such type.","pair_key":"6e18485e00f00c04a0ae5931f81ddad3bf62fc8d9d487e9211b360418d7ac555","path":"Mathlib/Algebra/Group/Semigroup.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_comm {G : Type*} [CommMagma G] (a b : G) : a * b = b * a"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"46f765d3f28d620839bc53552f83cdbd97e82b3f0b56d051c31b3e5aab75597f","prominence":"supporting","quote":{"exact":"Thus, the designation of multiplier and multiplicand does not affect the result"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"Thus, the designation of multiplier and multiplicand does not affect the result of the multiplication.","segments":[{"text":"Thus, the designation of multiplier and multiplicand does not affect the result of the multiplication."}]},"unresolved":null},{"absence":null,"basis":"179937ca59938cc8875581e3a6a8812f9657374f68c97eb146139bec31509af3","coverage":null,"id":"enwiki-20845-1375745567::In-text #1326d152","item":"In-text #1326d152","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Finset.card_product","end_line":142,"library":"mathlib","line":141,"location_key":"179937ca59938cc8875581e3a6a8812f9657374f68c97eb146139bec31509af3","module":"Mathlib.Data.Finset.Prod","note":"Gives the counting half of the passage; the area of a rectangle is left to the other locations.","pair_key":"c8f8ee081cdecd22abfd10ea287ad8f1d978e9fcb15b0381f24658a8a87466ca","path":"Mathlib/Data/Finset/Prod.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.card_product {α : Type*} {β : Type*} (s : Finset α) (t : Finset β) : (s ×ˢ t).card = s.card * t.card"},"statement":false},{"challenge":"sampled_out","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"Mathoverflow34145.lbMeasure_rectangle_toSet","end_line":119,"library":"formal-conjectures","line":117,"location_key":"e094fa806a731b5d11b875a4bd7b299a05db304c7916f6bfee93b2a75087caa5","module":"FormalConjectures.Mathoverflow.«34145»","note":"Gives the area half of the passage, with the product under an absolute value because the width and height parameters may be signed.","pair_key":"a0bc145608f2fdfef431dd71110adc3de28c108259f56e61d35807773b519f88","path":"FormalConjectures/Mathoverflow/34145.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem Mathoverflow34145.lbMeasure_rectangle_toSet (r : Mathoverflow34145.Rectangle) : Mathoverflow34145.lbMeasure r.toSet = ENNReal.ofReal |r.width * r.height|"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.volume_Icc_pi","end_line":238,"library":"mathlib","line":236,"location_key":"ac8743549a79f24ab642a06f6607f47e7ee915555edc9dbc594e95af50e5a3b3","module":"Mathlib.MeasureTheory.Measure.Lebesgue.Basic","note":"Gives the area half of the passage in any finite number of coordinates; the counting of an array is not part of it.","pair_key":"903c4c203878ab95cd4546232a20084f7ce64d411136f54537a81d687edcd883","path":"Mathlib/MeasureTheory/Measure/Lebesgue/Basic.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.volume_Icc_pi {ι : Type*} [Fintype ι] {a b : ι → ℝ} : MeasureTheory.MeasureSpace.volume (Set.Icc a b) = ∏ i, ENNReal.ofReal (b i - a i)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7784f38a1c5f41cead9efc6f6c8578334cd5eb85d54bb0090c7b672d9c369ec7","prominence":"supporting","quote":{"exact":"Multiplication can also be visualized as counting objects arranged in a rectangle"},"quote_capped":true,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"Multiplication can also be visualized as counting objects arranged in a rectangle (for whole numbers) or as calculating the area of a rectangle with sides of given lengths.","segments":[{"text":"Multiplication can also be visualized as counting objects arranged in a rectangle (for whole numbers) or as calculating the area of a rectangle with sides of given lengths."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"be318405ee4f52f3a042c13c761010411d49fbff2c400a76782b02cf32a1082b"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #761ed37c","item":"In-text #761ed37c","kind":"theorem","locations":[{"challenge":"downgraded","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"mul_comm","end_line":258,"library":"mathlib","line":258,"location_key":"2c9a517915c6b8f4779d66eeb099228c2a8c49fe4a1f1eb8d18e10cb707940bc","module":"Mathlib.Algebra.Group.Semigroup","note":"Stated for any type whose multiplication commutes, and the side lengths of the passage are real numbers.","pair_key":"9ea36d472f11a4b82589b511e8e0081f502cd5e5f462f1c3e72f6887c7384b1b","path":"Mathlib/Algebra/Group/Semigroup.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_comm {G : Type*} [CommMagma G] (a b : G) : a * b = b * a"},"statement":false},{"challenge":"sampled_out","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"Mathoverflow34145.lbMeasure_rectangle_toSet","end_line":119,"library":"formal-conjectures","line":117,"location_key":"39190a5a3e0158543e643e6e0e55f7e70c48e997842266da2a7049e7b5d9eec4","module":"FormalConjectures.Mathoverflow.«34145»","note":"Computes the area of a rectangle from its width and height, but asserts nothing about taking the two sides in the other order.","pair_key":"77427dda6f5867c5cdf989749dc24bfb3c47ef49aef989d5a4486f3a596ecc03","path":"FormalConjectures/Mathoverflow/34145.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem Mathoverflow34145.lbMeasure_rectangle_toSet (r : Mathoverflow34145.Rectangle) : Mathoverflow34145.lbMeasure r.toSet = ENNReal.ofReal |r.width * r.height|"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"low","declaration":"MeasureTheory.Measure.measurePreserving_swap","end_line":720,"library":"mathlib","line":719,"location_key":"f38e589b731d5f08a7158ce10bbc0ff8fd9ee94141d8562803589b608e6ff301","module":"Mathlib.MeasureTheory.Measure.Prod","note":"Says that exchanging the two coordinates of a product measure preserves it, which reaches the passage only together with the area formula.","pair_key":"9f7e26d985bfe9f48bab118138d30cdb5565202534547863ca527758bb21f0d7","path":"Mathlib/MeasureTheory/Measure/Prod.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem MeasureTheory.Measure.measurePreserving_swap {α : Type*} {β : Type*} [MeasurableSpace α] [MeasurableSpace β] {μ : MeasureTheory.Measure α} {ν : MeasureTheory.Measure β} [hν : MeasureTheory.SFinite ν] [MeasureTheory.SFinite μ] : MeasureTheory.MeasurePreserving Prod.swap (μ.prod ν) (ν.prod μ)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"850e8c4459bd1d08f296306a22f006a45cab861447e6314e04ec5bb6c108e7ca","prominence":"supporting","quote":{"exact":"The area of a rectangle remains the same regardless of which side"},"quote_capped":true,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"after":{"layer":"—a result of the commutative property.","segments":[{"text":"—a result of the commutative property."}]},"layer":"The area of a rectangle remains the same regardless of which side is measured first","segments":[{"text":"The area of a rectangle remains the same regardless of which side is measured first"}]},"unresolved":null},{"absence":null,"basis":"0072193aaaf6b41455d365951effd26969205bea1f20816dda2d667d0fb76130","coverage":null,"id":"enwiki-20845-1375745567::In-text #028d17e0","item":"In-text #028d17e0","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"div_eq_iff","end_line":345,"library":"mathlib","line":345,"location_key":"0072193aaaf6b41455d365951effd26969205bea1f20816dda2d667d0fb76130","module":"Mathlib.Algebra.GroupWithZero.Units.Basic","note":"Stated for any group with zero, where the quotient is characterised by the multiplication equation it solves.","pair_key":"8523a78aba355d5c4d954fe216153f574b88afa74b3f529f44126f74c6adc760","path":"Mathlib/Algebra/GroupWithZero/Units/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem div_eq_iff {G₀ : Type*} [GroupWithZero G₀] {a b c : G₀} : b ≠ 0 → (a / b = c ↔ a = c * b)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_div_cancel_right₀","end_line":198,"library":"mathlib","line":197,"location_key":"1d92dea7bd31f40af85592bb661695c14ad82e0967664b8f54ca1fea9d0d87ad","module":"Mathlib.Algebra.GroupWithZero.Defs","note":"States one direction of the inverse relation, multiplication followed by division.","pair_key":"f6ee85dc65bec4163bcf6049dab78381471f414a00d47b3baf6e8b52e46d30d1","path":"Mathlib/Algebra/GroupWithZero/Defs.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_div_cancel_right₀ {M₀ : Type*} [MonoidWithZero M₀] [Div M₀] [MulDivCancelClass M₀] (a : M₀) {b : M₀} : b ≠ 0 → a * b / b = a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"div_mul_cancel₀","end_line":336,"library":"mathlib","line":336,"location_key":"548aa59a9ff2625048c195f0f8cc4c72910ba05b88ab7996a3e41745ba85a958","module":"Mathlib.Algebra.GroupWithZero.Units.Basic","note":"States the other direction of the inverse relation, division followed by multiplication.","pair_key":"8f4777922858d8818ca3dfe75854e3ee313018dbdd6da45dac3f10ff47a68f1b","path":"Mathlib/Algebra/GroupWithZero/Units/Basic.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem div_mul_cancel₀ {G₀ : Type*} [GroupWithZero G₀] {b : G₀} (a : G₀) : b ≠ 0 → a / b * b = a"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a24763414828e585f14eb266dcfe88ddc9523bee102a5d9bcd29a353dd9f3e0b","prominence":"central","quote":{"exact":"The inverse operation of multiplication is considered division."},"quote_capped":false,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"The inverse operation of multiplication is considered division.","segments":[{"text":"The inverse operation of multiplication is considered division."}]},"unresolved":null},{"absence":null,"basis":"4911ee9bfd23a19f9dd36138263d9e0e958d0a715706b79657bb680c5c5c71c7","coverage":null,"id":"enwiki-20845-1375745567::In-text #6f5a74c8","item":"In-text #6f5a74c8","kind":"example","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.div_eq_of_eq_mul_left","end_line":456,"library":"lean-core","line":455,"location_key":"4911ee9bfd23a19f9dd36138263d9e0e958d0a715706b79657bb680c5c5c71c7","module":"Init.Data.Nat.Div.Basic","note":"Stated for arbitrary naturals, of which the passage's three numbers are one choice.","pair_key":"75d88b54494d39d7a87659ee76ce606b4afb0846a8d986fb940fc6cfcb60c37e","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.div_eq_of_eq_mul_left {n m k : Nat} : 0 < n → m = k * n → m / n = k"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.eq_div_of_mul_eq_left","end_line":1050,"library":"lean-core","line":1049,"location_key":"831bb9b00060ff46ae480c5d9efe0719efbe38f387f6dafab498f17b4e962eab","module":"Init.Data.Nat.Lemmas","note":"Stated for arbitrary naturals and read here at the three numbers of the example.","pair_key":"034f0145772a81a6f17d26a5104e74ee67f019137b29d1a6d5446e7c8c94ebf8","path":"src/Init/Data/Nat/Lemmas.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.eq_div_of_mul_eq_left {c a b : Nat} : c ≠ 0 → a * c = b → a = b / c"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f226ef9cc0e96c8becd551fa02a65bbafa177bf33e87fdc47623520bf8b12ac4","prominence":"supporting","quote":{"exact":"For example, since 4 multiplied by 3 equals 12, 12 divided by"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"For example, since 4 multiplied by 3 equals 12, 12 divided by 3 equals 4.","segments":[{"text":"For example, since 4 multiplied by 3 equals 12, 12 divided by 3 equals 4."}]},"unresolved":null},{"absence":null,"basis":"7c1328df4e1fa933ef1bc07c8f2e5d4e88268a9c3d408c92e9fac08404caa3e5","coverage":null,"id":"enwiki-20845-1375745567::In-text #3189e3ca","item":"In-text #3189e3ca","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_div_cancel_right₀","end_line":198,"library":"mathlib","line":197,"location_key":"7c1328df4e1fa933ef1bc07c8f2e5d4e88268a9c3d408c92e9fac08404caa3e5","module":"Mathlib.Algebra.GroupWithZero.Defs","note":"Stated for an arbitrary divisor that is not zero, and read here at the divisor 3.","pair_key":"f03c3ad44bf3acd213fa34745b4696a6e92c4ad6b68341573e0acba676b8db50","path":"Mathlib/Algebra/GroupWithZero/Defs.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_div_cancel_right₀ {M₀ : Type*} [MonoidWithZero M₀] [Div M₀] [MulDivCancelClass M₀] (a : M₀) {b : M₀} : b ≠ 0 → a * b / b = a"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Nat.mul_div_cancel","end_line":429,"library":"lean-core","line":427,"location_key":"305a558d0f39f5234cf92d68b25c98eebf79d42e04884106cb5052e544c8acb2","module":"Init.Data.Nat.Div.Basic","note":"Covers the passage at whole numbers, where division is the truncating one of Nat.","pair_key":"45d58fc9d535e73f27f777c1a771474e94134a92d8b6b7f5ea7db3f34f957213","path":"src/Init/Data/Nat/Div/Basic.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.mul_div_cancel (m : Nat) {n : Nat} : 0 < n → m * n / n = m"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b419ef8187e0a420eebd57f5fa920d2ca08f4dd9cc0616839ab4993c19a1572b","prominence":"supporting","quote":{"exact":"Indeed, multiplication by 3, followed by division by 3, yields the original"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"Indeed, multiplication by 3, followed by division by 3, yields the original number.","segments":[{"text":"Indeed, multiplication by 3, followed by division by 3, yields the original number."}]},"unresolved":null},{"absence":null,"basis":"010f0619e4e442877ecfdbdeb029f7b94ada4e7270745bfbb6e7940d38dfc04e","coverage":null,"id":"enwiki-20845-1375745567::In-text #8477c375","item":"In-text #8477c375","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"div_self","end_line":293,"library":"mathlib","line":293,"location_key":"010f0619e4e442877ecfdbdeb029f7b94ada4e7270745bfbb6e7940d38dfc04e","module":"Mathlib.Algebra.GroupWithZero.Units.Basic","note":"Stated for any group with zero, and the numbers of the passage form one.","pair_key":"bd9a7c52c3a2541be1f7811f32996dc99bfebfa93f950dd0bc0ae366e8ab6d58","path":"Mathlib/Algebra/GroupWithZero/Units/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem div_self {G₀ : Type*} [GroupWithZero G₀] {a : G₀} : a ≠ 0 → a / a = 1"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Nat.div_self","end_line":453,"library":"lean-core","line":451,"location_key":"51c25bfc3207bd61ac3d152edc187129ce5fe9a3b698bc26047fab7602f37779","module":"Init.Data.Nat.Div.Basic","note":"Covers the whole-number case of the passage.","pair_key":"01a33e7c329f967bf84eab69fd37b81e6b99188f53948ebdc914caeec298bf83","path":"src/Init/Data/Nat/Div/Basic.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.div_self {n : Nat} : 0 < n → n / n = 1"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"fd65702b4586fdc9f43d8a27956ae61ac3e6e625eebca7a6d800b3ffac607365","prominence":"supporting","quote":{"exact":"The division of a number other than 0 by itself equals 1."},"quote_capped":false,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"The division of a number other than 0 by itself equals 1.","segments":[{"text":"The division of a number other than 0 by itself equals 1."}]},"unresolved":null},{"absence":null,"basis":"84058dba4cbe5b0c9f0ddd775451b92564ac21443ebc22faaca98869eb3f8684","coverage":null,"id":"enwiki-20845-1375745567::In-text #593b2c7e","item":"In-text #593b2c7e","kind":"notation","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Mul","end_line":1656,"library":"lean-core","line":1654,"location_key":"84058dba4cbe5b0c9f0ddd775451b92564ac21443ebc22faaca98869eb3f8684","module":"Init.Prelude","note":"The library writes the sign as an asterisk rather than the cross of arithmetic, and declares the notation for an arbitrary type rather than for numbers alone.","pair_key":"d132a9d8695ad0e1274bdbe02cdc36840b38a614386eccd9dbb27706d2286e3c","path":"src/Init/Prelude.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"class Mul : Type u → Type u"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"HMul","end_line":1508,"library":"lean-core","line":1505,"location_key":"91535ca6eb4854d17044a4ab03ff4bf3c89d291ca3f9b0399e89ef2366cd9339","module":"Init.Prelude","note":"The heterogeneous form of the same infix notation, letting the two factors have different types, and again written with an asterisk.","pair_key":"a2682562dc1ac33ecbe8bea65fcd43ffe8ae992c8862fd0618e69714210e3d9f","path":"src/Init/Prelude.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"class HMul : Type u → Type v → outParam (Type w) → Type (max (max u v) w)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"edec99172edea0ab3a8b536f1f2181e4d2e264b71daa0e70512d5bf3e9d44998","prominence":"central","quote":{"exact":"In arithmetic, multiplication is often written using the multiplication sign (either ×"},"quote_capped":true,"section":["Notation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"In arithmetic, multiplication is often written using the multiplication sign (either × or × {\\displaystyle \\times } ) between the factors (that is, in infix notation)","segments":[{"text":"In arithmetic, multiplication is often written using the multiplication sign (either × or "},{"tex":"\\times"},{"text":" ) between the factors (that is, in infix notation)"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"05d9a12adf9d1aaf8ef36d3326cf4d04c69ac63f9bc0f81820a758cc06d4d645"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #655403e7","item":"In-text #655403e7","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"d179775c278a3b67dffb3d696db0ffe8ff46742231d874e44b831e8e47516310","prominence":"supporting","quote":{"exact":"2 × 3 = 6 , {\\displaystyle 2\\times 3=6,} (\"two times three"},"quote_capped":true,"section":["Notation"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"For example, ","lead_in":true,"segments":[{"text":"For example, "}]},"layer":"2 × 3 = 6 , {\\displaystyle 2\\times 3=6,} (\"two times three equals six\")","segments":[{"tex":"2\\times 3=6,"},{"text":" (\"two times three equals six\")"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"d598c55c523a87090ea20c69a0837e2fb1a36ddd2d71ae0b8a5a85fc40ff2602"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #d1dd02d4","item":"In-text #d1dd02d4","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"208b5ae06a92c43ff624ea72cd43138fb0f97334e3cea39944d796642847286a","prominence":"supporting","quote":{"exact":"3 × 4 = 12 , {\\displaystyle 3\\times 4=12,}"},"quote_capped":false,"section":["Notation"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"2 × 3 = 6 , {\\displaystyle 2\\times 3=6,} (\"two times three equals six\") ","lead_in":true,"segments":[{"tex":"2\\times 3=6,"},{"text":" (\"two times three equals six\") "}]},"layer":"3 × 4 = 12 , {\\displaystyle 3\\times 4=12,}","segments":[{"tex":"3\\times 4=12,"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"f1c621327e07a70b88bba098b1d27d2a54722bae6a39d228324f5485b189cee4"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #6fbb15c3","item":"In-text #6fbb15c3","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e42831ee2022d8cfd456741c58305201ebd499bec6d76f75f09e32be36800045","prominence":"supporting","quote":{"exact":"2 × 3 × 5 = 6 × 5 = 30 ,"},"quote_capped":true,"section":["Notation"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"3 × 4 = 12 , {\\displaystyle 3\\times 4=12,} ","lead_in":true,"segments":[{"tex":"3\\times 4=12,"},{"text":" "}]},"layer":"2 × 3 × 5 = 6 × 5 = 30 , {\\displaystyle 2\\times 3\\times 5=6\\times 5=30,}","segments":[{"tex":"2\\times 3\\times 5=6\\times 5=30,"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"c5f1354591792ba9ecfc16f34a3ea5b0f60e054db0904b0b67f8335b07f6cb89"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #52f3c667","item":"In-text #52f3c667","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"552e4037544592061fc483f7e47ba1b8ab4db9e3932d0b716053504254cf2422","prominence":"supporting","quote":{"exact":"2 × 2 × 2 × 2 × 2 = 32. {\\displaystyle"},"quote_capped":true,"section":["Notation"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"2 × 3 × 5 = 6 × 5 = 30 , {\\displaystyle 2\\times 3\\times 5=6\\times 5=30,} ","lead_in":true,"segments":[{"tex":"2\\times 3\\times 5=6\\times 5=30,"},{"text":" "}]},"layer":"2 × 2 × 2 × 2 × 2 = 32. {\\displaystyle 2\\times 2\\times 2\\times 2\\times 2=32.}","segments":[{"tex":"2\\times 2\\times 2\\times 2\\times 2=32."}]},"unresolved":null},{"absence":null,"basis":"0eb1826519709ae9719f1e2174ccc124f266a407528945add27ea6742e1f5468","coverage":null,"id":"enwiki-20845-1375745567::In-text #f358cac6","item":"In-text #f358cac6","kind":"notation","locations":[{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Mul","end_line":1656,"library":"lean-core","line":1654,"location_key":"0eb1826519709ae9719f1e2174ccc124f266a407528945add27ea6742e1f5468","module":"Init.Prelude","note":"Lean fixes one multiplication per type here and writes it with an asterisk rather than a centred dot, and it admits far more types than the numbers the passage multiplies.","pair_key":"e5aa45b61db414f8bdac6548ed24de53981531fe5b7191f7513f4526db0cc7ca","path":"src/Init/Prelude.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"class Mul : Type u → Type u"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Nat.mul","end_line":1919,"library":"lean-core","line":1917,"location_key":"644c288ca9a4deb4cbbc4fb0d3a0624bc6f0dca9c15b7fe18e34479bb7d1dd34","module":"Init.Prelude","note":"Its own documentation says the operation is normally reached through the asterisk, Lean's symbol in place of the article's dot, and it covers only natural numbers.","pair_key":"b217b9af9828ea97947e209f517d10ed404189cdc6411510f17233ecd9668d8b","path":"src/Init/Prelude.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Nat.mul : Nat → Nat → Nat"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"49b87e680d3392bf3981257625d4cd37095fe0f14dd14ed1e2303218ed5a802c","prominence":"supporting","quote":{"exact":"Multiplication is also denoted by a middle-position dot: 5 ⋅ 2 {\\displaystyle"},"quote_capped":true,"section":["Notation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"There are other mathematical notations for multiplication: ","lead_in":true,"segments":[{"text":"There are other mathematical notations for multiplication: "}]},"layer":"Multiplication is also denoted by a middle-position dot: 5 ⋅ 2 {\\displaystyle 5\\cdot 2}","segments":[{"text":"Multiplication is also denoted by a middle-position dot: "},{"tex":"5\\cdot 2"}]},"unresolved":null},{"absence":null,"basis":"76e50a50c04e651e9861d24b45075579358eb1cbe283aa063c67fdb59cd0a0e1","coverage":null,"id":"enwiki-20845-1375745567::In-text #0d6b50f1","item":"In-text #0d6b50f1","kind":"notation","locations":[{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Mul","end_line":1656,"library":"lean-core","line":1654,"location_key":"76e50a50c04e651e9861d24b45075579358eb1cbe283aa063c67fdb59cd0a0e1","module":"Init.Prelude","note":"Lean offers a single written form for this operation, the asterisk, so the fallback character the passage describes names the operation this class carries, over more types than the passage has in view.","pair_key":"e59c4ff7ea8d37148a8eb3396f913ca4f712e906d1894b3bf6ea8676fc76cc2b","path":"src/Init/Prelude.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"class Mul : Type u → Type u"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"low","declaration":"HMul","end_line":1508,"library":"lean-core","line":1505,"location_key":"6d73283f51df81f853f0cc1b81981b47319e93255e1bc47a7828c9a78f8ce65e","module":"Init.Prelude","note":"This is the class that attaches an infix symbol to multiplication in Lean, and the symbol it attaches is the asterisk, over factors that may even lie in different types.","pair_key":"ef2cc9d9d107e0f707ae238973cbcf3f044fc697dcc4c5379b4f659bed947b43","path":"src/Init/Prelude.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"class HMul : Type u → Type v → outParam (Type w) → Type (max (max u v) w)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a3bc609761e6d98a520b96aff62c88996c546388599f4d644ebb2e50cd720da4","prominence":"supporting","quote":{"exact":"When the dot operator character is not accessible, the interpunct (·) is"},"quote_capped":true,"section":["Notation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"The middle dot notation, or dot operator, is now standard in the United States and other countries.[clarification needed] ","segments":[{"text":"The middle dot notation, or dot operator, is now standard in the United States and other countries.[clarification needed] "}]},"layer":"When the dot operator character is not accessible, the interpunct (·) is used.","segments":[{"text":"When the dot operator character is not accessible, the interpunct (·) is used."}]},"unresolved":null},{"absence":null,"basis":"799709756ba48d74a6e6d53639dc8acbf63a7942e4012cf6b41f02344da2d75b","coverage":null,"id":"enwiki-20845-1375745567::In-text #5a17cab8","item":"In-text #5a17cab8","kind":"notation","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Mul","end_line":1656,"library":"lean-core","line":1654,"location_key":"799709756ba48d74a6e6d53639dc8acbf63a7942e4012cf6b41f02344da2d75b","module":"Init.Prelude","note":"Lean requires an explicit asterisk between the factors instead of the juxtaposition the passage describes, and its multiplication is fixed for an arbitrary type rather than for variables of one algebraic setting.","pair_key":"b4997da467ed545ca33862b73566662a3b74a768474f3d3ae41a5eb06511af10","path":"src/Init/Prelude.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"class Mul : Type u → Type u"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"low","declaration":"HMul","end_line":1508,"library":"lean-core","line":1505,"location_key":"cde5a2a6836ad26febb5809225d66d85e273e827df3ed979f4c31040d7e69b43","module":"Init.Prelude","note":"It is the class that gives multiplication a written infix form in Lean, and that form is an explicit asterisk, never bare juxtaposition, which Lean reads as function application.","pair_key":"1822d0306300b707729e82da82376469d149f46a4759d1799743ddfbae517500","path":"src/Init/Prelude.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"class HMul : Type u → Type v → outParam (Type w) → Type (max (max u v) w)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"83b5d9cb27f8da1ccdbe977f102eed54fe12dbac34beb3f026ef67c3ca6fc14c","prominence":"supporting","quote":{"exact":"In algebra, multiplication involving variables is often written as a juxtaposition (e.g.,"},"quote_capped":true,"section":["Notation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"In algebra, multiplication involving variables is often written as a juxtaposition (e.g., x y {\\displaystyle xy} for x {\\displaystyle x} times y {\\displaystyle y} or 5 x {\\displaystyle 5x} for five times x {\\displaystyle x} ), also called implied multiplication.","segments":[{"text":"In algebra, multiplication involving variables is often written as a juxtaposition (e.g., "},{"tex":"xy"},{"text":" for "},{"tex":"x"},{"text":" times "},{"tex":"y"},{"text":" or "},{"tex":"5x"},{"text":" for five times "},{"tex":"x"},{"text":" ), also called implied multiplication."}]},"unresolved":null},{"absence":null,"basis":"d89024e7747eaa903d12b633759fd16072262705706091a07528011fcd7458cd","coverage":null,"id":"enwiki-20845-1375745567::In-text #27b004a0","item":"In-text #27b004a0","kind":"notation","locations":[{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Mul","end_line":1656,"library":"lean-core","line":1654,"location_key":"d89024e7747eaa903d12b633759fd16072262705706091a07528011fcd7458cd","module":"Init.Prelude","note":"Lean writes this operation with an asterisk between the factors, with brackets doing no more than grouping, whereas the passage lets adjacency alone carry the product; the class also ranges over far more types than numbers.","pair_key":"baa63591f999f93ab2eb9273bb055a8274933f53ec6bdacd1d2259d304bbb029","path":"src/Init/Prelude.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"class Mul : Type u → Type u"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Nat.mul","end_line":1919,"library":"lean-core","line":1917,"location_key":"e1a710ee9482b0bf922685e936ee963fa0e828818dc9b712be17985bd4ff9c5a","module":"Init.Prelude","note":"It is multiplication on the naturals only, reached in Lean through the asterisk rather than by placing the factors next to each other.","pair_key":"26758fb3deed05620b65faecf3f365ebc9721cee147633350d25d98fb57d20fc","path":"src/Init/Prelude.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Nat.mul : Nat → Nat → Nat"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a758998360baafd33633b5f06e5314a88c2230601df824d6287e48e5c66f52b3","prominence":"supporting","quote":{"exact":"The notation can also be used for quantities that are surrounded by"},"quote_capped":true,"section":["Notation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"The notation can also be used for quantities that are surrounded by parentheses (e.g., 5 ( 2 ) {\\displaystyle 5(2)} , ( 5 ) 2 {\\displaystyle (5)2} or ( 5 ) ( 2 ) {\\displaystyle (5)(2)} for five times two)","segments":[{"text":"The notation can also be used for quantities that are surrounded by parentheses (e.g., "},{"tex":"5(2)"},{"text":" , "},{"tex":"(5)2"},{"text":" or "},{"tex":"(5)(2)"},{"text":" for five times two)"}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"7de8f9ef3709c315c26dafffb8d360b90828eebe8490af8d15c7a0a38ec9abef","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"405c9a0cc1d5b1b75a692d637c9fa5fb3a611e42b38cf6d1cb61e2f1d7fb8e41","text":"the cross symbol applied to two vectors means their cross product, which is again a vector"},{"id":"c2","part":"4dd1374636b05524b50d85320b82c0cf2ab10dcfc07bb8e12eca7ca0a15018d0","text":"the dot applied to two vectors means their dot product, which is a scalar"}],"parts":["405c9a0cc1d5b1b75a692d637c9fa5fb3a611e42b38cf6d1cb61e2f1d7fb8e41","4dd1374636b05524b50d85320b82c0cf2ab10dcfc07bb8e12eca7ca0a15018d0"],"relation":"broadMatch","status":"formalized"},"id":"enwiki-20845-1375745567::In-text #2dcd5df0","item":"In-text #2dcd5df0","kind":"notation","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"crossProduct","end_line":59,"library":"mathlib","line":47,"location_key":"405c9a0cc1d5b1b75a692d637c9fa5fb3a611e42b38cf6d1cb61e2f1d7fb8e41","module":"Mathlib.LinearAlgebra.CrossProduct","note":"Mathlib builds the operation over an arbitrary commutative ring of scalars, and its value lies in the same space of vectors.","pair_key":"082db5fbd0c9e61b4e5e1c9aab3bbb461c4a596ecfc6156423ec57b4b1371b41","path":"Mathlib/LinearAlgebra/CrossProduct.lean","proof_status":"definition","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def crossProduct {R : Type*} [CommRing R] : (Fin 3 → R) →ₗ[R] (Fin 3 → R) →ₗ[R] Fin 3 → R"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"dotProduct","end_line":77,"library":"mathlib","line":76,"location_key":"4dd1374636b05524b50d85320b82c0cf2ab10dcfc07bb8e12eca7ca0a15018d0","module":"Mathlib.Data.Matrix.Mul","note":"The scalars may be any type with multiplication and addition and the index any finite type, and the result lives in the scalar type.","pair_key":"2c70464572d37a1830ca2fbae491772a63a7d8f3a7746afdf254bb4eb26d67fe","path":"Mathlib/Data/Matrix/Mul.lean","proof_status":"definition","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def dotProduct {m : Type*} {α : Type v} [Fintype m] [Mul α] [AddCommMonoid α] : (m → α) → (m → α) → α"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"58c5e4dc1898c285d3405df0c77cf4b0ea717ba2906b1db211f0cdf7080b6e76","prominence":"supporting","quote":{"exact":"The cross symbol generally denotes taking a cross product of two vectors,"},"quote_capped":true,"section":["Notation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"The cross symbol generally denotes taking a cross product of two vectors, yielding a vector as its result, while the dot denotes taking the dot product of two vectors, resulting in a scalar.","segments":[{"text":"The cross symbol generally denotes taking a cross product of two vectors, yielding a vector as its result, while the dot denotes taking the dot product of two vectors, resulting in a scalar."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"3a6642c600c1154e35a9faac05339ea4b6ca2d90d0c1e52dac7ada84fa7f0e87"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #ff88f9fa","item":"In-text #ff88f9fa","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"ca19ecc8b91c21d79867cedf20a32327b1413f04b4afe29eb9c5037c8b5b479e","prominence":"supporting","quote":{"exact":"The numbers to be multiplied are generally called the factors (as in"},"quote_capped":true,"section":["Notation"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"The numbers to be multiplied are generally called the factors (as in factorization).","segments":[{"text":"The numbers to be multiplied are generally called the factors (as in factorization)."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"31fd5b95cb4261ef459bdc35e7c2828edb9d7c5c5977aadec82cfc6e7918515d"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #7ffce3ea","item":"In-text #7ffce3ea","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"ee2ea3202e7b47b32d981249a31122ed8a50d998554eee47b3dd75416cf9aece","prominence":"supporting","quote":{"exact":"The number to be multiplied is the multiplicand"},"quote_capped":false,"section":["Notation"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"after":{"layer":", and the number by which it is multiplied is the multiplier.","segments":[{"text":", and the number by which it is multiplied is the multiplier."}]},"layer":"The number to be multiplied is the multiplicand","segments":[{"text":"The number to be multiplied is the multiplicand"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"f35a67a74ea1c5a9d117a34470adcc54d119b1b4f5bf421049ce695e8426d760"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #712297d9","item":"In-text #712297d9","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"0ad919cdf4b9e7da4fd0151ceec9c8d15f2227637acffcfcf8bd7239faa8c538","prominence":"supporting","quote":{"exact":"the number by which it is multiplied is the multiplier."},"quote_capped":false,"section":["Notation"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"The number to be multiplied is the multiplicand, and ","segments":[{"text":"The number to be multiplied is the multiplicand, and "}]},"layer":"the number by which it is multiplied is the multiplier.","segments":[{"text":"the number by which it is multiplied is the multiplier."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"890ef5179c60fc6d6f0f7611bd85ce334db07460ed3aed43d20f7b7310fa6661"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #7cfd87d4","item":"In-text #7cfd87d4","kind":"notation","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"af5f660a044dc01c6ff0ffa92657fcb822fc56561ed7048893c39148e64bd469","prominence":"supporting","quote":{"exact":"Usually, the multiplier is placed first, and the multiplicand is placed second"},"quote_capped":false,"section":["Notation"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"after":{"layer":";[17][18] however, sometimes the first factor is considered the multiplicand and the second the multiplier.","segments":[{"text":";"},{"ref":"[17][18]"},{"text":" however, sometimes the first factor is considered the multiplicand and the second the multiplier."}]},"layer":"Usually, the multiplier is placed first, and the multiplicand is placed second","segments":[{"text":"Usually, the multiplier is placed first, and the multiplicand is placed second"}]},"unresolved":null},{"absence":null,"basis":"1263a16bfb6eb92eb8ab975f20c5e3078a66cfa95cca23a09b627500542d53dc","coverage":null,"id":"enwiki-20845-1375745567::In-text #7ea646cd","item":"In-text #7ea646cd","kind":"definition","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polynomial.coeff","end_line":559,"library":"mathlib","line":558,"location_key":"1263a16bfb6eb92eb8ab975f20c5e3078a66cfa95cca23a09b627500542d53dc","module":"Mathlib.Algebra.Polynomial.Basic","note":"Mathlib's function is the coefficient in one variable, whereas the passage's own example multiplies a product of two variables.","pair_key":"18784bda3cb76da5896833f288f6fa87c84dbc09fd9099703433857d44c2bf5e","path":"Mathlib/Algebra/Polynomial/Basic.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Polynomial.coeff {R : Type u} [Semiring R] : R[X] → ℕ →₀ R"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MvPolynomial.monomial","end_line":92,"library":"mathlib","line":91,"location_key":"a54569fb73c97ae6af4f7869f6ae37120d4c9e156053cdf99fb4b3fbac629d16","module":"Mathlib.Algebra.MvPolynomial.Basic","note":"It builds a monomial out of a scalar and an exponent vector rather than naming the scalar that multiplies an expression.","pair_key":"618cff7ee0a938d202d6b951a47130d908591a37eaefd45429af421075fceddb","path":"Mathlib/Algebra/MvPolynomial/Basic.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def MvPolynomial.monomial {R : Type u} {σ : Type*} [CommSemiring R] : (σ →₀ ℕ) → R →ₗ[R] MvPolynomial σ R"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"27fd703622df0675b4216eb2542a601b0cc0aab4210cbb46975cc0d86f7a25cc","prominence":"supporting","quote":{"exact":"In algebra, a number that is the multiplier of a variable or"},"quote_capped":true,"section":["Notation"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"In algebra, a number that is the multiplier of a variable or expression (e.g., the 3 in 3 x y 2 {\\displaystyle 3xy^{2}} ) is called a coefficient.","segments":[{"text":"In algebra, a number that is the multiplier of a variable or expression (e.g., the 3 in "},{"tex":"3xy^{2}"},{"text":" ) is called a coefficient."}]},"unresolved":null},{"absence":null,"basis":"ddc4429d864cc35e4d55e2a691865b6e5998636c79c751d4e9eb3d0a57c934a2","coverage":null,"id":"enwiki-20845-1375745567::In-text #bbed5f24","item":"In-text #bbed5f24","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Mul","end_line":1656,"library":"lean-core","line":1654,"location_key":"ddc4429d864cc35e4d55e2a691865b6e5998636c79c751d4e9eb3d0a57c934a2","module":"Init.Prelude","note":"The class supplies multiplication for an arbitrary type, and the element it returns on two arguments is the one the passage names.","pair_key":"cdcdff59768347af6359d430b6a162b8ebef744251abee58169971893ad07a41","path":"src/Init/Prelude.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"class Mul : Type u → Type u"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Nat.mul","end_line":1919,"library":"lean-core","line":1917,"location_key":"1cd99e64aa9d437aee36f256056123a17fda7dba58fb1cb33ea917dbcb7ab71b","module":"Init.Prelude","note":"This is multiplication for natural numbers only, one of the number systems the passage covers.","pair_key":"84ade78f3bcc34112347c9622230363a7b87809d02349a622dedd71bc26220d4","path":"src/Init/Prelude.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Nat.mul : Nat → Nat → Nat"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"708e2dfa7f133f7a76c5745472320c3a70c0e3a75b704f8f6089b482c4eb475e","prominence":"central","quote":{"exact":"The result of a multiplication is called a product."},"quote_capped":false,"section":["Notation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"The result of a multiplication is called a product.","segments":[{"text":"The result of a multiplication is called a product."}]},"unresolved":null},{"absence":null,"basis":"d56c9a7e8365531732a3002b0237db54f7c0e0083d366a4c25b801fa03e1773a","coverage":null,"id":"enwiki-20845-1375745567::In-text #d993fef0","item":"In-text #d993fef0","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"zsmul_eq_mul","end_line":105,"library":"mathlib","line":103,"location_key":"d56c9a7e8365531732a3002b0237db54f7c0e0083d366a4c25b801fa03e1773a","module":"Mathlib.Data.Int.Cast.Lemmas","note":"Its integer argument is an integer, so the passage's integer factor is met directly, and the ring may be any ring, including the reals where the passage's example lives.","pair_key":"a88fc9ab39e1aef0a40d315871d643d4a59a1999560c37f1125138e4d55dfed4","path":"Mathlib/Data/Int/Cast/Lemmas.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem zsmul_eq_mul {α : Type*} [NonAssocRing α] (a : α) (n : ℤ) : n • a = ↑n * a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"AddSubgroup.zsmul_mem_zmultiples","end_line":58,"library":"mathlib","line":58,"location_key":"cea4c258e868e73fabee573183fc67586db8628f2d76440dde0a5522d0c7a960","module":"Mathlib.Algebra.Group.Subgroup.ZPowers.Basic","note":"It places an integer multiple inside the subgroup of multiples, and reaching the passage's product needs in addition the lemma identifying multiplication by an integer with that multiple.","pair_key":"31e50f41cdc9952267fc53778430466febfbd3967baa313042f413f6a2bc7c88","path":"Mathlib/Algebra/Group/Subgroup/ZPowers/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem AddSubgroup.zsmul_mem_zmultiples {G : Type*} [AddGroup G] (g : G) (k : ℤ) : k • g ∈ AddSubgroup.zmultiples g"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"677e98d9e228f427dcf5ee24576cac627777ba129e43167b1ccdb6d7b748756e","prominence":"central","quote":{"exact":"When one factor is an integer, the product is a multiple of"},"quote_capped":true,"section":["Notation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"When one factor is an integer, the product is a multiple of the other or of the product of the others.","segments":[{"text":"When one factor is an integer, the product is a multiple of the other or of the product of the others."}]},"unresolved":null},{"absence":null,"basis":"6e8a206ca5bbdd408c3edf04e351b3b4c8e7cc0da844d6ef2daa4828a82a32f9","coverage":null,"id":"enwiki-20845-1375745567::In-text #23d8aa44","item":"In-text #23d8aa44","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"dvd_mul_left","end_line":247,"library":"mathlib","line":246,"location_key":"6e8a206ca5bbdd408c3edf04e351b3b4c8e7cc0da844d6ef2daa4828a82a32f9","module":"Mathlib.Algebra.Divisibility.Basic","note":"the library reads being a multiple as divisibility, and the factor that the article calls an integer is exactly the left factor of the product here","pair_key":"92dd264b2891e7e12ae1889bdecf209adc6c1251a4101843745f23b97482a030","path":"Mathlib/Algebra/Divisibility/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem dvd_mul_left {α : Type*} [CommSemigroup α] (a b : α) : a ∣ b * a"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"AddSubgroup.zsmul_mem_zmultiples","end_line":58,"library":"mathlib","line":58,"location_key":"9ea81c1f9e266612109fd14c48e5636af8f4ce32bc0e071270e295d1442b0843","module":"Mathlib.Algebra.Group.Subgroup.ZPowers.Basic","note":"it places an integer multiple inside the subgroup generated by pi, which is a different formulation of multiple from the product the article writes","pair_key":"8acdd187c57a118b89ff965db4b1b5543d07f8683447dfc622a52a780e444c11","path":"Mathlib/Algebra/Group/Subgroup/ZPowers/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem AddSubgroup.zsmul_mem_zmultiples {G : Type*} [AddGroup G] (g : G) (k : ℤ) : k • g ∈ AddSubgroup.zmultiples g"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"bf2da3f01b82b7a986a75642a9704b627fb4a05725480e3cf338a1eab05423a5","prominence":"supporting","quote":{"exact":"Thus, 2 × π {\\displaystyle 2\\times \\pi } is a multiple of"},"quote_capped":true,"section":["Notation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"Thus, 2 × π {\\displaystyle 2\\times \\pi } is a multiple of π {\\displaystyle \\pi } , as is 5133 × 486 × π {\\displaystyle 5133\\times 486\\times \\pi }","segments":[{"text":"Thus, "},{"tex":"2\\times \\pi"},{"text":" is a multiple of "},{"tex":"\\pi"},{"text":" , as is "},{"tex":"5133\\times 486\\times \\pi"}]},"unresolved":null},{"absence":null,"basis":"ffa236738d30b38074d4ca4a0cd96bf84aed0a176e301415d29bb9b0c676c670","coverage":null,"id":"enwiki-20845-1375745567::In-text #598e1b52","item":"In-text #598e1b52","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Finset.dvd_prod_of_mem","end_line":234,"library":"mathlib","line":231,"location_key":"ffa236738d30b38074d4ca4a0cd96bf84aed0a176e301415d29bb9b0c676c670","module":"Mathlib.Algebra.BigOperators.Group.Finset.Piecewise","note":"the library states this for a finite indexed product in any commutative monoid, which covers a product of any number of integer factors","pair_key":"8f6a983d5df321d2f12406cf9a2e65d59f5e0282d80f478574f610fefef1fe61","path":"Mathlib/Algebra/BigOperators/Group/Finset/Piecewise.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.dvd_prod_of_mem {ι : Type*} {M : Type*} [CommMonoid M] (f : ι → M) {a : ι} {s : Finset ι} : a ∈ s → f a ∣ ∏ i ∈ s, f i"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.dvd_mul_right","end_line":54,"library":"lean-core","line":54,"location_key":"4792a0049b0df6cc0db5704bcd683119d30ef2e90b15fab4fc0de2e2b80750eb","module":"Init.Data.Int.DivMod.Bootstrap","note":"this is the integer-specific form for the first of two factors","pair_key":"f40c56dbe0eb1c6164feaefed128d4be2845ec0bbdc3500868afcac6d903ef3e","path":"src/Init/Data/Int/DivMod/Bootstrap.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.dvd_mul_right (a b : Int) : a ∣ a * b"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.dvd_mul_left","end_line":56,"library":"lean-core","line":56,"location_key":"d8503b3de9914fc9c294775cbc3df1362ff114a652fa29fbe948bb09264045fb","module":"Init.Data.Int.DivMod.Bootstrap","note":"this is the integer-specific form for the second of two factors","pair_key":"d88609950b36c9dc87396c7f51fffefd21f8df6e4125c95171f7f08bc5155dc6","path":"src/Init/Data/Int/DivMod/Bootstrap.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.dvd_mul_left (a b : Int) : b ∣ a * b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"87521da7c71d3e6bf2cb7f64af10377eee6d95a90de5ee16029c5cb519ac1914","prominence":"central","quote":{"exact":"A product of integers is a multiple of each factor"},"quote_capped":false,"section":["Notation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"after":{"layer":"; for example, 15 is the product of 3 and 5 and is both a multiple of 3 and a multiple of 5.","segments":[{"text":"; for example, 15 is the product of 3 and 5 and is both a multiple of 3 and a multiple of 5."}]},"layer":"A product of integers is a multiple of each factor","segments":[{"text":"A product of integers is a multiple of each factor"}]},"unresolved":null},{"absence":null,"basis":"1f817d1ce9b6d8c995c368644088d4b7a1b1d29e323715d5c321504ad10dce11","coverage":null,"id":"enwiki-20845-1375745567::In-text #c0e6cc0c","item":"In-text #c0e6cc0c","kind":"example","locations":[{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.dvd_mul_right","end_line":24,"library":"lean-core","line":24,"location_key":"1f817d1ce9b6d8c995c368644088d4b7a1b1d29e323715d5c321504ad10dce11","module":"Init.Data.Nat.Dvd","note":"the numeric evaluation of the product to fifteen is settled by computation","pair_key":"f2d8e468363f9aa8b64aa8677177c217d6462c7e0180aa7988bd05f155de67da","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.dvd_mul_right (a b : Nat) : a ∣ a * b"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.dvd_mul_left","end_line":23,"library":"lean-core","line":23,"location_key":"c9adc1d98be3ea0c2bf44fd47454301c03bfa6d4f572e0b7a0747e886eb02a19","module":"Init.Data.Nat.Dvd","note":"the numeric evaluation of the product to fifteen is settled by computation","pair_key":"9fe47d2cc4374eec41056ca687f4d7776b36d70a9df33cfa5e4093e82e55010a","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_mul_left (a b : Nat) : a ∣ b * a"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"64cc1ad0acbef12b37268593e0ff02a8ebfd51fe3080529de166e8b00e8cb0d7","prominence":"supporting","quote":{"exact":"for example, 15 is the product of 3 and 5 and is"},"quote_capped":true,"section":["Notation"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"A product of integers is a multiple of each factor; ","segments":[{"text":"A product of integers is a multiple of each factor; "}]},"layer":"for example, 15 is the product of 3 and 5 and is both a multiple of 3 and a multiple of 5.","segments":[{"text":"for example, 15 is the product of 3 and 5 and is both a multiple of 3 and a multiple of 5."}]},"unresolved":null},{"absence":null,"basis":"94239ab389425ec44acb051c76192dddf2553c5c054d67096a62a2735c3966fd","coverage":null,"id":"enwiki-20845-1375745567::In-text #be9d3a47","item":"In-text #be9d3a47","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.mul","end_line":1919,"library":"lean-core","line":1917,"location_key":"94239ab389425ec44acb051c76192dddf2553c5c054d67096a62a2735c3966fd","module":"Init.Prelude","note":"Lean's logical model builds the product by recursion on the second argument, accumulating one copy of the first argument at each step, where the article writes the same repeated sum with a summation sign","pair_key":"c1308368dff257e908424095293743ffead74d5c69a6494660ccc47f9bbe8f55","path":"src/Init/Prelude.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Nat.mul : Nat → Nat → Nat"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Finset.sum_const_nat","end_line":994,"library":"mathlib","line":992,"location_key":"5ebfa986658e760e73d11fd67bf4894c0156db20054b6c09d5c7e660ca18ce35","module":"Mathlib.Algebra.BigOperators.Group.Finset.Basic","note":"the library writes the repeated sum as a sum over a finite index set and reads the number of copies off the size of that set","pair_key":"e3ed8b7d386735ee11a98f4839158b10fe13977f740b81d7466c6e43c8159a76","path":"Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.sum_const_nat {ι : Type*} {s : Finset ι} {m : ℕ} {f : ι → ℕ} : (∀ x ∈ s, f x = m) → ∑ x ∈ s, f x = s.card * m"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.mul_comm","end_line":213,"library":"lean-core","line":211,"location_key":"f9e9f44f741bbbf01b5e20643331f8cd39100a2183e594c288a413b74303a867","module":"Init.Data.Nat.Basic","note":"it states that the product does not depend on the order of the two factors, which is the fact behind the article's two readings of the repeated sum","pair_key":"d15b421eb5dceef7f0a865e67db5477d66e5386e938ff0195a8f63d45f35cf03","path":"src/Init/Data/Nat/Basic.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.mul_comm (n m : Nat) : n * m = m * n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"aea6902464055921a5615a1ea4d0f40b67b720aaa286d40c1bfa663850a3bcdf","prominence":"central","quote":{"exact":"The product of two natural numbers r , s ∈ N {\\displaystyle"},"quote_capped":true,"section":["Definitions","Product of two natural numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"The product of two natural numbers r , s ∈ N {\\displaystyle r,s\\in \\mathbb {N} } is defined as: r ⋅ s ≡ ∑ i = 1 s r = r + r + ⋯ + r ⏟ s times ≡ ∑ j = 1 r s = s + s + ⋯ + s ⏟ r times . {\\displaystyle r\\cdot s\\equiv \\sum _{i=1}^{s}r=\\underbrace {r+r+\\cdots +r} _{s{\\text{ times}}}\\equiv \\sum _{j=1}^{r}s=\\underbrace {s+s+\\cdots +s} _{r{\\text{ times}}}.}","segments":[{"text":"The product of two natural numbers "},{"tex":"r,s\\in \\mathbb {N}"},{"text":" is defined as: "},{"display":true,"tex":"r\\cdot s\\equiv \\sum _{i=1}^{s}r=\\underbrace {r+r+\\cdots +r} _{s{\\text{ times}}}\\equiv \\sum _{j=1}^{r}s=\\underbrace {s+s+\\cdots +s} _{r{\\text{ times}}}."}]},"unresolved":null},{"absence":null,"basis":"c4695efa14c4514c9e779ba73c030aad077844a8a78ba5e15123e424b657cb80","coverage":null,"id":"enwiki-20845-1375745567::In-text #0109d3d5","item":"In-text #0109d3d5","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.eq_nat_or_neg","end_line":1407,"library":"lean-core","line":1407,"location_key":"c4695efa14c4514c9e779ba73c030aad077844a8a78ba5e15123e424b657cb80","module":"Init.Data.Int.Order","note":"the witness is a natural number (ℕ), cast into the integers, so the passage's zero case is the case where that natural number is zero and the other two cases are the cast and its negation","pair_key":"3cb5181615f953699da456f394779df335b35b062bef114aa959f7c206a24725","path":"src/Init/Data/Int/Order.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.eq_nat_or_neg (a : Int) : ∃ n, a = ↑n ∨ a = -↑n"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.natAbs_eq","end_line":624,"library":"lean-core","line":622,"location_key":"0e3841803cb9143814f69518cc8ee67f2d3ed3900c9bb6a7ca9aa199aacce635","module":"Init.Data.Int.Order","note":"the natural number here (ℕ) is the absolute value of the integer, and its vanishing is exactly the passage's zero case","pair_key":"0ac5e87f447cdbf85bcbae52ee4f44849771fce366342f199690da5ad4b0175b","path":"src/Init/Data/Int/Order.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.natAbs_eq (a : Int) : a = ↑a.natAbs ∨ a = -↑a.natAbs"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"268f1e66ec207575d745ed9981d36ada298617a6d66fd02d95a144cc92c27918","prominence":"supporting","quote":{"exact":"An integer can be either zero, a nonzero natural number, or minus"},"quote_capped":true,"section":["Definitions","Product of two integers"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"An integer can be either zero, a nonzero natural number, or minus a nonzero natural number.","segments":[{"text":"An integer can be either zero, a nonzero natural number, or minus a nonzero natural number."}]},"unresolved":null},{"absence":null,"basis":"9cef6fa9bd3baa77e5c49a7bbe41380300488f2e81f5290a01cbff17010c8b1e","coverage":null,"id":"enwiki-20845-1375745567::In-text #949c90e8","item":"In-text #949c90e8","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.zero_mul","end_line":455,"library":"lean-core","line":455,"location_key":"9cef6fa9bd3baa77e5c49a7bbe41380300488f2e81f5290a01cbff17010c8b1e","module":"Init.Data.Int.Lemmas","note":"the vanishing factor stands on the left of the product here","pair_key":"0664059d94267e8ae2e531aa9b1b0ed9d1a4c4aaaa2182eb78365c8249862c4c","path":"src/Init/Data/Int/Lemmas.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.zero_mul (a : Int) : 0 * a = 0"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.mul_zero","end_line":453,"library":"lean-core","line":453,"location_key":"267b69995668fe343169f529a47a7feae7ad38a02981020b1bea061aaaff89d2","module":"Init.Data.Int.Lemmas","note":"the vanishing factor stands on the right of the product here","pair_key":"ba02113c43ea1726b887065cbb137295f72f09e411144b526bdbac361f3face3","path":"src/Init/Data/Int/Lemmas.lean","proof_status":"proved","rank":2,"relation":"exactMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.mul_zero (a : Int) : a * 0 = 0"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Int.mul_eq_zero","end_line":557,"library":"lean-core","line":551,"location_key":"5c775048712b1057896dca52dba681dc1b511c3b82a9f056a3ae29fd3079fa4b","module":"Init.Data.Int.Lemmas","note":"it characterises exactly when an integer product vanishes, which covers the passage's direction as one half of the equivalence","pair_key":"03d20fb90dbf11a5ec5b1d8d0fd09d60c27adcad2ae3c0ce31f4eab078a9818b","path":"src/Init/Data/Int/Lemmas.lean","proof_status":"proved","rank":3,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.mul_eq_zero {a b : Int} : a * b = 0 ↔ a = 0 ∨ b = 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a91587cff49bbd4b9093d4ef8602eb33287eaf8ee50865191e8a0c2c0f9e84df","prominence":"central","quote":{"exact":"The product of zero and another integer is always zero."},"quote_capped":false,"section":["Definitions","Product of two integers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"The product of zero and another integer is always zero.","segments":[{"text":"The product of zero and another integer is always zero."}]},"unresolved":null},{"absence":null,"basis":"56ab0957d438ff6c2b3e654ff5230875a1d486f897cf1744a80e651f0b5477c7","coverage":null,"id":"enwiki-20845-1375745567::In-text #8c15f966","item":"In-text #8c15f966","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Int.mul","end_line":191,"library":"lean-core","line":186,"location_key":"56ab0957d438ff6c2b3e654ff5230875a1d486f897cf1744a80e651f0b5477c7","module":"Init.Data.Int.Basic","note":"the library's model of integer multiplication splits on the nonnegative and negative-successor shapes of the two arguments, which is where the magnitudes are multiplied and the sign is chosen","pair_key":"3afa2b6348cf6e2b55710a35821c358f0bb302a1a6ed0a4852aecb50324e4c52","path":"src/Init/Data/Int/Basic.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Int.mul : Int → Int → Int"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.natAbs_mul","end_line":631,"library":"lean-core","line":629,"location_key":"e6d3e9d9cb3546d613d2f6def7b7cef7e02d062041e9cebf910fb17fac046afc","module":"Init.Data.Int.Order","note":"magnitude is taken here as the natural number absolute value of an integer","pair_key":"b661ed2f6278e74e40e685fcf4c3a117d9f3ce5a19590c6c0652bdad48326c2d","path":"src/Init/Data/Int/Order.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.natAbs_mul (a b : Int) : (a * b).natAbs = a.natAbs * b.natAbs"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.sign_mul","end_line":1323,"library":"lean-core","line":1321,"location_key":"e7c40355015cce1f375f6f23dd9e0815a66a70777ea44e4615155a45fc4d2d6c","module":"Init.Data.Int.Order","note":"for nonzero arguments the sign takes the two values the article's table is indexed by","pair_key":"77cddb6bab506b6b3802aab9d9bbd1f95956d2ee02c74c6876f6ffd6f9c7d679","path":"src/Init/Data/Int/Order.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.sign_mul (a b : Int) : (a * b).sign = a.sign * b.sign"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"8759ecff44d47d3baf9b95ee9b6d35fce5a81ac6a5ee34729678a58a333037e4","prominence":"central","quote":{"exact":"The product of two nonzero integers is determined by the product of"},"quote_capped":true,"section":["Definitions","Product of two integers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"The product of two nonzero integers is determined by the product of their positive amounts, combined with the sign derived from the following rule:","segments":[{"text":"The product of two nonzero integers is determined by the product of their positive amounts, combined with the sign derived from the following rule:"}]},"unresolved":null},{"absence":null,"basis":"fdce7fb2b6dff726227cef36c97a7336e3eebd82967671b6952e5dea0de96ead","coverage":null,"id":"enwiki-20845-1375745567::In-text #f7fd57eb","item":"In-text #f7fd57eb","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"NonUnitalNonAssocRing.toHasDistribNeg","end_line":343,"library":"mathlib","line":340,"location_key":"fdce7fb2b6dff726227cef36c97a7336e3eebd82967671b6952e5dea0de96ead","module":"Mathlib.Algebra.Ring.Defs","note":"the sign behaviour of multiplication is produced here as a derived instance from the ring axioms, so no separate rule of signs is postulated","pair_key":"2fc5ff6493452fc444b711543bf63fd1e59b7b830131546d9c7a8131dcd96c28","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance NonUnitalNonAssocRing.toHasDistribNeg {α : Type u} [NonUnitalNonAssocRing α] : HasDistribNeg α"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.neg_mul_neg","end_line":523,"library":"lean-core","line":523,"location_key":"12e38ff6ed7cfd031c5184813d7b89851885d72b924a880eae5b51392be5b119","module":"Init.Data.Int.Lemmas","note":"this is the single line of the table where two negative factors give a positive product","pair_key":"b0658cb8906e9194bd4bcb75f6b6d036a2bcde4590e790fc094eee30847a39e5","path":"src/Init/Data/Int/Lemmas.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.neg_mul_neg (a b : Int) : -a * -b = a * b"},"statement":false},{"challenge":"downgraded","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.sign_mul","end_line":1323,"library":"lean-core","line":1321,"location_key":"7a071bc009795646bddaa0e8f04218dd52d9503e80bc86e8f2a2561603b35d43","module":"Init.Data.Int.Order","note":"it records the rule itself for the integers","pair_key":"897f7d6a7324c27ffb258e54a39bd295b4002d70fbb60265fcb6aaf7ecbf0fc5","path":"src/Init/Data/Int/Order.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.sign_mul (a b : Int) : (a * b).sign = a.sign * b.sign"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a67bb48553371777e005c8c33131629d026cfe3e4710561a11eb4a61e1003a4a","prominence":"supporting","quote":{"exact":"(This rule is a consequence of the distributivity of multiplication over addition,"},"quote_capped":true,"section":["Definitions","Product of two integers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"(This rule is a consequence of the distributivity of multiplication over addition, and is not an additional rule.)","segments":[{"text":"(This rule is a consequence of the distributivity of multiplication over addition, and is not an additional rule.)"}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"b5aa6eea8a939d0835e8b6a2eaeb63acb7c2bbaeb33ed14242d40d9bad6cd79e","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"e0cc919143d6a73cb69d379921eb1814825e3e0d2d9780d5127e3406cebc0ac9","text":"a product of two positive numbers is positive"},{"id":"c2","part":"2950a99bfd72b1920cc0df93745976d0722dfa77142306ef8d09ef2144a7c798","text":"a positive number times a negative number is negative"},{"id":"c3","part":"37bfa9a2c715fad8a2fe2b8d921bd28f6962aa317b8ef3899b4e2a420c52dc43","text":"a negative number times a positive number is negative"},{"id":"c4","part":"9e182cec67683ba013f12d35aa520804e1dafcc4428a3c8abb3f951c2506c34a","text":"a product of two negative numbers is positive"}],"parts":["e0cc919143d6a73cb69d379921eb1814825e3e0d2d9780d5127e3406cebc0ac9","2950a99bfd72b1920cc0df93745976d0722dfa77142306ef8d09ef2144a7c798","37bfa9a2c715fad8a2fe2b8d921bd28f6962aa317b8ef3899b4e2a420c52dc43","9e182cec67683ba013f12d35aa520804e1dafcc4428a3c8abb3f951c2506c34a"],"relation":"exactMatch","status":"formalized"},"id":"enwiki-20845-1375745567::In-text #6b2e78a3","item":"In-text #6b2e78a3","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.mul_pos","end_line":537,"library":"lean-core","line":533,"location_key":"e0cc919143d6a73cb69d379921eb1814825e3e0d2d9780d5127e3406cebc0ac9","module":"Init.Data.Int.Order","note":null,"pair_key":"c3111886b16d85cbe6d3ecdf2b6909f50b00c7fb74f4ff5488ec975558b625b5","path":"src/Init/Data/Int/Order.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.mul_pos {a b : Int} : 0 < a → 0 < b → 0 < a * b"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.mul_neg_of_pos_of_neg","end_line":1191,"library":"lean-core","line":1189,"location_key":"2950a99bfd72b1920cc0df93745976d0722dfa77142306ef8d09ef2144a7c798","module":"Init.Data.Int.Order","note":null,"pair_key":"d63cab6091ed32c4e23cd5b96cd87374844d52f3a3167d61841c16e2ecd474d3","path":"src/Init/Data/Int/Order.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.mul_neg_of_pos_of_neg {a b : Int} : 0 < a → b < 0 → a * b < 0"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.mul_neg_of_neg_of_pos","end_line":1195,"library":"lean-core","line":1193,"location_key":"37bfa9a2c715fad8a2fe2b8d921bd28f6962aa317b8ef3899b4e2a420c52dc43","module":"Init.Data.Int.Order","note":null,"pair_key":"6d5ccd64e7da656a754f993735fcd25910be9583770f03f9b38e4ae5f74e08ed","path":"src/Init/Data/Int/Order.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.mul_neg_of_neg_of_pos {a b : Int} : a < 0 → 0 < b → a * b < 0"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.mul_pos_of_neg_of_neg","end_line":1218,"library":"lean-core","line":1216,"location_key":"9e182cec67683ba013f12d35aa520804e1dafcc4428a3c8abb3f951c2506c34a","module":"Init.Data.Int.Order","note":null,"pair_key":"18932d8ef877ad90f59f16fe43bc57c1cab8173c157c96bd8328540b012445b1","path":"src/Init/Data/Int/Order.lean","proof_status":"proved","rank":4,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.mul_pos_of_neg_of_neg {a b : Int} : a < 0 → b < 0 → 0 < a * b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d72d31662105d648c4b13a08593398e25d0e51c1078a612de504d480fea49bb9","prominence":"central","quote":{"exact":"A positive number multiplied by a positive number is positive (product of"},"quote_capped":true,"section":["Definitions","Product of two integers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"In words: ","lead_in":true,"segments":[{"text":"In words: "}]},"layer":"A positive number multiplied by a positive number is positive (product of natural numbers), A positive number multiplied by a negative number is negative, A negative number multiplied by a positive number is negative, A negative number multiplied by a negative number is positive.","segments":[{"text":"A positive number multiplied by a positive number is positive (product of natural numbers), A positive number multiplied by a negative number is negative, A negative number multiplied by a positive number is negative, A negative number multiplied by a negative number is positive."}]},"unresolved":null},{"absence":null,"basis":"7d0a7568d4b725acd4dbeb8e3a68683f40309a7b20342577f78f09fe7c2e97d9","coverage":null,"id":"enwiki-20845-1375745567::In-text #3aa1b888","item":"In-text #3aa1b888","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Rat.divInt_mul_divInt","end_line":464,"library":"lean-core","line":460,"location_key":"7d0a7568d4b725acd4dbeb8e3a68683f40309a7b20342577f78f09fe7c2e97d9","module":"Init.Data.Rat.Lemmas","note":"Lean writes the fraction with numerator z and denominator n as divInt z n, and the lemma reads the product off the product of the numerators over the product of the denominators.","pair_key":"b0713ce645b5c2a4962beee95a0bc01c64abd0b20349b356fc207e0119d25592","path":"src/Init/Data/Rat/Lemmas.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Rat.divInt_mul_divInt (n₁ n₂ : Int) {d₁ d₂ : Int} : Rat.divInt n₁ d₁ * Rat.divInt n₂ d₂ = Rat.divInt (n₁ * n₂) (d₁ * d₂)"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Rat.mul_def'","end_line":428,"library":"lean-core","line":427,"location_key":"3bdbf9c27938d0c01ccce6d779945bf06fd02a63d1451ebc77d26b4c89a3a02b","module":"Init.Data.Rat.Lemmas","note":"Lean forms the product from the product of the numerators and the product of the denominators and then reduces that fraction to lowest terms with mkRat.","pair_key":"fefe8dd80be5070ba99a9472edce4f72fd15264588e9b010fe767697912f9682","path":"src/Init/Data/Rat/Lemmas.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Rat.mul_def' (a b : Rat) : a * b = mkRat (a.num * b.num) (a.den * b.den)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"div_mul_div_comm","end_line":588,"library":"mathlib","line":588,"location_key":"fa785d91c3f8faf732e85c204aa521bbe2781aa096a7ab5c9447bd44ff0de89b","module":"Mathlib.Algebra.Group.Basic","note":"It is proved for an arbitrary commutative division monoid instead of for fractions built from integers.","pair_key":"77f59a52da8ebbc4846f17f1f3570d592915e0fe2ea468766364a754560b8291","path":"Mathlib/Algebra/Group/Basic.lean","proof_status":"proved","rank":3,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem div_mul_div_comm {α : Type*} [DivisionCommMonoid α] (a b c d : α) : a / b * (c / d) = a * c / (b * d)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"95e8b7d9a312dde73a7ebe3bb90af1cfec3685d47423ef3f09669dae7a47c931","prominence":"central","quote":{"exact":"Two fractions can be multiplied by multiplying their numerators and denominators: z"},"quote_capped":true,"section":["Definitions","Product of two fractions"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"Two fractions can be multiplied by multiplying their numerators and denominators: z n ⋅ z ′ n ′ = z ⋅ z ′ n ⋅ n ′ , {\\displaystyle {\\frac {z}{n}}\\cdot {\\frac {z'}{n'}}={\\frac {z\\cdot z'}{n\\cdot n'}},} which is defined when n , n ′ ≠ 0 {\\displaystyle n,n'\\neq 0} .","segments":[{"text":"Two fractions can be multiplied by multiplying their numerators and denominators: "},{"display":true,"tex":"{\\frac {z}{n}}\\cdot {\\frac {z'}{n'}}={\\frac {z\\cdot z'}{n\\cdot n'}},"},{"text":" which is defined when "},{"tex":"n,n'\\neq 0"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"9eea91347205721a79a558c58ce3ba17b88cd24ba5a643bf42c59ecc39fb3091","coverage":null,"id":"enwiki-20845-1375745567::In-text #b85777c3","item":"In-text #b85777c3","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Rat.isDenseEmbedding_coe_real","end_line":44,"library":"mathlib","line":43,"location_key":"9eea91347205721a79a558c58ce3ba17b88cd24ba5a643bf42c59ecc39fb3091","module":"Mathlib.Topology.Instances.Rat","note":"It also records that the cast is a topological embedding, a further fact the passage does not assert.","pair_key":"ec69059c710718c73adf41ab4ddb23331612911a538096fc16e5e1fdc4dc8edd","path":"Mathlib/Topology/Instances/Rat.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Rat.isDenseEmbedding_coe_real : IsDenseEmbedding Rat.cast"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"exists_rat_near","end_line":443,"library":"mathlib","line":440,"location_key":"e901bce9e44ac0b423d0756e39ce4f7788e8d0569ba78843ff002527c4e30914","module":"Mathlib.Algebra.Order.Archimedean.Basic","note":"It is stated for any Archimedean ordered field rather than for the real numbers alone.","pair_key":"dac7ea40ed98ea9409672ba75dd6374391f63ec4b6b4ddc33dec66b26cb31d90","path":"Mathlib/Algebra/Order/Archimedean/Basic.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem exists_rat_near {K : Type*} [Field K] [LinearOrder K] [IsStrictOrderedRing K] [Archimedean K] {ε : K} (x : K) : 0 < ε → ∃ q, |x - ↑q| < ε"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Rat.denseRange_cast","end_line":35,"library":"mathlib","line":32,"location_key":"407e9ef687e641c799cc8b71840b848efaccb7f30d7df8e3ab168be0e2df6a83","module":"Mathlib.Topology.Algebra.Order.Archimedean","note":"It is proved for every Archimedean ordered field carrying the order topology, not only for the reals.","pair_key":"be87214a554e9be4f243cc12df5faf7af645447bb66cc1cf9c2af46a5a8cd196","path":"Mathlib/Topology/Algebra/Order/Archimedean.lean","proof_status":"proved","rank":3,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Rat.denseRange_cast {𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] [TopologicalSpace 𝕜] [OrderTopology 𝕜] [Archimedean 𝕜] : DenseRange Rat.cast"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"bbc6cf6c4b8836f3aa975dc648d1797669e61a766b82ad437cadb8f419ca0318","prominence":"central","quote":{"exact":"A fundamental aspect of these definitions is that every real number can"},"quote_capped":true,"section":["Definitions","Product of two real numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"A fundamental aspect of these definitions is that every real number can be approximated to any accuracy by rational numbers.","segments":[{"text":"A fundamental aspect of these definitions is that every real number can be approximated to any accuracy by rational numbers."}]},"unresolved":null},{"absence":null,"basis":"ec16c87d7f11064ee09327756f55b8cb01459544f8abef54767c333331078e88","coverage":null,"id":"enwiki-20845-1375745567::In-text #030e5790","item":"In-text #030e5790","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ConditionallyCompleteLinearOrderedField.inducedMap_self","end_line":203,"library":"mathlib","line":202,"location_key":"ec16c87d7f11064ee09327756f55b8cb01459544f8abef54767c333331078e88","module":"Mathlib.Algebra.Order.CompleteField","note":"The induced map is defined as the supremum of the rational cut below its argument, and the declaration is proved for any conditionally complete ordered field; supremum and least upper bound are two encodings of one notion here, and the declaration pins the witnessing set instead of merely asserting that one exists.","pair_key":"66908bcff1227a0abf47f3e9b787b7c022234a6147da92c7417c3b94e0b27895","path":"Mathlib/Algebra/Order/CompleteField.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ConditionallyCompleteLinearOrderedField.inducedMap_self {β : Type*} [Field β] [ConditionallyCompleteLinearOrder β] [IsStrictOrderedRing β] (b : β) : ConditionallyCompleteLinearOrderedField.inducedMap β β b = b"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"LinearOrderedField.cutMap_self","end_line":101,"library":"mathlib","line":100,"location_key":"ac80475f7ecc2ce5422715abd1d3f879dcbfadc3c56bafa8b7b81a3e11c655ec","module":"Mathlib.Algebra.Order.CompleteField","note":"It only identifies the cut set as the rationals below the element and says nothing about its least upper bound.","pair_key":"16a66941638589903691267eeff604e6dd03cc8909bddaaabc370f57299b68fb","path":"Mathlib/Algebra/Order/CompleteField.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem LinearOrderedField.cutMap_self {α : Type*} [Field α] [LinearOrder α] (a : α) : LinearOrderedField.cutMap α a = Set.Iio a ∩ Set.range Rat.cast"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c2df8ff0606b914ec2b45562ce230f4476b995c5bb86eddcfdc32733ac85ed43","prominence":"supporting","quote":{"exact":"A standard way for expressing this is that every real number is"},"quote_capped":true,"section":["Definitions","Product of two real numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"A standard way for expressing this is that every real number is the least upper bound of a set of rational numbers.","segments":[{"text":"A standard way for expressing this is that every real number is the least upper bound of a set of rational numbers."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"a65aa3f7ce160f402209d93e94486b39510aacea77a083918fb4a939e20024ac"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #4f15b045","item":"In-text #4f15b045","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.hasSum_ofDigitsTerm_digits","end_line":156,"library":"mathlib","line":149,"location_key":"bab06fadd4ac93fb1afe9b782e8044f3b9b8c3520b9df3a9878243d367056894","module":"Mathlib.Analysis.Real.OfDigits","note":"It states that the series of digit terms converges to the number; reading off that the truncations have the number as their least upper bound still needs monotone convergence.","pair_key":"45fdb1037f226b31bd6bc38a8b92534b189fffa92bd7072beebeb13bb9ffc11a","path":"Mathlib/Analysis/Real/OfDigits.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.hasSum_ofDigitsTerm_digits (x : ℝ) {b : ℕ} [NeZero b] : 1 < b → x ∈ Set.Ico 0 1 → HasSum (Real.ofDigitsTerm (x.digits b)) x"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.sum_ofDigitsTerm_digits_le","end_line":147,"library":"mathlib","line":140,"location_key":"32b00f0b447799822d44773c06642e0e764e5e41f37b48556d2c1b8bc1ab5af1","module":"Mathlib.Analysis.Real.OfDigits","note":"It bounds each truncation by the number but leaves open whether the number is the smallest such bound.","pair_key":"10a59d5510b98689b35ef2c7d99eaee5524bbd6625db3fd14d9564878b198355","path":"Mathlib/Analysis/Real/OfDigits.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.sum_ofDigitsTerm_digits_le {x : ℝ} {b : ℕ} [NeZero b] : x ∈ Set.Ico 0 1 → ∀ (n : ℕ), ∑ i ∈ Finset.range n, Real.ofDigitsTerm (x.digits b) i ≤ x"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e6ae90726f804ec42e9acd7f45897e150c585a190e3e5999d51622ce418d576f","prominence":"supporting","quote":{"exact":"In particular, every positive real number is the least upper bound of"},"quote_capped":true,"section":["Definitions","Product of two real numbers"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"after":{"layer":"; for example, π {\\displaystyle \\pi } is the least upper bound of { 3 , 3.1 , 3.14 , 3.141 , … } . {\\displaystyle \\{3,\\;3.1,\\;3.14,\\;3.141,\\ldots \\}.}","segments":[{"text":"; for example, "},{"tex":"\\pi"},{"text":" is the least upper bound of "},{"tex":"\\{3,\\;3.1,\\;3.14,\\;3.141,\\ldots \\}."}]},"layer":"In particular, every positive real number is the least upper bound of the truncations of its infinite decimal representation","segments":[{"text":"In particular, every positive real number is the least upper bound of the truncations of its infinite decimal representation"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"590729e00035bfb48759cae70e8c4e659431fb538ab6b30dd59930e663f9188a"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #13cff284","item":"In-text #13cff284","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"65f1156a0baaaa57a3788c3f3bebe639cfd56b9c7ac57345cdd73fd5800cbb6c","prominence":"supporting","quote":{"exact":"for example, π {\\displaystyle \\pi } is the least upper bound of"},"quote_capped":true,"section":["Definitions","Product of two real numbers"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"In particular, every positive real number is the least upper bound of the truncations of its infinite decimal representation; ","segments":[{"text":"In particular, every positive real number is the least upper bound of the truncations of its infinite decimal representation; "}]},"layer":"for example, π {\\displaystyle \\pi } is the least upper bound of { 3 , 3.1 , 3.14 , 3.141 , … } . {\\displaystyle \\{3,\\;3.1,\\;3.14,\\;3.141,\\ldots \\}.}","segments":[{"text":"for example, "},{"tex":"\\pi"},{"text":" is the least upper bound of "},{"tex":"\\{3,\\;3.1,\\;3.14,\\;3.141,\\ldots \\}."}]},"unresolved":null},{"absence":null,"basis":"f5bde5291def1e3153935a9967820ea68412e15f8f7faac7999e53fe333a3f7f","coverage":null,"id":"enwiki-20845-1375745567::In-text #fabb439e","item":"In-text #fabb439e","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"instIsTopologicalRingReal","end_line":60,"library":"mathlib","line":60,"location_key":"f5bde5291def1e3153935a9967820ea68412e15f8f7faac7999e53fe333a3f7f","module":"Mathlib.Topology.Algebra.Ring.Real","note":"It records continuity of addition, negation and multiplication for all real arguments, not only for approximating rationals.","pair_key":"a5c42829fe07bba1c7a6eca33f73b1091a00be94673c2d00c504df33d2c7ec55","path":"Mathlib/Topology/Algebra/Ring/Real.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance instIsTopologicalRingReal : IsTopologicalRing ℝ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Filter.Tendsto.mul","end_line":80,"library":"mathlib","line":78,"location_key":"1a2007e2d629950416a8e066439bfac5ab7a5eb73608dad3c7ce2aee91b44627","module":"Mathlib.Topology.Algebra.Monoid.Defs","note":"It covers multiplication alone, while the passage speaks of the arithmetic operations generally.","pair_key":"ca4fd7eb78801d40228cf700fb6dbfecfb0ecb50cfc2ac35ce6b179645e4f79e","path":"Mathlib/Topology/Algebra/Monoid/Defs.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Filter.Tendsto.mul {M : Type*} [TopologicalSpace M] [Mul M] [ContinuousMul M] {α : Type*} {f g : α → M} {x : Filter α} {a b : M} : Filter.Tendsto f x (𝓝 a) → Filter.Tendsto g x (𝓝 b) → Filter.Tendsto (fun x ↦ f x * g x) x (𝓝 (a * b))"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"47b79aa9aaeb77818b8228816452469cc524eea1ffa6778d0eb86e7719dcad3c","prominence":"central","quote":{"exact":"A fundamental property of real numbers is that rational approximations are compatible"},"quote_capped":true,"section":["Definitions","Product of two real numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"A fundamental property of real numbers is that rational approximations are compatible with arithmetic operations, and, in particular, with multiplication.","segments":[{"text":"A fundamental property of real numbers is that rational approximations are compatible with arithmetic operations, and, in particular, with multiplication."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"43dd75453d655b64b05d8fe2d90481c21cb90872b733092dd5c577c7886af0ac"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #31d20109","item":"In-text #31d20109","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.mul_iSup_of_nonneg","end_line":117,"library":"mathlib","line":116,"location_key":"6dd6e61b3dc811b063b159251c6b97bd2d46ef3174f601c0f3e160eb7facf8b0","module":"Mathlib.Basic.Real.Pointwise","note":"It moves one nonnegative constant factor through a supremum, which on its own does not give the passage's identity for two varying factors.","pair_key":"9d58c605682ec4a4cb865037a8fbbd0cc4dc8ec2fb79e889e5f2054994800e80","path":"Mathlib/Basic/Real/Pointwise.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.mul_iSup_of_nonneg {ι : Sort*} {r : ℝ} : 0 ≤ r → ∀ (f : ι → ℝ), r * ⨆ i, f i = ⨆ i, r * f i"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.iSup_mul_of_nonneg","end_line":129,"library":"mathlib","line":128,"location_key":"054810bfcf3e89c6b84c10211eb420e0512ee74ab7e21a781a7b12b5417254a3","module":"Mathlib.Basic.Real.Pointwise","note":"It is the same one-sided identity with the constant factor on the right, and again leaves the two-factor case open.","pair_key":"00036c015ac9d3b5de1abc46d44100631ea69766dbd4412af0a265b1ea6d23e7","path":"Mathlib/Basic/Real/Pointwise.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.iSup_mul_of_nonneg {ι : Sort*} {r : ℝ} : 0 ≤ r → ∀ (f : ι → ℝ), (⨆ i, f i) * r = ⨆ i, f i * r"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"1eaf1cebc643634f223961de7c40e336e283447edc45a2fee36c0f48250e650e","prominence":"central","quote":{"exact":"This means that, if a and b are positive real numbers such"},"quote_capped":true,"section":["Definitions","Product of two real numbers"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"after":{"layer":" In particular, the product of two positive real numbers is the least upper bound of the term-by-term products of the sequences of their decimal representations.","segments":[{"text":" In particular, the product of two positive real numbers is the least upper bound of the term-by-term products of the sequences of their decimal representations."}]},"layer":"This means that, if a and b are positive real numbers such that a = sup x ∈ A x {\\displaystyle a=\\sup _{x\\in A}x} and b = sup y ∈ B y , {\\displaystyle b=\\sup _{y\\in B}y,} then a ⋅ b = sup x ∈ A , y ∈ B x ⋅ y . {\\displaystyle a\\cdot b=\\sup _{x\\in A,y\\in B}x\\cdot y.}","segments":[{"text":"This means that, if a and b are positive real numbers such that "},{"tex":"a=\\sup _{x\\in A}x"},{"text":" and "},{"tex":"b=\\sup _{y\\in B}y,"},{"text":" then "},{"tex":"a\\cdot b=\\sup _{x\\in A,y\\in B}x\\cdot y."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"33b5420fc4eca8dec38b15afcd8d22394db9d2f90599b38f881f3b2b20e07250"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #6faeffc9","item":"In-text #6faeffc9","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"be5af94451c4dfb79771a019731a35ae432a12b9f0ff8454c29256b584d5be7a","prominence":"central","quote":{"exact":"In particular, the product of two positive real numbers is the least"},"quote_capped":true,"section":["Definitions","Product of two real numbers"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"This means that, if a and b are positive real numbers such that a = sup x ∈ A x {\\displaystyle a=\\sup _{x\\in A}x} and b = sup y ∈ B y , {\\displaystyle b=\\sup _{y\\in B}y,} then a ⋅ b = sup x ∈ A , y ∈ B x ⋅ y . {\\displaystyle a\\cdot b=\\sup _{x\\in A,y\\in B}x\\cdot y.} ","segments":[{"text":"This means that, if a and b are positive real numbers such that "},{"tex":"a=\\sup _{x\\in A}x"},{"text":" and "},{"tex":"b=\\sup _{y\\in B}y,"},{"text":" then "},{"tex":"a\\cdot b=\\sup _{x\\in A,y\\in B}x\\cdot y."},{"text":" "}]},"layer":"In particular, the product of two positive real numbers is the least upper bound of the term-by-term products of the sequences of their decimal representations.","segments":[{"text":"In particular, the product of two positive real numbers is the least upper bound of the term-by-term products of the sequences of their decimal representations."}]},"unresolved":null},{"absence":null,"basis":"9ad3ef8ce06310f3ff6ff71a9036ccfdbd7e693125f4d48c5e7b3950330a64f6","coverage":null,"id":"enwiki-20845-1375745567::In-text #ebd8cf5e","item":"In-text #ebd8cf5e","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Complex.mk_mul_mk","end_line":212,"library":"mathlib","line":211,"location_key":"90334981f02b36dcc4ccc516b24565b89c243f5e9f6c68328bf5710fb8ac144d","module":"Mathlib.Basic.Complex.Basic","note":"Mathlib writes a complex number as a record of its real and imaginary parts, and this theorem gives Mathlib's product of two such records in exactly the component form the passage displays.","pair_key":"34709a2deec2bce753b060df3eb45c7a40bbfac9bd70921b39c01fd39f4e9d42","path":"Mathlib/Basic/Complex/Basic.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Complex.mk_mul_mk (x₁ x₂ y₁ y₂ : ℝ) : { re := x₁, im := y₁ } * { re := x₂, im := y₂ } = { re := x₁ * x₂ - y₁ * y₂, im := x₁ * y₂ + y₁ * x₂ }"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Complex.instMul","end_line":209,"library":"mathlib","line":208,"location_key":"9ad3ef8ce06310f3ff6ff71a9036ccfdbd7e693125f4d48c5e7b3950330a64f6","module":"Mathlib.Basic.Complex.Basic","note":"Mathlib packages complex multiplication as a typeclass instance on ℂ rather than as a displayed equation, and its underlying rule is the component formula the passage gives.","pair_key":"e5eed866f668e5c57c10a2e34400330f71f19b24552060709fb8b468bb14a40f","path":"Mathlib/Basic/Complex/Basic.lean","proof_status":"definition","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Complex.instMul : Mul ℂ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Complex.mul_re","end_line":216,"library":"mathlib","line":215,"location_key":"bffc454c40b17c96946accf108b16fb7edb1cfdc91fc6ca52ea562489b520dbb","module":"Mathlib.Basic.Complex.Basic","note":"It records only the real coordinate of a product, so by itself it does not give the passage's whole equation.","pair_key":"bf3a57f0073928dea215ac3d787a2736f8ca4024092aa12bdae2111801b6b993","path":"Mathlib/Basic/Complex/Basic.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Complex.mul_re (z w : ℂ) : (z * w).re = z.re * w.re - z.im * w.im"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Complex.mul_im","end_line":220,"library":"mathlib","line":219,"location_key":"321eec84ac067faee9b5c5cd13e231f96fc753dd9f17585be2736e7e4384dc37","module":"Mathlib.Basic.Complex.Basic","note":"It records only the imaginary coordinate of a product, so by itself it does not give the passage's whole equation.","pair_key":"c0e981253593011f140a2f89a3736f43bd99fcc3f7bb163a6e2b26136d7ee961","path":"Mathlib/Basic/Complex/Basic.lean","proof_status":"proved","rank":4,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Complex.mul_im (z w : ℂ) : (z * w).im = z.re * w.im + z.im * w.re"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"0d7719b3d17ea7522a706f1fa57edee81d29c05023a64aecad2ee59b047e9532","prominence":"central","quote":{"exact":"Two complex numbers can be multiplied by the distributive law and the"},"quote_capped":true,"section":["Definitions","Product of two complex numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"Two complex numbers can be multiplied by the distributive law and the fact that i 2 = − 1 {\\displaystyle i^{2}=-1} , as follows: ( a + b i ) ⋅ ( c + d i ) = a ⋅ c + a ⋅ d i + b i ⋅ c + b ⋅ d ⋅ i 2 = ( a ⋅ c − b ⋅ d ) + ( a ⋅ d + b ⋅ c ) i {\\displaystyle {\\begin{aligned}(a+b\\,i)\\cdot (c+d\\,i)&=a\\cdot c+a\\cdot d\\,i+b\\,i\\cdot c+b\\cdot d\\cdot i^{2}\\\\&=(a\\cdot c-b\\cdot d)+(a\\cdot d+b\\cdot c)\\,i\\end{aligned}}}","segments":[{"text":"Two complex numbers can be multiplied by the distributive law and the fact that "},{"tex":"i^{2}=-1"},{"text":" , as follows: "},{"display":true,"tex":"\\begin{aligned}(a+b\\,i)\\cdot (c+d\\,i)&=a\\cdot c+a\\cdot d\\,i+b\\,i\\cdot c+b\\cdot d\\cdot i^{2}\\\\&=(a\\cdot c-b\\cdot d)+(a\\cdot d+b\\cdot c)\\,i\\end{aligned}"}]},"unresolved":null},{"absence":null,"basis":"0f647d5fa97195ac4518385da1d87e28f0b8c5f08b643771c6686ef78f03635e","coverage":null,"id":"enwiki-20845-1375745567::In-text #ed3b96f7","item":"In-text #ed3b96f7","kind":"construction","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Complex.norm_mul_exp_arg_mul_I","end_line":60,"library":"mathlib","line":56,"location_key":"0f647d5fa97195ac4518385da1d87e28f0b8c5f08b643771c6686ef78f03635e","module":"Mathlib.Analysis.SpecialFunctions.Complex.Arg","note":"Mathlib supplies the two polar data itself, taking r to be the modulus of z and φ to be the principal argument of z, and at z = 0 both sides collapse to zero.","pair_key":"fc374e5efa6644b8b126c31fdb14cbaf2e178b28f1327af91f8ac0d2577c02ae","path":"Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Complex.norm_mul_exp_arg_mul_I (x : ℂ) : ↑‖x‖ * Complex.exp (↑x.arg * Complex.I) = x"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Complex.norm_mul_cos_add_sin_mul_I","end_line":64,"library":"mathlib","line":63,"location_key":"80a64620ebf3b5256f5fd9ff0e2513b05e94c42fec2800d4baff3c7e18810ea8","module":"Mathlib.Analysis.SpecialFunctions.Complex.Arg","note":"It gives the trigonometric middle term of the passage's chain, and reaching the exponential end needs Euler's formula as a separate lemma.","pair_key":"1678c254ca9688bed62accfb3f67331b8c6d4780b65194cdc0740addde27e3dd","path":"Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Complex.norm_mul_cos_add_sin_mul_I (x : ℂ) : ↑‖x‖ * (Complex.cos ↑x.arg + Complex.sin ↑x.arg * Complex.I) = x"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Complex.polarCoord","end_line":185,"library":"mathlib","line":184,"location_key":"78aab594f54079b0d6cdaf1516a7ae0742d9c3b0182d5d53825edd2d195701db","module":"Mathlib.Analysis.SpecialFunctions.PolarCoord","note":"It is a chart between the slit plane and a strip of the plane rather than the identity the passage writes down.","pair_key":"4b6cc7169293802dc5e00c60e63890c6c7cc3a3385caba7276ffffc735a69f3f","path":"Mathlib/Analysis/SpecialFunctions/PolarCoord.lean","proof_status":"definition","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Complex.polarCoord : OpenPartialHomeomorph ℂ (ℝ × ℝ)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"ab859ca9c96cd96c538cd9270b80582e4f65fe01cdba2f57ecb54e79d4d45547","prominence":"supporting","quote":{"exact":"The geometric meaning of complex multiplication can be understood by rewriting complex"},"quote_capped":true,"section":["Definitions","Product of two complex numbers"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"The geometric meaning of complex multiplication can be understood by rewriting complex numbers in polar coordinates: a + b i = r ⋅ ( cos ⁡ ( φ ) + i sin ⁡ ( φ ) ) = r ⋅ e i φ {\\displaystyle a+b\\,i=r\\cdot (\\cos(\\varphi )+i\\sin(\\varphi ))=r\\cdot e^{i\\varphi }}","segments":[{"text":"The geometric meaning of complex multiplication can be understood by rewriting complex numbers in polar coordinates: "},{"display":true,"tex":"a+b\\,i=r\\cdot (\\cos(\\varphi )+i\\sin(\\varphi ))=r\\cdot e^{i\\varphi }"}]},"unresolved":null},{"absence":null,"basis":"1c41d564c5eb0b62eb22411c44af97add97ebfb2bdfd3097086ac934c54099d3","coverage":null,"id":"enwiki-20845-1375745567::In-text #8f3ed906","item":"In-text #8f3ed906","kind":"notation","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Complex.norm_mul_exp_arg_mul_I","end_line":60,"library":"mathlib","line":56,"location_key":"1c41d564c5eb0b62eb22411c44af97add97ebfb2bdfd3097086ac934c54099d3","module":"Mathlib.Analysis.SpecialFunctions.Complex.Arg","note":"Mathlib chooses the two polar data itself, the modulus of z for s and the principal argument of z for ψ, and at z = 0 both sides collapse to zero.","pair_key":"71842d9a7243a2866d8d127a7c943570812729473406652474db7e54d16c5d70","path":"Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Complex.norm_mul_exp_arg_mul_I (x : ℂ) : ↑‖x‖ * Complex.exp (↑x.arg * Complex.I) = x"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Complex.norm_mul_cos_add_sin_mul_I","end_line":64,"library":"mathlib","line":63,"location_key":"f2d67bb0f903df13896b86587af418a42a437478759f2d39ea02dfb563d8f319","module":"Mathlib.Analysis.SpecialFunctions.Complex.Arg","note":"It gives the trigonometric middle term of the passage's chain, and reaching the exponential end needs Euler's formula as a separate lemma.","pair_key":"623131f6495037fd5efe6ad4022de34c0596a03c8ca484da0be804b57ce5b712","path":"Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Complex.norm_mul_cos_add_sin_mul_I (x : ℂ) : ↑‖x‖ * (Complex.cos ↑x.arg + Complex.sin ↑x.arg * Complex.I) = x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"fd76132a4eb36f3960e39010f30776324a8a713d8810467fbfdfdbafde095088","prominence":"supporting","quote":{"exact":"Furthermore, c + d i = s ⋅ ( cos ⁡ ("},"quote_capped":true,"section":["Definitions","Product of two complex numbers"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"Furthermore, c + d i = s ⋅ ( cos ⁡ ( ψ ) + i sin ⁡ ( ψ ) ) = s ⋅ e i ψ , {\\displaystyle c+d\\,i=s\\cdot (\\cos(\\psi )+i\\sin(\\psi ))=s\\cdot e^{i\\psi },}","segments":[{"text":"Furthermore, "},{"display":true,"tex":"c+d\\,i=s\\cdot (\\cos(\\psi )+i\\sin(\\psi ))=s\\cdot e^{i\\psi },"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"9340073c83c08d61cf633161b8e8b5d584a0a40adaafa0d773c19d9fd1b40f64"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #47998494","item":"In-text #47998494","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Complex.exp_add","end_line":131,"library":"mathlib","line":112,"location_key":"b4cf3f7a5b5da6a92847b4cdb966a0508927a9116f7ba057e83971fd5b97fae4","module":"Mathlib.Analysis.Complex.Exponential","note":"It splits the exponential of a sum of angles, but joining that to the component product needs the complex product formula as a further named lemma.","pair_key":"6a280be5ac14078e8ceee97d4fdd8c21037cfb930151bcd94291578dbb5884b8","path":"Mathlib/Analysis/Complex/Exponential.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Complex.exp_add (x y : ℂ) : Complex.exp (x + y) = Complex.exp x * Complex.exp y"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Complex.mk_mul_mk","end_line":212,"library":"mathlib","line":211,"location_key":"fc28eb6afc3a97a609520aee9a3cf358858e4987b2b708065d9976cb23245fd2","module":"Mathlib.Basic.Complex.Basic","note":"It gives the component product of two complex numbers and says nothing about the exponential side of the passage's equation.","pair_key":"17234001824a135a8b73e7ee327bfc9298246b4d83ecd7d99d770b3780ce126b","path":"Mathlib/Basic/Complex/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Complex.mk_mul_mk (x₁ x₂ y₁ y₂ : ℝ) : { re := x₁, im := y₁ } * { re := x₂, im := y₂ } = { re := x₁ * x₂ - y₁ * y₂, im := x₁ * y₂ + y₁ * x₂ }"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"8fe39444be82989a71afe418f87c3aa43c5ca59f3c4f0328fa4857c4e78c690b","prominence":"central","quote":{"exact":"from which one obtains ( a ⋅ c − b ⋅ d"},"quote_capped":true,"section":["Definitions","Product of two complex numbers"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"from which one obtains ( a ⋅ c − b ⋅ d ) + ( a ⋅ d + b ⋅ c ) i = r ⋅ s ⋅ e i ( φ + ψ ) . {\\displaystyle (a\\cdot c-b\\cdot d)+(a\\cdot d+b\\cdot c)i=r\\cdot s\\cdot e^{i(\\varphi +\\psi )}.}","segments":[{"text":"from which one obtains "},{"display":true,"tex":"(a\\cdot c-b\\cdot d)+(a\\cdot d+b\\cdot c)i=r\\cdot s\\cdot e^{i(\\varphi +\\psi )}."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"201c88470a812e7176c902daf16cb49fab0d8c0c6ec51193ec92339f549e8ca3","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"3bf63925ea659a89651de01cd484ef8bca01d7c655a8dde728c21e6f40f422db","text":"the magnitude of a product of complex numbers is the product of their magnitudes"},{"id":"c2","part":"d8fafc9e048a9c3fe5629e4f362db8867aff999dbf2f9d883602a776e6d9a5bd","text":"the argument of a product of complex numbers is the sum of their arguments"}],"parts":["3bf63925ea659a89651de01cd484ef8bca01d7c655a8dde728c21e6f40f422db","d8fafc9e048a9c3fe5629e4f362db8867aff999dbf2f9d883602a776e6d9a5bd"],"relation":"closeMatch","status":"formalized"},"id":"enwiki-20845-1375745567::In-text #fb7f8c76","item":"In-text #fb7f8c76","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Complex.norm_mul","end_line":76,"library":"mathlib","line":75,"location_key":"3bf63925ea659a89651de01cd484ef8bca01d7c655a8dde728c21e6f40f422db","module":"Mathlib.Analysis.Complex.Norm","note":"The norm on ℂ is the modulus the passage calls the magnitude.","pair_key":"5855b661330afdf81c927e3b78915facbc96bab16ef989ef2bd53556d0391a72","path":"Mathlib/Analysis/Complex/Norm.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Complex.norm_mul (z w : ℂ) : ‖z * w‖ = ‖z‖ * ‖w‖"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Complex.arg_mul_coe_angle","end_line":496,"library":"mathlib","line":488,"location_key":"d8fafc9e048a9c3fe5629e4f362db8867aff999dbf2f9d883602a776e6d9a5bd","module":"Mathlib.Analysis.SpecialFunctions.Complex.Arg","note":"Mathlib records the argument as an element of the circle of real angles, so the equation is an identity of angles rather than of real numbers in a chosen range.","pair_key":"c06587a73e962fa4c22e0730e2534d25bc714490720e8fa4776a5c04d5d73e45","path":"Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Complex.arg_mul_coe_angle {x y : ℂ} : x ≠ 0 → y ≠ 0 → ↑(x * y).arg = ↑x.arg + ↑y.arg"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Complex.arg_mul_eq_add_arg_iff","end_line":532,"library":"mathlib","line":529,"location_key":"276bcb0c5ed3dfa52b42ac59f425d03eac99d07d480906a01717c31ad4658d46","module":"Mathlib.Analysis.SpecialFunctions.Complex.Arg","note":"It says when the real-valued principal arguments add on the nose, which is a range condition rather than the passage's geometric law.","pair_key":"5f8a96c8440fcba5f569f565ade19210245630ac89433d651b98b889764aaa8e","path":"Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Complex.arg_mul_eq_add_arg_iff {x y : ℂ} : x ≠ 0 → y ≠ 0 → ((x * y).arg = x.arg + y.arg ↔ x.arg + y.arg ∈ Set.Ioc (-π) π)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6cc1181f714d02098bdcc72d13bfb17722457b438bc9c68d78490b057251f5e0","prominence":"central","quote":{"exact":"The geometric meaning is that the magnitudes are multiplied and the arguments"},"quote_capped":true,"section":["Definitions","Product of two complex numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"The geometric meaning is that the magnitudes are multiplied and the arguments are added.","segments":[{"text":"The geometric meaning is that the magnitudes are multiplied and the arguments are added."}]},"unresolved":null},{"absence":null,"basis":"a6c05a2488b05f9b472c6e8fe1a1279e17e5db17dbbce74d1d54b826e2e1a411","coverage":null,"id":"enwiki-20845-1375745567::In-text #eb0306d7","item":"In-text #eb0306d7","kind":"theorem","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Quaternion.commute_iff","end_line":110,"library":"tauceti","line":87,"location_key":"a6c05a2488b05f9b472c6e8fe1a1279e17e5db17dbbce74d1d54b826e2e1a411","module":"TauCeti.Algebra.Central.Quaternion","note":"The declaration is stated over an arbitrary commutative coefficient ring, where the passage speaks of the real quaternions.","pair_key":"112d48026e90e789a90f7e5562771ae2e3af13ee5e7034b64fa6e8f6e167b3a1","path":"TauCeti/Algebra/Central/Quaternion.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Quaternion.commute_iff {R : Type*} [CommRing R] {x y : Quaternion R} : Commute x y ↔ 2 * (x.imJ * y.imK - x.imK * y.imJ) = 0 ∧ 2 * (x.imK * y.imI - x.imI * y.imK) = 0 ∧ 2 * (x.imI * y.imJ - x.imJ * y.imI) = 0"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.Quaternion.commute_iff'","end_line":125,"library":"tauceti","line":118,"location_key":"55d5f9a3bdd81f394ece77459032a6320b5c229c57ffd29817df34390f54c410","module":"TauCeti.Algebra.Central.Quaternion","note":"It restates the commuting criterion only after a regularity assumption on two has been supplied, which is an extra step rather than part of the passage.","pair_key":"0bc670857e2f280b7f70ac92900ffa4ef21b16dad46735a084a4d434dcf44401","path":"TauCeti/Algebra/Central/Quaternion.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Quaternion.commute_iff' {R : Type*} [CommRing R] {x y : Quaternion R} : IsLeftRegular 2 → (Commute x y ↔ x.imJ * y.imK = x.imK * y.imJ ∧ x.imK * y.imI = x.imI * y.imK ∧ x.imI * y.imJ = x.imJ * y.imI)"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Quaternion.center_eq_bot","end_line":160,"library":"tauceti","line":152,"location_key":"c57894fb7fe9099cab56d5dd0dc56344dcd6e46a7e965aca06c3d2fadf4fefcf","module":"TauCeti.Algebra.Central.Quaternion","note":"It locates the centre of the quaternions in the scalars, from which non-commutativity follows only with a further nontriviality argument.","pair_key":"ed30959ed8ccfc8a571af5c334aa3e6d2307e49676517ec34be220f76284c49b","path":"TauCeti/Algebra/Central/Quaternion.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Quaternion.center_eq_bot {R : Type*} [CommRing R] : IsLeftRegular 2 → Subalgebra.center R (Quaternion R) = ⊥"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"29e3cec82f3306cea5d63f04f743d20bbdb2739c1d9e7aa8eaa9ed6eeeedc032","prominence":"central","quote":{"exact":"Note, in this case, that a ⋅ b {\\displaystyle a\\cdot b} and"},"quote_capped":true,"section":["Definitions","Product of two quaternions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"Note, in this case, that a ⋅ b {\\displaystyle a\\cdot b} and b ⋅ a {\\displaystyle b\\cdot a} are in general different.","segments":[{"text":"Note, in this case, that "},{"tex":"a\\cdot b"},{"text":" and "},{"tex":"b\\cdot a"},{"text":" are in general different."}]},"unresolved":null},{"absence":null,"basis":"6c5b543e0dc0ef36782c318a20ef49bb649ecc188bb1629cf51ccfb490ea2407","coverage":null,"id":"enwiki-20845-1375745567::In-text #c37394b2","item":"In-text #c37394b2","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.logb_mul","end_line":86,"library":"mathlib","line":85,"location_key":"6c5b543e0dc0ef36782c318a20ef49bb649ecc188bb1629cf51ccfb490ea2407","module":"Mathlib.Analysis.SpecialFunctions.Log.Base","note":"Mathlib states the law for an arbitrary base at once, where the passage has in view the common logarithms used for hand computation.","pair_key":"57953dce2b9fe97ef0b1b42151499ce75e2981ac51bb20a44952dc7f1b0fa750","path":"Mathlib/Analysis/SpecialFunctions/Log/Base.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.logb_mul {b x y : ℝ} : x ≠ 0 → y ≠ 0 → Real.logb b (x * y) = Real.logb b x + Real.logb b y"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.log_mul","end_line":135,"library":"mathlib","line":133,"location_key":"7de9a192c5a0717058869c6ec82aa89dbaf935448e799d12e228efc8370a39d8","module":"Mathlib.Analysis.SpecialFunctions.Log.Basic","note":"This is the passage's law for the single base chosen by Mathlib's unadorned logarithm.","pair_key":"c223596c9cf70b3f16b9a15dde343eb04a2e5a91fa20801e26e8c1eaa7138744","path":"Mathlib/Analysis/SpecialFunctions/Log/Basic.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.log_mul {x y : ℝ} : x ≠ 0 → y ≠ 0 → Real.log (x * y) = Real.log x + Real.log y"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f9345b358d9f6c42e837cf7d1e2b45b8cd4c4be09bb20b79650cc61f555e0959","prominence":"supporting","quote":{"exact":"adding logarithms is equivalent to multiplying"},"quote_capped":false,"section":["Computation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"Common logarithms were invented to simplify such calculations, since ","segments":[{"text":"Common logarithms were invented to simplify such calculations, since "}]},"layer":"adding logarithms is equivalent to multiplying","segments":[{"text":"adding logarithms is equivalent to multiplying"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"55821de3e26fd35c69810ca35e7a68a42bff34f94a1d656c803c34c7a4f8fd51"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #92f4bc64","item":"In-text #92f4bc64","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"d87914610770e33977ce1ca605d7b16477531857b73133e2b1f0a8c60bb2797b","prominence":"supporting","quote":{"exact":"For instance, to find the product of 13 and 21 one had"},"quote_capped":true,"section":["Computation","Historical algorithms","Egyptians"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"For instance, to find the product of 13 and 21 one had to double 21 three times, obtaining 2 × 21 = 42, 4 × 21 = 2 × 42 = 84, 8 × 21 = 2 × 84 = 168.","segments":[{"text":"For instance, to find the product of 13 and 21 one had to double 21 three times, obtaining 2 × 21 = 42, 4 × 21 = 2 × 42 = 84, 8 × 21 = 2 × 84 = 168."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"b5a8e0c9fcf62eeab4ce867d40a60714573dd35a8e891f8a64ee83e899746daf"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #53a54d07","item":"In-text #53a54d07","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"3cd47fab3862ca1ae93c1225d48c0db9bde54c9b853811b993a2da1bff0b053b","prominence":"supporting","quote":{"exact":"13 × 21 = (1 + 4 + 8) × 21 ="},"quote_capped":true,"section":["Computation","Historical algorithms","Egyptians"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"13 × 21 = (1 + 4 + 8) × 21 = (1 × 21) + (4 × 21) + (8 × 21) = 21 + 84 + 168 = 273.","segments":[{"text":"13 × 21 = (1 + 4 + 8) × 21 = (1 × 21) + (4 × 21) + (8 × 21) = 21 + 84 + 168 = 273."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"5396a10308dffc787a8cba65907f286c150d9a7515ab7352ea1c1c31feb1cf46"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #aace7d39","item":"In-text #aace7d39","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"99a49d38f16a3f3cb5650f5d246fa8b8ab5d5240e29644b1587b5dd9b4dd0158","prominence":"supporting","quote":{"exact":"× 30 4 10 300 40 3 90 12"},"quote_capped":false,"section":["Computation","Modern methods","Grid method"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"An example of multiplying 34 by 13 would be to lay the numbers out in a grid as follows: ","lead_in":true,"segments":[{"text":"An example of multiplying 34 by 13 would be to lay the numbers out in a grid as follows: "}]},"layer":"× 30 4 10 300 40 3 90 12","segments":[{"text":"× 30 4 10 300 40 3 90 12"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"4c527e2d59bd7d2849d577c129828fed57bec10d565282558d2bb84d2a9b8b96"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #0bc4d7b9","item":"In-text #0bc4d7b9","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"cb1922224b4412a2d2d5e6ceaa756937ca182f1f3feae8d5ebf9a592eedd009d","prominence":"central","quote":{"exact":"The classical method of multiplying two n-digit numbers requires n2 digit multiplications."},"quote_capped":false,"section":["Computation","Computer algorithms"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"The classical method of multiplying two n-digit numbers requires n2 digit multiplications.","segments":[{"text":"The classical method of multiplying two n-digit numbers requires n2 digit multiplications."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"2fe4acbec7d98e2abb1d8a69cb33182f689b8c5df799982a90a1eab545c0c59f"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #31a545e8","item":"In-text #31a545e8","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.TheoryOfComputation.IntegerMultiplicationWanted.IntegerMultiplication.theorem_1_1","library":"atlas","line":88,"location_key":"32c1f79a928969030aff38b413c7582534072158b0e606f399825ffe29079a8c","module":"WantedExt.TheoryOfComputation.IntegerMultiplicationWanted","note":"It asserts a machine whose running time is bounded by a constant multiple of n log n, with no hypothesis about how that machine works.","pair_key":"9269a01b70591b94857ebfa2e1e7236f874621a9dbf4d2ea32c92bce5ca602a2","path":"WantedExt/TheoryOfComputation/IntegerMultiplicationWanted.lean","proof_status":"wanted","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.TheoryOfComputation.IntegerMultiplicationWanted.IntegerMultiplication.theorem_1_1 : ∃ T, (fun n ↦ ↑(T.time n)) =O[Filter.atTop] fun n ↦ ↑n * Real.log ↑n"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.Analysis.Fourier.FastFourierTransformWanted.fftCost_recurrence","library":"atlas","line":136,"location_key":"9ca8f42871f9e0e8c27eea603212123031ae9d49ed19dac1a7da83de9c76a545","module":"MathlibExt.Analysis.Fourier.FastFourierTransform","note":"It gives the halving recurrence for the step count of the transform itself, not a bound on the cost of multiplying two numbers.","pair_key":"1926e2568f57d3d9e2d9b22cb0681eab91f9d5c075daea7b6ebe4cc8474209db","path":"MathlibExt/Analysis/Fourier/FastFourierTransform.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.Analysis.Fourier.FastFourierTransformWanted.fftCost_recurrence (n : ℕ) : 0 < n → MathlibExt.Analysis.Fourier.FastFourierTransformWanted.fftCost (2 * n) = 2 * MathlibExt.Analysis.Fourier.FastFourierTransformWanted.fftCost n + 2 * n"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"2692b7e00bc5da63cb81f6df530626a555fdd188f1a66516dd1c9ef972d71263","prominence":"central","quote":{"exact":"Methods based on the discrete Fourier transform reduce the computational complexity to"},"quote_capped":true,"section":["Computation","Computer algorithms"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"Methods based on the discrete Fourier transform reduce the computational complexity to O(n log n log log n).","segments":[{"text":"Methods based on the discrete Fourier transform reduce the computational complexity to O(n log n log log n)."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #95256820","item":"In-text #95256820","kind":"theorem","locations":[],"outcome":"unresolved","passage_ends_in_suffix":false,"passage_key":"cf91025daf5a717d1ed6e7e63caaf4752bb052822b4305bda513f63edcd93b0d","prominence":"supporting","quote":{"exact":"In 2016, the factor log log n was replaced by a function"},"quote_capped":true,"section":["Computation","Computer algorithms"],"status":null,"subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"In 2016, the factor log log n was replaced by a function that increases much slower, though still not constant.[27]","segments":[{"text":"In 2016, the factor log log n was replaced by a function that increases much slower, though still not constant."},{"ref":"[27]"}]},"unresolved":{"challenge":"sampled_out"}},{"absence":null,"basis":"544cfbbd0bb51deb738ed5775ba7dcf909e331de9f690d505f128726b8993f79","coverage":null,"id":"enwiki-20845-1375745567::In-text #dfd50002","item":"In-text #dfd50002","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.TheoryOfComputation.IntegerMultiplicationWanted.IntegerMultiplication.theorem_1_1","library":"atlas","line":88,"location_key":"544cfbbd0bb51deb738ed5775ba7dcf909e331de9f690d505f128726b8993f79","module":"WantedExt.TheoryOfComputation.IntegerMultiplicationWanted","note":"The machine multiplies natural numbers (ℕ) handed to it in binary, least significant bit first, and its step count is bounded as a function of the input length; that is the bit-size reading of the passage's integer multiplication, where a sign is one further bit of input and the claim is about the n-digit size of the factors.","pair_key":"7b1e60f824c5a043f6000aa595f7ccff26a15e65ef018a2e040bd7ee89b8f879","path":"WantedExt/TheoryOfComputation/IntegerMultiplicationWanted.lean","proof_status":"wanted","rank":1,"relation":"closeMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.TheoryOfComputation.IntegerMultiplicationWanted.IntegerMultiplication.theorem_1_1 : ∃ T, (fun n ↦ ↑(T.time n)) =O[Filter.atTop] fun n ↦ ↑n * Real.log ↑n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f9ed66335874d1ccec6c23c39c7520b4b412d5f8482cc2d8f011940ab08b7ef7","prominence":"central","quote":{"exact":"In March 2019, David Harvey and Joris van der Hoeven submitted a"},"quote_capped":true,"section":["Computation","Computer algorithms"],"status":"statement_only","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"after":{"layer":" The algorithm, also based on the fast Fourier transform, is conjectured to be asymptotically optimal.","segments":[{"text":" The algorithm, also based on the fast Fourier transform, is conjectured to be asymptotically optimal."}]},"layer":"In March 2019, David Harvey and Joris van der Hoeven submitted a paper presenting an integer multiplication algorithm with a complexity of O ( n log ⁡ n ) . {\\displaystyle O(n\\log n).} [28]","segments":[{"text":"In March 2019, David Harvey and Joris van der Hoeven submitted a paper presenting an integer multiplication algorithm with a complexity of "},{"tex":"O(n\\log n)."},{"text":" "},{"ref":"[28]"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"1672f3b386d25bda56cf9f8cb2af79b7b1e5647686536fbc4ac8edd037752542"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #9b6d6795","item":"In-text #9b6d6795","kind":"conjecture","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.TheoryOfComputation.IntegerMultiplicationWanted.IntegerMultiplication.theorem_1_1","library":"atlas","line":88,"location_key":"1a7c84cdd971811ced8ff55f09f6091f9458e79250e0bfe07ce495adbb5fa9a9","module":"WantedExt.TheoryOfComputation.IntegerMultiplicationWanted","note":"It states that the n log n running time is achieved by some machine, and says nothing about what every machine must spend.","pair_key":"532e7965f184c82ed42b8e454c8ab81d2e3a010513b4b70e75e8adc3c924265c","path":"WantedExt/TheoryOfComputation/IntegerMultiplicationWanted.lean","proof_status":"wanted","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.TheoryOfComputation.IntegerMultiplicationWanted.IntegerMultiplication.theorem_1_1 : ∃ T, (fun n ↦ ↑(T.time n)) =O[Filter.atTop] fun n ↦ ↑n * Real.log ↑n"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"af8c36c678c1c563fb948644bdcab6eb4108f31bac05952325571049a709f8b3","prominence":"central","quote":{"exact":"The algorithm, also based on the fast Fourier transform, is conjectured to"},"quote_capped":true,"section":["Computation","Computer algorithms"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"In March 2019, David Harvey and Joris van der Hoeven submitted a paper presenting an integer multiplication algorithm with a complexity of O ( n log ⁡ n ) . {\\displaystyle O(n\\log n).} [28] ","segments":[{"text":"In March 2019, David Harvey and Joris van der Hoeven submitted a paper presenting an integer multiplication algorithm with a complexity of "},{"tex":"O(n\\log n)."},{"text":" "},{"ref":"[28]"},{"text":" "}]},"layer":"The algorithm, also based on the fast Fourier transform, is conjectured to be asymptotically optimal.[29]","segments":[{"text":"The algorithm, also based on the fast Fourier transform, is conjectured to be asymptotically optimal."},{"ref":"[29]"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"a14169b5e9f9df657b229265883da24df000150fe431f664a86cf5a91ab49b5d"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #5c05abeb","item":"In-text #5c05abeb","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.TheoryOfComputation.IntegerMultiplicationWanted.IntegerMultiplication.theorem_1_1","library":"atlas","line":88,"location_key":"e4ea6fe29436cd670cd3f148f47d35b48826da4420c0ccc94cc5bfc82600d34a","module":"WantedExt.TheoryOfComputation.IntegerMultiplicationWanted","note":"It records the existence of a machine multiplying two numbers within a bound of the order of n times the logarithm of n, and says nothing about the size at which such a method overtakes the older ones.","pair_key":"a8e4bd2930da1ebd6f7f868fbb26700801b070b2db5ac29b287211eb07140644","path":"WantedExt/TheoryOfComputation/IntegerMultiplicationWanted.lean","proof_status":"wanted","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.TheoryOfComputation.IntegerMultiplicationWanted.IntegerMultiplication.theorem_1_1 : ∃ T, (fun n ↦ ↑(T.time n)) =O[Filter.atTop] fun n ↦ ↑n * Real.log ↑n"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"1bce4ba8e7976b203e2821abe45e6015ecaa21222743aa9499f4ad144ff6fafc","prominence":"supporting","quote":{"exact":"The algorithm is not practically useful, as it only becomes faster for"},"quote_capped":true,"section":["Computation","Computer algorithms"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"The algorithm is not practically useful, as it only becomes faster for multiplying extremely large numbers (having more than 2172912 bits).","segments":[{"text":"The algorithm is not practically useful, as it only becomes faster for multiplying extremely large numbers (having more than 2172912 bits)."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"3e8a31f524dc08f10468453e0fa20211075490fd0fbb054a255d3e4c0934e1ce"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #078196ef","item":"In-text #078196ef","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"5e8be30cea11ed3bef19cdeb41aa5b919d73fa5273411a3502f2abe77c3ba2ae","prominence":"supporting","quote":{"exact":"[4 bags] × [3 marbles per bag] = 12 marbles."},"quote_capped":false,"section":["Products of measurements"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"[4 bags] × [3 marbles per bag] = 12 marbles.","segments":[{"text":"[4 bags] × [3 marbles per bag] = 12 marbles."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"3fece7dd834f9eb4d04beed73233eae39dda260a3c06ce6188de8596d367aed2"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #76b6aa74","item":"In-text #76b6aa74","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"b0017b211b2b1afed16af5cdae23d72d912524f9cc564687231638c8b9239b2c","prominence":"supporting","quote":{"exact":"50 kilometers per hour × 3 hours = 150 kilometers."},"quote_capped":false,"section":["Products of measurements"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"50 kilometers per hour × 3 hours = 150 kilometers.","segments":[{"text":"50 kilometers per hour × 3 hours = 150 kilometers."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"586571a18dbfe8373a612a134c8e447cce100d895424c19703f00a8241caebc1"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #d440285a","item":"In-text #d440285a","kind":"example","locations":[{"challenge":"sampled_out","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"Mathoverflow34145.lbMeasure_rectangle_toSet","end_line":119,"library":"formal-conjectures","line":117,"location_key":"6f50325d9cedbdc54f90a95f8a1d852fce318387abcb023183467b59ac037b41","module":"FormalConjectures.Mathoverflow.«34145»","note":"It computes the plane measure of a rectangular region from its two side lengths, which reaches the passage only once one reads the passage's two lengths as the sides of a region, a reading the passage does not make.","pair_key":"6073ddd97f2ae0bb3d073eaa1fc335969c29eba06b3e0c6014747c03615d9b1a","path":"FormalConjectures/Mathoverflow/34145.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem Mathoverflow34145.lbMeasure_rectangle_toSet (r : Mathoverflow34145.Rectangle) : Mathoverflow34145.lbMeasure r.toSet = ENNReal.ofReal |r.width * r.height|"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"a4aa028958baf8fd4be41acd7f004797eca4a615ff1d75322103a7f04e2e6b6d","prominence":"supporting","quote":{"exact":"2.5 meters × 4.5 meters = 11.25 square meters"},"quote_capped":false,"section":["Products of measurements"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"Other examples of multiplication involving units include: ","lead_in":true,"segments":[{"text":"Other examples of multiplication involving units include: "}]},"layer":"2.5 meters × 4.5 meters = 11.25 square meters","segments":[{"text":"2.5 meters × 4.5 meters = 11.25 square meters"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"e01e236e64a36b0469ac361ce60fe647e53fe3b6ac09b2fd836faff6dde1187b"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #d08b7449","item":"In-text #d08b7449","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"6c4391b3b527bcc49fc6acbdb49eda6523b5bf783394aef1e3ee0f017d88c331","prominence":"supporting","quote":{"exact":"11 meters/second × 9 seconds = 99 meters"},"quote_capped":false,"section":["Products of measurements"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"2.5 meters × 4.5 meters = 11.25 square meters ","lead_in":true,"segments":[{"text":"2.5 meters × 4.5 meters = 11.25 square meters "}]},"layer":"11 meters/second × 9 seconds = 99 meters","segments":[{"text":"11 meters/second × 9 seconds = 99 meters"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"dad59b1d59be6337e9ef82cbc21de445cd2df2492a29968a86cd393597ef20c2"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #9d0b0036","item":"In-text #9d0b0036","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"9db65ab4026ff41ea4942bb98e77039057ba0140e68558d32b3ff9c8918e7f7a","prominence":"supporting","quote":{"exact":"4.5 residents per house × 20 houses = 90 residents"},"quote_capped":false,"section":["Products of measurements"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"11 meters/second × 9 seconds = 99 meters ","lead_in":true,"segments":[{"text":"11 meters/second × 9 seconds = 99 meters "}]},"layer":"4.5 residents per house × 20 houses = 90 residents","segments":[{"text":"4.5 residents per house × 20 houses = 90 residents"}]},"unresolved":null},{"absence":null,"basis":"3c68fe66c02cc23da8888c57708988427d2acefeba30a9ca13921cf6434b44f8","coverage":null,"id":"enwiki-20845-1375745567::In-text #af4eb51b","item":"In-text #af4eb51b","kind":"notation","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Finset.prod","end_line":68,"library":"mathlib","line":67,"location_key":"3c68fe66c02cc23da8888c57708988427d2acefeba30a9ca13921cf6434b44f8","module":"Mathlib.Algebra.BigOperators.Group.Finset.Defs","note":"Mathlib takes the product over any finite index set in any commutative monoid, and this is the operation its own capital-pi symbol abbreviates.","pair_key":"62f3ce760da0760bc59f7d6cc7a9693807e7b58300a1e9f38e2d6bbf43f9c9ed","path":"Mathlib/Algebra/BigOperators/Group/Finset/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Finset.prod {ι : Type*} {M : Type*} [CommMonoid M] : Finset ι → (ι → M) → M"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"List.prod","end_line":2076,"library":"lean-core","line":2075,"location_key":"6f62cd5fc220ff713590975efe269ca1e3f96a17384c8a2936c9ce3c2405ace7","module":"Init.Data.List.Basic","note":"This is the product of a finite sequence of elements, defined for any type carrying a multiplication and a unit, with the factors multiplied in the order they are listed.","pair_key":"95054db50f79e6eafaa842c19f150136283142f1302e9ad9fa73d6ab4bf2e6e5","path":"src/Init/Data/List/Basic.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def List.prod {α : Type u_1} [Mul α] [One α] : List α → α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"BigOperators.bigprod","end_line":195,"library":"mathlib","line":195,"location_key":"01ad4541248d715e3008a32e8880d8ebeedd4d829e0e4a59ec941f4e7421a90e","module":"Mathlib.Algebra.BigOperators.Group.Finset.Defs","note":"This is the parser that introduces the capital-pi symbol as the way to write the finite product, so it fixes the symbol but asserts no mathematical content of its own.","pair_key":"f5e91388da6990d0eb5b859c22dfd1cf152c20d3535691079aaecbda22d6fb71","path":"Mathlib/Algebra/BigOperators/Group/Finset/Defs.lean","proof_status":"definition","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def BigOperators.bigprod : Lean.ParserDescr"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f20adf1be0ff739b3fb83dea59c46fcf8c61a4e54cf1fb6d6879765867834592","prominence":"central","quote":{"exact":"The product of a sequence of factors can be written with the"},"quote_capped":true,"section":["Product of a sequence","Capital pi notation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"The product of a sequence of factors can be written with the product symbol ∏ {\\displaystyle \\textstyle \\prod } , which derives from the capital letter Π (pi) in the Greek alphabet (much like the same way the summation symbol ∑ {\\displaystyle \\textstyle \\sum } is derived from the Greek letter Σ (sigma)).[31][32]","segments":[{"text":"The product of a sequence of factors can be written with the product symbol "},{"tex":"\\textstyle \\prod"},{"text":" , which derives from the capital letter Π (pi) in the Greek alphabet (much like the same way the summation symbol "},{"tex":"\\textstyle \\sum"},{"text":" is derived from the Greek letter Σ (sigma))."},{"ref":"[31][32]"}]},"unresolved":null},{"absence":null,"basis":"063deffcae68ed0958ba61be7926e7d181e5c09336d1e05a37c1fb9536e7eed0","coverage":null,"id":"enwiki-20845-1375745567::In-text #c6ca581c","item":"In-text #c6ca581c","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Fin.prod_univ_four","end_line":126,"library":"mathlib","line":124,"location_key":"063deffcae68ed0958ba61be7926e7d181e5c09336d1e05a37c1fb9536e7eed0","module":"Mathlib.Algebra.BigOperators.Fin","note":"Mathlib numbers the four indices from zero where the example counts them from one, so the same four factors occur in the same order on both sides.","pair_key":"00638679da9a84cb5dd68508fbff500b4d61a9fb634835e73ddd5a7ad6affbaf","path":"Mathlib/Algebra/BigOperators/Fin.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Fin.prod_univ_four {M : Type*} [CommMonoid M] (f : Fin 4 → M) : ∏ i, f i = f 0 * f 1 * f 2 * f 3"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Finset.prod_range_succ","end_line":562,"library":"mathlib","line":560,"location_key":"18dc8b4a3d421c40062fd8c21d43e94fa0474e6872717a01516c532ade2e318c","module":"Mathlib.Algebra.BigOperators.Group.Finset.Basic","note":"It takes one factor off the top of a product over an initial range, so arriving at a four-factor expansion needs it several times together with the value of the empty product.","pair_key":"2691c04674d851a23971244bb36171fe596d0cf6f985a1da9f8799587d439037","path":"Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.prod_range_succ {M : Type*} [CommMonoid M] (f : ℕ → M) (n : ℕ) : ∏ x ∈ Finset.range (n + 1), f x = (∏ x ∈ Finset.range n, f x) * f n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"278a340704a9d337040a7cd86494b1bda9e2f316158b7c65a244ea52566147d7","prominence":"supporting","quote":{"exact":"The meaning of this notation is given by ∏ i = 1"},"quote_capped":true,"section":["Product of a sequence","Capital pi notation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"after":{"layer":" which results in ∏ i = 1 4 ( i + 1 ) = 120. {\\displaystyle \\prod _{i=1}^{4}(i+1)=120.}","segments":[{"text":" which results in "},{"display":true,"tex":"\\prod _{i=1}^{4}(i+1)=120."}]},"layer":"The meaning of this notation is given by ∏ i = 1 4 ( i + 1 ) = ( 1 + 1 ) ( 2 + 1 ) ( 3 + 1 ) ( 4 + 1 ) , {\\displaystyle \\prod _{i=1}^{4}(i+1)=(1+1)\\,(2+1)\\,(3+1)\\,(4+1),}","segments":[{"text":"The meaning of this notation is given by "},{"display":true,"tex":"\\prod _{i=1}^{4}(i+1)=(1+1)\\,(2+1)\\,(3+1)\\,(4+1),"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"1385e2affa6697f333eb55ea7ac41e5c4bd597c0bba7e488e02ba26a2a30486f"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #5218dd15","item":"In-text #5218dd15","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"feedc15dfeccb0fa0024023d2a94d029085796fba8978805cfa2e6d2a83aeec1","prominence":"supporting","quote":{"exact":"which results in ∏ i = 1 4 ( i + 1"},"quote_capped":true,"section":["Product of a sequence","Capital pi notation"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"The meaning of this notation is given by ∏ i = 1 4 ( i + 1 ) = ( 1 + 1 ) ( 2 + 1 ) ( 3 + 1 ) ( 4 + 1 ) , {\\displaystyle \\prod _{i=1}^{4}(i+1)=(1+1)\\,(2+1)\\,(3+1)\\,(4+1),} ","segments":[{"text":"The meaning of this notation is given by "},{"display":true,"tex":"\\prod _{i=1}^{4}(i+1)=(1+1)\\,(2+1)\\,(3+1)\\,(4+1),"},{"text":" "}]},"layer":"which results in ∏ i = 1 4 ( i + 1 ) = 120. {\\displaystyle \\prod _{i=1}^{4}(i+1)=120.}","segments":[{"text":"which results in "},{"display":true,"tex":"\\prod _{i=1}^{4}(i+1)=120."}]},"unresolved":null},{"absence":null,"basis":"f0e15777dbb6dbe8e326424ea7a187a88131bc8d715e06bac08e0e8713d55fbf","coverage":null,"id":"enwiki-20845-1375745567::In-text #3a3cb504","item":"In-text #3a3cb504","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Finset.prod","end_line":68,"library":"mathlib","line":67,"location_key":"f0e15777dbb6dbe8e326424ea7a187a88131bc8d715e06bac08e0e8713d55fbf","module":"Mathlib.Algebra.BigOperators.Group.Finset.Defs","note":"Mathlib binds the index over an arbitrary finite index set, so the bounded integer range the passage describes is one choice of that set.","pair_key":"a5cc8d009bdcd39d0ccb684ab7931ed6e5cd01766fa558fa28b81c2e6563e7b5","path":"Mathlib/Algebra/BigOperators/Group/Finset/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Finset.prod {ι : Type*} {M : Type*} [CommMonoid M] : Finset ι → (ι → M) → M"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Finset.Icc","end_line":274,"library":"mathlib","line":273,"location_key":"a352f406910e2e529dd83f05a9da6a5913fd2d680337158ac7c4760be71d468e","module":"Mathlib.Order.Interval.Finset.Defs","note":"It supplies the range of index values delimited by the two bounds but says nothing about any product.","pair_key":"d420a918410a489d604094b58fea44c377babd8679150d793f75585336f0f5f4","path":"Mathlib/Order/Interval/Finset/Defs.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Finset.Icc {α : Type*} [Preorder α] [LocallyFiniteOrder α] : α → α → Finset α"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f3ab2d80b97e7dfb00a2c94ff3b62958884832574f966cd1d7ad0a9e2c15adb2","prominence":"supporting","quote":{"exact":"In such a notation, the variable i represents a varying integer, called"},"quote_capped":true,"section":["Product of a sequence","Capital pi notation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"In such a notation, the variable i represents a varying integer, called the multiplication index, that runs from the lower value 1 indicated in the subscript to the upper value 4 given by the superscript.","segments":[{"text":"In such a notation, the variable i represents a varying integer, called the multiplication index, that runs from the lower value 1 indicated in the subscript to the upper value 4 given by the superscript."}]},"unresolved":null},{"absence":null,"basis":"5fd5a1dab14e95e5c417c840fbadfd268cc5fd0b275c98b0035f09fca668a5ac","coverage":null,"id":"enwiki-20845-1375745567::In-text #add2c9af","item":"In-text #add2c9af","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Finset.prod","end_line":68,"library":"mathlib","line":67,"location_key":"5fd5a1dab14e95e5c417c840fbadfd268cc5fd0b275c98b0035f09fca668a5ac","module":"Mathlib.Algebra.BigOperators.Group.Finset.Defs","note":"The declaration multiplies a function over an arbitrary finite index set, which covers the bounded run of index values the passage uses.","pair_key":"e41d994fcc49e18aae83958f965c67d42b8ab7c4001e7c9addf2777a6d25f7bc","path":"Mathlib/Algebra/BigOperators/Group/Finset/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Finset.prod {ι : Type*} {M : Type*} [CommMonoid M] : Finset ι → (ι → M) → M"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7694d33c756842dbc28239a7b613e679c87d1aaa2befcd3fd318b8afbb0cd663","prominence":"central","quote":{"exact":"The product is obtained by multiplying together all factors obtained by substituting"},"quote_capped":true,"section":["Product of a sequence","Capital pi notation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"The product is obtained by multiplying together all factors obtained by substituting the multiplication index for an integer between the lower and the upper values (the bounds included) in the expression that follows the product operator.","segments":[{"text":"The product is obtained by multiplying together all factors obtained by substituting the multiplication index for an integer between the lower and the upper values (the bounds included) in the expression that follows the product operator."}]},"unresolved":null},{"absence":null,"basis":"f52ddb7c25ca38607ce3fe5bb56ada32d8abfd40630042f0ba601df6c4b64362","coverage":null,"id":"enwiki-20845-1375745567::In-text #f07fa9db","item":"In-text #f07fa9db","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Finset.prod","end_line":68,"library":"mathlib","line":67,"location_key":"f52ddb7c25ca38607ce3fe5bb56ada32d8abfd40630042f0ba601df6c4b64362","module":"Mathlib.Algebra.BigOperators.Group.Finset.Defs","note":"The declaration works for any finite index set over any index type, so the integer bounds m and n the passage names are one instance of it.","pair_key":"fc8c0503102d6ad5deee496dcaebf73bdb3f7135b70619dfd2c78ab7c4cb43f1","path":"Mathlib/Algebra/BigOperators/Group/Finset/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Finset.prod {ι : Type*} {M : Type*} [CommMonoid M] : Finset ι → (ι → M) → M"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Finset.prod_Icc_succ_top","end_line":77,"library":"mathlib","line":75,"location_key":"69975467081bc82f357734a082677170c5336528e0cf0d3a013c6df3d8a456c5","module":"Mathlib.Algebra.BigOperators.Intervals","note":"It peels a single top factor off a product over an interval of naturals rather than giving the whole run of factors for integer bounds.","pair_key":"5085ada7e3153a414d2bb80bf7007eb3ca0310b0bb462f733d5de77ffea2b57c","path":"Mathlib/Algebra/BigOperators/Intervals.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.prod_Icc_succ_top {M : Type*} [CommMonoid M] {a b : ℕ} : a ≤ b + 1 → ∀ (f : ℕ → M), ∏ k ∈ Finset.Icc a (b + 1), f k = (∏ k ∈ Finset.Icc a b, f k) * f (b + 1)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"8e25fe5fcfd6cf6892eeb230f0b8568555a84484f6a06955ebfed0c5a6aadb23","prominence":"central","quote":{"exact":"More generally, the notation is defined as ∏ i = m n"},"quote_capped":true,"section":["Product of a sequence","Capital pi notation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"More generally, the notation is defined as ∏ i = m n x i = x m ⋅ x m + 1 ⋅ x m + 2 ⋅ ⋯ ⋅ x n − 1 ⋅ x n , {\\displaystyle \\prod _{i=m}^{n}x_{i}=x_{m}\\cdot x_{m+1}\\cdot x_{m+2}\\cdot \\,\\,\\cdots \\,\\,\\cdot x_{n-1}\\cdot x_{n},} where m and n are integers or expressions that evaluate to integers.","segments":[{"text":"More generally, the notation is defined as "},{"display":true,"tex":"\\prod _{i=m}^{n}x_{i}=x_{m}\\cdot x_{m+1}\\cdot x_{m+2}\\cdot \\,\\,\\cdots \\,\\,\\cdot x_{n-1}\\cdot x_{n},"},{"text":" where m and n are integers or expressions that evaluate to integers."}]},"unresolved":null},{"absence":null,"basis":"69a12da7de75e7f4b04a58a4c5447ce11ae8e7360221a58ffdb9fe0833d834e9","coverage":null,"id":"enwiki-20845-1375745567::In-text #1225908e","item":"In-text #1225908e","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Finset.prod_singleton","end_line":76,"library":"mathlib","line":75,"location_key":"69a12da7de75e7f4b04a58a4c5447ce11ae8e7360221a58ffdb9fe0833d834e9","module":"Mathlib.Algebra.BigOperators.Group.Finset.Basic","note":"Lean writes the one-element run of indices as the finset whose only member is m, so Finset.Icc m m and that one-member finset name the same index range.","pair_key":"3cc61302c2333a85e316b522f615d21c2a555d0538349b91defeebf129443643","path":"Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.prod_singleton {ι : Type*} {M : Type*} [CommMonoid M] (f : ι → M) (a : ι) : ∏ x ∈ {a}, f x = f a"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Finset.Icc_self","end_line":550,"library":"mathlib","line":550,"location_key":"d0d37398f56227fb5edc1a05ba297bbca5c5e7ad5539909a15095886bc4ba05b","module":"Mathlib.Order.Interval.Finset.Basic","note":"It rewrites the index range when the bounds agree but says nothing about the value of a product.","pair_key":"89f928d45566666294e14a0b813c92a2f54473ea0775f3363f61b60166d20874","path":"Mathlib/Order/Interval/Finset/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.Icc_self {α : Type*} [PartialOrder α] [LocallyFiniteOrder α] (a : α) : Finset.Icc a a = {a}"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"943222aa8ea6550ea5327c3eb58e3fd55a7b3a6e47d03df9e3995ff41b9ddb13","prominence":"supporting","quote":{"exact":"In the case where m = n, the value of the product"},"quote_capped":true,"section":["Product of a sequence","Capital pi notation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"after":{"layer":"; if m > n, the product is an empty product whose value is 1—regardless of the expression for the factors.","segments":[{"text":"; if m > n, the product is an empty product whose value is 1—regardless of the expression for the factors."}]},"layer":"In the case where m = n, the value of the product is the same as that of the single factor xm","segments":[{"text":"In the case where m = n, the value of the product is the same as that of the single factor xm"}]},"unresolved":null},{"absence":null,"basis":"f83471cc588bf196fa8f92df21113e476840f63c56835f16e02922521487db54","coverage":null,"id":"enwiki-20845-1375745567::In-text #7c6ba712","item":"In-text #7c6ba712","kind":"definition","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Finset.prod_empty","end_line":379,"library":"mathlib","line":378,"location_key":"f83471cc588bf196fa8f92df21113e476840f63c56835f16e02922521487db54","module":"Mathlib.Algebra.BigOperators.Group.Finset.Defs","note":"It fixes the value of an empty product but does not itself say that the passage's bounds give an empty index range.","pair_key":"433f6f2d36ad32e1834c5406d0c0bcee3c5450000ca0f52f511e67f6fa3d1d35","path":"Mathlib/Algebra/BigOperators/Group/Finset/Defs.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.prod_empty {ι : Type*} {M : Type*} {f : ι → M} [CommMonoid M] : ∏ x ∈ ∅, f x = 1"},"statement":false},{"challenge":"downgraded","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Finset.Icc_eq_empty_of_lt","end_line":115,"library":"mathlib","line":114,"location_key":"4aede9c02989dd63c956f11a588503e39a115567b5517f640eb8ad95da7be24c","module":"Mathlib.Order.Interval.Finset.Basic","note":"It settles that the index range is empty in the passage's case but leaves the value of the product to a second declaration.","pair_key":"10179665ffac853d9965793a541a69cc9e3756dd9c8daf63439dd218ede6fbac","path":"Mathlib/Order/Interval/Finset/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.Icc_eq_empty_of_lt {α : Type*} {a b : α} [Preorder α] [LocallyFiniteOrder α] : b < a → Finset.Icc a b = ∅"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7ecd08aa36d367b1600219b75fc7aaf1ac77a8c4bff2c62607a4c2d5a91c09c3","prominence":"supporting","quote":{"exact":"if m > n, the product is an empty product whose value"},"quote_capped":true,"section":["Product of a sequence","Capital pi notation"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"In the case where m = n, the value of the product is the same as that of the single factor xm; ","segments":[{"text":"In the case where m = n, the value of the product is the same as that of the single factor xm; "}]},"layer":"if m > n, the product is an empty product whose value is 1—regardless of the expression for the factors.","segments":[{"text":"if m > n, the product is an empty product whose value is 1—regardless of the expression for the factors."}]},"unresolved":null},{"absence":null,"basis":"aaccdd55e23074fddb59041d4d58ff0f684125d15e2d806868a6cdcf7623c7cf","coverage":null,"id":"enwiki-20845-1375745567::In-text #10e91acd","item":"In-text #10e91acd","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Finset.prod","end_line":68,"library":"mathlib","line":67,"location_key":"aaccdd55e23074fddb59041d4d58ff0f684125d15e2d806868a6cdcf7623c7cf","module":"Mathlib.Algebra.BigOperators.Group.Finset.Defs","note":"The declaration multiplies a family over any finite index set, and the run from one to n the passage uses is one such set.","pair_key":"ef3aa8a4cccb3622ff96cca9a32766ddfd528e237b1f0fa3b113195cba0b8864","path":"Mathlib/Algebra/BigOperators/Group/Finset/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Finset.prod {ι : Type*} {M : Type*} [CommMonoid M] : Finset ι → (ι → M) → M"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Finset.prod_range_succ","end_line":562,"library":"mathlib","line":560,"location_key":"c258a22cc916c00986fdaf021cecf9e2dc51a3955473397d9912fe5832159edb","module":"Mathlib.Algebra.BigOperators.Group.Finset.Basic","note":"It removes the last factor of a product indexed by the first n naturals rather than writing out the whole run of factors.","pair_key":"29aba500588fa72ee23aeccb2d42903ae974cda1efa753f405a4d6455c5e21e9","path":"Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.prod_range_succ {M : Type*} [CommMonoid M] (f : ℕ → M) (n : ℕ) : ∏ x ∈ Finset.range (n + 1), f x = (∏ x ∈ Finset.range n, f x) * f n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a4babc9049cd8e8463db0bca11635991e608d311e9457bc499fea1f298532021","prominence":"central","quote":{"exact":"By definition, ∏ i = 1 n x i = x 1"},"quote_capped":true,"section":["Product of a sequence","Capital pi notation","Properties of capital pi notation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"By definition, ∏ i = 1 n x i = x 1 ⋅ x 2 ⋅ … ⋅ x n . {\\displaystyle \\prod _{i=1}^{n}x_{i}=x_{1}\\cdot x_{2}\\cdot \\ldots \\cdot x_{n}.}","segments":[{"text":"By definition, "},{"display":true,"tex":"\\prod _{i=1}^{n}x_{i}=x_{1}\\cdot x_{2}\\cdot \\ldots \\cdot x_{n}."}]},"unresolved":null},{"absence":null,"basis":"c72393a28fb37965eb651888afcb9687dddf0d63cbc3c6f3fbb9a0d819e09793","coverage":null,"id":"enwiki-20845-1375745567::In-text #dca27fc8","item":"In-text #dca27fc8","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Finset.pow_eq_prod_const","end_line":677,"library":"mathlib","line":677,"location_key":"c72393a28fb37965eb651888afcb9687dddf0d63cbc3c6f3fbb9a0d819e09793","module":"Mathlib.Algebra.BigOperators.Group.Finset.Basic","note":"Lean indexes the n equal factors by Finset.range n, which starts the index at zero where the passage starts it at one, and writes the power on the left of the equation.","pair_key":"d25a015db3ee5883f7ff9569e15c5acac4af2e75566c17b9ed6a7e5f309bef8e","path":"Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.pow_eq_prod_const {M : Type*} [CommMonoid M] (b : M) (n : ℕ) : b ^ n = ∏ _k ∈ Finset.range n, b"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Finset.prod_const","end_line":662,"library":"mathlib","line":661,"location_key":"ee34f8c129c8c0592ed6eb823fef0d99020dac7238cb2129501603379e237975","module":"Mathlib.Algebra.BigOperators.Group.Finset.Basic","note":"Its exponent is the size of the index set, so reaching the passage's exponent n needs a separate counting lemma for the range from one to n.","pair_key":"c750bf5b548a4e0ce6b3e956c6ee8cfe5742a803b31ed051a9c0723e652a3f1b","path":"Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.prod_const {ι : Type*} {M : Type*} {s : Finset ι} [CommMonoid M] (b : M) : ∏ _x ∈ s, b = b ^ s.card"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"5e5cc19544baecd8311caee19567fbc12c2aee519189ceaf91702ed775328e82","prominence":"central","quote":{"exact":"If all factors are identical, a product of n factors is equivalent"},"quote_capped":true,"section":["Product of a sequence","Capital pi notation","Properties of capital pi notation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"If all factors are identical, a product of n factors is equivalent to exponentiation: ∏ i = 1 n x = x ⋅ x ⋅ … ⋅ x = x n . {\\displaystyle \\prod _{i=1}^{n}x=x\\cdot x\\cdot \\ldots \\cdot x=x^{n}.}","segments":[{"text":"If all factors are identical, a product of n factors is equivalent to exponentiation: "},{"display":true,"tex":"\\prod _{i=1}^{n}x=x\\cdot x\\cdot \\ldots \\cdot x=x^{n}."}]},"unresolved":null},{"absence":null,"basis":"a6d891e89f0c103ee6e1280b9fde0c1ec4a1a5680e036a3f36b222d3fc918dce","coverage":null,"id":"enwiki-20845-1375745567::In-text #4b64cdd8","item":"In-text #4b64cdd8","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Finset.prod_mul_distrib","end_line":311,"library":"mathlib","line":310,"location_key":"a6d891e89f0c103ee6e1280b9fde0c1ec4a1a5680e036a3f36b222d3fc918dce","module":"Mathlib.Algebra.BigOperators.Group.Finset.Basic","note":"Mathlib allows an arbitrary finite index set and arbitrary commutative monoid values, so the article's run of indices is one reading of it.","pair_key":"1fb9d776bc74a6de47df3116b8c3f9463a8e9af2b8b9eafa6f8974782c89305c","path":"Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.prod_mul_distrib {ι : Type*} {M : Type*} {s : Finset ι} [CommMonoid M] {f g : ι → M} : ∏ x ∈ s, f x * g x = (∏ x ∈ s, f x) * ∏ x ∈ s, g x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"312dd92b29cd4bfe18c09a593a86f7ab967506e926b8426dd55a8eb45ec00f9c","prominence":"central","quote":{"exact":"∏ i = 1 n x i y i = ( ∏"},"quote_capped":true,"section":["Product of a sequence","Capital pi notation","Properties of capital pi notation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"Associativity and commutativity of multiplication imply ","lead_in":true,"segments":[{"text":"Associativity and commutativity of multiplication imply "}]},"layer":"∏ i = 1 n x i y i = ( ∏ i = 1 n x i ) ( ∏ i = 1 n y i ) {\\displaystyle \\prod _{i=1}^{n}{x_{i}y_{i}}=\\left(\\prod _{i=1}^{n}x_{i}\\right)\\left(\\prod _{i=1}^{n}y_{i}\\right)} and","segments":[{"tex":"\\prod _{i=1}^{n}{x_{i}y_{i}}=\\left(\\prod _{i=1}^{n}x_{i}\\right)\\left(\\prod _{i=1}^{n}y_{i}\\right)"},{"text":" and"}]},"unresolved":null},{"absence":null,"basis":"cb82684c3a90821475628ce5232c528126408f633a1fe03b4ae6d032a626fc8b","coverage":null,"id":"enwiki-20845-1375745567::In-text #2a8f78c4","item":"In-text #2a8f78c4","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Finset.prod_pow","end_line":636,"library":"mathlib","line":635,"location_key":"cb82684c3a90821475628ce5232c528126408f633a1fe03b4ae6d032a626fc8b","module":"Mathlib.Algebra.BigOperators.Group.Finset.Defs","note":"Its exponent ranges over the naturals, so it reaches the article's whole-number case and not the alternative in which the exponent is real and the factors positive.","pair_key":"085a3a5cbe485935ccd13a10a73a178c1aff4d89a25537d7ee78a5fd59434099","path":"Mathlib/Algebra/BigOperators/Group/Finset/Defs.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.prod_pow {ι : Type*} {M : Type*} [CommMonoid M] (s : Finset ι) (n : ℕ) (f : ι → M) : ∏ x ∈ s, f x ^ n = (∏ x ∈ s, f x) ^ n"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.finsetProd_rpow","end_line":258,"library":"mathlib","line":255,"location_key":"2ff7fca8f31faedbeac204c04b31567679f15f5633f5889af982019f783d8e47","module":"Mathlib.Analysis.SpecialFunctions.Pow.NNReal","note":"Its factors are required to be nonnegative reals and its exponent is real, which is the article's second case; the extra factor value zero is harmless since the article's factors are positive.","pair_key":"8091d09431174fb7e993fbfa91f258bffeff072af5ff37b1b4474081d0f0eda9","path":"Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.finsetProd_rpow {ι : Type*} (s : Finset ι) (f : ι → ℝ) : (∀ i ∈ s, 0 ≤ f i) → ∀ (r : ℝ), ∏ i ∈ s, f i ^ r = (∏ i ∈ s, f i) ^ r"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"84118fc40377ad7f6ca38274a64ffad58674ae2b0c8c333abd551645368b32df","prominence":"central","quote":{"exact":"( ∏ i = 1 n x i ) a = ∏"},"quote_capped":true,"section":["Product of a sequence","Capital pi notation","Properties of capital pi notation"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"after":{"layer":", and ∏ i = 1 n x a i = x ∑ i = 1 n a i {\\displaystyle \\prod _{i=1}^{n}x^{a_{i}}=x^{\\sum _{i=1}^{n}a_{i}}} if all a i {\\displaystyle a_{i}} are non-negative integers, or if x is a positive real number.","segments":[{"text":", and "},{"display":true,"tex":"\\prod _{i=1}^{n}x^{a_{i}}=x^{\\sum _{i=1}^{n}a_{i}}"},{"text":" if all "},{"tex":"a_{i}"},{"text":" are non-negative integers, or if x is a positive real number."}]},"before":{"layer":"∏ i = 1 n x i y i = ( ∏ i = 1 n x i ) ( ∏ i = 1 n y i ) {\\displaystyle \\prod _{i=1}^{n}{x_{i}y_{i}}=\\left(\\prod _{i=1}^{n}x_{i}\\right)\\left(\\prod _{i=1}^{n}y_{i}\\right)} and ","lead_in":true,"segments":[{"tex":"\\prod _{i=1}^{n}{x_{i}y_{i}}=\\left(\\prod _{i=1}^{n}x_{i}\\right)\\left(\\prod _{i=1}^{n}y_{i}\\right)"},{"text":" and "}]},"layer":"( ∏ i = 1 n x i ) a = ∏ i = 1 n x i a {\\displaystyle \\left(\\prod _{i=1}^{n}x_{i}\\right)^{a}=\\prod _{i=1}^{n}x_{i}^{a}} if a is a non-negative integer, or if all x i {\\displaystyle x_{i}} are positive real numbers","segments":[{"tex":"\\left(\\prod _{i=1}^{n}x_{i}\\right)^{a}=\\prod _{i=1}^{n}x_{i}^{a}"},{"text":" if a is a non-negative integer, or if all "},{"tex":"x_{i}"},{"text":" are positive real numbers"}]},"unresolved":null},{"absence":null,"basis":"da144dcc595664f5aa429cb4d569e05ee9086d41b5d2022ec9301b30e9178897","coverage":null,"id":"enwiki-20845-1375745567::In-text #0205d038","item":"In-text #0205d038","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Finset.prod_pow_eq_pow_sum","end_line":682,"library":"mathlib","line":680,"location_key":"da144dcc595664f5aa429cb4d569e05ee9086d41b5d2022ec9301b30e9178897","module":"Mathlib.Algebra.BigOperators.Group.Finset.Basic","note":"Its exponents are natural numbers, so it reaches the article's whole-number case and not the alternative in which the base is a positive real and the exponents arbitrary.","pair_key":"0ceb7ffa4ebe074e9cab7edfb613079151fabbf20194c3b742c8ba29db14c433","path":"Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.prod_pow_eq_pow_sum {ι : Type*} {M : Type*} [CommMonoid M] (s : Finset ι) (f : ι → ℕ) (a : M) : ∏ i ∈ s, a ^ f i = a ^ ∑ i ∈ s, f i"},"statement":false},{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"Finset.prod_zpow_eq_zpow_sum","end_line":49,"library":"tauceti","line":42,"location_key":"d30efc564e770aa8b684dca53ade99fc926427518b64d6cd38eb98dab982e0a3","module":"TauCeti.Algebra.BigOperators.ZPow","note":"It requires the base to be invertible, which the article's positive real case supplies, and it allows negative exponents the article does not mention.","pair_key":"cf5729c785ff4b71d2a281a174f7c965a19c9b72cf3f3eff5b1c25991513e7ed","path":"TauCeti/Algebra/BigOperators/ZPow.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem Finset.prod_zpow_eq_zpow_sum {ι : Type*} {G : Type*} [CommGroup G] (s : Finset ι) (y : G) (e : ι → ℤ) : ∏ i ∈ s, y ^ e i = y ^ ∑ i ∈ s, e i"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"ed31cd3f2970a40ed9b8a7e0dfcc8df94f106858f7118a83cb99cef3e9430e59","prominence":"supporting","quote":{"exact":"∏ i = 1 n x a i = x ∑ i"},"quote_capped":true,"section":["Product of a sequence","Capital pi notation","Properties of capital pi notation"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"if a is a non-negative integer, or if all x i {\\displaystyle x_{i}} are positive real numbers, and ","segments":[{"text":"if a is a non-negative integer, or if all "},{"tex":"x_{i}"},{"text":" are positive real numbers, and "}]},"layer":"∏ i = 1 n x a i = x ∑ i = 1 n a i {\\displaystyle \\prod _{i=1}^{n}x^{a_{i}}=x^{\\sum _{i=1}^{n}a_{i}}} if all a i {\\displaystyle a_{i}} are non-negative integers, or if x is a positive real number.","segments":[{"display":true,"tex":"\\prod _{i=1}^{n}x^{a_{i}}=x^{\\sum _{i=1}^{n}a_{i}}"},{"text":" if all "},{"tex":"a_{i}"},{"text":" are non-negative integers, or if x is a positive real number."}]},"unresolved":null},{"absence":null,"basis":"1de7159d152e42f5b03d9599430389a011acef1d0abfb35793109b9ca24aec0a","coverage":null,"id":"enwiki-20845-1375745567::In-text #83308d79","item":"In-text #83308d79","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"tprod","end_line":148,"library":"mathlib","line":143,"location_key":"1de7159d152e42f5b03d9599430389a011acef1d0abfb35793109b9ca24aec0a","module":"Mathlib.Topology.Algebra.InfiniteSum.Defs","note":"Mathlib defines this object for an arbitrary index type, arbitrary topological commutative monoid values and a choice of summation direction, and it is the library's infinite product.","pair_key":"09a7216d465d432acd8614aaf4d6dadcfa5166a69ada8675f198d32b1efed647","path":"Mathlib/Topology/Algebra/InfiniteSum/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def tprod {α : Type*} {β : Type*} [CommMonoid α] [TopologicalSpace α] : (β → α) → optParam (SummationFilter β) (SummationFilter.unconditional β) → α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Multipliable","end_line":116,"library":"mathlib","line":115,"location_key":"8983b2e916ac9ef6c74f9fae7b748f43fb87fa423f26d7af381adcae82fadf45","module":"Mathlib.Topology.Algebra.InfiniteSum.Defs","note":"It is the statement that such an infinite product exists, which is a condition on the family rather than the named object itself.","pair_key":"b9e30307ba2ae50fb5ade488582d67cc659ba4f8a52d857d63735ec5bd5bfa55","path":"Mathlib/Topology/Algebra/InfiniteSum/Defs.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Multipliable {α : Type*} {β : Type*} [CommMonoid α] [TopologicalSpace α] : (β → α) → optParam (SummationFilter β) (SummationFilter.unconditional β) → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"05369e2dd094aa7e72196ba371be73cd4bdde4cd53efa70d926baee5d742f8cb","prominence":"central","quote":{"exact":"One may also consider products of infinitely many factors; these are called"},"quote_capped":true,"section":["Product of a sequence","Infinite products"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"One may also consider products of infinitely many factors; these are called infinite products.","segments":[{"text":"One may also consider products of infinitely many factors; these are called infinite products."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"ee9440de6b89af83c35cd54e928e482943894a2309959e79ff349bc3706256c7"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #5a880376","item":"In-text #5a880376","kind":"notation","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"2d1d4ebb391e14aa1ca98279150813e5cdf14aabec017d5da1246fbfcd32203f","prominence":"supporting","quote":{"exact":"Notationally, this consists in replacing n above by the infinity symbol ∞."},"quote_capped":false,"section":["Product of a sequence","Infinite products"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"Notationally, this consists in replacing n above by the infinity symbol ∞.","segments":[{"text":"Notationally, this consists in replacing n above by the infinity symbol ∞."}]},"unresolved":null},{"absence":null,"basis":"7a0895c411d8e89db1c837eee39eb7e89040fdc0ff43f8d1d3bc4b0223f86538","coverage":null,"id":"enwiki-20845-1375745567::In-text #a8c3dfbe","item":"In-text #a8c3dfbe","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"tprod","end_line":148,"library":"mathlib","line":143,"location_key":"7a0895c411d8e89db1c837eee39eb7e89040fdc0ff43f8d1d3bc4b0223f86538","module":"Mathlib.Topology.Algebra.InfiniteSum.Defs","note":"Mathlib's product is the limit of the finite partial products along a chosen direction of finite index sets, and along the growing initial ranges on the naturals that direction is the one the article takes.","pair_key":"21513f49d783a20f9dc1cd5da050a889855bd03a0275fc02175d78e01d0f5754","path":"Mathlib/Topology/Algebra/InfiniteSum/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def tprod {α : Type*} {β : Type*} [CommMonoid α] [TopologicalSpace α] : (β → α) → optParam (SummationFilter β) (SummationFilter.unconditional β) → α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"HasProd","end_line":108,"library":"mathlib","line":107,"location_key":"6bdd3760803c5149cf812400dd6082b55bc5170ed4ccbd9ce18e9038bdf0e433","module":"Mathlib.Topology.Algebra.InfiniteSum.Defs","note":"This is the relation form of the same definition: the finite partial products, taken along the chosen direction, converge to the stated value.","pair_key":"e501db0089c32f838775590c9203ba34f1dfb4de358f3aebdc1bf9b17fe317b8","path":"Mathlib/Topology/Algebra/InfiniteSum/Defs.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def HasProd {α : Type*} {β : Type*} [CommMonoid α] [TopologicalSpace α] : (β → α) → α → optParam (SummationFilter β) (SummationFilter.unconditional β) → Prop"},"statement":true},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Multipliable.tendsto_prod_tprod_nat","end_line":58,"library":"mathlib","line":56,"location_key":"811d4747bf413c4f1f6f59cdd23923ef272731600b2de80903dc818649fba414","module":"Mathlib.Topology.Algebra.InfiniteSum.NatInt","note":"It assumes convergence that does not depend on the order of the factors, an assumption the article does not make, and under it delivers the article's defining limit.","pair_key":"242b6e2cb30c8325e6b37f5234694946932800e173355f3a353fe44c6914855a","path":"Mathlib/Topology/Algebra/InfiniteSum/NatInt.lean","proof_status":"proved","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Multipliable.tendsto_prod_tprod_nat {M : Type*} [CommMonoid M] [TopologicalSpace M] {f : ℕ → M} : Multipliable f → Filter.Tendsto (fun n ↦ ∏ i ∈ Finset.range n, f i) Filter.atTop (𝓝 (∏' (i : ℕ), f i))"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"5e04b4a327a082aab3c3bf848589510aa19c5cd6b453b757dad6adf034819fd8","prominence":"central","quote":{"exact":"The product of such an infinite sequence is defined as the limit"},"quote_capped":true,"section":["Product of a sequence","Infinite products"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"The product of such an infinite sequence is defined as the limit of the product of the first n factors, as n grows without bound. That is, ∏ i = m ∞ x i = lim n → ∞ ∏ i = m n x i . {\\displaystyle \\prod _{i=m}^{\\infty }x_{i}=\\lim _{n\\to \\infty }\\prod _{i=m}^{n}x_{i}.}","segments":[{"text":"The product of such an infinite sequence is defined as the limit of the product of the first n factors, as n grows without bound. That is, "},{"display":true,"tex":"\\prod _{i=m}^{\\infty }x_{i}=\\lim _{n\\to \\infty }\\prod _{i=m}^{n}x_{i}."}]},"unresolved":null},{"absence":null,"basis":"1605a4fb1654e83851bc28cca3e10eeb2340550d95f23b06a11597c2e4fccc31","coverage":null,"id":"enwiki-20845-1375745567::In-text #e37175cc","item":"In-text #e37175cc","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"tprod_int_rec","end_line":402,"library":"mathlib","line":400,"location_key":"1605a4fb1654e83851bc28cca3e10eeb2340550d95f23b06a11597c2e4fccc31","module":"Mathlib.Topology.Algebra.InfiniteSum.NatInt","note":"Lean cuts the index at zero, putting the middle factor with the forward half, and writes each half's limit as that half's infinite product.","pair_key":"335738f6e41893128f76b491241056fc0faf6f2b10cb6d1038d42385d468be85","path":"Mathlib/Topology/Algebra/InfiniteSum/NatInt.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem tprod_int_rec {M : Type*} [CommMonoid M] [TopologicalSpace M] [ContinuousMul M] [T2Space M] {f g : ℕ → M} : Multipliable f → Multipliable g → ∏' (n : ℤ), Int.rec f g n = (∏' (n : ℕ), f n) * ∏' (n : ℕ), g n"},"statement":false},{"challenge":"downgraded","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"tprod","end_line":148,"library":"mathlib","line":143,"location_key":"247d26b23d0ab4ddebf230013884de7bf3356f65ab0f196d6dd82a4ee855f09a","module":"Mathlib.Topology.Algebra.InfiniteSum.Defs","note":"Mathlib takes a single limit over intervals widening in both directions where the article multiplies two one-sided limits, and the two values agree whenever the article's two limits exist.","pair_key":"609e9afa4de840a8ef35ed02d2267926a4f63cc5b60d5b9908a2b4d6ece61c09","path":"Mathlib/Topology/Algebra/InfiniteSum/Defs.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def tprod {α : Type*} {β : Type*} [CommMonoid α] [TopologicalSpace α] : (β → α) → optParam (SummationFilter β) (SummationFilter.unconditional β) → α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"SummationFilter.conditional","end_line":218,"library":"mathlib","line":217,"location_key":"56f6dee8e56d6fa44a248915f409c606cbaad3d0abf9405f7b88465554d174ef","module":"Mathlib.Topology.Algebra.InfiniteSum.SummationFilter","note":"It defines the direction of widening intervals along which a two-sided product is taken, not the product itself.","pair_key":"2e8ccadfcf4dc7f3e6aeb3a83cacb1a3f8dbb6705f35df2df2af1e9d53206dae","path":"Mathlib/Topology/Algebra/InfiniteSum/SummationFilter.lean","proof_status":"definition","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def SummationFilter.conditional (β : Type*) [Preorder β] [LocallyFiniteOrder β] : SummationFilter β"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"360ed181cc4eb8b2d31656712de9e9d60c005e31f189fb7334473e11f925f1a3","prominence":"supporting","quote":{"exact":"One can similarly replace m with negative infinity, and define: ∏ i"},"quote_capped":true,"section":["Product of a sequence","Infinite products"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"One can similarly replace m with negative infinity, and define: ∏ i = − ∞ ∞ x i = ( lim m → − ∞ ∏ i = m 0 x i ) ⋅ ( lim n → ∞ ∏ i = 1 n x i ) , {\\displaystyle \\prod _{i=-\\infty }^{\\infty }x_{i}=\\left(\\lim _{m\\to -\\infty }\\prod _{i=m}^{0}x_{i}\\right)\\cdot \\left(\\lim _{n\\to \\infty }\\prod _{i=1}^{n}x_{i}\\right),} provided both limits exist.[citation needed]","segments":[{"text":"One can similarly replace m with negative infinity, and define: "},{"display":true,"tex":"\\prod _{i=-\\infty }^{\\infty }x_{i}=\\left(\\lim _{m\\to -\\infty }\\prod _{i=m}^{0}x_{i}\\right)\\cdot \\left(\\lim _{n\\to \\infty }\\prod _{i=1}^{n}x_{i}\\right),"},{"text":" provided both limits exist.[citation needed]"}]},"unresolved":null},{"absence":null,"basis":"2d93c782e7851ddaf8546b8063cb27c2438ca5eee69c93c067052b0729574d19","coverage":null,"id":"enwiki-20845-1375745567::In-text #22088e31","item":"In-text #22088e31","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Finset.pow_eq_prod_const","end_line":677,"library":"mathlib","line":677,"location_key":"45e4977c8f1ffb31a2aac9c20700d29b5d1c31cc3c86b75c906b2ac990a10fef","module":"Mathlib.Algebra.BigOperators.Group.Finset.Basic","note":"Mathlib writes the power out as the product of as many copies of the base as the exponent counts, indexed by a range of that length.","pair_key":"fb2aa9bddb77946a49cc2addbade6fb4f378544779bae27f984d9efb63869344","path":"Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.pow_eq_prod_const {M : Type*} [CommMonoid M] (b : M) (n : ℕ) : b ^ n = ∏ _k ∈ Finset.range n, b"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"npowRec","end_line":42,"library":"lean-core","line":40,"location_key":"2d93c782e7851ddaf8546b8063cb27c2438ca5eee69c93c067052b0729574d19","module":"Init.Data.Zero","note":"Lean builds the power operation of a monoid by iterating the multiplication, for any type carrying a unit and a multiplication, and its docstring describes it as the base multiplied by itself that many times.","pair_key":"b7389a7576328cf6bdfd1a98d449193a545ad573a1999ec9c1c399c2a0736b3e","path":"src/Init/Data/Zero.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def npowRec {M : Type u_1} [One M] [Mul M] : Nat → M → M"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"ce0390ebc113cea92a214e1945b170c03cfe70f3c6cf5578d853d5689035334d","prominence":"central","quote":{"exact":"When multiplication is repeated, the resulting operation is known as exponentiation."},"quote_capped":false,"section":["Exponentiation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"When multiplication is repeated, the resulting operation is known as exponentiation.","segments":[{"text":"When multiplication is repeated, the resulting operation is known as exponentiation."}]},"unresolved":null},{"absence":null,"basis":"ebf7cada26e321f829674123e1b3e8db1b790174a0c0a22ee2b0a2ec08fde312","coverage":null,"id":"enwiki-20845-1375745567::In-text #d5f3cef3","item":"In-text #d5f3cef3","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"pow_three'","end_line":436,"library":"mathlib","line":436,"location_key":"ebf7cada26e321f829674123e1b3e8db1b790174a0c0a22ee2b0a2ec08fde312","module":"Mathlib.Algebra.Group.Monoid","note":"Lean brackets the three equal factors to the left, the way the article writes the product.","pair_key":"b436c49926497486b75df32f032715da20316c3ad0ec343b31015555574f6bb0","path":"Mathlib/Algebra/Group/Monoid.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem pow_three' {M : Type*} [Monoid M] (a : M) : a ^ 3 = a * a * a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"pow_three","end_line":439,"library":"mathlib","line":439,"location_key":"59c241205e08392f529fb0a5eeb9dcb4c49c417a73ed34eddffbd0e39cffcf40","module":"Mathlib.Algebra.Group.Monoid","note":"Lean brackets the three equal factors to the right, giving the same numerical product.","pair_key":"11636623118c01ddeca79abe8b7e2b49913aa1ac5819494969464029da40aafb","path":"Mathlib/Algebra/Group/Monoid.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem pow_three {M : Type*} [Monoid M] (a : M) : a ^ 3 = a * (a * a)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e68ea0e31577b052d40da3476dd9bc924276fc2c7171011a676a313d585445d1","prominence":"supporting","quote":{"exact":"For instance, the product of three factors of two (2×2×2) is \"two"},"quote_capped":true,"section":["Exponentiation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"For instance, the product of three factors of two (2×2×2) is \"two raised to the third power\", and is denoted by 23, a two with a superscript three.","segments":[{"text":"For instance, the product of three factors of two (2×2×2) is \"two raised to the third power\", and is denoted by 23, a two with a superscript three."}]},"unresolved":null},{"absence":null,"basis":"38b2706849a5e8b933f671983f7a9b30f0389dfba2d0abce41717c55476de5aa","coverage":null,"id":"enwiki-20845-1375745567::In-text #5abe7726","item":"In-text #5abe7726","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Finset.pow_eq_prod_const","end_line":677,"library":"mathlib","line":677,"location_key":"38b2706849a5e8b933f671983f7a9b30f0389dfba2d0abce41717c55476de5aa","module":"Mathlib.Algebra.BigOperators.Group.Finset.Basic","note":"Lean lets the product index run over the first n naturals, so the product still has n factors, each equal to the base.","pair_key":"5ac32eb5be0a72cd80eb558f2a983ef3c0e1f64662cbd76b18825c1884511a71","path":"Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.pow_eq_prod_const {M : Type*} [CommMonoid M] (b : M) (n : ℕ) : b ^ n = ∏ _k ∈ Finset.range n, b"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"List.prod_eq_pow_card","end_line":100,"library":"mathlib","line":100,"location_key":"9f153395a8d1ec889bbe13789f5754407d20705b0bcb9e576a27883b3ab02d01","module":"Mathlib.Algebra.BigOperators.Group.List.Defs","note":"Lean counts the factors by the length of a list rather than by an index running from one.","pair_key":"f1ead1c8992fb3be2a57d140c14114387377251419452066992bfa678d3cd79c","path":"Mathlib/Algebra/BigOperators/Group/List/Defs.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"deprecated_to":"List.prod_eq_pow_length","elided":false,"text":"theorem List.prod_eq_pow_card {M : Type*} [Monoid M] (l : List M) (m : M) : (∀ x ∈ l, x = m) → l.prod = m ^ l.length"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"80bfc763c5771025389ab072c28c04f520dc6ef5e2b9aeda58e727f65797438c","prominence":"central","quote":{"exact":"In general, the exponent (or superscript) indicates how many times the base"},"quote_capped":true,"section":["Exponentiation"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"In general, the exponent (or superscript) indicates how many times the base appears in the expression, so that the expression a n = a × a × ⋯ × a ⏟ n = ∏ i = 1 n a {\\displaystyle a^{n}=\\underbrace {a\\times a\\times \\cdots \\times a} _{n}=\\prod _{i=1}^{n}a} indicates that n copies of the base a are to be multiplied together.","segments":[{"text":"In general, the exponent (or superscript) indicates how many times the base appears in the expression, so that the expression "},{"display":true,"tex":"a^{n}=\\underbrace {a\\times a\\times \\cdots \\times a} _{n}=\\prod _{i=1}^{n}a"},{"text":" indicates that n copies of the base a are to be multiplied together."}]},"unresolved":null},{"absence":null,"basis":"18e0541fc8800f93378bd6fce5766ab4bac71146b9b931717a5d63caab79a89e","coverage":null,"id":"enwiki-20845-1375745567::In-text #281018c3","item":"In-text #281018c3","kind":"notation","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"PNatPowAssoc","end_line":50,"library":"mathlib","line":46,"location_key":"18e0541fc8800f93378bd6fce5766ab4bac71146b9b931717a5d63caab79a89e","module":"Mathlib.Algebra.Group.PNatPowAssoc","note":"Lean carries the exponent notation as a power instance and power associativity as a separate Prop mixin over it.","pair_key":"b0afc6b2b02a997f5cedb73c19243962fcf361e98e5c00d70ed3e2fd73f58cb3","path":"Mathlib/Algebra/Group/PNatPowAssoc.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class PNatPowAssoc (M : Type*) [Mul M] [Pow M ℕ+] : Prop"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"NatPowAssoc","end_line":52,"library":"mathlib","line":46,"location_key":"7216bfdec8e76c77fefcd49d09ad9cbd7443780bf19405093424fd69909f93ae","module":"Mathlib.Algebra.Group.NatPowAssoc","note":"Lean's unital form of the mixin also pins down the zeroth power, which the article's numbers possess.","pair_key":"b66e745e04d5eae499bc078c6ddb6bb3b4b8443bb2523022057498fa3f9922d8","path":"Mathlib/Algebra/Group/NatPowAssoc.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class NatPowAssoc (M : Type*) [MulOneClass M] [Pow M ℕ] : Prop"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b77d00d784ef4c3f1650e5ad210eacc721922bc446448ccfa1d709cd589919f0","prominence":"supporting","quote":{"exact":"This notation can be used whenever multiplication is known to be power"},"quote_capped":true,"section":["Exponentiation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"This notation can be used whenever multiplication is known to be power associative.","segments":[{"text":"This notation can be used whenever multiplication is known to be power associative."}]},"unresolved":null},{"absence":null,"basis":"9cb6d3d8720fd827d9a92bbd09a701307a9393d32368298a1e3fb9604de998c3","coverage":null,"id":"enwiki-20845-1375745567::In-text #df1b800e","item":"In-text #df1b800e","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_comm","end_line":258,"library":"mathlib","line":258,"location_key":"9cb6d3d8720fd827d9a92bbd09a701307a9393d32368298a1e3fb9604de998c3","module":"Mathlib.Algebra.Group.Semigroup","note":"Lean states the law for any type whose multiplication commutes.","pair_key":"a957027b7eea6d34e2ed83e31769e9d9b1c97e40b0ac1be3a78ffc41a8e4e098","path":"Mathlib/Algebra/Group/Semigroup.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_comm {G : Type*} [CommMagma G] (a b : G) : a * b = b * a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.commRing","end_line":197,"library":"mathlib","line":176,"location_key":"b37e4833cb0ef35692c0842cd5bf18cc46b91bee49ed2e04771b6ad80dcd21fe","module":"Mathlib.Basic.Real.Basic","note":"The commutativity of real multiplication is one of the fields this instance supplies.","pair_key":"78b62660425c1e0b79e3172c0c507a9bfc3b0c622f52eea1dda6ede77a25c55d","path":"Mathlib/Basic/Real/Basic.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Real.commRing : CommRing ℝ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Complex.instCommSemiring","end_line":406,"library":"mathlib","line":405,"location_key":"19465086e331eb565563c50d31e97f16fa3956a19fba1b52a9ca7158358ad9c5","module":"Mathlib.Basic.Complex.Basic","note":"Lean records the commutativity of complex multiplication inside this instance.","pair_key":"c765e4a5817ec0ff1e8e74a204d68d8cc231fc2708121749e2dac57bae660520","path":"Mathlib/Basic/Complex/Basic.lean","proof_status":"definition","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Complex.instCommSemiring : CommSemiring ℂ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"73877f3ecf4e32284d06a9a552c71d9088f0f1d172a9e9004e070e06b9bf4daa","prominence":"central","quote":{"exact":"The order in which two numbers are multiplied does not matter:[34][35] x"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"Commutative property ","lead_in":true,"segments":[{"text":"Commutative property "}]},"layer":"The order in which two numbers are multiplied does not matter:[34][35] x ⋅ y = y ⋅ x . {\\displaystyle x\\cdot y=y\\cdot x.}","segments":[{"text":"The order in which two numbers are multiplied does not matter:"},{"ref":"[34][35]"},{"text":" "},{"display":true,"tex":"x\\cdot y=y\\cdot x."}]},"unresolved":null},{"absence":null,"basis":"1dc8864c14a747ca7ab2e6bad3af5cc2ae2b9705bbe965a17dc30f32ad499b9f","coverage":null,"id":"enwiki-20845-1375745567::In-text #045b29d0","item":"In-text #045b29d0","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_assoc","end_line":162,"library":"mathlib","line":161,"location_key":"1dc8864c14a747ca7ab2e6bad3af5cc2ae2b9705bbe965a17dc30f32ad499b9f","module":"Mathlib.Algebra.Group.Semigroup","note":"Lean states the law for any type whose multiplication is associative.","pair_key":"e8a1ae1d18b9707265d43eb3925680ac91292b7ea0075cecdfdef94497a67692","path":"Mathlib/Algebra/Group/Semigroup.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_assoc {G : Type*} [Semigroup G] (a b c : G) : a * b * c = a * (b * c)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.commRing","end_line":197,"library":"mathlib","line":176,"location_key":"30a72f2f2fb7f36b1648cdaadbd2f12c63869dc01cd46259b1658757388b434b","module":"Mathlib.Basic.Real.Basic","note":"The associativity of real multiplication is among the fields this instance supplies.","pair_key":"1fa8091addf7f0aa58fc93fe79ffc5d43df77e0b64c6bbfc2831c1a69e4f0728","path":"Mathlib/Basic/Real/Basic.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Real.commRing : CommRing ℝ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Complex.instCommSemiring","end_line":406,"library":"mathlib","line":405,"location_key":"851f60022bfc11a49982da2f9ca48779c7d83b811bf2642037a06847131d89f0","module":"Mathlib.Basic.Complex.Basic","note":"Lean records the associativity of complex multiplication inside this instance.","pair_key":"522195f70c9c1dd0493dfd4fa4d62627d41e6eb8f5d730313a68b59c5bc0eda4","path":"Mathlib/Basic/Complex/Basic.lean","proof_status":"definition","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Complex.instCommSemiring : CommSemiring ℂ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"3a3e2601b83787e13c5647299251ab2a38f0589964dbd1a0a628ff8a05c88b1a","prominence":"central","quote":{"exact":"Expressions solely involving multiplication or addition are invariant with respect to the"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"Associative property ","lead_in":true,"segments":[{"text":"Associative property "}]},"layer":"Expressions solely involving multiplication or addition are invariant with respect to the order of operations:[34][35] ( x ⋅ y ) ⋅ z = x ⋅ ( y ⋅ z ) . {\\displaystyle (x\\cdot y)\\cdot z=x\\cdot (y\\cdot z).}","segments":[{"text":"Expressions solely involving multiplication or addition are invariant with respect to the order of operations:"},{"ref":"[34][35]"},{"text":" "},{"display":true,"tex":"(x\\cdot y)\\cdot z=x\\cdot (y\\cdot z)."}]},"unresolved":null},{"absence":null,"basis":"ad7ef8f8026e18b67f84a7437222321aef9994d819c51447a8eeabd238c98fda","coverage":null,"id":"enwiki-20845-1375745567::In-text #da39101f","item":"In-text #da39101f","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_add","end_line":91,"library":"mathlib","line":91,"location_key":"ad7ef8f8026e18b67f84a7437222321aef9994d819c51447a8eeabd238c98fda","module":"Mathlib.Algebra.Ring.Defs","note":"Lean states the law for any type carrying both operations with left distributivity.","pair_key":"8b750b351bbaae60b11a3473b58d97bdf3afab86b92d9c260937daccb1d41f02","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_add {R : Type v} [Mul R] [Add R] [LeftDistribClass R] (a b c : R) : a * (b + c) = a * b + a * c"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"left_distrib","end_line":89,"library":"mathlib","line":87,"location_key":"d0eee05d8a2b863c28fffbb553c53acb85c3d6680740ab34d18abeaa0e2c3294","module":"Mathlib.Algebra.Ring.Defs","note":"Lean keeps this as the primitive name of the law that mul_add abbreviates.","pair_key":"b0be59b0c101c352fecc77b5f4bc4e7b7406746c1f8f308be0ef7e7554cc3ffa","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem left_distrib {R : Type v} [Mul R] [Add R] [LeftDistribClass R] (a b c : R) : a * (b + c) = a * b + a * c"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.commRing","end_line":197,"library":"mathlib","line":176,"location_key":"73c23c947912b9649051d58bec1e6da5b4119d7db4c25e2ac6a38a4a0d10348a","module":"Mathlib.Basic.Real.Basic","note":"Distributivity for the reals is among the fields this instance supplies.","pair_key":"30635baae6777909f1520022261281f591aaecd67c705798f4cefdb2f2d45276","path":"Mathlib/Basic/Real/Basic.lean","proof_status":"definition","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Real.commRing : CommRing ℝ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Complex.instCommSemiring","end_line":406,"library":"mathlib","line":405,"location_key":"8afabb06524b7154e3740a934310f4d0df07cd59e37fee2ac9135829a408ec2a","module":"Mathlib.Basic.Complex.Basic","note":"Distributivity for the complexes is recorded inside this instance.","pair_key":"7e98231f657699b42cfdd1155a2043882b746c9ac4b553d9ea3d9d61ba696586","path":"Mathlib/Basic/Complex/Basic.lean","proof_status":"definition","rank":4,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Complex.instCommSemiring : CommSemiring ℂ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"87a42286922063046f77deec6c05e0360eae06b292e80246c09abe04ea0e45aa","prominence":"central","quote":{"exact":"Holds with respect to multiplication over addition. This identity is of prime"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"Distributive property ","lead_in":true,"segments":[{"text":"Distributive property "}]},"layer":"Holds with respect to multiplication over addition. This identity is of prime importance in simplifying algebraic expressions:[34][35] x ⋅ ( y + z ) = x ⋅ y + x ⋅ z . {\\displaystyle x\\cdot (y+z)=x\\cdot y+x\\cdot z.}","segments":[{"text":"Holds with respect to multiplication over addition. This identity is of prime importance in simplifying algebraic expressions:"},{"ref":"[34][35]"},{"text":" "},{"display":true,"tex":"x\\cdot (y+z)=x\\cdot y+x\\cdot z."}]},"unresolved":null},{"absence":null,"basis":"de3dd551c88898ba8381a2aa8aa7f993669596f8141a6cfcd930b63f4a7ccbcd","coverage":null,"id":"enwiki-20845-1375745567::In-text #e032f1b4","item":"In-text #e032f1b4","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MulOneClass","end_line":78,"library":"mathlib","line":74,"location_key":"de3dd551c88898ba8381a2aa8aa7f993669596f8141a6cfcd930b63f4a7ccbcd","module":"Mathlib.Algebra.Group.Monoid","note":"Lean names the distinguished element one and packages the two identity laws for it as a class over any type.","pair_key":"f7ec8e8780abc646ed5486e253559aaecdcd2a01edf6cd5465c5c5ac9a8d051a","path":"Mathlib/Algebra/Group/Monoid.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class MulOneClass : Type u_2 → Type u_2"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.commRing","end_line":197,"library":"mathlib","line":176,"location_key":"280d0b17c5cef6b6ac60249b8465ee2068848e443cf3e970af48fe91acff9f66","module":"Mathlib.Basic.Real.Basic","note":"The unit of real multiplication is one of the data this instance supplies.","pair_key":"ce43d2cca610a36e596f8ba0ad52fd565dbec07b0b4f915edcc4ab1949a18ed3","path":"Mathlib/Basic/Real/Basic.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Real.commRing : CommRing ℝ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Complex.instCommSemiring","end_line":406,"library":"mathlib","line":405,"location_key":"65a94ae79640ac000be2683f02b281cd7762ad908f085811b27cfa405e49c906","module":"Mathlib.Basic.Complex.Basic","note":"The unit of complex multiplication is recorded inside this instance.","pair_key":"f3c12dfa86247de0ffcef39d2f4cee90720cbc6b9f6a4ed4f794a2d289e7d848","path":"Mathlib/Basic/Complex/Basic.lean","proof_status":"definition","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Complex.instCommSemiring : CommSemiring ℂ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"dc94a40c4f22f6995a652f327d400b2980c3eb7c2f9fd804acda983650156d91","prominence":"central","quote":{"exact":"The multiplicative identity is 1"},"quote_capped":false,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"after":{"layer":"; anything multiplied by 1 is itself.","segments":[{"text":"; anything multiplied by 1 is itself."}]},"before":{"layer":"Identity element ","lead_in":true,"segments":[{"text":"Identity element "}]},"layer":"The multiplicative identity is 1","segments":[{"text":"The multiplicative identity is 1"}]},"unresolved":null},{"absence":null,"basis":"a7ab98c461f19bc260963ed4734f003f626e154368b25bdaa35de065377a01e3","coverage":null,"id":"enwiki-20845-1375745567::In-text #3c8634d7","item":"In-text #3c8634d7","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_one","end_line":96,"library":"mathlib","line":95,"location_key":"a7ab98c461f19bc260963ed4734f003f626e154368b25bdaa35de065377a01e3","module":"Mathlib.Algebra.Group.Monoid","note":"Lean states the law for any type carrying a multiplication and a distinguished one.","pair_key":"a3e2a0435b0a2da25fd93a91be8cce93906c1853fcf70e4916211bcd9ebe54a0","path":"Mathlib/Algebra/Group/Monoid.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_one {M : Type*} [MulOneClass M] (a : M) : a * 1 = a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.commRing","end_line":197,"library":"mathlib","line":176,"location_key":"76ddb75aa16a012592d66074f7838cab8334e1f69cbfed87f34a4215ee41128f","module":"Mathlib.Basic.Real.Basic","note":"The identity law for the real unit is among the fields this instance supplies.","pair_key":"a6dee0c12b5d831208d7528bd35b8447e6ac3a55927da7cd253d0f52fab442ca","path":"Mathlib/Basic/Real/Basic.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Real.commRing : CommRing ℝ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Complex.instCommSemiring","end_line":406,"library":"mathlib","line":405,"location_key":"24991887cffedd5c4afc539ac8c7a4484aaf7acaec737a7b9e94033f31688e0e","module":"Mathlib.Basic.Complex.Basic","note":"The identity law for the complex unit is recorded inside this instance.","pair_key":"d1174c72f4fb8342363e334a321fc5f795260e7a58ad23c96a11e4b862e94d82","path":"Mathlib/Basic/Complex/Basic.lean","proof_status":"definition","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Complex.instCommSemiring : CommSemiring ℂ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"eeac03f5266a71bb22217f83c30089a40873605f3de30687b2310db661ac3cd7","prominence":"central","quote":{"exact":"anything multiplied by 1 is itself. This feature of 1 is known"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"The multiplicative identity is 1; ","segments":[{"text":"The multiplicative identity is 1; "}]},"layer":"anything multiplied by 1 is itself. This feature of 1 is known as the identity property:[34][35] x ⋅ 1 = x . {\\displaystyle x\\cdot 1=x.}","segments":[{"text":"anything multiplied by 1 is itself. This feature of 1 is known as the identity property:"},{"ref":"[34][35]"},{"text":" "},{"display":true,"tex":"x\\cdot 1=x."}]},"unresolved":null},{"absence":null,"basis":"b9fb3b6f665f274b627117ef63979c31cd047f271d33c6d0adf1714b1485c27e","coverage":null,"id":"enwiki-20845-1375745567::In-text #6b06b275","item":"In-text #6b06b275","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Mathlib.Tactic.Ring.Common.mul_zero","end_line":654,"library":"mathlib","line":654,"location_key":"b9fb3b6f665f274b627117ef63979c31cd047f271d33c6d0adf1714b1485c27e","module":"Mathlib.Tactic.Ring.Common","note":"Lean states the law over any commutative semiring, and the reals and complexes are among those.","pair_key":"00afe5e0db2acdaaf38d5333969341995b0570bd7bb144d3d89bdaafe5751b2b","path":"Mathlib/Tactic/Ring/Common.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Mathlib.Tactic.Ring.Common.mul_zero {R : Type*} [CommSemiring R] (a : R) : a * 0 = 0"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.mul_zero","end_line":453,"library":"lean-core","line":453,"location_key":"c313c09897951243673ac7c1245c089be6ebb6c124d4848d84abd490a69c4022","module":"Init.Data.Int.Lemmas","note":"The integers are one of the number systems the section says these laws cover.","pair_key":"cf660d8a8b5a1afd9ae7b11940b07ba5d97bf838b452cb3f65a10eab548861f9","path":"src/Init/Data/Int/Lemmas.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.mul_zero (a : Int) : a * 0 = 0"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Rat.mul_zero","end_line":441,"library":"lean-core","line":441,"location_key":"d92e6b99bc446b6a4626e9c3caedb9e2cf6815e50e03cc6279d3063daac62267","module":"Init.Data.Rat.Lemmas","note":"Fractions are listed in the section as numbers the properties hold for.","pair_key":"76ca3cf5ff8ce0dc5dd4ef78e4c146c76066358bac0a4d6ea83c59c8f314b78c","path":"src/Init/Data/Rat/Lemmas.lean","proof_status":"proved","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Rat.mul_zero (a : Rat) : a * 0 = 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"33fc85e0b93eb72c36fabd4bdba7fe7c267d09400fee2af03992aa309df84cd9","prominence":"central","quote":{"exact":"Any number multiplied by 0 is 0. This is known as the"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"Property of 0 ","lead_in":true,"segments":[{"text":"Property of 0 "}]},"layer":"Any number multiplied by 0 is 0. This is known as the zero property of multiplication:[34] x ⋅ 0 = 0. {\\displaystyle x\\cdot 0=0.}","segments":[{"text":"Any number multiplied by 0 is 0. This is known as the zero property of multiplication:"},{"ref":"[34]"},{"text":" "},{"display":true,"tex":"x\\cdot 0=0."}]},"unresolved":null},{"absence":null,"basis":"bf68303348e00de1895ee1d699f2589cb99e4bf0341170ed63d76d0f5c31c62e","coverage":null,"id":"enwiki-20845-1375745567::In-text #bce87383","item":"In-text #bce87383","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"neg_one_mul","end_line":316,"library":"mathlib","line":316,"location_key":"bf68303348e00de1895ee1d699f2589cb99e4bf0341170ed63d76d0f5c31c62e","module":"Mathlib.Algebra.Ring.Defs","note":"In Lean minus x denotes the ring's additive inverse of x, so the article's cancelling sum is how that inverse is fixed.","pair_key":"2bc18d463511075191c049254cdd25331d82b9f38344552efced6b987f668933","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem neg_one_mul {α : Type u} [MulOneClass α] [HasDistribNeg α] (a : α) : -1 * a = -a"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.neg_eq_neg_one_mul","end_line":549,"library":"lean-core","line":546,"location_key":"96e624a7f486e62063249b87210d4d382596ba558e1d909dbfc189d64a1e0cd4","module":"Init.Data.Int.Lemmas","note":"The two sides of the equation are written in the opposite order from the article's.","pair_key":"9077b2792bffe4d876f4d5d744c4caa6357086d1d704e725d1f3fba5e1086d50","path":"src/Init/Data/Int/Lemmas.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.neg_eq_neg_one_mul (a : Int) : -a = -1 * a"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"3051083502a5687c63429d75cf564c02d86d84c0d18c7ca1b22d648a6c2ab952","prominence":"central","quote":{"exact":"−1 times any number is equal to the additive inverse of that"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"after":{"layer":" −1 times −1 is 1: ( − 1 ) ⋅ ( − 1 ) = 1. {\\displaystyle (-1)\\cdot (-1)=1.}","segments":[{"text":" −1 times −1 is 1: "},{"display":true,"tex":"(-1)\\cdot (-1)=1."}]},"before":{"layer":"Negation ","lead_in":true,"segments":[{"text":"Negation "}]},"layer":"−1 times any number is equal to the additive inverse of that number: ( − 1 ) ⋅ x = ( − x ) , {\\displaystyle (-1)\\cdot x=(-x),} where ( − x ) + x = 0. {\\displaystyle (-x)+x=0.}","segments":[{"text":"−1 times any number is equal to the additive inverse of that number: "},{"tex":"(-1)\\cdot x=(-x),"},{"text":" where "},{"tex":"(-x)+x=0."}]},"unresolved":null},{"absence":null,"basis":"d4b5afd200f8ef0205804c66a62ed5532b0ab455ea913db9cfe55767f29febe2","coverage":null,"id":"enwiki-20845-1375745567::In-text #f5dff623","item":"In-text #f5dff623","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"neg_mul_neg","end_line":292,"library":"mathlib","line":292,"location_key":"d4b5afd200f8ef0205804c66a62ed5532b0ab455ea913db9cfe55767f29febe2","module":"Mathlib.Algebra.Ring.Defs","note":"Lean states the sign rule for arbitrary factors; the article's equation is what it says when both factors are one.","pair_key":"b82e4b92edd0e4d31fc926bd2a9c808b0ed9c6a42ea3b076730464685ca24d3d","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem neg_mul_neg {α : Type u} [Mul α] [HasDistribNeg α] (a b : α) : -a * -b = a * b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"082f33abb4dd7e5967e891e9d3bc936fb4ebc4ac415bb95faa6fce238f2931d6","prominence":"central","quote":{"exact":"−1 times −1 is 1: ( − 1 ) ⋅ ( −"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"−1 times any number is equal to the additive inverse of that number: ( − 1 ) ⋅ x = ( − x ) , {\\displaystyle (-1)\\cdot x=(-x),} where ( − x ) + x = 0. {\\displaystyle (-x)+x=0.} ","segments":[{"text":"−1 times any number is equal to the additive inverse of that number: "},{"tex":"(-1)\\cdot x=(-x),"},{"text":" where "},{"tex":"(-x)+x=0."},{"text":" "}]},"layer":"−1 times −1 is 1: ( − 1 ) ⋅ ( − 1 ) = 1. {\\displaystyle (-1)\\cdot (-1)=1.}","segments":[{"text":"−1 times −1 is 1: "},{"display":true,"tex":"(-1)\\cdot (-1)=1."}]},"unresolved":null},{"absence":null,"basis":"af6da171ece3393731b402a60e8ea28336241225a633fbae80058d9294e2da80","coverage":null,"id":"enwiki-20845-1375745567::In-text #6cde6365","item":"In-text #6cde6365","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_one_div_cancel","end_line":338,"library":"mathlib","line":338,"location_key":"af6da171ece3393731b402a60e8ea28336241225a633fbae80058d9294e2da80","module":"Mathlib.Algebra.GroupWithZero.Units.Basic","note":"Lean writes the reciprocal as one divided by x, as the article does, and states it for any group with zero.","pair_key":"7e8d78ebdccee7dbdb8cec8e58512f188faedf744f9ecc75e65e8e104499f25c","path":"Mathlib/Algebra/GroupWithZero/Units/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_one_div_cancel {G₀ : Type*} [GroupWithZero G₀] {a : G₀} : a ≠ 0 → a * (1 / a) = 1"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_inv_cancel₀","end_line":228,"library":"mathlib","line":228,"location_key":"c3443f13c51ab2c61980a313a2dc4247c99a10ecd482a63b423440786762e7ec","module":"Mathlib.Algebra.GroupWithZero.Defs","note":"The reciprocal is written with the inversion operator rather than as one over x; both name the same element.","pair_key":"c512a89afa0297e31280832a11c3d3cab8538b45cb18c2d0f8fb729b717627b7","path":"Mathlib/Algebra/GroupWithZero/Defs.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_inv_cancel₀ {G₀ : Type u} [GroupWithZero G₀] {a : G₀} : a ≠ 0 → a * a⁻¹ = 1"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"fdebaeee78432b0078b990e8f5658ad1c53c49ac7edd5680b63afba1d08f8825","prominence":"central","quote":{"exact":"Every number x, except 0, has a multiplicative inverse, 1 x {\\displaystyle"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"Inverse element ","lead_in":true,"segments":[{"text":"Inverse element "}]},"layer":"Every number x, except 0, has a multiplicative inverse, 1 x {\\displaystyle {\\frac {1}{x}}} , such that x ⋅ ( 1 x ) = 1 {\\displaystyle x\\cdot \\left({\\frac {1}{x}}\\right)=1} .","segments":[{"text":"Every number x, except 0, has a multiplicative inverse, "},{"tex":"\\frac {1}{x}"},{"text":" , such that "},{"tex":"x\\cdot \\left({\\frac {1}{x}}\\right)=1"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"7bc97708deeccf5e17403734e9cb6ee266eb7c01c5697d18cfb6dd4e51c2fbf8","coverage":null,"id":"enwiki-20845-1375745567::In-text #27cffdbd","item":"In-text #27cffdbd","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_lt_mul_of_pos_left","end_line":234,"library":"mathlib","line":233,"location_key":"7bc97708deeccf5e17403734e9cb6ee266eb7c01c5697d18cfb6dd4e51c2fbf8","module":"Mathlib.Algebra.Order.GroupWithZero.Defs","note":"Lean phrases the comparison with the strict less-than sign and multiplies on the left, as the article's product does.","pair_key":"7f14d8f28645bee7ee804d7adda586d244c4421dd7021b6b1b5d62f33f9d4b6b","path":"Mathlib/Algebra/Order/GroupWithZero/Defs.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_lt_mul_of_pos_left {α : Type*} [Mul α] [Zero α] [Preorder α] {a b c : α} [PosMulStrictMono α] : b < c → 0 < a → a * b < a * c"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a66bb5d65a819b0bd64cd216aec0944beb6d09ca2d9fc28c7d8b7cbdef1ed5b2","prominence":"central","quote":{"exact":"Multiplication by a positive number preserves the order:For a > 0, if"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"Order preservation ","lead_in":true,"segments":[{"text":"Order preservation "}]},"layer":"Multiplication by a positive number preserves the order:For a > 0, if b > c, then ab > ac.","segments":[{"text":"Multiplication by a positive number preserves the order:For a > 0, if b > c, then ab > ac."}]},"unresolved":null},{"absence":null,"basis":"e8788acca18ea5f427889914bf5fd94dadfda4be1aafbfdc064de66838571285","coverage":null,"id":"enwiki-20845-1375745567::In-text #2d2f8e46","item":"In-text #2d2f8e46","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_lt_mul_of_neg_left","end_line":220,"library":"mathlib","line":212,"location_key":"e8788acca18ea5f427889914bf5fd94dadfda4be1aafbfdc064de66838571285","module":"Mathlib.Algebra.Order.Ring.Unbundled.Basic","note":"Lean calls the negative factor c and writes the comparison with the strict less-than sign.","pair_key":"81e2bba609f681644e4d0a7689b8938beea70344353e64b2acb609c370e7c31f","path":"Mathlib/Algebra/Order/Ring/Unbundled/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_lt_mul_of_neg_left {R : Type u} [Semiring R] [PartialOrder R] {a b c : R} [ExistsAddOfLE R] [PosMulStrictMono R] [AddRightStrictMono R] [AddRightReflectLT R] : b < a → c < 0 → c * a < c * b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"38b400b20e696a570cf69f992fe81b67787e3d7d0dba991bb95cc5d3b1ed04f1","prominence":"central","quote":{"exact":"Multiplication by a negative number reverses the order:For a < 0, if"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"Multiplication by a negative number reverses the order:For a < 0, if b > c, then ab < ac.","segments":[{"text":"Multiplication by a negative number reverses the order:For a < 0, if b > c, then ab < ac."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":4,"queries":4,"sha256":"e9c392e0ea587b848559428f11b1ba8d612b33e830cd07fa872a322f954733e3"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #9b260643","item":"In-text #9b260643","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"0380124e15ccd55cd1b6c33540dba840990a9416e053ce7bf58c8f1e5eb1b19f","prominence":"central","quote":{"exact":"The complex numbers do not have an ordering that is compatible with"},"quote_capped":true,"section":["Properties"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"The complex numbers do not have an ordering that is compatible with both addition and multiplication.","segments":[{"text":"The complex numbers do not have an ordering that is compatible with both addition and multiplication."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"760d5c7eafa38c6c9303fa483d333af9b996c3db149db2771ee17d6a5b1d4fcc"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #021f4a38","item":"In-text #021f4a38","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"6c1166ebae60194a401219829914aea526b66159210705f3500085c2d66eb271","prominence":"central","quote":{"exact":"For example, multiplication is not, in general, commutative for matrices"},"quote_capped":false,"section":["Properties"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"after":{"layer":" and quaternions.","segments":[{"text":" and quaternions."}]},"layer":"For example, multiplication is not, in general, commutative for matrices","segments":[{"text":"For example, multiplication is not, in general, commutative for matrices"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":4,"queries":5,"sha256":"e4e7a525889096e1cebd2d85d001d7401e792a61493529bbec8c5bb186267726"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #a87bc00d","item":"In-text #a87bc00d","kind":"theorem","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Quaternion.instIsCentral","end_line":166,"library":"tauceti","line":165,"location_key":"b19b145bba597d3a0e572887824f945ca28e3d189835a0860988c3442cd9c90e","module":"TauCeti.Algebra.Central.Quaternion","note":"The instance pins the centre of the quaternions down to the scalars of the base ring; the failure of commutativity follows only once one adds that the quaternions are bigger than those scalars.","pair_key":"ac17ae644184648461731808c1286883a42edf8c083cdbb4141e41b62e202072","path":"TauCeti/Algebra/Central/Quaternion.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"instance TauCeti.Quaternion.instIsCentral {R : Type*} [CommRing R] [NoZeroDivisors R] [NeZero 2] : Algebra.IsCentral R (Quaternion R)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"8919ccb70e0db45aaed32c58c9e14eec0c89737904d99b4f864abd534c9cfe9e","prominence":"central","quote":{"exact":"quaternions.[34]"},"quote_capped":false,"section":["Properties"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"For example, multiplication is not, in general, commutative for matrices and ","segments":[{"text":"For example, multiplication is not, in general, commutative for matrices and "}]},"layer":"quaternions.[34]","segments":[{"text":"quaternions."},{"ref":"[34]"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":5,"sha256":"689e3b0320f5b9388c2d7cb5b37c9022fd19c39914f25ac14b79b8abe2732009"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #2491749b","item":"In-text #2491749b","kind":"theorem","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Octonion.left_alternative","end_line":646,"library":"tauceti","line":638,"location_key":"d45120deb7db21995106e761fc9ed192bb9bacefb4b925b63bfacae18beb37b9","module":"TauCeti.Algebra.Octonion.Basic","note":"The lemma records a rebracketing of octonion products that does hold when a factor is repeated; it asserts nothing about triples whose two bracketings differ.","pair_key":"d03513cc578790d2e75fd1140ca1f0c6b8c14ca2c5bb42506cddc9d232e26ee0","path":"TauCeti/Algebra/Octonion/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Octonion.left_alternative {R : Type*} [CommRing R] (x y : TauCeti.Octonion R) : x * x * y = x * (x * y)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"cf997e8f1c95ef4af93db69c8d516c84f69b5875c2f86b5eba64d70ac90b3142","prominence":"central","quote":{"exact":"Hurwitz's theorem shows that for the hypercomplex numbers of dimension 8 or"},"quote_capped":true,"section":["Properties"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"Hurwitz's theorem shows that for the hypercomplex numbers of dimension 8 or greater, including the octonions, sedenions, and trigintaduonions, multiplication is generally not associative.","segments":[{"text":"Hurwitz's theorem shows that for the hypercomplex numbers of dimension 8 or greater, including the octonions, sedenions, and trigintaduonions, multiplication is generally not associative."}]},"unresolved":null},{"absence":null,"basis":"702602e4641e5d2d688fca0913e6b32bbb8910f55497c528bea5a80b8aee2749","coverage":{"basis":false,"bundle_key":"e8bb1b546a600b08034ac5a00b18bc1d07e66867c23c2bb4593c675642bdfbc8","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"b8e1e4ee3b714c14481559a473a4bef4e196ead177f47356884005c6a907cc55","text":"x × 0 = 0"},{"id":"c2","part":"5188f9890bc19503838b3960fbd33992e478e6d73f6d1dba8e7c9670bb50e954","text":"x × S(y) = (x × y) + x, where S(y) is the successor of y"}],"parts":["b8e1e4ee3b714c14481559a473a4bef4e196ead177f47356884005c6a907cc55","5188f9890bc19503838b3960fbd33992e478e6d73f6d1dba8e7c9670bb50e954"],"relation":"closeMatch","status":"formalized"},"id":"enwiki-20845-1375745567::In-text #2a4ea9b1","item":"In-text #2a4ea9b1","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.mul","end_line":1919,"library":"lean-core","line":1917,"location_key":"702602e4641e5d2d688fca0913e6b32bbb8910f55497c528bea5a80b8aee2749","module":"Init.Prelude","note":"Lean defines multiplication on the naturals by recursion on the second argument: it returns zero at zero, and at a successor it adds the first argument to the previous value.","pair_key":"65ff761c58bf9acaf51abde7eade8b4d3fec878979f87ff33bdcbddb9626714f","path":"src/Init/Prelude.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Nat.mul : Nat → Nat → Nat"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.mul_zero","end_line":192,"library":"lean-core","line":191,"location_key":"b8e1e4ee3b714c14481559a473a4bef4e196ead177f47356884005c6a907cc55","module":"Init.Data.Nat.Basic","note":"The lemma unfolds Lean's multiplication at zero on the right, stating the defining equation of the library's operation.","pair_key":"38cf760d6affbff2d153735c7cdba27115fdaa93094fbbb725083629ec99efb1","path":"src/Init/Data/Nat/Basic.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.mul_zero (n : Nat) : n * 0 = 0"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.mul_succ","end_line":195,"library":"lean-core","line":194,"location_key":"5188f9890bc19503838b3960fbd33992e478e6d73f6d1dba8e7c9670bb50e954","module":"Init.Data.Nat.Basic","note":"The lemma unfolds Lean's multiplication at the successor of the second argument, stating the recursion step of the library's operation.","pair_key":"f4d29ef3b6a3ba29944af4a61df814b5579bf63d62c9018d413f82628162574b","path":"src/Init/Data/Nat/Basic.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.mul_succ (n m : Nat) : n * m.succ = n * m + n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"0eb958c17267f1199fdc64019070fca55b9bce118db58b1566fd94b8665d0cc8","prominence":"central","quote":{"exact":"x × 0 = 0 {\\displaystyle x\\times 0=0} x × S ("},"quote_capped":true,"section":["Axioms"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"Peano arithmetic has two axioms for multiplication: ","lead_in":true,"segments":[{"text":"Peano arithmetic has two axioms for multiplication: "}]},"layer":"x × 0 = 0 {\\displaystyle x\\times 0=0} x × S ( y ) = ( x × y ) + x {\\displaystyle x\\times S(y)=(x\\times y)+x}","segments":[{"tex":"x\\times 0=0"},{"text":" "},{"tex":"x\\times S(y)=(x\\times y)+x"}]},"unresolved":null},{"absence":null,"basis":"654612395432373c82e06cae4bc0e8d31e0ee568767fa6f331e1b395741b2c38","coverage":null,"id":"enwiki-20845-1375745567::In-text #cc5dd76d","item":"In-text #cc5dd76d","kind":"notation","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.instSuccOrder","end_line":32,"library":"mathlib","line":31,"location_key":"654612395432373c82e06cae4bc0e8d31e0ee568767fa6f331e1b395741b2c38","module":"Mathlib.Order.SuccPred.Nat","note":"Lean packages the successor operation on the naturals as an order instance, carrying with the operation the proofs that its value is the least natural above the argument.","pair_key":"a877b006434c96c0bd9a51c59b6e055ef57f9f1572f649ca8d674f66ae11354a","path":"Mathlib/Order/SuccPred/Nat.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Nat.instSuccOrder : SuccOrder ℕ"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Order.succ","end_line":139,"library":"mathlib","line":138,"location_key":"4d014bcb4c1e498514da4623149260a98be2d1801049f633368920259aac4d4b","module":"Mathlib.Order.SuccPred.Basic","note":"The operation is defined for any preordered type that carries a successor structure, which is wider than the naturals of the passage (PD1).","pair_key":"3e919dd32e1c1a2e5da5216b34cc0de257a921a74aee9c0dc5af533970060495","path":"Mathlib/Order/SuccPred/Basic.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Order.succ {α : Type*} [Preorder α] [SuccOrder α] : α → α"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.succ_eq_succ","end_line":52,"library":"mathlib","line":51,"location_key":"84e59622318e0a3b0d20f38a5851db114b06c6c9b3e07df2aebdf97ec9bbfc5a","module":"Mathlib.Order.SuccPred.Nat","note":"It only identifies the order-theoretic successor on the naturals with the constructor successor, a link between two spellings rather than a statement of what S denotes.","pair_key":"a6eba9b6b12b2ea5a3a736e406707cd2e4317c818f08807ffc99f110a890db68","path":"Mathlib/Order/SuccPred/Nat.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.succ_eq_succ : Order.succ = Nat.succ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d06cd9bb0c42dec54b68be441ce476eef75316d22166ccb2520b52e34d6741ce","prominence":"supporting","quote":{"exact":"Here S(y) represents the successor of y; i.e., the natural number that"},"quote_capped":true,"section":["Axioms"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"Here S(y) represents the successor of y; i.e., the natural number that follows y.","segments":[{"text":"Here S(y) represents the successor of y; i.e., the natural number that follows y."}]},"unresolved":null},{"absence":null,"basis":"58e93f156506ef0945d8a56474cca8f38740f453a5a3363032006822d2d830ee","coverage":null,"id":"enwiki-20845-1375745567::In-text #dcd921b4","item":"In-text #dcd921b4","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.instMulOneClass","end_line":28,"library":"mathlib","line":26,"location_key":"58e93f156506ef0945d8a56474cca8f38740f453a5a3363032006822d2d830ee","module":"Mathlib.Algebra.Group.Nat.Defs","note":"Lean packages the two identity laws for the unit of the naturals into a single class instance that also carries the multiplication and the unit themselves.","pair_key":"1954c6ec64876b7c04aa316b04279f50d96c57cbc313768f99c24644d0e69551","path":"Mathlib/Algebra/Group/Nat/Defs.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Nat.instMulOneClass : MulOneClass ℕ"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.mul_one","end_line":217,"library":"lean-core","line":216,"location_key":"82acd134d66f4b5ad772cd63d4ef1c589c45fd4a894c44f479922d8915095bba","module":"Init.Data.Nat.Basic","note":"The lemma covers the right-hand identity law only, which is the half of the passage that the article's own computation shows.","pair_key":"554d09307e0b3f9dcdc7f1259b83c6eb6198c665047fc30beca11404d9fda67b","path":"src/Init/Data/Nat/Basic.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.mul_one (n : Nat) : n * 1 = n"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.one_mul","end_line":220,"library":"lean-core","line":219,"location_key":"bebc2f65f30086b00983143c5f51fbf4387bde7fe38cf8423e8c5e43bc09a9b0","module":"Init.Data.Nat.Basic","note":"The lemma covers the left-hand identity law only.","pair_key":"bd6794b81051ab9e4ecb11042a1e93d4e783a495ebc41596947e82b3a26bf3c9","path":"src/Init/Data/Nat/Basic.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.one_mul (n : Nat) : 1 * n = n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"589314f6be570b6530addd521f1067c1d9acd31bedfea45421d744e7cd4a5a7d","prominence":"central","quote":{"exact":"For instance, S(0), denoted by 1, is a multiplicative identity because"},"quote_capped":false,"section":["Axioms"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"after":{"layer":" x × 1 = x × S ( 0 ) = ( x × 0 ) + x = 0 + x = x . {\\displaystyle x\\times 1=x\\times S(0)=(x\\times 0)+x=0+x=x.}","segments":[{"text":" "},{"display":true,"tex":"x\\times 1=x\\times S(0)=(x\\times 0)+x=0+x=x."}]},"layer":"For instance, S(0), denoted by 1, is a multiplicative identity because","segments":[{"text":"For instance, S(0), denoted by 1, is a multiplicative identity because"}]},"unresolved":null},{"absence":null,"basis":"d751bd5fe107128b8d5898da61e0054a89a99d7fbc6a0ed887737f1aa4d7f97f","coverage":null,"id":"enwiki-20845-1375745567::In-text #6d350ecd","item":"In-text #6d350ecd","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.mul_one","end_line":217,"library":"lean-core","line":216,"location_key":"d751bd5fe107128b8d5898da61e0054a89a99d7fbc6a0ed887737f1aa4d7f97f","module":"Init.Data.Nat.Basic","note":"The declaration states that a natural number times the unit is that number, which is what the chain asserts from its first term to its last.","pair_key":"9360fe04391049071941189d59125bbd83424c566a2e1849ed48812f7804cf3b","path":"src/Init/Data/Nat/Basic.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.mul_one (n : Nat) : n * 1 = n"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.mul_succ","end_line":195,"library":"lean-core","line":194,"location_key":"5f6b3ea3ac2d822ddd3771c7610967efe994183e93ebdf9c6f50dd05bcb6bbe0","module":"Init.Data.Nat.Basic","note":"It justifies one middle step of the displayed computation, rewriting the product with a successor, without giving the chain's end-to-end equality.","pair_key":"fb59244ca5db04ace260a056b7dc8029869d3fc84a3eb2ebde6b7d78d1b0dd65","path":"src/Init/Data/Nat/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.mul_succ (n m : Nat) : n * m.succ = n * m + n"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.zero_add","end_line":133,"library":"lean-core","line":131,"location_key":"92a18299a0355e0efd6d3e58a30bad21d736024057b2d9f5344fa1a134c2ff1d","module":"Init.Data.Nat.Basic","note":"It justifies the last middle step of the computation, dropping a zero summand, without giving the chain's end-to-end equality.","pair_key":"d201c0efd593cec5d5c74dd8b1a17657345fb31c8eb6ca7e958e078c061d1e5f","path":"src/Init/Data/Nat/Basic.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.zero_add (n : Nat) : 0 + n = n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"4781f4c4762c60a952d56ef3066d8e453cd47d7fe7f11439bdba89e83f0117a3","prominence":"supporting","quote":{"exact":"x × 1 = x × S ( 0 ) = ("},"quote_capped":true,"section":["Axioms"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"For instance, S(0), denoted by 1, is a multiplicative identity because ","segments":[{"text":"For instance, S(0), denoted by 1, is a multiplicative identity because "}]},"layer":"x × 1 = x × S ( 0 ) = ( x × 0 ) + x = 0 + x = x . {\\displaystyle x\\times 1=x\\times S(0)=(x\\times 0)+x=0+x=x.}","segments":[{"display":true,"tex":"x\\times 1=x\\times S(0)=(x\\times 0)+x=0+x=x."}]},"unresolved":null},{"absence":null,"basis":"e6bce6d52b842c14f590de1e35b596b8fa37ccac625a118801e55ff81c96bd24","coverage":null,"id":"enwiki-20845-1375745567::In-text #1591e6d7","item":"In-text #1591e6d7","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Int","end_line":58,"library":"lean-core","line":46,"location_key":"e6bce6d52b842c14f590de1e35b596b8fa37ccac625a118801e55ff81c96bd24","module":"Init.Data.Int.Basic","note":"Lean writes each integer either as a natural number or as the negation of a successor of a natural number, so the same numbers are carried by a tagged ℕ instead of by a class of pairs.","pair_key":"8683f1d3e5ff4f5f25f9aeb87a6f22a1bf89733802d91d60fcb7177e65ee3b22","path":"src/Init/Data/Int/Basic.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"inductive Int"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Algebra.GrothendieckAddGroup","end_line":34,"library":"mathlib","line":34,"location_key":"a1a1c8c8e80128d6fd2ed161e554827b5f1fc3f0bdff4c0e0ba5c6200f49898a","module":"Mathlib.GroupTheory.MonoidLocalization.GrothendieckGroup","note":"The construction quotients pairs drawn from any additive commutative monoid, so it is wider than the ℕ of the passage, and at ℕ it returns precisely the classes of ordered pairs of natural numbers (PD1).","pair_key":"a05a82a941c439ea99c7aa87297a178b9656401575c360c31df0ce88c6dfa83f","path":"Mathlib/GroupTheory/MonoidLocalization/GrothendieckGroup.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"abbrev Algebra.GrothendieckAddGroup (M : Type u_1) [AddCommMonoid M] : Type u_1"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"1eb9f7cf20feaaf92c0efe44d90c5db9f9b88743c6da01019c4cd50e71e937d4","prominence":"central","quote":{"exact":"The axioms for integers typically define them as equivalence classes of ordered"},"quote_capped":true,"section":["Axioms"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"The axioms for integers typically define them as equivalence classes of ordered pairs of natural numbers.","segments":[{"text":"The axioms for integers typically define them as equivalence classes of ordered pairs of natural numbers."}]},"unresolved":null},{"absence":null,"basis":"c731ec5b0279567e6b477d841486301e0e981f19f78944635c2fc1404a877cd3","coverage":null,"id":"enwiki-20845-1375745567::In-text #2fba8147","item":"In-text #2fba8147","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.subNatNat","end_line":149,"library":"lean-core","line":146,"location_key":"c731ec5b0279567e6b477d841486301e0e981f19f78944635c2fc1404a877cd3","module":"Init.Data.Int.Basic","note":"The declaration takes the two natural numbers as separate arguments rather than as one ordered pair, and returns their difference as an integer, negative when the second exceeds the first.","pair_key":"16f4b473013c2c2b44db0b89909a26f60b95a69d7cf8186d8939bcbd9136c39d","path":"src/Init/Data/Int/Basic.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Int.subNatNat : Nat → Nat → Int"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.subNatNat_eq_coe","end_line":361,"library":"lean-core","line":353,"location_key":"99d3ab08157f9fd8da904b0e1c5bd74fd44dd5d29dcc96d2cc226d8d522082d6","module":"Init.Data.Int.Lemmas","note":"The lemma unfolds the library's map on two naturals into the difference of their images in the integers.","pair_key":"1126d5132f20a2bf1dcf3d4f6570f8e7fa46fedffa803a1ec89608fb70956102","path":"src/Init/Data/Int/Lemmas.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.subNatNat_eq_coe {m n : Nat} : Int.subNatNat m n = ↑m - ↑n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"1dd2ef12aff929aa98c38d1db94517e3833f595d393be9f54f80bc4740508bd1","prominence":"supporting","quote":{"exact":"The model is based on treating (x,y) as equivalent to x −"},"quote_capped":true,"section":["Axioms"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"The model is based on treating (x,y) as equivalent to x − y when x and y are treated as integers.","segments":[{"text":"The model is based on treating (x,y) as equivalent to x − y when x and y are treated as integers."}]},"unresolved":null},{"absence":null,"basis":"c530946ff2ea36888ea18ff8ab5ce1316a978df94e9ebb59015e4d85ab7cdabb","coverage":null,"id":"enwiki-20845-1375745567::In-text #8ea38f9c","item":"In-text #8ea38f9c","kind":"example","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.subNatNat_eq_coe","end_line":361,"library":"lean-core","line":353,"location_key":"c530946ff2ea36888ea18ff8ab5ce1316a978df94e9ebb59015e4d85ab7cdabb","module":"Init.Data.Int.Lemmas","note":"Its binders m and n range over ℕ, which is what the article's pairs are built from, and its value lies in ℤ, so the integer -1 the passage names is the value obtained.","pair_key":"26eb4dba3b4421cabf63fd16aee094a717d28398b8af9c6c791e79429a3d1447","path":"src/Init/Data/Int/Lemmas.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.subNatNat_eq_coe {m n : Nat} : Int.subNatNat m n = ↑m - ↑n"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"AddLocalization.mk_eq_mk_iff'","end_line":780,"library":"mathlib","line":780,"location_key":"38f565beba55da0a2321440adbe29e697c03a820b5e092ab607b406f7276fa9d","module":"Mathlib.GroupTheory.MonoidLocalization.Basic","note":"It settles that the two pairs agree, and says nothing about the value -1 itself.","pair_key":"92468593655c5c75fb26acfd1178aa38f054a9247ea10685288916788b213f69","path":"Mathlib/GroupTheory/MonoidLocalization/Basic.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem AddLocalization.mk_eq_mk_iff' {α : Type*} [AddCommMonoid α] [IsCancelAdd α] {s : AddSubmonoid α} {a₁ b₁ : α} {a₂ b₂ : ↥s} : AddLocalization.mk a₁ a₂ = AddLocalization.mk b₁ b₂ ↔ ↑b₂ + a₁ = ↑a₂ + b₁"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"029144349afaef71d8759774d7a4daa5ba46d404404d5b0cd2ff55cdf9e96ee3","prominence":"supporting","quote":{"exact":"Thus both (0,1) and (1,2) are equivalent to −1."},"quote_capped":false,"section":["Axioms"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"Thus both (0,1) and (1,2) are equivalent to −1.","segments":[{"text":"Thus both (0,1) and (1,2) are equivalent to −1."}]},"unresolved":null},{"absence":null,"basis":"28520808e16e60f8c9af0551b56c6c39883381da27c0221ac183ac062dc82158","coverage":null,"id":"enwiki-20845-1375745567::In-text #e9cd978d","item":"In-text #e9cd978d","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Int.mul","end_line":191,"library":"lean-core","line":186,"location_key":"28520808e16e60f8c9af0551b56c6c39883381da27c0221ac183ac062dc82158","module":"Init.Data.Int.Basic","note":"Lean carries an integer as a natural or as the negation of a successor instead of as a class of pairs of naturals; the operation on ℤ it fixes is the one the displayed formula lays down.","pair_key":"bbc8de5124b0de4d211a46b63a48449632d2d7058e91762a059ac717186092b3","path":"src/Init/Data/Int/Basic.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Int.mul : Int → Int → Int"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"Algebra.GrothendieckAddGroup.instMul","end_line":95,"library":"tauceti","line":92,"location_key":"7fe2139848b345d278237f6e5b13c072640cf65a37d62c9805e9a22683bd1015","module":"TauCeti.RingTheory.GrothendieckRing","note":"The product is put on the formal differences of any such semiring; the pairs of naturals that give the integers are the case the passage writes out.","pair_key":"a3abcc5fceb0242ac2329f76ac4abda641fa6ba74877c0b19783fb00c3efa2b8","path":"TauCeti/RingTheory/GrothendieckRing.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"instance Algebra.GrothendieckAddGroup.instMul {S : Type*} [NonUnitalNonAssocSemiring S] : Mul (Algebra.GrothendieckAddGroup S)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d4622594c4c51ef87fd310494b097de733bec7f2fbc9bb437b710221a93170a7","prominence":"central","quote":{"exact":"The multiplication axiom for integers defined this way is ( x p"},"quote_capped":true,"section":["Axioms"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"The multiplication axiom for integers defined this way is ( x p , x m ) × ( y p , y m ) = ( x p × y p + x m × y m , x p × y m + x m × y p ) . {\\displaystyle (x_{p},\\,x_{m})\\times (y_{p},\\,y_{m})=(x_{p}\\times y_{p}+x_{m}\\times y_{m},\\;x_{p}\\times y_{m}+x_{m}\\times y_{p}).}","segments":[{"text":"The multiplication axiom for integers defined this way is "},{"display":true,"tex":"(x_{p},\\,x_{m})\\times (y_{p},\\,y_{m})=(x_{p}\\times y_{p}+x_{m}\\times y_{m},\\;x_{p}\\times y_{m}+x_{m}\\times y_{p})."}]},"unresolved":null},{"absence":null,"basis":"4d0f350530dbaf20ff38c1579e41201544d13c51f0af6ac47dab7b0c2bf0891d","coverage":null,"id":"enwiki-20845-1375745567::In-text #7cd0c042","item":"In-text #7cd0c042","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.neg_mul_neg","end_line":523,"library":"lean-core","line":523,"location_key":"4d0f350530dbaf20ff38c1579e41201544d13c51f0af6ac47dab7b0c2bf0891d","module":"Init.Data.Int.Lemmas","note":"The passage arrives at the rule through the computation on pairs, while the declaration states the rule itself in ℤ.","pair_key":"f38765290f79fd772821ed6e103e8dc81d769af8e15666726c4ef9ccb5e5acb3","path":"src/Init/Data/Int/Lemmas.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.neg_mul_neg (a b : Int) : -a * -b = a * b"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"neg_mul_neg","end_line":292,"library":"mathlib","line":292,"location_key":"22bc16ee4301e11ee1dec66f7a6edc6b5938bb503c33c53bd7737b6676dba4f0","module":"Mathlib.Algebra.Ring.Defs","note":"It is stated for any type with a multiplication and a negation that distributes over it, the integers among them.","pair_key":"a0f36b983e1f9246711af0b7e6e10c5f45d6519c0a53c408e97d2619f1e24f16","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem neg_mul_neg {α : Type u} [Mul α] [HasDistribNeg α] (a b : α) : -a * -b = a * b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"dc2060c75cda0e8f0317c8d50e2051dc2393cb81eb341e5386b56255ffc2fa6e","prominence":"central","quote":{"exact":"The rule that −1 × −1 = 1 can then be deduced"},"quote_capped":true,"section":["Axioms"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"The rule that −1 × −1 = 1 can then be deduced from ( 0 , 1 ) × ( 0 , 1 ) = ( 0 × 0 + 1 × 1 , 0 × 1 + 1 × 0 ) = ( 1 , 0 ) . {\\displaystyle (0,1)\\times (0,1)=(0\\times 0+1\\times 1,\\,0\\times 1+1\\times 0)=(1,0).}","segments":[{"text":"The rule that −1 × −1 = 1 can then be deduced from "},{"display":true,"tex":"(0,1)\\times (0,1)=(0\\times 0+1\\times 1,\\,0\\times 1+1\\times 0)=(1,0)."}]},"unresolved":null},{"absence":null,"basis":"a3fda11afc27f733b6172a448e86340221cf326ba61f2fdc74973112f936099d","coverage":null,"id":"enwiki-20845-1375745567::In-text #9906c4bd","item":"In-text #9906c4bd","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.mul","end_line":1919,"library":"lean-core","line":1917,"location_key":"a3fda11afc27f733b6172a448e86340221cf326ba61f2fdc74973112f936099d","module":"Init.Prelude","note":"ℕ is Lean's type of the non-negative integers the passage speaks of, and this is the recursion on the successor that the Peano route gives for their product.","pair_key":"b203e60687b6984fe43ec656d7c8d427873a14211b23ffb2aaf90d5e51e7342b","path":"src/Init/Prelude.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Nat.mul : Nat → Nat → Nat"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Fintype.card_prod","end_line":58,"library":"mathlib","line":56,"location_key":"6671b2d4bd7a8c27c71dccb9cbae52c72c3ec26c4f0f183b02dbd2278b74e7ec","module":"Mathlib.Data.Fintype.Prod","note":"The two sizes are natural numbers, Lean's non-negative integers, and the theorem puts their product as the size of the product set, which is the counting route through cardinalities.","pair_key":"17bfaecd147efbd1fa59a97cc1e19d88efc641685f54dc891b3f8a7dd6102701","path":"Mathlib/Data/Fintype/Prod.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Fintype.card_prod (α : Type*) (β : Type*) [Fintype α] [Fintype β] : Fintype.card (α × β) = Fintype.card α * Fintype.card β"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Cardinal.mul_def","end_line":276,"library":"mathlib","line":275,"location_key":"f1cef19636d3b0fba293c809f317c0a1b7f35715023790dd12d0664d1c20f512","module":"Mathlib.SetTheory.Cardinal.Defs","note":"Cardinal multiplication is fixed here for every cardinal; the finite ones are ℕ, the non-negative integers the passage counts with.","pair_key":"776b1b752120589094b802b4bc59f81710328e12125a20732f0c0e48b4aef9eb","path":"Mathlib/SetTheory/Cardinal/Defs.lean","proof_status":"proved","rank":3,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.mul_def (α β : Type u) : Cardinal.mk α * Cardinal.mk β = Cardinal.mk (α × β)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"9077dce172e84ec2fe45c1d64a61cf02ecbf1f9cb886cfef1e2141e3891c4602","prominence":"central","quote":{"exact":"The product of non-negative integers can be defined with set theory using"},"quote_capped":true,"section":["Multiplication with set theory"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"The product of non-negative integers can be defined with set theory using cardinal numbers or the Peano axioms.","segments":[{"text":"The product of non-negative integers can be defined with set theory using cardinal numbers or the Peano axioms."}]},"unresolved":null},{"absence":null,"basis":"4c6a34cac381cc5ca6faf49327d24c8e96bd44338f9cc293624dcd1ee9e9dc0f","coverage":null,"id":"enwiki-20845-1375745567::In-text #b853e6ac","item":"In-text #b853e6ac","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.cauchy_mul","end_line":151,"library":"mathlib","line":150,"location_key":"14399954a1e68753d6a06e9f1c9e532ee39f335264d10e753b19676151b4d089","module":"Mathlib.Basic.Real.Basic","note":"Lean's ℝ carries each real as a class of Cauchy sequences of rationals, and this theorem puts the product of two reals as the product taken in that completion of ℚ.","pair_key":"20f3d870f7601f95024b12863f6c4a6fd52a520790d22b1cec25cb6c713ff8b0","path":"Mathlib/Basic/Real/Basic.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.cauchy_mul (a b : ℝ) : (a * b).cauchy = a.cauchy * b.cauchy"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"CauSeq.Completion.instMulCauchy","end_line":87,"library":"mathlib","line":86,"location_key":"4c6a34cac381cc5ca6faf49327d24c8e96bd44338f9cc293624dcd1ee9e9dc0f","module":"Mathlib.Algebra.Order.CauSeq.Completion","note":"The instance puts a product on the completion of any ring carrying an absolute value; the rationals are the case the passage uses.","pair_key":"61dc70def5ae97167a8c930cf9fe641a6be0fd3e8269179b25d870e1a4bf2629","path":"Mathlib/Algebra/Order/CauSeq/Completion.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance CauSeq.Completion.instMulCauchy {α : Type*} [Field α] [LinearOrder α] [IsStrictOrderedRing α] {β : Type*} [Ring β] {abv : β → α} [IsAbsoluteValue abv] : Mul (CauSeq.Completion.Cauchy abv)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2e5c77e64af62bd716bd524094e7dc8da3fbdfa5decd248a76b77f15e0171401","prominence":"central","quote":{"exact":"The product of real numbers is defined in terms of products of"},"quote_capped":true,"section":["Multiplication with set theory"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"after":{"layer":"; see construction of the real numbers.","segments":[{"text":"; see construction of the real numbers."}]},"layer":"The product of real numbers is defined in terms of products of rational numbers","segments":[{"text":"The product of real numbers is defined in terms of products of rational numbers"}]},"unresolved":null},{"absence":null,"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #ef1e767d","item":"In-text #ef1e767d","kind":"theorem","locations":[],"outcome":"unresolved","passage_ends_in_suffix":false,"passage_key":"cb1c7e986073999739deb7213a477d114c2d8dbf78574299b58deab02076d66e","prominence":"supporting","quote":{"exact":"There are many sets that, under the operation of multiplication, satisfy the"},"quote_capped":true,"section":["Multiplication in group theory"],"status":null,"subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"There are many sets that, under the operation of multiplication, satisfy the axioms that define group structure.","segments":[{"text":"There are many sets that, under the operation of multiplication, satisfy the axioms that define group structure."}]},"unresolved":{"challenge":"survived"}},{"absence":null,"basis":"cc8dd5c6ef3974d175274b3ea557f4303ca310f123725426f250eb4eebdd4fbc","coverage":null,"id":"enwiki-20845-1375745567::In-text #4ef3590d","item":"In-text #4ef3590d","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Group","end_line":34,"library":"mathlib","line":33,"location_key":"cc8dd5c6ef3974d175274b3ea557f4303ca310f123725426f250eb4eebdd4fbc","module":"Mathlib.Algebra.Group.Defs","note":"Lean packs the operation, the unit and the inversion with their laws as fields of a single class, and the closure of the operation is carried by its type G → G → G rather than written as a separate law; the division field is packaging.","pair_key":"e391643f7d1fc942d4c6c5b2fa7238a5403214c276f7209a182736f00b8a2688","path":"Mathlib/Algebra/Group/Defs.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class Group : Type u_2 → Type u_2"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"03cf7ac9fc6b42b4da648d5646dedc53beff86abcd9c200aabf511e72f8a1afa","prominence":"central","quote":{"exact":"These axioms are closure, associativity, and the inclusion of an identity element"},"quote_capped":true,"section":["Multiplication in group theory"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"These axioms are closure, associativity, and the inclusion of an identity element and inverses.","segments":[{"text":"These axioms are closure, associativity, and the inclusion of an identity element and inverses."}]},"unresolved":null},{"absence":null,"basis":"2e869794c00d858fe19c0cb404d52f18686846c7b410cd0747486954cff45eeb","coverage":null,"id":"enwiki-20845-1375745567::In-text #6bd03c95","item":"In-text #6bd03c95","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Units.instGroup","end_line":261,"library":"mathlib","line":260,"location_key":"2e869794c00d858fe19c0cb404d52f18686846c7b410cd0747486954cff45eeb","module":"Mathlib.Algebra.Group.Units.Defs","note":"Lean reaches this group by resolution from ℚ's field instance to its monoid and then to the units, and a unit of ℚ is a nonzero rational packaged with its inverse, so the carrier is the set the passage names.","pair_key":"7f0838615d763cf2ca4f59b5d8c22f9a71f7efb1ad3e61b71cefebb74db5a187","path":"Mathlib/Algebra/Group/Units/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Units.instGroup {α : Type u} [Monoid α] : Group αˣ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a4723c8c99b832fff520e42f667b2bb3cba2fde47b0767ba51499058ab36ec31","prominence":"central","quote":{"exact":"A simple example is the set of non-zero rational numbers."},"quote_capped":false,"section":["Multiplication in group theory"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"A simple example is the set of non-zero rational numbers.","segments":[{"text":"A simple example is the set of non-zero rational numbers."}]},"unresolved":null},{"absence":null,"basis":"61a45dcd1f360d601f4695ef5f4c5a5ee922b7544fb0ae024e666dd65e59b489","coverage":null,"id":"enwiki-20845-1375745567::In-text #fe8db475","item":"In-text #fe8db475","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Rat.commGroupWithZero","end_line":52,"library":"mathlib","line":44,"location_key":"61a45dcd1f360d601f4695ef5f4c5a5ee922b7544fb0ae024e666dd65e59b489","module":"Mathlib.Algebra.Ring.Rat","note":"The instance carries the whole multiplicative structure of the rationals, including the absorbing zero, and the passage reads off only its neutral element.","pair_key":"022543545844cc1029ad8a1d25d541412218cc6762000e029d90e8cf33875d97","path":"Mathlib/Algebra/Ring/Rat.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Rat.commGroupWithZero : CommGroupWithZero ℚ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Units.val_one","end_line":183,"library":"mathlib","line":182,"location_key":"697539bcedc7d8b929f57270331d55bc546d536d874c19aef06d800c989f3382","module":"Mathlib.Algebra.Group.Units.Defs","note":"Stated for an arbitrary monoid; the group of invertible rationals is Mathlib's way of writing the nonzero rationals under multiplication.","pair_key":"ae23a6cbef8b035f8d32b741cec986ac404ff371e9e73a59114079fb6f4347e6","path":"Mathlib/Algebra/Group/Units/Defs.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Units.val_one {α : Type u} [Monoid α] : ↑1 = 1"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"366e6356c3902cb699cbce25bf50a5bc4433e60b461142e66950c6c03751bdd8","prominence":"supporting","quote":{"exact":"Here the identity element is 1, as opposed to groups under addition"},"quote_capped":true,"section":["Multiplication in group theory"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"Here the identity element is 1, as opposed to groups under addition where the identity is typically 0.","segments":[{"text":"Here the identity element is 1, as opposed to groups under addition where the identity is typically 0."}]},"unresolved":null},{"absence":null,"basis":"2ba69b74d2313fa070c496e3fe856311b9a3c01a7d247451f6e61fda032abec6","coverage":null,"id":"enwiki-20845-1375745567::In-text #a43de350","item":"In-text #a43de350","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Units.ne_zero","end_line":36,"library":"mathlib","line":35,"location_key":"2ba69b74d2313fa070c496e3fe856311b9a3c01a7d247451f6e61fda032abec6","module":"Mathlib.Algebra.GroupWithZero.Units.Basic","note":"Stated for any monoid with zero rather than for the rationals alone; the nontriviality hypothesis rules out only the one-element ring, where the claim would be empty.","pair_key":"ab3964b9fb7aeef3efc76c8f05272da245a80b02f932f2d206697d206f9a5301","path":"Mathlib/Algebra/GroupWithZero/Units/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Units.ne_zero {M₀ : Type*} [MonoidWithZero M₀] [Nontrivial M₀] (u : M₀ˣ) : ↑u ≠ 0"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"not_isUnit_zero","end_line":72,"library":"mathlib","line":71,"location_key":"9ba189a93db045e5525262d05ebcd99639e3539eeafe1af8f109333d0e94262b","module":"Mathlib.Algebra.GroupWithZero.Units.Basic","note":"Stated for an arbitrary monoid with zero; the reason zero has to be dropped is exactly that it is never invertible.","pair_key":"74ff29ded8ab7fb38893f2972e282139efbdafea04b4f1bf0e8d2157e2fbc84f","path":"Mathlib/Algebra/GroupWithZero/Units/Basic.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem not_isUnit_zero {M₀ : Type*} [MonoidWithZero M₀] [Nontrivial M₀] : ¬IsUnit 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"cb2f69ade621a04a2e4e5b23b415da08d6573e53b8cac6ee322f8047909faae8","prominence":"central","quote":{"exact":"Note that with the rationals, zero must be excluded"},"quote_capped":false,"section":["Multiplication in group theory"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"after":{"layer":" because, under multiplication, it does not have an inverse: there is no rational number that can be multiplied by zero to result in 1.","segments":[{"text":" because, under multiplication, it does not have an inverse: there is no rational number that can be multiplied by zero to result in 1."}]},"layer":"Note that with the rationals, zero must be excluded","segments":[{"text":"Note that with the rationals, zero must be excluded"}]},"unresolved":null},{"absence":null,"basis":"017260bc62aadd1d5f351d0980d59cb9dc39963bb71fbc60daa220e41dd45ea2","coverage":null,"id":"enwiki-20845-1375745567::In-text #c6233c30","item":"In-text #c6233c30","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"not_isUnit_zero","end_line":72,"library":"mathlib","line":71,"location_key":"017260bc62aadd1d5f351d0980d59cb9dc39963bb71fbc60daa220e41dd45ea2","module":"Mathlib.Algebra.GroupWithZero.Units.Basic","note":"Stated for an arbitrary monoid with zero, and Mathlib writes invertibility where the passage speaks of having a multiplicative inverse.","pair_key":"74c24bb264e91dbf4eeb04f3579fbc535e91bafcc5337b73e4f7a935e5b31a2b","path":"Mathlib/Algebra/GroupWithZero/Units/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem not_isUnit_zero {M₀ : Type*} [MonoidWithZero M₀] [Nontrivial M₀] : ¬IsUnit 0"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Units.ne_zero","end_line":36,"library":"mathlib","line":35,"location_key":"16e5b1884bd70f63d739963b9f910e892e939f1ea8cd45f8d3b7e691ad30955c","module":"Mathlib.Algebra.GroupWithZero.Units.Basic","note":"Stated for an arbitrary monoid with zero; it records the same obstruction from the side of the invertible elements.","pair_key":"a9ae1e50b4e0c7eda54c60e3cbdfb833c00e3f2d615aa055316b01044eb7ab09","path":"Mathlib/Algebra/GroupWithZero/Units/Basic.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Units.ne_zero {M₀ : Type*} [MonoidWithZero M₀] [Nontrivial M₀] (u : M₀ˣ) : ↑u ≠ 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"ca9bc20803a6c45bec018e6160f3485b02bdf5234a23f63f002775473594e437","prominence":"supporting","quote":{"exact":"under multiplication, it does not have an inverse: there is no rational"},"quote_capped":true,"section":["Multiplication in group theory"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"Note that with the rationals, zero must be excluded because, ","segments":[{"text":"Note that with the rationals, zero must be excluded because, "}]},"layer":"under multiplication, it does not have an inverse: there is no rational number that can be multiplied by zero to result in 1.","segments":[{"text":"under multiplication, it does not have an inverse: there is no rational number that can be multiplied by zero to result in 1."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"717ad3cbd8cf649600aaf88a4eb4338f3b8903eff86042bba0ece1495ec6fc4e","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"c3f25b6820bf02cb7e6dbe9d82ff1779a90a4db825ac2e782bbf0c14f2d23ce0","text":"the multiplicative group of the non-zero rationals is abelian"},{"id":"c2","part":"3cdb24c4cb09d34760751c101a609381513f366caa47e0ba5477fe278457df0b","text":"a set that satisfies the group axioms under multiplication need not be abelian"}],"parts":["c3f25b6820bf02cb7e6dbe9d82ff1779a90a4db825ac2e782bbf0c14f2d23ce0","3cdb24c4cb09d34760751c101a609381513f366caa47e0ba5477fe278457df0b"],"relation":"broadMatch","status":"formalized"},"id":"enwiki-20845-1375745567::In-text #c435b582","item":"In-text #c435b582","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Rat.commGroupWithZero","end_line":52,"library":"mathlib","line":44,"location_key":"c3f25b6820bf02cb7e6dbe9d82ff1779a90a4db825ac2e782bbf0c14f2d23ce0","module":"Mathlib.Algebra.Ring.Rat","note":"Besides the abelian group on the nonzero rationals the instance also records how zero multiplies, which the passage does not discuss.","pair_key":"b3fd7a3471e9d18ff4799b7e83bc25f41f7968e5d2319c67ee5d71ea99e79373","path":"Mathlib/Algebra/Ring/Rat.lean","proof_status":"definition","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Rat.commGroupWithZero : CommGroupWithZero ℚ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"DihedralGroup.not_commutative","end_line":232,"library":"mathlib","line":226,"location_key":"3cdb24c4cb09d34760751c101a609381513f366caa47e0ba5477fe278457df0b","module":"Mathlib.GroupTheory.SpecificGroups.Dihedral","note":"The declaration names one concrete family of groups where the passage only claims that some group fails to be abelian.","pair_key":"22867baf5ea5b37fe5f24fa5958750954c0bd5911a2d87559108f79c1eb07f16","path":"Mathlib/GroupTheory/SpecificGroups/Dihedral.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem DihedralGroup.not_commutative {n : ℕ} : n ≠ 1 → n ≠ 2 → ¬IsMulCommutative (DihedralGroup n)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c4989137b92b999cfbd6bf9f978c6d608f7ff7412fb0bdada4bbaccbeaf4129c","prominence":"central","quote":{"exact":"In this example, the result is an abelian group, but that is"},"quote_capped":true,"section":["Multiplication in group theory"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"In this example, the result is an abelian group, but that is not always the case.","segments":[{"text":"In this example, the result is an abelian group, but that is not always the case."}]},"unresolved":null},{"absence":null,"basis":"a5163833e94db8b5221ae97ef1e060b6bd06f77dc1e011ea8411a41a4a5d3173","coverage":null,"id":"enwiki-20845-1375745567::In-text #6f858108","item":"In-text #6f858108","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Matrix.GeneralLinearGroup","end_line":44,"library":"mathlib","line":42,"location_key":"a5163833e94db8b5221ae97ef1e060b6bd06f77dc1e011ea8411a41a4a5d3173","module":"Mathlib.LinearAlgebra.Matrix.GeneralLinearGroup.Defs","note":"Defined over any semiring where the passage fixes a field, so it covers coefficient rings the passage never considers.","pair_key":"7e6f100e92c8bd873226f361314c8cfd93811369eb4f4b94e194af3539955a9c","path":"Mathlib/LinearAlgebra/Matrix/GeneralLinearGroup/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"abbrev Matrix.GeneralLinearGroup (n : Type u) (R : Type v) [DecidableEq n] [Fintype n] [Semiring R] : Type (max v u)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Units.instGroup","end_line":261,"library":"mathlib","line":260,"location_key":"8e841175f8a7bc1b75c2a1c317eba76081b2dcaee7a69cc91812282222008b8c","module":"Mathlib.Algebra.Group.Units.Defs","note":"This is the instance Lean's resolution reaches for the invertible matrices, through the monoid structure of the square matrices over the field.","pair_key":"ad950333ea734aebe387b0e3f35b1721a0da436c1f791dcacc239594e705fd5d","path":"Mathlib/Algebra/Group/Units/Defs.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Units.instGroup {α : Type u} [Monoid α] : Group αˣ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"96e12c546902f68bf7d7bed99915809971fa5b84d8979058f1954b5cd409ef28","prominence":"central","quote":{"exact":"To see this, consider the set of invertible square matrices of a"},"quote_capped":true,"section":["Multiplication in group theory"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"To see this, consider the set of invertible square matrices of a given dimension over a given field. Here, it is straightforward to verify closure, associativity, and inclusion of identity (the identity matrix) and inverses.","segments":[{"text":"To see this, consider the set of invertible square matrices of a given dimension over a given field. Here, it is straightforward to verify closure, associativity, and inclusion of identity (the identity matrix) and inverses."}]},"unresolved":null},{"absence":null,"basis":"0e07c28cc4cbf9fcb54108858e7b0d6f52caedd1bdd4c27a1ac92887c2591ff6","coverage":null,"id":"enwiki-20845-1375745567::In-text #4548e64f","item":"In-text #4548e64f","kind":"theorem","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Matrix.GeneralLinearGroup.not_isSolvable_fin_two","end_line":42,"library":"tauceti","line":36,"location_key":"0e07c28cc4cbf9fcb54108858e7b0d6f52caedd1bdd4c27a1ac92887c2591ff6","module":"TauCeti.LinearAlgebra.Matrix.GeneralLinearGroup.Solvable","note":"It fixes the dimension at two and asks the field to hold a suitable element, so it covers only some of the dimensions and fields the passage ranges over.","pair_key":"f86d641993f90b1237e77b01a96d2f222c508385a3a793f02240bbc8303e91b2","path":"TauCeti/LinearAlgebra/Matrix/GeneralLinearGroup/Solvable.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Matrix.GeneralLinearGroup.not_isSolvable_fin_two (F : Type u) [Field F] : (∃ a, a ≠ 0 ∧ a ^ 2 ≠ 1) → ¬Group.IsSolvable (GL (Fin 2) F)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"LieAlgebra.SpecialLinear.sl_non_abelian","end_line":149,"library":"mathlib","line":141,"location_key":"3409f53073aaa973e1e7b3a05df0a0e3f7f621625c3167b1be0826ba068778c8","module":"Mathlib.Algebra.Lie.Classical","note":"It produces traceless matrices whose two products disagree, which is the reason the passage gives rather than the conclusion it draws about the invertible matrices.","pair_key":"c9a85a2a16618199194271a9e785ee503cde17bef7417928ade2f2d72fe6845c","path":"Mathlib/Algebra/Lie/Classical.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem LieAlgebra.SpecialLinear.sl_non_abelian (n : Type*) (R : Type u₂) [CommRing R] [DecidableEq n] [Fintype n] [Nontrivial R] : 1 < Fintype.card n → ¬IsLieAbelian ↥(LieAlgebra.SpecialLinear.sl n R)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7e716863cac308d832e7f02813f83673806695bec3e34c9a2d645830f5bd39eb","prominence":"central","quote":{"exact":"However, matrix multiplication is not commutative, which shows that this group is"},"quote_capped":true,"section":["Multiplication in group theory"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"However, matrix multiplication is not commutative, which shows that this group is non-abelian.","segments":[{"text":"However, matrix multiplication is not commutative, which shows that this group is non-abelian."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"56e856ba103199d4164a54debf598125da5ac9f3b26c63d2a9fc7f6842544432"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #419c0876","item":"In-text #419c0876","kind":"theorem","locations":[{"challenge":"downgraded","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Int.isUnit_iff","end_line":49,"library":"mathlib","line":45,"location_key":"45484e36f7d3761a1aa4db253f1f85ce5f7a3ccef010510b90dbbbec45182463","module":"Mathlib.Algebra.Group.Int.Units","note":"It characterises invertibility for every integer, while the passage only needs one nonzero integer that fails to be invertible.","pair_key":"d8824ffd6f7a826f3d14b7046efbff244a940e4e2231ce01d2c41ac5fa056eba","path":"Mathlib/Algebra/Group/Int/Units.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Int.isUnit_iff {u : ℤ} : IsUnit u ↔ u = 1 ∨ u = -1"},"statement":false},{"challenge":"downgraded","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Int.units_eq_one_or","end_line":33,"library":"mathlib","line":32,"location_key":"139c709f46c86b0acd692c86eecf242b8a249cecb6f2b25b6d8757023f14a2ad","module":"Mathlib.Algebra.Ring.Int.Units","note":"It enumerates the invertible integers, which is more than the passage needs to deny the group axioms.","pair_key":"731fb590afb8b39a835b718e29e6515a5b3560f2b52fe20065e5156ec5cca5d6","path":"Mathlib/Algebra/Ring/Int/Units.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Int.units_eq_one_or (u : ℤˣ) : u = 1 ∨ u = -1"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"be6928c28b8e3702bce73518e03f653eef08a0aefbfc8249f26ef81ca08b8850","prominence":"central","quote":{"exact":"Another fact worth noticing is that the integers under multiplication do not"},"quote_capped":true,"section":["Multiplication in group theory"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"Another fact worth noticing is that the integers under multiplication do not form a group—even if zero is excluded.","segments":[{"text":"Another fact worth noticing is that the integers under multiplication do not form a group—even if zero is excluded."}]},"unresolved":null},{"absence":null,"basis":"e2767642e8686f2b2e1678b7508d02c100d524f8988ab8b85008cc9104868d6d","coverage":null,"id":"enwiki-20845-1375745567::In-text #5d44e142","item":"In-text #5d44e142","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Int.isUnit_eq_one_or","end_line":37,"library":"mathlib","line":36,"location_key":"e2767642e8686f2b2e1678b7508d02c100d524f8988ab8b85008cc9104868d6d","module":"Mathlib.Algebra.Group.Int.Units","note":"Mathlib writes the hypothesis as invertibility in the integers where the article says the element has a multiplicative inverse there.","pair_key":"084bc598fe58afa9e94342d6d6d947f51cac012ede931321083e80779c02fba5","path":"Mathlib/Algebra/Group/Int/Units.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Int.isUnit_eq_one_or {u : ℤ} : IsUnit u → u = 1 ∨ u = -1"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Int.isUnit_iff","end_line":49,"library":"mathlib","line":45,"location_key":"aa2ec74f96c741455d17feffd5e9d1b75b1cd0bb2612a4dd3a77eaa66856e8d3","module":"Mathlib.Algebra.Group.Int.Units","note":"It states an equivalence where the passage only asserts the direction from having an inverse to being one of the two numerals.","pair_key":"7ed59311551ba8f343827288bcbd3fd59dd978e9a8428aaddaaab69f5c09a241","path":"Mathlib/Algebra/Group/Int/Units.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Int.isUnit_iff {u : ℤ} : IsUnit u ↔ u = 1 ∨ u = -1"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Int.units_eq_one_or","end_line":33,"library":"mathlib","line":32,"location_key":"4ac3177e08ae24156455f31a73e87a029b791099060fe9725f942af5d8b5152a","module":"Mathlib.Algebra.Ring.Int.Units","note":"It is phrased through the multiplicative group of the integers rather than through the integers themselves.","pair_key":"c6bef6a099e72b61098bfdfdb653b6d99f2f9504eaca0c7607db0b479c4924e0","path":"Mathlib/Algebra/Ring/Int/Units.lean","proof_status":"proved","rank":3,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Int.units_eq_one_or (u : ℤˣ) : u = 1 ∨ u = -1"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"76894b285ee1c8baebceca30b7c1688cb5f72c66874aab2724a302a7e98a9791","prominence":"supporting","quote":{"exact":"This is easily seen by the nonexistence of an inverse for all"},"quote_capped":true,"section":["Multiplication in group theory"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"This is easily seen by the nonexistence of an inverse for all elements other than 1 and −1.","segments":[{"text":"This is easily seen by the nonexistence of an inverse for all elements other than 1 and −1."}]},"unresolved":null},{"absence":null,"basis":"ecf281024f0e45d3ab944c31948f367beb86937e0fe5c798fd4f6e2112250acc","coverage":null,"id":"enwiki-20845-1375745567::In-text #df886c64","item":"In-text #df886c64","kind":"notation","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Mul","end_line":1656,"library":"lean-core","line":1654,"location_key":"ecf281024f0e45d3ab944c31948f367beb86937e0fe5c798fd4f6e2112250acc","module":"Init.Prelude","note":"This is the class that puts a homogeneous product between two elements of one type; Lean prints that product with an asterisk where the passage uses a dot or no symbol at all, and it is available for every type, not only for groups.","pair_key":"b8200a5523d652e9e6ea7d61f139dd184274249579de113e8ca6988dfdc1240b","path":"src/Init/Prelude.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"class Mul : Type u → Type u"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Group","end_line":34,"library":"mathlib","line":33,"location_key":"5dc10b3f1f6f601cf74aab0fdfccc793739adb5981e16ec375cea625cfcb5de2","module":"Mathlib.Algebra.Group.Defs","note":"Mathlib's group class is the multiplicatively written one, as opposed to its additive twin, but what it states are the group axioms rather than any convention about printing the operation.","pair_key":"a558d83adac116b58c3a462856c2e59ce601c5fc1970396fa3d893f7e1043fb9","path":"Mathlib/Algebra/Group/Defs.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class Group : Type u_2 → Type u_2"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f70de8a49e7a49d0d02d7b890679bd08d527bafe714dda77a905b60644a799f5","prominence":"central","quote":{"exact":"Multiplication in group theory is typically notated either by a dot or"},"quote_capped":true,"section":["Multiplication in group theory"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"Multiplication in group theory is typically notated either by a dot or by juxtaposition (the omission of an operation symbol between elements).","segments":[{"text":"Multiplication in group theory is typically notated either by a dot or by juxtaposition (the omission of an operation symbol between elements)."}]},"unresolved":null},{"absence":null,"basis":"0ad23c54e538eecc50667d308c4b1345e2e4ade3077ed2a77af19846bfaee689","coverage":null,"id":"enwiki-20845-1375745567::In-text #a3db7383","item":"In-text #a3db7383","kind":"notation","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Mul","end_line":1656,"library":"lean-core","line":1654,"location_key":"0ad23c54e538eecc50667d308c4b1345e2e4ade3077ed2a77af19846bfaee689","module":"Init.Prelude","note":"The class writes the product of two elements of one type as an infix term; Lean's symbol for it is an asterisk where the passage offers a dot or bare apposition of a and b.","pair_key":"a9f26c94db82048f22ad29f2871843f8691688983d18e9b40013ce0c54e9ad64","path":"src/Init/Prelude.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"class Mul : Type u → Type u"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"HMul","end_line":1508,"library":"lean-core","line":1505,"location_key":"cf567eb3b1c210171157e48d35c98c35c1a7f9ae58614429668a1d63ff0d7318","module":"Init.Prelude","note":"Lean's heterogeneous class allows the two factors to come from different types and the product from a third; the passage keeps all three the same.","pair_key":"f7f6a557d130fad613d99f9918350a340f44495b9bdf25d5c9140abd888aa101","path":"src/Init/Prelude.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"class HMul : Type u → Type v → outParam (Type w) → Type (max (max u v) w)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"8af8ce16a137e9233e351b947d1afcacc64ea07dbe60ff34a609c0674b83ff6f","prominence":"supporting","quote":{"exact":"multiplying element a by element b could be notated as a ⋅"},"quote_capped":true,"section":["Multiplication in group theory"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"So ","segments":[{"text":"So "}]},"layer":"multiplying element a by element b could be notated as a ⋅ {\\displaystyle \\cdot } b or ab.","segments":[{"text":"multiplying element a by element b could be notated as a "},{"tex":"\\cdot"},{"text":" b or ab."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"04fc5c611c9b37f018a32c717ac6f796c503a5a9b223cae30b4609f8da193bd1"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #c2580fca","item":"In-text #c2580fca","kind":"notation","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"GrpCat","end_line":42,"library":"mathlib","line":39,"location_key":"091774f11e16f209ac3bea21d091d3cc8baa976232f5584640853cac2123e7a3","module":"Mathlib.Algebra.Category.Grp.Basic","note":"This bundles a carrier together with its group structure as one object of a category, which is the closest the universe comes to naming a group by its set and its operation, but it fixes no symbol for that operation.","pair_key":"0f10be372060999ee44ed433a0432a313e36fbf6a34ceae6346f46d4f4210bcb","path":"Mathlib/Algebra/Category/Grp/Basic.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure GrpCat"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Mul","end_line":1656,"library":"lean-core","line":1654,"location_key":"793f7f39f1973b55477dbd0654c3412c08e4f64712b9c03e9f3816a2a92337b6","module":"Init.Prelude","note":"It supplies the infix symbol for a type's multiplication, but it never addresses how a group is displayed alongside the set it is carried by.","pair_key":"29d337128cfd5ae18e357085f86ba21e44962ecdee0b39a65d93b9b927d278cb","path":"src/Init/Prelude.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"class Mul : Type u → Type u"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"af91d9a0e9fe7d1f0d467fdf6e60326506eaef1569488be047dde1ee2220ad08","prominence":"supporting","quote":{"exact":"When referring to a group via the indication of the set and"},"quote_capped":true,"section":["Multiplication in group theory"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"When referring to a group via the indication of the set and operation, the dot is used.","segments":[{"text":"When referring to a group via the indication of the set and operation, the dot is used."}]},"unresolved":null},{"absence":null,"basis":"515fbbeefbe561637da6286498e9c543dd574d87dc44a20b6c8fa8448e4a6edc","coverage":null,"id":"enwiki-20845-1375745567::In-text #8b6f4944","item":"In-text #8b6f4944","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Rat.commGroupWithZero","end_line":52,"library":"mathlib","line":44,"location_key":"515fbbeefbe561637da6286498e9c543dd574d87dc44a20b6c8fa8448e4a6edc","module":"Mathlib.Algebra.Ring.Rat","note":"Mathlib keeps the multiplicative structure of the rationals in the group-with-zero form, which packages the invertibility of every non-zero rational and adds that the operation commutes.","pair_key":"aba04108394a2b6fbf8d28d4f1625c99448eb75d37cc0775efb0a1d06fbb67fe","path":"Mathlib/Algebra/Ring/Rat.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Rat.commGroupWithZero : CommGroupWithZero ℚ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Units.instGroup","end_line":261,"library":"mathlib","line":260,"location_key":"20465defd0c96fe07b71701bc57e1b3658ecbd1c96a6cdc57962c7820cf55261","module":"Mathlib.Algebra.Group.Units.Defs","note":"The declaration is the general fact that invertible elements of a monoid form a group; at the rationals those elements are the non-zero ones.","pair_key":"df6c0f706141c1c00e80735553106969f34e6fc643974533902183fdb140c07f","path":"Mathlib/Algebra/Group/Units/Defs.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Units.instGroup {α : Type u} [Monoid α] : Group αˣ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2dcb9c91592730a06ab30bd94bf53c8f92deb51fcd203927e695f7b69d6d947c","prominence":"supporting","quote":{"exact":"For example, our first example could be indicated by ( Q /"},"quote_capped":true,"section":["Multiplication in group theory"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"For example, our first example could be indicated by ( Q / { 0 } , ⋅ ) {\\displaystyle \\left(\\mathbb {Q} /\\{0\\},\\,\\cdot \\right)} .","segments":[{"text":"For example, our first example could be indicated by "},{"tex":"\\left(\\mathbb {Q} /\\{0\\},\\,\\cdot \\right)"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"7fae79aa7bea0f72acc89030a0bbc6543fdbdd2b2d5dd1fcdc8ea3971b3cd840","coverage":null,"id":"enwiki-20845-1375745567::In-text #a124e9cd","item":"In-text #a124e9cd","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Nat.mul","end_line":1919,"library":"lean-core","line":1917,"location_key":"7fae79aa7bea0f72acc89030a0bbc6543fdbdd2b2d5dd1fcdc8ea3971b3cd840","module":"Init.Prelude","note":"Lean builds this function by adding one argument once for every step down the other, so the function it defines is the repeated sum the passage describes; at a zero argument it returns zero, which is the sum of no copies.","pair_key":"d8ddc8667941618b0d699045bb6fe79ab19942592c54cf96a64628bc626188c6","path":"src/Init/Prelude.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Nat.mul : Nat → Nat → Nat"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"List.sum_replicate_nat","end_line":39,"library":"lean-core","line":38,"location_key":"03a8e6c2755151b3f8610a6be4d2e7bd3c8cc28e85682de2e4d3d897e7d40e1c","module":"Init.Data.List.Nat.Sum","note":"Lean renders the sum of N copies of M as the sum of the list that repeats M N times, and states that this sum is the product of the two numbers.","pair_key":"f588219b8e548ddc855d86a3d229e2b23754e6694d866994ef165575f8dbe904","path":"src/Init/Data/List/Nat/Sum.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem List.sum_replicate_nat {n a : Nat} : (List.replicate n a).sum = n * a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"List.sum_const_nat","end_line":386,"library":"mathlib","line":385,"location_key":"124b144ea00987e430d00540da87788193dcebc58d78d842b22f6dc84a0f4343","module":"Mathlib.Algebra.BigOperators.Group.List.Basic","note":"Mathlib's version of the same equation writes the repeated summand as a list repeating M and equates its total with the product.","pair_key":"4c1867989682af0f2eab6b43ec458a3167a21bc62d98ef9f9d2d72de1208c267","path":"Mathlib/Algebra/BigOperators/Group/List/Basic.lean","proof_status":"proved","rank":3,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem List.sum_const_nat (m n : ℕ) : (List.replicate m n).sum = m * n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"cc9274807cb57c6656c1712c8c334db452dcc3ce9e105107e671ebedfab8972d","prominence":"central","quote":{"exact":"N × M {\\displaystyle N\\times M} is the sum of N copies"},"quote_capped":true,"section":["Multiplication of different kinds of numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"Integers ","lead_in":true,"segments":[{"text":"Integers "}]},"layer":"N × M {\\displaystyle N\\times M} is the sum of N copies of M when N and M are positive whole numbers.","segments":[{"tex":"N\\times M"},{"text":" is the sum of N copies of M when N and M are positive whole numbers."}]},"unresolved":null},{"absence":null,"basis":"42962939f60a8e587aa7d09a85ef1ff120bb0dfbdaa6568ab5f25ee57f748e5d","coverage":null,"id":"enwiki-20845-1375745567::In-text #b6779c99","item":"In-text #b6779c99","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Fintype.card_prod","end_line":58,"library":"mathlib","line":56,"location_key":"42962939f60a8e587aa7d09a85ef1ff120bb0dfbdaa6568ab5f25ee57f748e5d","module":"Mathlib.Data.Fintype.Prod","note":"The lemma counts the pairs drawn from two finite types, and the cells of the passage's array are exactly such pairs.","pair_key":"faaca1ec5562cef1035329d4fc04670018b4934c6c91891a3101cf3a5dd4b8c1","path":"Mathlib/Data/Fintype/Prod.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Fintype.card_prod (α : Type*) (β : Type*) [Fintype α] [Fintype β] : Fintype.card (α × β) = Fintype.card α * Fintype.card β"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Finset.card_product","end_line":142,"library":"mathlib","line":141,"location_key":"09594033c36cc18346221536138a79907f47d347647f3e9ceae068b6efed25c5","module":"Mathlib.Data.Finset.Prod","note":"The lemma counts the pairs formed from two finite sets, which is the array laid out by its columns and rows.","pair_key":"b9db4f3cce2654702b5bfeaecd9ed34101db9ff7a26ee354127997a7f3469d3c","path":"Mathlib/Data/Finset/Prod.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.card_product {α : Type*} {β : Type*} (s : Finset α) (t : Finset β) : (s ×ˢ t).card = s.card * t.card"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"3799c50614f14db69c13740800483e315acc90c8e754d78dc3a3edd23d605e90","prominence":"supporting","quote":{"exact":"This gives the number of things in an array N wide and"},"quote_capped":true,"section":["Multiplication of different kinds of numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"This gives the number of things in an array N wide and M high.","segments":[{"text":"This gives the number of things in an array N wide and M high."}]},"unresolved":null},{"absence":null,"basis":"cca00494a5ca60d3db8c753e6fe59f2783aa49e0dedb44e2a2df2cad481ab63f","coverage":null,"id":"enwiki-20845-1375745567::In-text #4fdfa272","item":"In-text #4fdfa272","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.mul_neg","end_line":521,"library":"lean-core","line":520,"location_key":"cca00494a5ca60d3db8c753e6fe59f2783aa49e0dedb44e2a2df2cad481ab63f","module":"Init.Data.Int.Lemmas","note":"Lean states the rule for arbitrary integer arguments, so it also covers the cases where the factors are themselves negative or zero, beyond the whole numbers the passage is extending from.","pair_key":"ebd540f57cc9450cfc6c1fac3daa273bc7521cc0e36a772d9ca87489af487f69","path":"src/Init/Data/Int/Lemmas.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.mul_neg (a b : Int) : a * -b = -(a * b)"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.neg_mul_eq_mul_neg","end_line":513,"library":"lean-core","line":512,"location_key":"bbf1c08e24d1a1a559741dfb2a6870fc0c0c39d9a0f28c4df57fea5655a9b4c7","module":"Init.Data.Int.Lemmas","note":"Lean records the same identity with the two sides exchanged, for all integer arguments including negative and zero ones.","pair_key":"71a7217c8608262fdc01978ba5ac5d3abce7fd1bcfeafbf0e0588cc3cb83d0df","path":"src/Init/Data/Int/Lemmas.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.neg_mul_eq_mul_neg (a b : Int) : -(a * b) = a * -b"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_neg","end_line":290,"library":"mathlib","line":289,"location_key":"d6d68497c9d52e497a1810f180f2b1dee247b8bd667fd510b02fe773e7019be8","module":"Mathlib.Algebra.Ring.Defs","note":"Mathlib states the rule for any type with a multiplication and a negation that distributes over it, of which the integers are one.","pair_key":"12ae1d77d4b8248a047fcee8da7a249f87b7617cb1a8f1473f89911d36259d71","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"proved","rank":3,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_neg {α : Type u} [Mul α] [HasDistribNeg α] (a b : α) : a * -b = -(a * b)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"51b146241196f954437097f95210ce907101c10ea26936f7ab783d17b06cbfb3","prominence":"central","quote":{"exact":"Generalization to negative numbers can be done by N × ( −"},"quote_capped":true,"section":["Multiplication of different kinds of numbers"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"after":{"layer":" ( − N ) × ( − M ) = N × M {\\displaystyle (-N)\\times (-M)=N\\times M} The same sign rules apply to rational and real numbers.","segments":[{"text":" "},{"tex":"(-N)\\times (-M)=N\\times M"},{"text":" The same sign rules apply to rational and real numbers."}]},"layer":"Generalization to negative numbers can be done by N × ( − M ) = ( − N ) × M = − ( N × M ) {\\displaystyle N\\times (-M)=(-N)\\times M=-(N\\times M)} and","segments":[{"text":"Generalization to negative numbers can be done by "},{"tex":"N\\times (-M)=(-N)\\times M=-(N\\times M)"},{"text":" and"}]},"unresolved":null},{"absence":null,"basis":"21c0a073dd0f208ac516c0449069eaffa4bee800546b79ff9c54548722539ce6","coverage":null,"id":"enwiki-20845-1375745567::In-text #386c19b9","item":"In-text #386c19b9","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.neg_mul_neg","end_line":523,"library":"lean-core","line":523,"location_key":"21c0a073dd0f208ac516c0449069eaffa4bee800546b79ff9c54548722539ce6","module":"Init.Data.Int.Lemmas","note":"Lean states the identity for all integer arguments, so it reaches beyond the whole numbers the passage negates to cases where the factors are already negative or zero.","pair_key":"340923853b77b50e61375f35751c6ec1a8a0af51040a0f277a5b343ae5fbbd70","path":"src/Init/Data/Int/Lemmas.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.neg_mul_neg (a b : Int) : -a * -b = a * b"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"neg_mul_neg","end_line":292,"library":"mathlib","line":292,"location_key":"b35100881eceb7669e74d1b63083056655d7176d039fc4016e80118b5e1884e0","module":"Mathlib.Algebra.Ring.Defs","note":"Mathlib states the identity for any type with a multiplication and a distributing negation, the integers among them.","pair_key":"c024a39275c1ae5977b07c1780a98d27a8a138086ffcbf1ca8a770317e947c9e","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem neg_mul_neg {α : Type u} [Mul α] [HasDistribNeg α] (a b : α) : -a * -b = a * b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"1e9fa6497db4682d2f9a87e7f1973fcca414059deb8939a104e938507d696071","prominence":"central","quote":{"exact":"( − N ) × ( − M ) = N ×"},"quote_capped":true,"section":["Multiplication of different kinds of numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"after":{"layer":" The same sign rules apply to rational and real numbers.","segments":[{"text":" The same sign rules apply to rational and real numbers."}]},"before":{"layer":"Generalization to negative numbers can be done by N × ( − M ) = ( − N ) × M = − ( N × M ) {\\displaystyle N\\times (-M)=(-N)\\times M=-(N\\times M)} and ","segments":[{"text":"Generalization to negative numbers can be done by "},{"tex":"N\\times (-M)=(-N)\\times M=-(N\\times M)"},{"text":" and "}]},"layer":"( − N ) × ( − M ) = N × M {\\displaystyle (-N)\\times (-M)=N\\times M}","segments":[{"tex":"(-N)\\times (-M)=N\\times M"}]},"unresolved":null},{"absence":null,"basis":"161528f41c317c9712c42d5af636963d95b0eaf3920f3090c7b1985f1adcf04d","coverage":null,"id":"enwiki-20845-1375745567::In-text #6962b745","item":"In-text #6962b745","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Rat.mul_neg","end_line":488,"library":"lean-core","line":486,"location_key":"161528f41c317c9712c42d5af636963d95b0eaf3920f3090c7b1985f1adcf04d","module":"Init.Data.Rat.Lemmas","note":"Stated for the rational numbers themselves, with no side condition on the two factors.","pair_key":"4b0f2b7c78d61c7bc91077f740dedd329e84b8e6beaaf38037b28bb156346d27","path":"src/Init/Data/Rat/Lemmas.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Rat.mul_neg (a b : Rat) : a * -b = -(a * b)"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Rat.neg_mul","end_line":484,"library":"lean-core","line":482,"location_key":"64291fac85396de60b63480ea5a00d3b8c2006afb5b5d0eaf40bcbadaaed0115","module":"Init.Data.Rat.Lemmas","note":"The companion of the previous rule, also stated directly for rationals.","pair_key":"fc7a79d57b4d5c69b1cbfda1e399297dd55700da7b83046cf713ecb160d0931c","path":"src/Init/Data/Rat/Lemmas.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Rat.neg_mul (a b : Rat) : -a * b = -(a * b)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"neg_mul_neg","end_line":292,"library":"mathlib","line":292,"location_key":"54f5a7e13eab7d086e766a124830297022f47af6347a3cd67ad490a1f01c14f9","module":"Mathlib.Algebra.Ring.Defs","note":"Stated over any multiplicative carrier with distributive negation, which the rationals are.","pair_key":"5f9fcca5ac9e5709bbc3edefef8d8453dac90daa574a7c765bce521b44539cf9","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem neg_mul_neg {α : Type u} [Mul α] [HasDistribNeg α] (a b : α) : -a * -b = a * b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"5969ebd04de3cee2bb216a820c5b2155a34d32bf0380e0d3a6d9a6a12e1c8c1b","prominence":"supporting","quote":{"exact":"The same sign rules apply to rational"},"quote_capped":false,"section":["Multiplication of different kinds of numbers"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"after":{"layer":" and real numbers.","segments":[{"text":" and real numbers."}]},"before":{"layer":"Generalization to negative numbers can be done by N × ( − M ) = ( − N ) × M = − ( N × M ) {\\displaystyle N\\times (-M)=(-N)\\times M=-(N\\times M)} and ( − N ) × ( − M ) = N × M {\\displaystyle (-N)\\times (-M)=N\\times M} ","segments":[{"text":"Generalization to negative numbers can be done by "},{"tex":"N\\times (-M)=(-N)\\times M=-(N\\times M)"},{"text":" and "},{"tex":"(-N)\\times (-M)=N\\times M"},{"text":" "}]},"layer":"The same sign rules apply to rational","segments":[{"text":"The same sign rules apply to rational"}]},"unresolved":null},{"absence":null,"basis":"11a52add4f16fe0a229409e19fab7c35868f82d3ce84d5df076f3dbefa8b4f77","coverage":null,"id":"enwiki-20845-1375745567::In-text #078b7e33","item":"In-text #078b7e33","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_neg","end_line":290,"library":"mathlib","line":289,"location_key":"11a52add4f16fe0a229409e19fab7c35868f82d3ce84d5df076f3dbefa8b4f77","module":"Mathlib.Algebra.Ring.Defs","note":"Stated over any multiplicative carrier with distributive negation, which the reals are.","pair_key":"e67de8061b029214bf29ae9f318620c6a8fc1b07a114a6383734c93156d1e686","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_neg {α : Type u} [Mul α] [HasDistribNeg α] (a b : α) : a * -b = -(a * b)"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"neg_mul","end_line":286,"library":"mathlib","line":285,"location_key":"30ff8b0d46304c664b3844e1eb41efd6358b3655cd8cb6ea1d15b908fbc618f1","module":"Mathlib.Algebra.Ring.Defs","note":"The companion rule for a negated left factor over the same carriers.","pair_key":"debea0bfcd85d8ee4f20efd4b693c3518cb0ecdaa9881a09223f7687c3c5a1c0","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem neg_mul {α : Type u} [Mul α] [HasDistribNeg α] (a b : α) : -a * b = -(a * b)"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"neg_mul_neg","end_line":292,"library":"mathlib","line":292,"location_key":"e87911f4a671336a0c9cda7d81d80dbb4a593dc0de6417ead09c028fb701e944","module":"Mathlib.Algebra.Ring.Defs","note":"Stated over any multiplicative carrier with distributive negation, which the reals are.","pair_key":"b61a6f65f3efc6e039e185d9b435a2456aa52af7ad008e9bb43e65d1052de5af","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem neg_mul_neg {α : Type u} [Mul α] [HasDistribNeg α] (a b : α) : -a * -b = a * b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"73973d75a2ba2b6df2f5b8f4a373da7528263cb5d87ebb8d74ffd2e38b6ab9e0","prominence":"supporting","quote":{"exact":"real numbers.","suffix":" R"},"quote_capped":false,"section":["Multiplication of different kinds of numbers"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"Generalization to negative numbers can be done by N × ( − M ) = ( − N ) × M = − ( N × M ) {\\displaystyle N\\times (-M)=(-N)\\times M=-(N\\times M)} and ( − N ) × ( − M ) = N × M {\\displaystyle (-N)\\times (-M)=N\\times M} The same sign rules apply to rational and ","segments":[{"text":"Generalization to negative numbers can be done by "},{"tex":"N\\times (-M)=(-N)\\times M=-(N\\times M)"},{"text":" and "},{"tex":"(-N)\\times (-M)=N\\times M"},{"text":" The same sign rules apply to rational and "}]},"layer":"real numbers.","segments":[{"text":"real numbers."}]},"unresolved":null},{"absence":null,"basis":"ee5dc0dd6832e7c422fb6d8b414f5114cc486756d16872000f2793eb46e2e257","coverage":null,"id":"enwiki-20845-1375745567::In-text #4395e596","item":"In-text #4395e596","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Rat.mul","end_line":183,"library":"lean-core","line":168,"location_key":"ee5dc0dd6832e7c422fb6d8b414f5114cc486756d16872000f2793eb46e2e257","module":"Init.Data.Rat.Basic","note":"Lean's definition of rational multiplication divides out the common factor of the numerator product and the denominator product, so the value comes back in lowest terms.","pair_key":"bc0b08f1e95acdd5aef6d6183734aae3d550ddba14d2ac9b44c37767e351230d","path":"src/Init/Data/Rat/Basic.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Rat.mul : Rat → Rat → Rat"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Rat.divInt_mul_divInt","end_line":464,"library":"lean-core","line":460,"location_key":"ea32a51cae1c5ffd0eff5082ae41ebccc797990b8253cc38f00832314799e6c3","module":"Init.Data.Rat.Lemmas","note":"The lemma unfolds Lean's rational product at quotients of integers into the quotient of the product of numerators by the product of denominators.","pair_key":"f3952e578b78be9155ecb84a6711105a32482ace25f49e0f0c72a20df9afa9b7","path":"src/Init/Data/Rat/Lemmas.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Rat.divInt_mul_divInt (n₁ n₂ : Int) {d₁ d₂ : Int} : Rat.divInt n₁ d₁ * Rat.divInt n₂ d₂ = Rat.divInt (n₁ * n₂) (d₁ * d₂)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Rat.mul_eq_mkRat","end_line":111,"library":"mathlib","line":110,"location_key":"dde5e00347ef5cd0ada0b950d33889c249bb6e695442851d9de41d0ab5966265","module":"Mathlib.Data.Rat.Defs","note":"Lean writes the product of two rationals as the fraction built from the product of the numerators over the product of the denominators, reduced by mkRat.","pair_key":"cdaa3dcdfd1b0f237787e2930aa5c05985fc37be509bd2704e0ff9812cbe2bcc","path":"Mathlib/Data/Rat/Defs.lean","proof_status":"proved","rank":3,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Rat.mul_eq_mkRat (q r : ℚ) : q * r = mkRat (q.num * r.num) (q.den * r.den)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"div_mul_div_comm","end_line":588,"library":"mathlib","line":588,"location_key":"3875c1b4c46172c43001939397fd4a0cafa45b2c09851a1a74f3c3e63ad57ac1","module":"Mathlib.Algebra.Group.Basic","note":"Stated for any carrier with commutative division, of which the rationals are one.","pair_key":"753a0ce81a65e8cf49f01594367e51f1fc97c7a6e540b038702ce34dbe91b6c7","path":"Mathlib/Algebra/Group/Basic.lean","proof_status":"proved","rank":4,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem div_mul_div_comm {α : Type*} [DivisionCommMonoid α] (a b c d : α) : a / b * (c / d) = a * c / (b * d)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"27fe0d0943f4ebd5c79b0cd5604ece5accbf441ad4433b8feaba971fcdb40e9d","prominence":"central","quote":{"exact":"Generalization to fractions A B × C D {\\displaystyle {\\frac {A}{B}}\\times {\\frac"},"quote_capped":true,"section":["Multiplication of different kinds of numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"Rational numbers ","lead_in":true,"segments":[{"text":"Rational numbers "}]},"layer":"Generalization to fractions A B × C D {\\displaystyle {\\frac {A}{B}}\\times {\\frac {C}{D}}} is by multiplying the numerators and denominators, respectively: A B × C D = ( A × C ) ( B × D ) {\\displaystyle {\\frac {A}{B}}\\times {\\frac {C}{D}}={\\frac {(A\\times C)}{(B\\times D)}}} .","segments":[{"text":"Generalization to fractions "},{"tex":"{\\frac {A}{B}}\\times {\\frac {C}{D}}"},{"text":" is by multiplying the numerators and denominators, respectively: "},{"tex":"{\\frac {A}{B}}\\times {\\frac {C}{D}}={\\frac {(A\\times C)}{(B\\times D)}}"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"ecce9b489e4e2957f571aae3779e4e4fd4d457dd7b4c32b123267471e2f78f54","coverage":null,"id":"enwiki-20845-1375745567::In-text #bac7256a","item":"In-text #bac7256a","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.volume_Icc_pi_toReal","end_line":243,"library":"mathlib","line":241,"location_key":"ecce9b489e4e2957f571aae3779e4e4fd4d457dd7b4c32b123267471e2f78f54","module":"Mathlib.MeasureTheory.Measure.Lebesgue.Basic","note":"The passage's rectangle is the box between the zero corner and the corner given by the two side lengths.","pair_key":"664c36cf0cdf85cadad8bea072e8fe6ba38d630e07e4755059d90d8c4ae1c34a","path":"Mathlib/MeasureTheory/Measure/Lebesgue/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.volume_Icc_pi_toReal {ι : Type*} [Fintype ι] {a b : ι → ℝ} : a ≤ b → (MeasureTheory.MeasureSpace.volume (Set.Icc a b)).toReal = ∏ i, (b i - a i)"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Finset.card_product","end_line":142,"library":"mathlib","line":141,"location_key":"7a4854452796264e851f52ba5af0d922dec96971aff2d2a797f490a961d58e47","module":"Mathlib.Data.Finset.Prod","note":"The array of the passage is the set of pairs drawn from a set of columns and a set of rows.","pair_key":"60a8e47dd62031ae928ea66c3f983ead434a3bd22fa0bcd5c6910e73a92788d8","path":"Mathlib/Data/Finset/Prod.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.card_product {α : Type*} {β : Type*} (s : Finset α) (t : Finset β) : (s ×ˢ t).card = s.card * t.card"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"ad15eb2f4e7ad1b77ea4b4e5ee69e2871e6a55684088cc9d2fa827e85716f46e","prominence":"supporting","quote":{"exact":"This gives the area of a rectangle A B {\\displaystyle {\\frac {A}{B}}}"},"quote_capped":true,"section":["Multiplication of different kinds of numbers"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"This gives the area of a rectangle A B {\\displaystyle {\\frac {A}{B}}} high and C D {\\displaystyle {\\frac {C}{D}}} wide, and is the same as the number of things in an array when the rational numbers happen to be whole numbers.","segments":[{"text":"This gives the area of a rectangle "},{"tex":"\\frac {A}{B}"},{"text":" high and "},{"tex":"\\frac {C}{D}"},{"text":" wide, and is the same as the number of things in an array when the rational numbers happen to be whole numbers."}]},"unresolved":null},{"absence":null,"basis":"7b16b8b3e392523b5ae608ab830d0b40ee59308c3afb56ec3d3f13f7b7e57026","coverage":null,"id":"enwiki-20845-1375745567::In-text #91e0e1ea","item":"In-text #91e0e1ea","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real","end_line":38,"library":"mathlib","line":36,"location_key":"7b16b8b3e392523b5ae608ab830d0b40ee59308c3afb56ec3d3f13f7b7e57026","module":"Mathlib.Basic.Real.Basic","note":"Lean's type of reals wraps a single field, an element of the Cauchy completion of the rationals for the rational absolute value, and the arithmetic it carries, the product among it, is that of the completion.","pair_key":"9fe0c5c6dc6ab1e46d33a0537c6312ebb514ecac6449b62ea482c3426630a67e","path":"Mathlib/Basic/Real/Basic.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure Real"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.cauchy_mul","end_line":151,"library":"mathlib","line":150,"location_key":"483a480733451199d2e0e705ce4a8f97f354b2000b32cd6d98793c0ded696d3c","module":"Mathlib.Basic.Real.Basic","note":"The lemma unfolds the product of two reals into the product of the Cauchy-sequence classes that represent them.","pair_key":"fc44ff2946fdcddbd3685f1432448fcf0c2f3b63573241ce54457d04432df1a3","path":"Mathlib/Basic/Real/Basic.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.cauchy_mul (a b : ℝ) : (a * b).cauchy = a.cauchy * b.cauchy"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.instMul","end_line":107,"library":"mathlib","line":106,"location_key":"40ea496610aa3fa1b4963c8722c7a2c15425d8fae0ead86a2b8d5b7da16199a3","module":"Mathlib.Basic.Real.Basic","note":"Lean packages the product of reals as a type-class instance on the type built from rational Cauchy sequences.","pair_key":"c2b90926fdaf282fea279504403567a3d48d38a255885b02eb264f7f8f8923c6","path":"Mathlib/Basic/Real/Basic.lean","proof_status":"definition","rank":3,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Real.instMul : Mul ℝ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6a8e48344ce45b61353932b76949d0d969fa1e490799191b238611269cea564a","prominence":"central","quote":{"exact":"Real numbers and their products can be defined in terms of sequences"},"quote_capped":true,"section":["Multiplication of different kinds of numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"Real numbers ","lead_in":true,"segments":[{"text":"Real numbers "}]},"layer":"Real numbers and their products can be defined in terms of sequences of rational numbers.","segments":[{"text":"Real numbers and their products can be defined in terms of sequences of rational numbers."}]},"unresolved":null},{"absence":null,"basis":"da081b0b2654476cb99eddbd2f1e6cb4fc079402e1a196a277bfc4821edb0ab9","coverage":null,"id":"enwiki-20845-1375745567::In-text #693e990c","item":"In-text #693e990c","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Complex.instMul","end_line":209,"library":"mathlib","line":208,"location_key":"da081b0b2654476cb99eddbd2f1e6cb4fc079402e1a196a277bfc4821edb0ab9","module":"Mathlib.Basic.Complex.Basic","note":"Lean packages the product as a type-class instance on a structure whose two real fields are the ordered pair of the passage.","pair_key":"7bc9b786618006d6c5f1594b27f629c6850a8e0c2325f3f9115b5ea097f196c2","path":"Mathlib/Basic/Complex/Basic.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Complex.instMul : Mul ℂ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Complex.mk_mul_mk","end_line":212,"library":"mathlib","line":211,"location_key":"1c8eebc68d1332d85d0fc6bd8cebaebcb54741a8049a5ee224ac6a461299fb88","module":"Mathlib.Basic.Complex.Basic","note":"The lemma unfolds the product of two complex numbers written by their real and imaginary parts into the pair of components.","pair_key":"cb029b4c40b5bea1963c31a87b18dd2d76a78ae8d56122a8d3da960c55c9e405","path":"Mathlib/Basic/Complex/Basic.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Complex.mk_mul_mk (x₁ x₂ y₁ y₂ : ℝ) : { re := x₁, im := y₁ } * { re := x₂, im := y₂ } = { re := x₁ * x₂ - y₁ * y₂, im := x₁ * y₂ + y₁ * x₂ }"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6d5a71294ce99e85ff38c747b828c525d87b0f6fd111a565b00b0415029b48f7","prominence":"central","quote":{"exact":"Considering complex numbers z 1 {\\displaystyle z_{1}} and z 2 {\\displaystyle z_{2}}"},"quote_capped":true,"section":["Multiplication of different kinds of numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"Complex numbers ","lead_in":true,"segments":[{"text":"Complex numbers "}]},"layer":"Considering complex numbers z 1 {\\displaystyle z_{1}} and z 2 {\\displaystyle z_{2}} as ordered pairs of real numbers ( a 1 , b 1 ) {\\displaystyle (a_{1},b_{1})} and ( a 2 , b 2 ) {\\displaystyle (a_{2},b_{2})} , the product z 1 × z 2 {\\displaystyle z_{1}\\times z_{2}} is ( a 1 × a 2 − b 1 × b 2 , a 1 × b 2 + a 2 × b 1 ) {\\displaystyle (a_{1}\\times a_{2}-b_{1}\\times b_{2},a_{1}\\times b_{2}+a_{2}\\times b_{1})} .","segments":[{"text":"Considering complex numbers "},{"tex":"z_{1}"},{"text":" and "},{"tex":"z_{2}"},{"text":" as ordered pairs of real numbers "},{"tex":"(a_{1},b_{1})"},{"text":" and "},{"tex":"(a_{2},b_{2})"},{"text":" , the product "},{"tex":"z_{1}\\times z_{2}"},{"text":" is "},{"tex":"(a_{1}\\times a_{2}-b_{1}\\times b_{2},a_{1}\\times b_{2}+a_{2}\\times b_{1})"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"5c4e2bc8909d93924835638a35f5afe480d768b178e4928d5f876166a3db96d3","coverage":null,"id":"enwiki-20845-1375745567::In-text #07548243","item":"In-text #07548243","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Complex.ofReal_mul","end_line":224,"library":"mathlib","line":223,"location_key":"5c4e2bc8909d93924835638a35f5afe480d768b178e4928d5f876166a3db96d3","module":"Mathlib.Basic.Complex.Basic","note":"Lean states the agreement through the coercion of a real into the complex numbers, which sends a real to the complex number with that real part and imaginary part zero.","pair_key":"7fd0f960558d92ceff7abc8dcb70e3f278378ae5bf10f22ac26b37c7238be4f5","path":"Mathlib/Basic/Complex/Basic.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Complex.ofReal_mul (r s : ℝ) : ↑(r * s) = ↑r * ↑s"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Complex.mk_mul_mk","end_line":212,"library":"mathlib","line":211,"location_key":"17cbe5577bc6d6f41ec132e5b8dbaf344a52931c5b8d6f374bad1fcaabbcafed","module":"Mathlib.Basic.Complex.Basic","note":"Stated for arbitrary real and imaginary parts, of which the passage's case with vanishing imaginary parts is one.","pair_key":"869cf8a749d57f479c2b4f32a69efa72ab1e09e1a4e13ec32df39d1c88b782db","path":"Mathlib/Basic/Complex/Basic.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Complex.mk_mul_mk (x₁ x₂ y₁ y₂ : ℝ) : { re := x₁, im := y₁ } * { re := x₂, im := y₂ } = { re := x₁ * x₂ - y₁ * y₂, im := x₁ * y₂ + y₁ * x₂ }"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"dc8fc80d99c97edd033bf0b9f5c70491abfcb8b77fc0b65cb5746e93dcd53458","prominence":"supporting","quote":{"exact":"This is the same as for reals a 1 × a 2"},"quote_capped":true,"section":["Multiplication of different kinds of numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"after":{"layer":", denoting − 1 {\\displaystyle {\\sqrt {-1}}} as i {\\displaystyle i} , z 1 × z 2 = ( a 1 + b 1 i ) ( a 2 + b 2 i ) = ( a 1 × a 2 ) + ( a 1 × b 2 i ) + ( b 1 × a 2 i ) + ( b 1 × b 2 i 2 ) = ( a 1 a 2 − b 1 b 2 ) + ( a 1 b 2 + b 1 a 2 ) i . {\\displaystyle z_{1}\\times z_{2}=(a_{1}+b_{1}i)(a_{2}+b_{2}i)=(a_{1}\\times a_{2})+(a_{1}\\times b_{2}i)+(b_{1}\\times a_{2}i)+(b_{1}\\times b_{2}i^{2})=(a_{1}a_{2}-b_{1}b_{2})+(a_{1}b_{2}+b_{1}a_{2})i.}","segments":[{"text":", denoting "},{"tex":"\\sqrt {-1}"},{"text":" as "},{"tex":"i"},{"text":" , "},{"tex":"z_{1}\\times z_{2}=(a_{1}+b_{1}i)(a_{2}+b_{2}i)=(a_{1}\\times a_{2})+(a_{1}\\times b_{2}i)+(b_{1}\\times a_{2}i)+(b_{1}\\times b_{2}i^{2})=(a_{1}a_{2}-b_{1}b_{2})+(a_{1}b_{2}+b_{1}a_{2})i."}],"trimmed":true},"layer":"This is the same as for reals a 1 × a 2 {\\displaystyle a_{1}\\times a_{2}} when the imaginary parts b 1 {\\displaystyle b_{1}} and b 2 {\\displaystyle b_{2}} are zero.Equivalently","segments":[{"text":"This is the same as for reals "},{"tex":"a_{1}\\times a_{2}"},{"text":" when the imaginary parts "},{"tex":"b_{1}"},{"text":" and "},{"tex":"b_{2}"},{"text":" are zero.Equivalently"}]},"unresolved":null},{"absence":null,"basis":"fb541ca5a98afdd94a834003fba1211f8aca5d546d22e30055085051e39151a7","coverage":null,"id":"enwiki-20845-1375745567::In-text #8cd0cf73","item":"In-text #8cd0cf73","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Complex.mk_mul_mk","end_line":212,"library":"mathlib","line":211,"location_key":"fb541ca5a98afdd94a834003fba1211f8aca5d546d22e30055085051e39151a7","module":"Mathlib.Basic.Complex.Basic","note":"Lean names a complex number by its two real components rather than in the form a plus b i, and returns the product with real component a1a2 minus b1b2 and imaginary component a1b2 plus b1a2.","pair_key":"57d3adb8f0591d7acfc0dc7f95b189c5fdc51db0e687c307d52f1780721c70c3","path":"Mathlib/Basic/Complex/Basic.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Complex.mk_mul_mk (x₁ x₂ y₁ y₂ : ℝ) : { re := x₁, im := y₁ } * { re := x₂, im := y₂ } = { re := x₁ * x₂ - y₁ * y₂, im := x₁ * y₂ + y₁ * x₂ }"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Complex.mk_eq_add_mul_I","end_line":261,"library":"mathlib","line":260,"location_key":"fd80112502968908edf2d25796030994c4a64dfe146fab07b99e6a23c82da673","module":"Mathlib.Basic.Complex.Basic","note":"It records that the complex number with parts a and b is a plus b times i, the change of notation the passage opens with, and states no product.","pair_key":"ea56638d5646106423deaf4966c3989d2212933c4696bd049d11d6d6202c213c","path":"Mathlib/Basic/Complex/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Complex.mk_eq_add_mul_I (a b : ℝ) : { re := a, im := b } = ↑a + ↑b * Complex.I"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"114189bec19059275faf4e6aa14f5eaabd55b9adc634017fbb137eaf4498603e","prominence":"central","quote":{"exact":"denoting − 1 {\\displaystyle {\\sqrt {-1}}} as i {\\displaystyle i} , z"},"quote_capped":true,"section":["Multiplication of different kinds of numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"after":{"layer":", in trigonometric form, if z 1 = r 1 ( cos ⁡ ϕ 1 + i sin ⁡ ϕ 1 ) , z 2 = r 2 ( cos ⁡ ϕ 2 + i sin ⁡ ϕ 2 ) {\\displaystyle z_{1}=r_{1}(\\cos \\phi _{1}+i\\sin \\phi _{1}),z_{2}=r_{2}(\\cos \\phi _{2}+i\\sin \\phi _{2})} , then z 1 z 2 = r 1 r 2 ( cos ⁡ ( ϕ 1 + ϕ 2 ) + i sin ⁡ ( ϕ 1 + ϕ 2 ) ) . {\\textstyle z_{1}z_{2}=r_{1}r_{2}(\\cos(\\phi _{1}+\\phi _{2})+i\\sin(\\phi _{1}+\\phi _{2})).}","segments":[{"text":", in trigonometric form, if "},{"tex":"z_{1}=r_{1}(\\cos \\phi _{1}+i\\sin \\phi _{1}),z_{2}=r_{2}(\\cos \\phi _{2}+i\\sin \\phi _{2})"},{"text":" , then "},{"tex":"\\textstyle z_{1}z_{2}=r_{1}r_{2}(\\cos(\\phi _{1}+\\phi _{2})+i\\sin(\\phi _{1}+\\phi _{2}))."}],"trimmed":true},"before":{"layer":"This is the same as for reals a 1 × a 2 {\\displaystyle a_{1}\\times a_{2}} when the imaginary parts b 1 {\\displaystyle b_{1}} and b 2 {\\displaystyle b_{2}} are zero.Equivalently, ","segments":[{"text":"This is the same as for reals "},{"tex":"a_{1}\\times a_{2}"},{"text":" when the imaginary parts "},{"tex":"b_{1}"},{"text":" and "},{"tex":"b_{2}"},{"text":" are zero.Equivalently, "}]},"layer":"denoting − 1 {\\displaystyle {\\sqrt {-1}}} as i {\\displaystyle i} , z 1 × z 2 = ( a 1 + b 1 i ) ( a 2 + b 2 i ) = ( a 1 × a 2 ) + ( a 1 × b 2 i ) + ( b 1 × a 2 i ) + ( b 1 × b 2 i 2 ) = ( a 1 a 2 − b 1 b 2 ) + ( a 1 b 2 + b 1 a 2 ) i . {\\displaystyle z_{1}\\times z_{2}=(a_{1}+b_{1}i)(a_{2}+b_{2}i)=(a_{1}\\times a_{2})+(a_{1}\\times b_{2}i)+(b_{1}\\times a_{2}i)+(b_{1}\\times b_{2}i^{2})=(a_{1}a_{2}-b_{1}b_{2})+(a_{1}b_{2}+b_{1}a_{2})i.} [34]Alternatively","segments":[{"text":"denoting "},{"tex":"\\sqrt {-1}"},{"text":" as "},{"tex":"i"},{"text":" , "},{"tex":"z_{1}\\times z_{2}=(a_{1}+b_{1}i)(a_{2}+b_{2}i)=(a_{1}\\times a_{2})+(a_{1}\\times b_{2}i)+(b_{1}\\times a_{2}i)+(b_{1}\\times b_{2}i^{2})=(a_{1}a_{2}-b_{1}b_{2})+(a_{1}b_{2}+b_{1}a_{2})i."},{"text":" "},{"ref":"[34]"},{"text":"Alternatively"}]},"unresolved":null},{"absence":null,"basis":"7311529081a1eb855a8523c6c21ac698a9112af844cd599a9e188db58351aee1","coverage":null,"id":"enwiki-20845-1375745567::In-text #1dc1143f","item":"In-text #1dc1143f","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Circle.exp_add","end_line":135,"library":"mathlib","line":133,"location_key":"7311529081a1eb855a8523c6c21ac698a9112af844cd599a9e188db58351aee1","module":"Mathlib.Analysis.Complex.Circle","note":"Circle.exp t names the complex number exp(t i), which Mathlib's definitions of cosine and sine expand to cos t + i sin t, and the declaration fixes each factor at modulus one.","pair_key":"7e6e8c2787f2904ab6474a8bd41c84b6a1d45e0a5fa064ec5368388c23de3cee","path":"Mathlib/Analysis/Complex/Circle.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Circle.exp_add (x y : ℝ) : Circle.exp (x + y) = Circle.exp x * Circle.exp y"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Complex.exp_add","end_line":131,"library":"mathlib","line":112,"location_key":"1c617c328caa3dc531a79765b017f790bf1e43391e4adbcb2e099178efe9a3db","module":"Mathlib.Analysis.Complex.Exponential","note":"It gives the product rule for the complex exponential; turning that into the passage's cosine-and-sine form needs Euler's identity and a rearrangement of the two radii.","pair_key":"aabda77d4292a69c6a289613d2be7a0631292e9e9eb3bb4360a8b43ec2c88272","path":"Mathlib/Analysis/Complex/Exponential.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Complex.exp_add (x y : ℂ) : Complex.exp (x + y) = Complex.exp x * Complex.exp y"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Complex.arg_mul_coe_angle","end_line":496,"library":"mathlib","line":488,"location_key":"2b725640a23ac66fc6fa3823c3de125e7e576f78b84ab11fca1f0b4219cc3b17","module":"Mathlib.Analysis.SpecialFunctions.Complex.Arg","note":"It says the angle of a product is the sum of the two angles, read modulo a full turn, and says nothing about the two radii or about the displayed product formula.","pair_key":"1990e2372388ea16b6a61052eb0a260bf91264bf3dad49c4fb3595283ea17f1d","path":"Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Complex.arg_mul_coe_angle {x y : ℂ} : x ≠ 0 → y ≠ 0 → ↑(x * y).arg = ↑x.arg + ↑y.arg"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"4927224836cc9aea29d19e28e164eb13b66a1485a38f46caa34e550743356814","prominence":"central","quote":{"exact":"in trigonometric form, if z 1 = r 1 ( cos ⁡"},"quote_capped":true,"section":["Multiplication of different kinds of numbers"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"z 1 × z 2 = ( a 1 + b 1 i ) ( a 2 + b 2 i ) = ( a 1 × a 2 ) + ( a 1 × b 2 i ) + ( b 1 × a 2 i ) + ( b 1 × b 2 i 2 ) = ( a 1 a 2 − b 1 b 2 ) + ( a 1 b 2 + b 1 a 2 ) i . {\\displaystyle z_{1}\\times z_{2}=(a_{1}+b_{1}i)(a_{2}+b_{2}i)=(a_{1}\\times a_{2})+(a_{1}\\times b_{2}i)+(b_{1}\\times a_{2}i)+(b_{1}\\times b_{2}i^{2})=(a_{1}a_{2}-b_{1}b_{2})+(a_{1}b_{2}+b_{1}a_{2})i.} [34]Alternatively, ","segments":[{"tex":"z_{1}\\times z_{2}=(a_{1}+b_{1}i)(a_{2}+b_{2}i)=(a_{1}\\times a_{2})+(a_{1}\\times b_{2}i)+(b_{1}\\times a_{2}i)+(b_{1}\\times b_{2}i^{2})=(a_{1}a_{2}-b_{1}b_{2})+(a_{1}b_{2}+b_{1}a_{2})i."},{"text":" "},{"ref":"[34]"},{"text":"Alternatively, "}],"trimmed":true},"layer":"in trigonometric form, if z 1 = r 1 ( cos ⁡ ϕ 1 + i sin ⁡ ϕ 1 ) , z 2 = r 2 ( cos ⁡ ϕ 2 + i sin ⁡ ϕ 2 ) {\\displaystyle z_{1}=r_{1}(\\cos \\phi _{1}+i\\sin \\phi _{1}),z_{2}=r_{2}(\\cos \\phi _{2}+i\\sin \\phi _{2})} , then z 1 z 2 = r 1 r 2 ( cos ⁡ ( ϕ 1 + ϕ 2 ) + i sin ⁡ ( ϕ 1 + ϕ 2 ) ) . {\\textstyle z_{1}z_{2}=r_{1}r_{2}(\\cos(\\phi _{1}+\\phi _{2})+i\\sin(\\phi _{1}+\\phi _{2})).}","segments":[{"text":"in trigonometric form, if "},{"tex":"z_{1}=r_{1}(\\cos \\phi _{1}+i\\sin \\phi _{1}),z_{2}=r_{2}(\\cos \\phi _{2}+i\\sin \\phi _{2})"},{"text":" , then "},{"tex":"\\textstyle z_{1}z_{2}=r_{1}r_{2}(\\cos(\\phi _{1}+\\phi _{2})+i\\sin(\\phi _{1}+\\phi _{2}))."}]},"unresolved":null},{"absence":null,"basis":"e9bbaac177de2d13e548933b61ba44796ae61daca5a40f61a3984926ab539302","coverage":null,"id":"enwiki-20845-1375745567::In-text #9648ab71","item":"In-text #9648ab71","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Mul","end_line":1656,"library":"lean-core","line":1654,"location_key":"e9bbaac177de2d13e548933b61ba44796ae61daca5a40f61a3984926ab539302","module":"Init.Prelude","note":"Lean's class carries the multiplicatively written binary operation for any carrier type, so it also covers carriers that are not rings.","pair_key":"349186ec978e4a586798539f8f45d51833aecaedc891503226c75b81da7fd7ae","path":"src/Init/Prelude.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"class Mul : Type u → Type u"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Ring","end_line":146,"library":"mathlib","line":146,"location_key":"e094d20876e615a5ad48853e9abba789a11a66229fbe75930903d5476d160298","module":"Mathlib.Algebra.Ring.Defs","note":"It declares the structure the passage names, with its two operations and their laws, rather than singling out the multiplicative one.","pair_key":"e5bf0e19e9c5050f6697885211a65ce7e88e0b1ed8c56e087e3e044b3697c9be","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class Ring : Type u → Type u"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"342138b19f5c96033cab24198876552823857f229118c8216bc9d9b5442eb6fe","prominence":"central","quote":{"exact":"A very general, and abstract, concept of multiplication is as the \"multiplicatively"},"quote_capped":true,"section":["Multiplication of different kinds of numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"A very general, and abstract, concept of multiplication is as the \"multiplicatively denoted\" (second) binary operation in a ring.","segments":[{"text":"A very general, and abstract, concept of multiplication is as the \"multiplicatively denoted\" (second) binary operation in a ring."}]},"unresolved":null},{"absence":null,"basis":"8c23da555e4d2cd9742caa7d4f9349f1f223fc13b2c02d793ab78476076989fd","coverage":null,"id":"enwiki-20845-1375745567::In-text #c6a01dad","item":"In-text #c6a01dad","kind":"example","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Polynomial.ring","end_line":1112,"library":"mathlib","line":1108,"location_key":"8c23da555e4d2cd9742caa7d4f9349f1f223fc13b2c02d793ab78476076989fd","module":"Mathlib.Algebra.Polynomial.Basic","note":"It supplies the ring structure on polynomials; whether polynomials deserve to be called numbers is not something a declaration settles.","pair_key":"a7b49ad913da7895f56bbcc3cc0adf8e39849fb6d051546265b4e81fbc0adcb0","path":"Mathlib/Algebra/Polynomial/Basic.lean","proof_status":"definition","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Polynomial.ring {R : Type u} [Ring R] : Ring (R[X])"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Polynomial.commRing","end_line":1144,"library":"mathlib","line":1141,"location_key":"d23cd8026e487e5305f75c250fdebc5f9536f9b46dd9e209e492f2057fada11b","module":"Mathlib.Algebra.Polynomial.Basic","note":"This is the commutative-coefficient form of the same structure; it likewise leaves the article's remark about number systems untouched.","pair_key":"8f075526d59bb7041cdf3e18e560b8bc23ec7d8a870abed4a47ef0c47e390a86","path":"Mathlib/Algebra/Polynomial/Basic.lean","proof_status":"definition","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Polynomial.commRing {R : Type u} [CommRing R] : CommRing (R[X])"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"30f87e830e0f468b78f4dbeb84cd1585eb48740a83cab26dfb842e929ecd5547","prominence":"supporting","quote":{"exact":"An example of a ring that is not any of the number"},"quote_capped":true,"section":["Multiplication of different kinds of numbers"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"layer":"An example of a ring that is not any of the number systems above is a polynomial ring (polynomials can be added and multiplied, but polynomials are not numbers in any usual sense).","segments":[{"text":"An example of a ring that is not any of the number systems above is a polynomial ring (polynomials can be added and multiplied, but polynomials are not numbers in any usual sense)."}]},"unresolved":null},{"absence":null,"basis":"18d23c3260873598b681bebc7694a9edfc86aa5a438b4329fe1f8dc020e47cbe","coverage":null,"id":"enwiki-20845-1375745567::In-text #12ab962c","item":"In-text #12ab962c","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"div_eq_mul_one_div","end_line":344,"library":"mathlib","line":344,"location_key":"18d23c3260873598b681bebc7694a9edfc86aa5a438b4329fe1f8dc020e47cbe","module":"Mathlib.Algebra.Group.Basic","note":"The declaration writes the reciprocal exactly as the passage does, as one divided by the second number.","pair_key":"fa2deec3446ba8c26a1e212cddac9941d81328713b9e3e9c1b5e2da06a108931","path":"Mathlib/Algebra/Group/Basic.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem div_eq_mul_one_div {G : Type*} [DivInvMonoid G] (a b : G) : a / b = a * (1 / b)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"div_eq_mul_inv","end_line":243,"library":"mathlib","line":242,"location_key":"9cd604e666c9704582a610596bb0a50fd0dba49c9b29b744508913416951d3ab","module":"Mathlib.Algebra.Group.DivInvMonoid","note":"Lean writes the reciprocal of the divisor with an inverse symbol where the passage writes it as one over the divisor, the same element.","pair_key":"947780825bf04e20e013833a6f6df2529de423bf4114e1e15620a9c6d7b590d6","path":"Mathlib/Algebra/Group/DivInvMonoid.lean","proof_status":"proved","rank":2,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem div_eq_mul_inv {G : Type*} [DivInvMonoid G] (a b : G) : a / b = a * b⁻¹"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"01f0859f5912812ed1c5616c94413c9ca7907ec0a05bba30e4e0b95dd86fea39","prominence":"central","quote":{"exact":"Often division, x y {\\displaystyle {\\frac {x}{y}}} , is the same as"},"quote_capped":true,"section":["Multiplication of different kinds of numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"Division ","lead_in":true,"segments":[{"text":"Division "}]},"layer":"Often division, x y {\\displaystyle {\\frac {x}{y}}} , is the same as multiplication by an inverse, x ( 1 y ) {\\displaystyle x\\left({\\frac {1}{y}}\\right)} .","segments":[{"text":"Often division, "},{"tex":"\\frac {x}{y}"},{"text":" , is the same as multiplication by an inverse, "},{"tex":"x\\left({\\frac {1}{y}}\\right)"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"3dbda327cb4b7986cd04b3469d530a9d345b609430fd822e7cb86181dd0bb987","coverage":null,"id":"enwiki-20845-1375745567::In-text #35d4f7b7","item":"In-text #35d4f7b7","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Nat.div","end_line":2326,"library":"lean-core","line":2315,"location_key":"3dbda327cb4b7986cd04b3469d530a9d345b609430fd822e7cb86181dd0bb987","module":"Init.Prelude","note":"It defines the quotient of two naturals, discarding a remainder and returning zero for a zero divisor; it says nothing by itself about inverses.","pair_key":"a5d971f477b10de4147b4e81caa2b155db04a35656efa6b4e6bf45a00d238bde","path":"src/Init/Prelude.lean","proof_status":"definition","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Nat.div : Nat → Nat → Nat"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.isUnit_iff","end_line":38,"library":"mathlib","line":38,"location_key":"78edf33a1fe7d193e78ca8dcdbc5f94cff8e9762edf91085edbf320be919a428","module":"Mathlib.Algebra.Group.Nat.Units","note":"It characterises the invertible naturals as the single number one, which settles that inverses are missing for every other natural.","pair_key":"14ef7aaca535cc65bf36163730d8875b06e1adea1b846eb2c9dc034069b132dd","path":"Mathlib/Algebra/Group/Nat/Units.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.isUnit_iff {n : ℕ} : IsUnit n ↔ n = 1"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"81f2519d607f88d1f242ceecae6a1fe401a9ea4cb9ef5c3d325c17abf1d32c09","prominence":"supporting","quote":{"exact":"Multiplication for some types of \"numbers\" may have corresponding division, without inverses"},"quote_capped":false,"section":["Multiplication of different kinds of numbers"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"after":{"layer":"; in an integral domain x may have no inverse \" 1 x {\\displaystyle {\\frac {1}{x}}} \" but x y {\\displaystyle {\\frac {x}{y}}} may be defined.","segments":[{"text":"; in an integral domain x may have no inverse \" "},{"tex":"\\frac {1}{x}"},{"text":" \" but "},{"tex":"\\frac {x}{y}"},{"text":" may be defined."}]},"layer":"Multiplication for some types of \"numbers\" may have corresponding division, without inverses","segments":[{"text":"Multiplication for some types of \"numbers\" may have corresponding division, without inverses"}]},"unresolved":null},{"absence":null,"basis":"19c1ab6e20551266cd54635a4e9239df4de257908142a5379e32b36ca90e8d53","coverage":null,"id":"enwiki-20845-1375745567::In-text #255f5966","item":"In-text #255f5966","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Int.isUnit_iff","end_line":49,"library":"mathlib","line":45,"location_key":"19c1ab6e20551266cd54635a4e9239df4de257908142a5379e32b36ca90e8d53","module":"Mathlib.Algebra.Group.Int.Units","note":"It pins down the invertible integers as exactly two of them, which gives the missing reciprocal the passage speaks of inside an integral domain.","pair_key":"1f1186b498822d16f6c655a81cf8ec4abb903d66e8483bc1c2e612b04af5c25e","path":"Mathlib/Algebra/Group/Int/Units.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Int.isUnit_iff {u : ℤ} : IsUnit u ↔ u = 1 ∨ u = -1"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Int.instDiv","end_line":112,"library":"lean-core","line":111,"location_key":"bbc9f85b89be54d9ffaa28f3ca779c3e332f1dd2332250836453a9d7b8e76bdb","module":"Init.Data.Int.DivMod.Basic","note":"It equips the integers with a quotient using the Euclidean rounding convention, which is defined for every pair of integers.","pair_key":"170f19b366b0068ff1f24b3b8b4dc75db0934bbf441266b8aebe780952ef0e30","path":"src/Init/Data/Int/DivMod/Basic.lean","proof_status":"definition","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"instance Int.instDiv : Div Int"},"statement":false},{"challenge":"downgraded","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"EuclideanDomain.mul_div_cancel'","end_line":102,"library":"mathlib","line":101,"location_key":"5d07d6ea2a7ccec73da49d20a3670a192bb3e145ad0a07b477be2d956ab57e01","module":"Mathlib.Algebra.EuclideanDomain.Basic","note":"It shows the quotient behaving as exact division in a domain whose divisor need not be invertible.","pair_key":"d189db0e63a26d6446c785ffee6f3c81a609c4f8647e569d6595f479a68271ea","path":"Mathlib/Algebra/EuclideanDomain/Basic.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem EuclideanDomain.mul_div_cancel' {R : Type u} [EuclideanDomain R] {a b : R} : b ≠ 0 → b ∣ a → b * (a / b) = a"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"956de4fa9998a9d6e69b25999279f57ff38e4c2a8f2f8f14b44e8983a57439aa","prominence":"central","quote":{"exact":"in an integral domain x may have no inverse \" 1 x"},"quote_capped":true,"section":["Multiplication of different kinds of numbers"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"Multiplication for some types of \"numbers\" may have corresponding division, without inverses; ","segments":[{"text":"Multiplication for some types of \"numbers\" may have corresponding division, without inverses; "}]},"layer":"in an integral domain x may have no inverse \" 1 x {\\displaystyle {\\frac {1}{x}}} \" but x y {\\displaystyle {\\frac {x}{y}}} may be defined.","segments":[{"text":"in an integral domain x may have no inverse \" "},{"tex":"\\frac {1}{x}"},{"text":" \" but "},{"tex":"\\frac {x}{y}"},{"text":" may be defined."}]},"unresolved":null},{"absence":null,"basis":"59ced9b57b12da0aca474582317d5fa64df8d2cbe234203ae98e9134fc76fc59","coverage":null,"id":"enwiki-20845-1375745567::In-text #c98c89bd","item":"In-text #c98c89bd","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_inv_cancel₀","end_line":228,"library":"mathlib","line":228,"location_key":"59ced9b57b12da0aca474582317d5fa64df8d2cbe234203ae98e9134fc76fc59","module":"Mathlib.Algebra.GroupWithZero.Defs","note":"The further remark about a quotient being ambiguous when multiplication does not commute is a separate claim this equation does not address.","pair_key":"c443360f055c857417f735615557f634775ca158e151b2f05f28dd3c1289caf4","path":"Mathlib/Algebra/GroupWithZero/Defs.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_inv_cancel₀ {G₀ : Type u} [GroupWithZero G₀] {a : G₀} : a ≠ 0 → a * a⁻¹ = 1"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"inv_mul_cancel₀","end_line":56,"library":"mathlib","line":52,"location_key":"a3c6bda57b10207180c639b280eca2fda7efbce717588a67b7032e66c59ee2d4","module":"Mathlib.Algebra.GroupWithZero.NeZero","note":"It records the inverse acting from the left, which matters precisely because multiplication here need not commute.","pair_key":"291f3617c635b45f702948110e604cd59a4e8aebf538e6c5af1166e69fc36a3b","path":"Mathlib/Algebra/GroupWithZero/NeZero.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem inv_mul_cancel₀ {G₀ : Type*} [GroupWithZero G₀] {a : G₀} : a ≠ 0 → a⁻¹ * a = 1"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"DivisionRing","end_line":153,"library":"mathlib","line":116,"location_key":"e6dfc55380125eafe14479712fe4b1935fd27d1eef9494426856e00cd4c285d7","module":"Mathlib.Algebra.Field.Defs","note":"It declares the structure the passage names, with inverses for nonzero elements built into its data and laws.","pair_key":"6b852b79aeff2c1469f28c233d0aaf5ff1de4bf128e88f6f68ef560fdbe2e41d","path":"Mathlib/Algebra/Field/Defs.lean","proof_status":"definition","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class DivisionRing : Type u_2 → Type u_2"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"356b5be3c8cf2e04287ad117ae187a8d5484fb5aa7b8aed38608612f0e3c38fe","prominence":"central","quote":{"exact":"In a division ring there are inverses, but x y {\\displaystyle {\\frac"},"quote_capped":true,"section":["Multiplication of different kinds of numbers"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"after":{"layer":" since x ( 1 y ) {\\displaystyle x\\left({\\frac {1}{y}}\\right)} need not be the same as ( 1 y ) x {\\displaystyle \\left({\\frac {1}{y}}\\right)x} .[41][citation needed]","segments":[{"text":" since "},{"tex":"x\\left({\\frac {1}{y}}\\right)"},{"text":" need not be the same as "},{"tex":"\\left({\\frac {1}{y}}\\right)x"},{"text":" ."},{"ref":"[41]"},{"text":"[citation needed]"}]},"layer":"In a division ring there are inverses, but x y {\\displaystyle {\\frac {x}{y}}} may be ambiguous in non-commutative rings","segments":[{"text":"In a division ring there are inverses, but "},{"tex":"\\frac {x}{y}"},{"text":" may be ambiguous in non-commutative rings"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":5,"sha256":"c52aad30102763bab04ea5b39854c42b5573af1b92bd2f9cfe5347a83b760fc0"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-20845-1375745567::In-text #1816a68d","item":"In-text #1816a68d","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e41c8e38008bac6d3c2f84f79253f665c60432596b67d726fb914947c8906f55","prominence":"supporting","quote":{"exact":"x ( 1 y ) {\\displaystyle x\\left({\\frac {1}{y}}\\right)} need not be the"},"quote_capped":true,"section":["Multiplication of different kinds of numbers"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=20845&oldid=1375745567","text":{"before":{"layer":"In a division ring there are inverses, but x y {\\displaystyle {\\frac {x}{y}}} may be ambiguous in non-commutative rings since ","segments":[{"text":"In a division ring there are inverses, but "},{"tex":"\\frac {x}{y}"},{"text":" may be ambiguous in non-commutative rings since "}]},"layer":"x ( 1 y ) {\\displaystyle x\\left({\\frac {1}{y}}\\right)} need not be the same as ( 1 y ) x {\\displaystyle \\left({\\frac {1}{y}}\\right)x} .[41][citation needed]","segments":[{"tex":"x\\left({\\frac {1}{y}}\\right)"},{"text":" need not be the same as "},{"tex":"\\left({\\frac {1}{y}}\\right)x"},{"text":" ."},{"ref":"[41]"},{"text":"[citation needed]"}]},"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":351007,"images":[{"author":"Silly rabbit at English Wikipedia","file":"Gelosia_multiplication_45_256.png","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0/","project":"commons"},{"author":"Kmhkmh","file":"Komplexe_zahlenebene.svg","licence":"CC BY 4.0","licence_url":"https://creativecommons.org/licenses/by/4.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":"Gisling","file":"Multiplication_algorithm.GIF","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0","project":"commons"},{"author":"Krishnavedala","file":"Multiplication_chart.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"Dmcq","file":"Multiply_4_bags_3_marbles.svg","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0","project":"commons"},{"author":"Dmcq","file":"Multiply_scaling.svg","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","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":"David Vignoni, changed colour to blue by yonidebest","file":"Postscript-viewer-blue.svg","licence":"LGPL","licence_url":"https://www.gnu.org/licenses/lgpl.html","project":"commons"},{"author":"Tkgd2007","file":"Question_book-new.svg","licence":"Cc-by-sa-3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0/","project":"en"},{"author":"Jim.belk","file":"Three_by_Four.svg","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"Yoram Shoval","file":"צעצוע_מכני_משנת_1918_לחישובי_לוח_הכפל_The_Educated_Monkey.jpg","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"}],"marks":660,"passages":148,"sha256":"13f1a22ed07bd4f22b0bd0c793a4e3b1bf60ccfbe40fc5493fba45638c650a92","unplaced":["enwiki-20845-1375745567::In-text #8483c9c5","enwiki-20845-1375745567::In-text #4c139e78","enwiki-20845-1375745567::In-text #95256820","enwiki-20845-1375745567::In-text #ef1e767d"]},"record_set":"23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602","records_sha256":"d50ad206e60a6a2636b3af0f8a42c8c2a93931adf7e7c2d94ab511dbe01946ff","revision":1375745567,"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":"6a640f5ae505d62916514bb4bd13d2844ae478361876e344a46b53da86ba5c69","layer_sha256":"74b34233a26b1d5573976bf6f391f28d25dc64e71e13d156441b9f0311918ac6","renderer":"web-html/3"},"source_id":"enwiki-20845-1375745567","summary":{"by_library":{"atlas":{"complete":0,"incomplete":1,"locations":1,"passages":1,"related":4},"formal-conjectures":{"complete":1,"incomplete":0,"locations":1,"passages":1,"related":2},"lean-core":{"complete":77,"incomplete":0,"locations":77,"passages":48,"related":5},"mathlib":{"complete":139,"incomplete":0,"locations":139,"passages":89,"related":42},"tauceti":{"complete":4,"incomplete":0,"locations":4,"passages":4,"related":4}},"by_prominence":{"central":{"by_status":{"formalized":56,"not_formalized":11,"partial":11,"statement_only":1,"unresolved":0},"passages":79},"subject":{"by_status":{"formalized":0,"not_formalized":0,"partial":0,"statement_only":0,"unresolved":0},"passages":0},"supporting":{"by_status":{"formalized":29,"not_formalized":24,"partial":16,"statement_only":0,"unresolved":4},"passages":73}},"by_proof_status":{"definition":89,"proved":186,"wanted":4},"by_relation":{"broadMatch":97,"closeMatch":39,"exactMatch":9,"hasPart":47,"narrowMatch":30,"relatedMatch":57},"by_status":{"formalized":85,"not_formalized":35,"partial":27,"statement_only":1,"unresolved":4},"locations":222,"passages":152,"related":57},"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":"Multiplication","universe":{"frozen":"2026-10-17","id":"u1","libraries":48,"sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"wikidata":"Q40276"}
