{"assessment":{"class":"C","importance":"high"},"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":103118,"passages":[{"absence":null,"basis":"2faf2acc23d6890e691c505fa54fd7aa59b01f84e7cdefcb7aed40d5d1342ccf","coverage":null,"id":"enwiki-103118-1369824603::In-text #547540cf","item":"In-text #547540cf","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"left_distrib","end_line":89,"library":"mathlib","line":87,"location_key":"c6981d40ae4365033d92ed82964ade594d3b421b7369969150c0235ba620cb88","module":"Mathlib.Algebra.Ring.Defs","note":"Lean states the identity for any carrier whose multiplication and addition satisfy the left-distributive class, which is the binary-operation setting the passage speaks about.","pair_key":"4e6031fcfbbff157f3fe5a5be6306e572c243f85ead3be2ac0e5e81daa5d259c","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 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":"Distrib","end_line":66,"library":"mathlib","line":62,"location_key":"2faf2acc23d6890e691c505fa54fd7aa59b01f84e7cdefcb7aed40d5d1342ccf","module":"Mathlib.Algebra.Ring.Defs","note":"This Lean class is the property of a pair of binary operations on any carrier, and it carries the right-hand law beside the one the passage displays.","pair_key":"fe5f421f8be3f0a221a7641c8a4502c502fbac2abff18127f5ce8df7fa9b833d","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class Distrib : Type u_1 → Type u_1"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.left_distrib","end_line":228,"library":"lean-core","line":225,"location_key":"6378940267d00ee01f3689557b81e4aab79704372dccb3ec34c0e9958290cced","module":"Init.Data.Nat.Basic","note":"Lean fixes the carrier to the natural numbers, where the passage speaks of numbers at large.","pair_key":"7a59c8c8780b6111a26a3c55117f2b2f2424117b276075d476d99041a6d8e4b5","path":"src/Init/Data/Nat/Basic.lean","proof_status":"proved","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.left_distrib (n m k : Nat) : n * (m + k) = n * m + n * k"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"32663f238a87187414ef1f06522dfdc8c00da877ca7286ef249668e85c46a729","prominence":"subject","quote":{"exact":"In mathematics, the distributive property of binary operations is a generalization of"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"In mathematics, the distributive property of binary operations is a generalization of the distributive law, which asserts that the equality x ⋅ ( y + z ) = x ⋅ y + x ⋅ z {\\displaystyle x\\cdot (y+z)=x\\cdot y+x\\cdot z} is always true in elementary algebra.","segments":[{"text":"In mathematics, the distributive property of binary operations is a generalization of the distributive law, which asserts that the equality "},{"display":true,"tex":"x\\cdot (y+z)=x\\cdot y+x\\cdot z"},{"text":" is always true in elementary algebra."}]},"unresolved":null},{"absence":null,"basis":"79a150f0ee5cde2e44d132fd3901133710d7ff2ffdb74e5bff23b8afe5198ead","coverage":null,"id":"enwiki-103118-1369824603::In-text #e865be01","item":"In-text #e865be01","kind":"example","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.left_distrib","end_line":228,"library":"lean-core","line":225,"location_key":"79a150f0ee5cde2e44d132fd3901133710d7ff2ffdb74e5bff23b8afe5198ead","module":"Init.Data.Nat.Basic","note":"Lean quantifies over all natural numbers where the example fixes three of them.","pair_key":"c9296be05579958fb4591d3a08bf41fc7805421e45dcd64747be20c0c38dfaec","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.left_distrib (n m k : Nat) : n * (m + k) = n * m + n * k"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"left_distrib","end_line":89,"library":"mathlib","line":87,"location_key":"c56210a8dd9e94c31d2322b7d79cbd7d6452174e25b277c357d010ef66806674","module":"Mathlib.Algebra.Ring.Defs","note":"Lean states the law for any carrier carrying the left-distributive class, not for the three numbers of the example.","pair_key":"a099b00e239310a29f8fd6fab65be6754071e6ee53cc09254818ed4a4d032eee","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}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"900800f6613586a980e1e9ca31679c61bfcf1d931da6a4f9c28c97a5c3b66162","prominence":"supporting","quote":{"exact":"For example, in elementary arithmetic, one has 2 ⋅ ( 1 +"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"after":{"layer":" Therefore, one would say that multiplication distributes over addition.","segments":[{"text":" Therefore, one would say that multiplication distributes over addition."}]},"layer":"For example, in elementary arithmetic, one has 2 ⋅ ( 1 + 3 ) = ( 2 ⋅ 1 ) + ( 2 ⋅ 3 ) . {\\displaystyle 2\\cdot (1+3)=(2\\cdot 1)+(2\\cdot 3).}","segments":[{"text":"For example, in elementary arithmetic, one has "},{"display":true,"tex":"2\\cdot (1+3)=(2\\cdot 1)+(2\\cdot 3)."}]},"unresolved":null},{"absence":null,"basis":"2d9c20f93857a28e94cc4f691d5cae7db8f1a8f5bdcd6f02468321dec211ac5d","coverage":null,"id":"enwiki-103118-1369824603::In-text #0ab578f9","item":"In-text #0ab578f9","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.instDistrib","end_line":36,"library":"mathlib","line":34,"location_key":"2d9c20f93857a28e94cc4f691d5cae7db8f1a8f5bdcd6f02468321dec211ac5d","module":"Mathlib.Algebra.Ring.Nat","note":"Lean records the property for the natural numbers, one of the number systems the passage covers.","pair_key":"10b95385ac2570617750f636d932d47f12eb95da07fa4501a3d57c06401e1a4b","path":"Mathlib/Algebra/Ring/Nat.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Nat.instDistrib : Distrib ℕ"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Int.instDistrib","end_line":89,"library":"mathlib","line":89,"location_key":"dc2b57a92e6a584fd1c2eb65605b6fa100a17099d441c0be50fde6711204696f","module":"Mathlib.Algebra.Ring.Int.Defs","note":"Lean records the property for the integers, another of the number systems the passage covers.","pair_key":"3de3b5e44119e57db0d82bfb8ad6f848fcc8f6f849f8f1fee8f0e1f5c6b76c41","path":"Mathlib/Algebra/Ring/Int/Defs.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Int.instDistrib : Distrib ℤ"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"left_distrib","end_line":89,"library":"mathlib","line":87,"location_key":"b1d4f3cd44f7aec7bed6a46313f6c67bf8fc63066bfdc4f3d1f0864fe7ba372f","module":"Mathlib.Algebra.Ring.Defs","note":"It gives the law with the sum on the right of the product, and leaves the companion law to right_distrib.","pair_key":"e11c55e83fde2b0bb2c7ced345354cc04aa5f3c967c50a790931efb55e2febab","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 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":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"right_distrib","end_line":95,"library":"mathlib","line":93,"location_key":"bd9647e077d3ab136a03a60bce4c9e374eebac69432a6508b395c707c845f413","module":"Mathlib.Algebra.Ring.Defs","note":"It gives the law with the sum on the left of the product, and leaves the companion law to left_distrib.","pair_key":"23eac1dd06a2062902b73f8279894adf859adc206455b3ca19a2cbf679a7b67a","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"proved","rank":4,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem right_distrib {R : Type v} [Mul R] [Add R] [RightDistribClass R] (a b c : R) : (a + b) * c = a * c + b * c"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"82333b93be2de78b91b3b360eebc178a1b15948c079ed98711f4d4b8244d1705","prominence":"supporting","quote":{"exact":"Therefore, one would say that multiplication distributes over addition."},"quote_capped":false,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"before":{"layer":"For example, in elementary arithmetic, one has 2 ⋅ ( 1 + 3 ) = ( 2 ⋅ 1 ) + ( 2 ⋅ 3 ) . {\\displaystyle 2\\cdot (1+3)=(2\\cdot 1)+(2\\cdot 3).} ","segments":[{"text":"For example, in elementary arithmetic, one has "},{"display":true,"tex":"2\\cdot (1+3)=(2\\cdot 1)+(2\\cdot 3)."},{"text":" "}]},"layer":"Therefore, one would say that multiplication distributes over addition.","segments":[{"text":"Therefore, one would say that multiplication distributes over addition."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"8edd2a32e0fe3f292932e68afb39d56dbcc75a7f32a584c48de822cf3b47b14b","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"57527c2ad9494bb36978209d1636b219a438c344c673052198749837c542eb42","text":"conjunction distributes over disjunction"},{"id":"c2","part":"2c691086c95964d2dade0ee5aca68f05f3b40f6bb2b91cee2570d3645d40d13c","text":"disjunction distributes over conjunction"}],"parts":["57527c2ad9494bb36978209d1636b219a438c344c673052198749837c542eb42","2c691086c95964d2dade0ee5aca68f05f3b40f6bb2b91cee2570d3645d40d13c"],"relation":"broadMatch","status":"formalized"},"id":"enwiki-103118-1369824603::In-text #50af0ad3","item":"In-text #50af0ad3","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"inf_sup_left","end_line":329,"library":"mathlib","line":323,"location_key":"57527c2ad9494bb36978209d1636b219a438c344c673052198749837c542eb42","module":"Mathlib.Order.Defs.Lattice","note":"Lean writes the law with lattice meet and join, and the index supplies those instances for Boolean algebras and for Prop.","pair_key":"7545cf505e1ab3d86e87640f966e204dca7725c51bfd0a86d06fc8664155f042","path":"Mathlib/Order/Defs/Lattice.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem inf_sup_left {α : Type u} [DistribLattice α] (a b c : α) : a ⊓ (b ⊔ c) = a ⊓ b ⊔ a ⊓ c"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"sup_inf_left","end_line":317,"library":"mathlib","line":316,"location_key":"2c691086c95964d2dade0ee5aca68f05f3b40f6bb2b91cee2570d3645d40d13c","module":"Mathlib.Order.Defs.Lattice","note":"Lean writes the companion law with lattice join and meet, over the same class of carriers.","pair_key":"288605d628d87eee8b7df514a23b78c9abdcb5720d0d486ef17a626cf3791012","path":"Mathlib/Order/Defs/Lattice.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem sup_inf_left {α : Type u} [DistribLattice α] (a b c : α) : a ⊔ b ⊓ c = (a ⊔ b) ⊓ (a ⊔ c)"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"and_or_left","end_line":122,"library":"lean-core","line":120,"location_key":"c93e2c5463c5e120e5b83ca6948e288454963b7c067b082e77ea1b093a244af5","module":"Init.PropLemmas","note":"Lean states it for propositions only, while the conjunct also speaks of Boolean algebras.","pair_key":"76f6a826942a0026b68b7a4d8cfa5260d749dc4cd6e5520c1c84af8f299c9a5d","path":"src/Init/PropLemmas.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem and_or_left {a b c : Prop} : a ∧ (b ∨ c) ↔ a ∧ b ∨ a ∧ c"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"or_and_left","end_line":130,"library":"lean-core","line":128,"location_key":"065717d8de5900782147f050900ac77c9ccf1c2dc55cc049fdb558f3b743208d","module":"Init.PropLemmas","note":"Lean states it for propositions only, while the conjunct also speaks of Boolean algebras.","pair_key":"95be8458e4e7b3e5d51f732e7b5181ea7f4fb3c0e8cbc7edff41dba17f3f9dfa","path":"src/Init/PropLemmas.lean","proof_status":"proved","rank":4,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem or_and_left {a b c : Prop} : a ∨ b ∧ c ↔ (a ∨ b) ∧ (a ∨ c)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"78b000ce1757db85fb39603608caf31c096d6f70c0ea278a85f7d4295e10f81b","prominence":"supporting","quote":{"exact":"It is also encountered in Boolean algebra and mathematical logic, where each"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"It is also encountered in Boolean algebra and mathematical logic, where each of the logical and (denoted ∧ {\\displaystyle \\,\\land \\,} ) and the logical or (denoted ∨ {\\displaystyle \\,\\lor \\,} ) distributes over the other.","segments":[{"text":"It is also encountered in Boolean algebra and mathematical logic, where each of the logical and (denoted "},{"tex":"\\,\\land \\,"},{"text":" ) and the logical or (denoted "},{"tex":"\\,\\lor \\,"},{"text":" ) distributes over the other."}]},"unresolved":null},{"absence":null,"basis":"be17a4b8c705e58f42eca7672950eb66d47457f22ae2a233dcf1d606b3416f15","coverage":null,"id":"enwiki-103118-1369824603::In-text #c54597c9","item":"In-text #c54597c9","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"LeftDistribClass","end_line":71,"library":"mathlib","line":69,"location_key":"be17a4b8c705e58f42eca7672950eb66d47457f22ae2a233dcf1d606b3416f15","module":"Mathlib.Algebra.Ring.Defs","note":"The Lean class carries the two operations as instances on the carrier type, and its field is the identity the passage displays.","pair_key":"49778473eedbbe0c21db6e538af4f169d84d12ef835ba334920720b5573671fb","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class LeftDistribClass (R : Type*) [Mul R] [Add R] : Prop"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"left_distrib","end_line":89,"library":"mathlib","line":87,"location_key":"50d4d766f78712a11a0c4f09226d672210745cc6901f13ad04634ea382ecc89c","module":"Mathlib.Algebra.Ring.Defs","note":"It unfolds the Lean class into the equation that the passage uses as its definition.","pair_key":"129e0834ffc6b92dbce142dd1a51d092e0ce97e1c68a63e7ca249b18f037e966","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"proved","rank":2,"relation":"closeMatch","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}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"bdd2ecc3e78b20d930dada8a680df9f54a76862616ea5bd9b528b2d1e7b3472a","prominence":"central","quote":{"exact":"the operation ∗ {\\displaystyle \\,*\\,} is left-distributive over (or with respect to)"},"quote_capped":true,"section":["Definition"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"before":{"layer":"Given a set S {\\displaystyle S} and two binary operators ∗ {\\displaystyle \\,*\\,} and + {\\displaystyle \\,+\\,} on S , {\\displaystyle S,} ","lead_in":true,"segments":[{"text":"Given a set "},{"tex":"S"},{"text":" and two binary operators "},{"tex":"\\,*\\,"},{"text":" and "},{"tex":"\\,+\\,"},{"text":" on "},{"tex":"S,"},{"text":" "}]},"layer":"the operation ∗ {\\displaystyle \\,*\\,} is left-distributive over (or with respect to) + {\\displaystyle \\,+\\,} if, given any elements x , y , and z {\\displaystyle x,y,{\\text{ and }}z} of S , {\\displaystyle S,} x ∗ ( y + z ) = ( x ∗ y ) + ( x ∗ z ) ; {\\displaystyle x*(y+z)=(x*y)+(x*z);}","segments":[{"text":"the operation "},{"tex":"\\,*\\,"},{"text":" is left-distributive over (or with respect to) "},{"tex":"\\,+\\,"},{"text":" if, given any elements "},{"tex":"x,y,{\\text{ and }}z"},{"text":" of "},{"tex":"S,"},{"text":" "},{"display":true,"tex":"x*(y+z)=(x*y)+(x*z);"}]},"unresolved":null},{"absence":null,"basis":"f4cccdcbab4c48dcd64becff6a24879c806289195114e39e63f8e1f4e2fe1c4c","coverage":null,"id":"enwiki-103118-1369824603::In-text #8b3abede","item":"In-text #8b3abede","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"RightDistribClass","end_line":76,"library":"mathlib","line":74,"location_key":"f4cccdcbab4c48dcd64becff6a24879c806289195114e39e63f8e1f4e2fe1c4c","module":"Mathlib.Algebra.Ring.Defs","note":"The Lean class carries the two operations as instances on the carrier type, and its field is the identity the passage displays.","pair_key":"49044043cc6e4cfa03c6c1d912d70d697633be94f58b33ee52ad3db9e4515a87","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class RightDistribClass (R : Type*) [Mul R] [Add R] : Prop"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"right_distrib","end_line":95,"library":"mathlib","line":93,"location_key":"2bb09d9f778d61b92649bf6167b764a1b03981528635e27a7dfdf5e8bddd1de0","module":"Mathlib.Algebra.Ring.Defs","note":"It unfolds the Lean class into the equation that the passage uses as its definition.","pair_key":"291a27e854335cb7c404f979df6f16b577d2b15cc9c3275e1f7037c6e517daf3","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem right_distrib {R : Type v} [Mul R] [Add R] [RightDistribClass R] (a b c : R) : (a + b) * c = a * c + b * c"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6bdac9eb1393775b599a34db28414ba11d60d1baf48313dd1cff8d9a1532cf9b","prominence":"central","quote":{"exact":"the operation ∗ {\\displaystyle \\,*\\,} is right-distributive over + {\\displaystyle \\,+\\,} if,"},"quote_capped":true,"section":["Definition"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"before":{"layer":"x ∗ ( y + z ) = ( x ∗ y ) + ( x ∗ z ) ; {\\displaystyle x*(y+z)=(x*y)+(x*z);} ","lead_in":true,"segments":[{"display":true,"tex":"x*(y+z)=(x*y)+(x*z);"},{"text":" "}]},"layer":"the operation ∗ {\\displaystyle \\,*\\,} is right-distributive over + {\\displaystyle \\,+\\,} if, given any elements x , y , and z {\\displaystyle x,y,{\\text{ and }}z} of S , {\\displaystyle S,} ( y + z ) ∗ x = ( y ∗ x ) + ( z ∗ x ) ; {\\displaystyle (y+z)*x=(y*x)+(z*x);}","segments":[{"text":"the operation "},{"tex":"\\,*\\,"},{"text":" is right-distributive over "},{"tex":"\\,+\\,"},{"text":" if, given any elements "},{"tex":"x,y,{\\text{ and }}z"},{"text":" of "},{"tex":"S,"},{"text":" "},{"display":true,"tex":"(y+z)*x=(y*x)+(z*x);"}]},"unresolved":null},{"absence":null,"basis":"5998956375813a80757c88fbf994d920fe179fe94791f805269d57ee2d0c66b1","coverage":null,"id":"enwiki-103118-1369824603::In-text #efcaa066","item":"In-text #efcaa066","kind":"definition","locations":[{"challenge":"downgraded","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Distrib","end_line":66,"library":"mathlib","line":62,"location_key":"5998956375813a80757c88fbf994d920fe179fe94791f805269d57ee2d0c66b1","module":"Mathlib.Algebra.Ring.Defs","note":"The Lean class bundles the carrier with its two operations and with both one-sided laws, as the passage's definition does.","pair_key":"019a2411a5fc13f6a89a9e5241e10167048a81c30a830bd1ec16f740625e1e43","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class Distrib : Type u_1 → Type u_1"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"54849097b820c56059f95d299abca5d2e969c0f778865d6313d5ea783c035ad7","prominence":"central","quote":{"exact":"and the operation ∗ {\\displaystyle \\,*\\,} is distributive over + {\\displaystyle \\,+\\,}"},"quote_capped":true,"section":["Definition"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"before":{"layer":"( y + z ) ∗ x = ( y ∗ x ) + ( z ∗ x ) ; {\\displaystyle (y+z)*x=(y*x)+(z*x);} ","lead_in":true,"segments":[{"display":true,"tex":"(y+z)*x=(y*x)+(z*x);"},{"text":" "}]},"layer":"and the operation ∗ {\\displaystyle \\,*\\,} is distributive over + {\\displaystyle \\,+\\,} if it is left- and right-distributive.","segments":[{"text":"and the operation "},{"tex":"\\,*\\,"},{"text":" is distributive over "},{"tex":"\\,+\\,"},{"text":" if it is left- and right-distributive."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"50d81bbd579fa70618db3784218e35cefcac107e9c20295aa18e6e134ba53e21"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-103118-1369824603::In-text #62643aad","item":"In-text #62643aad","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"aa5929022f2c786d7c29d7feb19debfa6df3f900046900a7eab57e995762fe9e","prominence":"supporting","quote":{"exact":"When ∗ {\\displaystyle \\,*\\,} is commutative, the three conditions above are logically"},"quote_capped":true,"section":["Definition"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"When ∗ {\\displaystyle \\,*\\,} is commutative, the three conditions above are logically equivalent.","segments":[{"text":"When "},{"tex":"\\,*\\,"},{"text":" is commutative, the three conditions above are logically equivalent."}]},"unresolved":null},{"absence":null,"basis":"d007314321324199fd04e35975daa0c287fa11cce1e568fedb8637bd4e89d266","coverage":null,"id":"enwiki-103118-1369824603::In-text #579e1102","item":"In-text #579e1102","kind":"definition","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"LeftDistribClass","end_line":71,"library":"mathlib","line":69,"location_key":"d007314321324199fd04e35975daa0c287fa11cce1e568fedb8637bd4e89d266","module":"Mathlib.Algebra.Ring.Defs","note":"Lean's class is written for the addition case only, so it leaves the minus reading of the first identity to a separate lemma.","pair_key":"91b93f5628a7af9bd77b17153779adf6682abec39044295f2c953a285765de88","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"definition","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class LeftDistribClass (R : Type*) [Mul R] [Add R] : Prop"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"RightDistribClass","end_line":76,"library":"mathlib","line":74,"location_key":"104e51d24754097cdf4deb8763a84873ef9d6055bffd8ffa463401f7803a5cf8","module":"Mathlib.Algebra.Ring.Defs","note":"As with its left-hand twin, Lean writes the bracket as a sum, so the minus reading of the second identity is a separate lemma.","pair_key":"24f9a934b4706544730dfd7177a32ae638b147ec309587fcaf7ec649029c4053","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"definition","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class RightDistribClass (R : Type*) [Mul R] [Add R] : Prop"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_sub","end_line":348,"library":"mathlib","line":348,"location_key":"e3c28869709f5e5323e54c1c4d7754faab58ee8b758614cb1eb046d2fce065c1","module":"Mathlib.Algebra.Ring.Defs","note":"This covers the subtraction half of the first condition, which the distributive class above leaves out.","pair_key":"154384436c213280139868604b6cf74880da83a1d69ea048077e4c75cf984c97","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 mul_sub {α : Type u} [NonUnitalNonAssocRing α] (a b c : α) : a * (b - c) = a * b - a * c"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"sub_mul","end_line":353,"library":"mathlib","line":353,"location_key":"15d0821fca594c6a812688ab05abcd2d1a32bdfa80621c8401a7042537f0fda5","module":"Mathlib.Algebra.Ring.Defs","note":"This covers the subtraction half of the second condition, which the right-hand distributive class leaves out.","pair_key":"b347f087ed0c17272fdd575dfe787762843e8e6b22a68fff56c861ba68771f47","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"proved","rank":4,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem sub_mul {α : Type u} [NonUnitalNonAssocRing α] (a b c : α) : (a - b) * c = a * c - b * c"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c826e4400abcc405724fbb5fb59a40bdff2c780b1682dfddbfaf06251684b298","prominence":"supporting","quote":{"exact":"If the operation denoted ⋅ {\\displaystyle \\cdot } is not commutative, there"},"quote_capped":true,"section":["Meaning"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"If the operation denoted ⋅ {\\displaystyle \\cdot } is not commutative, there is a distinction between left-distributivity and right-distributivity: a ⋅ ( b ± c ) = a ⋅ b ± a ⋅ c (left-distributive) {\\displaystyle a\\cdot \\left(b\\pm c\\right)=a\\cdot b\\pm a\\cdot c\\qquad {\\text{ (left-distributive) }}} ( a ± b ) ⋅ c = a ⋅ c ± b ⋅ c (right-distributive) . {\\displaystyle (a\\pm b)\\cdot c=a\\cdot c\\pm b\\cdot c\\qquad {\\text{ (right-distributive) }}.}","segments":[{"text":"If the operation denoted "},{"tex":"\\cdot"},{"text":" is not commutative, there is a distinction between left-distributivity and right-distributivity: "},{"display":true,"tex":"a\\cdot \\left(b\\pm c\\right)=a\\cdot b\\pm a\\cdot c\\qquad {\\text{ (left-distributive) }}"},{"text":" "},{"display":true,"tex":"(a\\pm b)\\cdot c=a\\cdot c\\pm b\\cdot c\\qquad {\\text{ (right-distributive) }}."}]},"unresolved":null},{"absence":null,"basis":"f9463e731a6002371397395aa053a4558b26d23d4bbce37b42094c93428037bf","coverage":null,"id":"enwiki-103118-1369824603::In-text #8f028750","item":"In-text #8f028750","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"add_mul","end_line":97,"library":"mathlib","line":97,"location_key":"f9463e731a6002371397395aa053a4558b26d23d4bbce37b42094c93428037bf","module":"Mathlib.Algebra.Ring.Defs","note":"Lean writes only the sum case, so the difference case the passage also describes is left to its companion lemma.","pair_key":"fc84ff750100844d18d47e2b858002374db456477e567988b6af75670956253b","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 add_mul {R : Type v} [Mul R] [Add R] [RightDistribClass R] (a b c : R) : (a + b) * c = a * c + b * c"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"sub_mul","end_line":353,"library":"mathlib","line":353,"location_key":"f67600328e801efc93500475564015ebc5e444cd2856631d1ef92b8b9b9ddd03","module":"Mathlib.Algebra.Ring.Defs","note":"This is the minuend-and-subtrahend case of the verbal rule; the sum case is the lemma above.","pair_key":"d84e697615959ebb160da3ee0b23b037db53e0b964765ea5d345d9a9d4352e53","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 sub_mul {α : Type u} [NonUnitalNonAssocRing α] (a b c : α) : (a - b) * c = a * c - b * c"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"mul_add","end_line":91,"library":"mathlib","line":91,"location_key":"2ec812ff1e5e3e8985351b9dbe4af585a70845cc738460620a402b8311d75fd9","module":"Mathlib.Algebra.Ring.Defs","note":"The passage describes the rule without fixing the side of the factor, and this lemma is the sum case with the factor in front.","pair_key":"39087f39ba3f6ebed02195cf556d0a1a7eeda52ca6d14716b47fe9a988608ace","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 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":"medium","declaration":"mul_sub","end_line":348,"library":"mathlib","line":348,"location_key":"c7ca3c1b63189501936e0a160738c16b1f25ba85aff119c2842ef6257c113f44","module":"Mathlib.Algebra.Ring.Defs","note":"This is the difference case with the factor in front, the fourth of the four readings the verbal rule covers.","pair_key":"9bb1884a1f3e55bf5a9d554757acfd8a1bc55213cc5537eca22fa5171673eb8f","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"proved","rank":4,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_sub {α : Type u} [NonUnitalNonAssocRing α] (a b c : α) : a * (b - c) = a * b - a * c"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"9d5e8f82bedfa7c15990d69c1e233484b7df2526b8aa8a0cc2f709fea31fca3b","prominence":"central","quote":{"exact":"To multiply a sum (or difference) by a factor, each summand (or"},"quote_capped":true,"section":["Meaning"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"To multiply a sum (or difference) by a factor, each summand (or minuend and subtrahend) is multiplied by this factor and the resulting products are added (or subtracted).","segments":[{"text":"To multiply a sum (or difference) by a factor, each summand (or minuend and subtrahend) is multiplied by this factor and the resulting products are added (or subtracted)."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"933ca9cf2f25ea7623cfa0f04afee9fd8dbb9db61322f8f3eac10ecb2fb8d7b2"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-103118-1369824603::In-text #2c61a53a","item":"In-text #2c61a53a","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"ce06f7cb1c7693168efad8668cd224d31eafc60187601cacdaaa1cf3ee411695","prominence":"supporting","quote":{"exact":"If the operation outside the parentheses (in this case, the multiplication) is"},"quote_capped":true,"section":["Meaning"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"after":{"layer":", and one talks simply of distributivity.","segments":[{"text":", and one talks simply of distributivity."}]},"layer":"If the operation outside the parentheses (in this case, the multiplication) is commutative, then left-distributivity implies right-distributivity and vice versa","segments":[{"text":"If the operation outside the parentheses (in this case, the multiplication) is commutative, then left-distributivity implies right-distributivity and vice versa"}]},"unresolved":null},{"absence":null,"basis":"bf1f989e5bc208757cc379e5fcac1e84e8830537456e0b363a5b43c188716a76","coverage":null,"id":"enwiki-103118-1369824603::In-text #f1a0bdc8","item":"In-text #f1a0bdc8","kind":"example","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"add_div","end_line":33,"library":"mathlib","line":33,"location_key":"bf1f989e5bc208757cc379e5fcac1e84e8830537456e0b363a5b43c188716a76","module":"Mathlib.Algebra.Field.Basic","note":"Lean writes the sum case; neither the minus reading nor the remark that division is not commutative is part of this lemma.","pair_key":"28f99831647045c602eefc54d2898772352aa9996d07ca0a8f8720425a8bfe2d","path":"Mathlib/Algebra/Field/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem add_div {K : Type*} [DivisionSemiring K] (a b c : K) : (a + b) / c = a / c + b / c"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"sub_div","end_line":110,"library":"mathlib","line":109,"location_key":"b7e114d4f2bfa16f39d6f576b2a6a4f728a85dee88df02bcba44e36672501340","module":"Mathlib.Algebra.Field.Basic","note":"This completes the two sign readings of the identity, while the non-commutativity of division stays unstated.","pair_key":"34c0c556ce435d90499a9d26c41d5d822ae9f99f2be667a0095b2396e4733530","path":"Mathlib/Algebra/Field/Basic.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem sub_div {K : Type*} [DivisionRing K] (a b c : K) : (a - b) / c = a / c - b / c"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"aa777b9cc8df66c976818795235ec25b55210ce34a130018572e7c2511daf5e3","prominence":"supporting","quote":{"exact":"One example of an operation that is \"only\" right-distributive is division, which"},"quote_capped":true,"section":["Meaning"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"after":{"layer":" In this case, left-distributivity does not apply: a ÷ ( b ± c ) ≠ a ÷ b ± a ÷ c {\\displaystyle a\\div (b\\pm c)\\neq a\\div b\\pm a\\div c}","segments":[{"text":" In this case, left-distributivity does not apply: "},{"display":true,"tex":"a\\div (b\\pm c)\\neq a\\div b\\pm a\\div c"}]},"layer":"One example of an operation that is \"only\" right-distributive is division, which is not commutative: ( a ± b ) ÷ c = a ÷ c ± b ÷ c . {\\displaystyle (a\\pm b)\\div c=a\\div c\\pm b\\div c.}","segments":[{"text":"One example of an operation that is \"only\" right-distributive is division, which is not commutative: "},{"display":true,"tex":"(a\\pm b)\\div c=a\\div c\\pm b\\div c."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"a6fd9f755d73d3795f6353c60472ee73251f4a25e9b8f3f6d48c01422f35bd6b"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-103118-1369824603::In-text #69a63ef2","item":"In-text #69a63ef2","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"47b6cbb7069a274654e0d23349499d1e771a5d9b32c9c6001656541392f4ef33","prominence":"supporting","quote":{"exact":"In this case, left-distributivity does not apply: a ÷ ( b ±"},"quote_capped":true,"section":["Meaning"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"before":{"layer":"One example of an operation that is \"only\" right-distributive is division, which is not commutative: ( a ± b ) ÷ c = a ÷ c ± b ÷ c . {\\displaystyle (a\\pm b)\\div c=a\\div c\\pm b\\div c.} ","segments":[{"text":"One example of an operation that is \"only\" right-distributive is division, which is not commutative: "},{"display":true,"tex":"(a\\pm b)\\div c=a\\div c\\pm b\\div c."},{"text":" "}]},"layer":"In this case, left-distributivity does not apply: a ÷ ( b ± c ) ≠ a ÷ b ± a ÷ c {\\displaystyle a\\div (b\\pm c)\\neq a\\div b\\pm a\\div c}","segments":[{"text":"In this case, left-distributivity does not apply: "},{"display":true,"tex":"a\\div (b\\pm c)\\neq a\\div b\\pm a\\div c"}]},"unresolved":null},{"absence":null,"basis":"1f69d2a60bc7f4c631ad9cb8c9c9c9a43b24b58a36d86da127249f1f3c0a2b14","coverage":null,"id":"enwiki-103118-1369824603::In-text #1b9209eb","item":"In-text #1b9209eb","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"NonUnitalNonAssocSemiring.toDistrib","end_line":119,"library":"mathlib","line":119,"location_key":"1f69d2a60bc7f4c631ad9cb8c9c9c9a43b24b58a36d86da127249f1f3c0a2b14","module":"Mathlib.Algebra.Ring.Defs","note":"Lean records the two laws as an ancestor of the whole ring hierarchy, so they hold for rings and also for carriers weaker than rings.","pair_key":"94b4fab6dd0e264a47b09d64c38500baba29bbe670ccb5be7b0cd4df5854e64a","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 NonUnitalNonAssocSemiring.toDistrib {α : Type u} [self : NonUnitalNonAssocSemiring α] : Distrib α"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Int.instCommRing","end_line":45,"library":"mathlib","line":28,"location_key":"42a89b6a6f2fae21b5971625741437a4935e0b899ea89c2d28d166b82a66a67f","module":"Mathlib.Algebra.Ring.Int.Defs","note":"Lean fixes the carrier to the integers, the example the passage names, where the passage speaks of rings at large.","pair_key":"fce414f57e1eab37e2c355a183bfb8906e092e4c47d4befd97e3321d5ad1d452","path":"Mathlib/Algebra/Ring/Int/Defs.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Int.instCommRing : CommRing ℤ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c8d89353ba0380e5920517d4ac892d695d168dad87786958c1604daf0e130fe1","prominence":"supporting","quote":{"exact":"The distributive laws are among the axioms for rings (like the ring"},"quote_capped":true,"section":["Meaning"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"after":{"layer":" fields (like the field of rational numbers).","segments":[{"text":" fields (like the field of rational numbers)."}]},"layer":"The distributive laws are among the axioms for rings (like the ring of integers) and","segments":[{"text":"The distributive laws are among the axioms for rings (like the ring of integers) and"}]},"unresolved":null},{"absence":null,"basis":"703ab42de9ae1bf11e72491d31af7a48b6b59dc626237c04ef25ecb00e3b9c1c","coverage":null,"id":"enwiki-103118-1369824603::In-text #3763f9b9","item":"In-text #3763f9b9","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"NonUnitalNonAssocSemiring.toDistrib","end_line":119,"library":"mathlib","line":119,"location_key":"703ab42de9ae1bf11e72491d31af7a48b6b59dc626237c04ef25ecb00e3b9c1c","module":"Mathlib.Algebra.Ring.Defs","note":"Lean places the two laws below the field hierarchy, so they hold for fields and also for carriers that are not fields.","pair_key":"27b0d38ba7ea7ee7851d42c0a5f80b65d5fb08f94277b9a71ccb85c05aee54d5","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 NonUnitalNonAssocSemiring.toDistrib {α : Type u} [self : NonUnitalNonAssocSemiring α] : Distrib α"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Rat.instField","end_line":36,"library":"mathlib","line":27,"location_key":"57ede99825bef2a8c02dcf97017461f3ce57700917c8da7db2416dd7dff8435d","module":"Mathlib.Algebra.Field.Rat","note":"Lean fixes the carrier to the rationals, the example the passage names, where the passage speaks of fields at large.","pair_key":"814b1c7f44313d64877e0efd47ad0c38796a89014559404f6b4218a09626c4f5","path":"Mathlib/Algebra/Field/Rat.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Rat.instField : Field ℚ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f1b233af6a504269b4218fe364df10c876fa0fcc5d53231759e00c89960713ee","prominence":"supporting","quote":{"exact":"fields (like the field of rational numbers)."},"quote_capped":false,"section":["Meaning"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"before":{"layer":"The distributive laws are among the axioms for rings (like the ring of integers) and ","segments":[{"text":"The distributive laws are among the axioms for rings (like the ring of integers) and "}]},"layer":"fields (like the field of rational numbers).","segments":[{"text":"fields (like the field of rational numbers)."}]},"unresolved":null},{"absence":null,"basis":"1a5bbe84269d4d84ffebc42327f71aaaead9a4799ec6658c17c7d9f200138f68","coverage":null,"id":"enwiki-103118-1369824603::In-text #d25b30f1","item":"In-text #d25b30f1","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"NonUnitalNonAssocSemiring.toDistrib","end_line":119,"library":"mathlib","line":119,"location_key":"1a5bbe84269d4d84ffebc42327f71aaaead9a4799ec6658c17c7d9f200138f68","module":"Mathlib.Algebra.Ring.Defs","note":"Lean states it for carriers wider than rings and fields, and it says nothing about the second conclusion, which concerns addition across a product.","pair_key":"e1c94ed34236ed02cb94f22fc1f5681b52cfde1185a1ea4948c8428d664fd6e5","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"definition","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance NonUnitalNonAssocSemiring.toDistrib {α : Type u} [self : NonUnitalNonAssocSemiring α] : Distrib α"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b84cbdc5210843d6b4642dc94bc355c3f7c45768af4b67711a8af2f601776523","prominence":"supporting","quote":{"exact":"Here multiplication is distributive over addition, but addition is not distributive over"},"quote_capped":true,"section":["Meaning"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"Here multiplication is distributive over addition, but addition is not distributive over multiplication.","segments":[{"text":"Here multiplication is distributive over addition, but addition is not distributive over multiplication."}]},"unresolved":null},{"absence":null,"basis":"f6468f6dbb87859eb3be169b212efdb868555078274eadbcdfa08eefa40dba79","coverage":null,"id":"enwiki-103118-1369824603::In-text #c254d730","item":"In-text #c254d730","kind":"example","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"inf_sup_left","end_line":329,"library":"mathlib","line":323,"location_key":"f6468f6dbb87859eb3be169b212efdb868555078274eadbcdfa08eefa40dba79","module":"Mathlib.Order.Defs.Lattice","note":"The chain of instances is resolution inside the index, not an extra lemma.","pair_key":"e3740a6da94a0fedf0109331ecbe3c452570392871f40b63ac7e1c8c6d63acc5","path":"Mathlib/Order/Defs/Lattice.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem inf_sup_left {α : Type u} [DistribLattice α] (a b c : α) : a ⊓ (b ⊔ c) = a ⊓ b ⊔ a ⊓ c"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"sup_inf_left","end_line":317,"library":"mathlib","line":316,"location_key":"d25351cf72393d16bd55814761bfd31c95a8f577ee488069ccce84696a821190","module":"Mathlib.Order.Defs.Lattice","note":"This is the direction the passage adds when it says the second operation also distributes.","pair_key":"803d9ea89246fa4e7406e24ae5950737495ad4358eb07ff7ae1b61cfaa92aeb5","path":"Mathlib/Order/Defs/Lattice.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem sup_inf_left {α : Type u} [DistribLattice α] (a b c : α) : a ⊔ b ⊓ c = (a ⊔ b) ⊓ (a ⊔ c)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"0ff6f464f5b6fb66d08131f5e443d2ebbf10c86cd1fff34b5957854f9e7db805","prominence":"supporting","quote":{"exact":"Examples of structures with two operations that are each distributive over the"},"quote_capped":true,"section":["Meaning"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"Examples of structures with two operations that are each distributive over the other are Boolean algebras such as the algebra of sets or the switching algebra.","segments":[{"text":"Examples of structures with two operations that are each distributive over the other are Boolean algebras such as the algebra of sets or the switching algebra."}]},"unresolved":null},{"absence":null,"basis":"4986d53555ec05365831e605529f6b676202ed703073fd6f80d4f928937c13e2","coverage":null,"id":"enwiki-103118-1369824603::In-text #bc74eda8","item":"In-text #bc74eda8","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Finset.sum_mul_sum","end_line":64,"library":"mathlib","line":62,"location_key":"4986d53555ec05365831e605529f6b676202ed703073fd6f80d4f928937c13e2","module":"Mathlib.Algebra.BigOperators.Ring.Finset","note":"Subtracted terms enter as negative values of the families, so the sign bookkeeping the passage mentions lives inside the terms themselves.","pair_key":"8e2c235840124f34da031e6a5c3f30641cd5f0ff1ce0bfa1a04414a7d0107083","path":"Mathlib/Algebra/BigOperators/Ring/Finset.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.sum_mul_sum {ι : Type*} {κ : Type*} {R : Type*} [NonUnitalNonAssocSemiring R] (s : Finset ι) (t : Finset κ) (f : ι → R) (g : κ → R) : (∑ i ∈ s, f i) * ∑ j ∈ t, g j = ∑ i ∈ s, ∑ j ∈ t, f i * g j"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7627e4b2733a38a0ae26e61507cffe146d73ce94542d5278f8e46ad9c36106d3","prominence":"supporting","quote":{"exact":"Multiplying sums can be put into words as follows: When a sum"},"quote_capped":true,"section":["Meaning"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"Multiplying sums can be put into words as follows: When a sum is multiplied by a sum, multiply each summand of a sum with each summand of the other sum (keeping track of signs) then add up all of the resulting products.","segments":[{"text":"Multiplying sums can be put into words as follows: When a sum is multiplied by a sum, multiply each summand of a sum with each summand of the other sum (keeping track of signs) then add up all of the resulting products."}]},"unresolved":null},{"absence":null,"basis":"78eb4e40371a00e2aee8644937c8e813d0850f7dfa7a67abf9967ea16b945383","coverage":null,"id":"enwiki-103118-1369824603::In-text #ec22871a","item":"In-text #ec22871a","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.instField","end_line":496,"library":"mathlib","line":481,"location_key":"78eb4e40371a00e2aee8644937c8e813d0850f7dfa7a67abf9967ea16b945383","module":"Mathlib.Basic.Real.Basic","note":"A Field structure on the reals contains the two distributive axioms among its ring components, which is the consequence the passage draws from it.","pair_key":"52c7da008dbed917fee57e67342dea44e47f1a86957fccf5d649f15aa34f253b","path":"Mathlib/Basic/Real/Basic.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Real.instField : Field ℝ"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_add","end_line":91,"library":"mathlib","line":91,"location_key":"d168ff2acbe38ed5807f8eb7e9f4173c5ed8cd4c586eb472e29333f804f985a9","module":"Mathlib.Algebra.Ring.Defs","note":"It gives the law the passage says holds on the reals without saying anything about them being a field.","pair_key":"dab09797343500b19f208dcb9e854eb7c558b18a1a2cadc897264cfa2498ac2e","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 mul_add {R : Type v} [Mul R] [Add R] [LeftDistribClass R] (a b c : R) : a * (b + c) = a * b + a * c"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"1d42690b2f5927e3aa1f2b55aed79e8a08d83486b3019b0eef2aa0e909640b6a","prominence":"supporting","quote":{"exact":"From the point of view of algebra, the real numbers form a"},"quote_capped":true,"section":["Examples","Real numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"From the point of view of algebra, the real numbers form a field, which ensures the validity of the distributive law.","segments":[{"text":"From the point of view of algebra, the real numbers form a field, which ensures the validity of the distributive law."}]},"unresolved":null},{"absence":null,"basis":"fbbf32d51e163cfb76315856f3127b849604a172c3f872501fd04ac5a351cfa5","coverage":null,"id":"enwiki-103118-1369824603::In-text #6ff8f072","item":"In-text #6ff8f072","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"mul_add","end_line":91,"library":"mathlib","line":91,"location_key":"fbbf32d51e163cfb76315856f3127b849604a172c3f872501fd04ac5a351cfa5","module":"Mathlib.Algebra.Ring.Defs","note":"The chain the passage writes runs from the product to ninety-six; the declaration supplies its one algebraic move and every other equality is decidable numeral arithmetic.","pair_key":"c23caba2b7c7eed29430b59ce58c95b2ac849ef52e2de28a30783760c4222c9c","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}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"9e5dc2e2121023e3b75aba52a5d466e3835da86582fa447d012bbf4fe12553ce","prominence":"supporting","quote":{"exact":"6 ⋅ 16 = 6 ⋅ ( 10 + 6 ) ="},"quote_capped":true,"section":["Examples","Real numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"after":{"layer":" Thus, to calculate 6 ⋅ 16 {\\displaystyle 6\\cdot 16} in one's head, one first multiplies 6 ⋅ 10 {\\displaystyle 6\\cdot 10} and 6 ⋅ 6 {\\displaystyle 6\\cdot 6} and add the intermediate results.","segments":[{"text":" Thus, to calculate "},{"tex":"6\\cdot 16"},{"text":" in one's head, one first multiplies "},{"tex":"6\\cdot 10"},{"text":" and "},{"tex":"6\\cdot 6"},{"text":" and add the intermediate results."}]},"before":{"layer":"During mental arithmetic, distributivity is often used unconsciously: ","segments":[{"text":"During mental arithmetic, distributivity is often used unconsciously: "}]},"layer":"6 ⋅ 16 = 6 ⋅ ( 10 + 6 ) = 6 ⋅ 10 + 6 ⋅ 6 = 60 + 36 = 96 {\\displaystyle 6\\cdot 16=6\\cdot (10+6)=6\\cdot 10+6\\cdot 6=60+36=96}","segments":[{"display":true,"tex":"6\\cdot 16=6\\cdot (10+6)=6\\cdot 10+6\\cdot 6=60+36=96"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"75ed01e720bc3cc2a584130927a5485c5bccf073fa4fb5a64736adf6804d7f15"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-103118-1369824603::In-text #b5ad6606","item":"In-text #b5ad6606","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_sub","end_line":348,"library":"mathlib","line":348,"location_key":"f7da52dd473f1830657210def7fc1144e80dad45f3a7faf9fa45d017aa349578","module":"Mathlib.Algebra.Ring.Defs","note":"It produces the chain's middle term, which R-CHAIN counts as a move and not a clause of the statement.","pair_key":"df9c29f08e1f5b629218a02f37c98a4ac75679344cd5808bdf143d8023b531a8","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_sub {α : Type u} [NonUnitalNonAssocRing α] (a b c : α) : a * (b - c) = a * b - a * c"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"92ab16c7fc296b5b533f00272dac0c9ebe2c90232a8fb7a673b46682681978d1","prominence":"supporting","quote":{"exact":"3 a 2 b ⋅ ( 4 a − 5 b )"},"quote_capped":true,"section":["Examples","Real numbers"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"before":{"layer":"Second example (with variables) ","lead_in":true,"segments":[{"text":"Second example (with variables) "}]},"layer":"3 a 2 b ⋅ ( 4 a − 5 b ) = 3 a 2 b ⋅ 4 a − 3 a 2 b ⋅ 5 b = 12 a 3 b − 15 a 2 b 2 {\\displaystyle 3a^{2}b\\cdot (4a-5b)=3a^{2}b\\cdot 4a-3a^{2}b\\cdot 5b=12a^{3}b-15a^{2}b^{2}}","segments":[{"display":true,"tex":"3a^{2}b\\cdot (4a-5b)=3a^{2}b\\cdot 4a-3a^{2}b\\cdot 5b=12a^{3}b-15a^{2}b^{2}"}]},"unresolved":null},{"absence":null,"basis":"fcc2d7c089dae027bfa5824dbc2638583ce0dd2f565e7cffbe617dccc676b3c5","coverage":null,"id":"enwiki-103118-1369824603::In-text #8b063267","item":"In-text #8b063267","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"sq_sub_sq","end_line":199,"library":"mathlib","line":199,"location_key":"fcc2d7c089dae027bfa5824dbc2638583ce0dd2f565e7cffbe617dccc676b3c5","module":"Mathlib.Algebra.Ring.Commute","note":"The two bracket-expansion routes the passage displays are ways of reaching the identity, not further content in it.","pair_key":"3e0ab893603b8fa33e29e0210c7f5842b4d86a889ff955139672ec5d7f3d008e","path":"Mathlib/Algebra/Ring/Commute.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem sq_sub_sq {R : Type u} [CommRing R] (a b : R) : a ^ 2 - b ^ 2 = (a + b) * (a - b)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"cf2109dda7e7a964ddedd0011ca364263892c8517b756dd9123a368b80427376","prominence":"supporting","quote":{"exact":"( a + b ) ⋅ ( a − b ) ="},"quote_capped":true,"section":["Examples","Real numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"after":{"layer":" Here the distributive law was applied twice, and it does not matter which bracket is first multiplied out.","segments":[{"text":" Here the distributive law was applied twice, and it does not matter which bracket is first multiplied out."}]},"before":{"layer":"Third example (with two sums) ","lead_in":true,"segments":[{"text":"Third example (with two sums) "}]},"layer":"( a + b ) ⋅ ( a − b ) = a ⋅ ( a − b ) + b ⋅ ( a − b ) = a 2 − a b + b a − b 2 = a 2 − b 2 = ( a + b ) ⋅ a − ( a + b ) ⋅ b = a 2 + b a − a b − b 2 = a 2 − b 2 {\\displaystyle {\\begin{aligned}(a+b)\\cdot (a-b)&=a\\cdot (a-b)+b\\cdot (a-b)=a^{2}-ab+ba-b^{2}=a^{2}-b^{2}\\\\&=(a+b)\\cdot a-(a+b)\\cdot b=a^{2}+ba-ab-b^{2}=a^{2}-b^{2}\\\\\\end{aligned}}}","segments":[{"display":true,"tex":"\\begin{aligned}(a+b)\\cdot (a-b)&=a\\cdot (a-b)+b\\cdot (a-b)=a^{2}-ab+ba-b^{2}=a^{2}-b^{2}\\\\&=(a+b)\\cdot a-(a+b)\\cdot b=a^{2}+ba-ab-b^{2}=a^{2}-b^{2}\\\\\\end{aligned}"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":3,"sha256":"0528f50bb384350a98adecaee4f919d4563445c7e592e2a2a87559547195b237"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-103118-1369824603::In-text #b44c8608","item":"In-text #b44c8608","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Finset.dvd_sum","end_line":92,"library":"mathlib","line":91,"location_key":"f1a7f6b3acba4dc1eeb9c6da2e00e056a7a4df08f4e5d2fa6552157663fe7ec4","module":"Mathlib.Algebra.BigOperators.Ring.Finset","note":"Its hypothesis that the divisor divides each term is exactly what the passage has to establish first.","pair_key":"67eeb1983c163fb7664aec602a62da5634ddf71761e72cbb947e63c99bdac2cd","path":"Mathlib/Algebra/BigOperators/Ring/Finset.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.dvd_sum {ι : Type*} {R : Type*} {s : Finset ι} [NonUnitalSemiring R] {f : ι → R} {a : R} : (∀ i ∈ s, a ∣ f i) → a ∣ ∑ i ∈ s, f i"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Finset.mul_sum","end_line":60,"library":"mathlib","line":59,"location_key":"1a881f957de98d03fc2bd6c790edf46a7aa2b98b4f12235d7d51c96775986186","module":"Mathlib.Algebra.BigOperators.Ring.Finset","note":"It is the general law behind taking a factor out of a sum, stated for an arbitrary semiring.","pair_key":"8b34cb2c924e87f465cf28c61ff054a5b3d2e689e9aaa402e671fbd8af2b317c","path":"Mathlib/Algebra/BigOperators/Ring/Finset.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.mul_sum {ι : Type*} {R : Type*} [NonUnitalNonAssocSemiring R] (s : Finset ι) (f : ι → R) (a : R) : a * ∑ i ∈ s, f i = ∑ i ∈ s, a * f i"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"71deff2bb90c998496d6c3eb88743460430ac0c750d5ab8f6c4a46980053d35c","prominence":"supporting","quote":{"exact":"it can be factored out."},"quote_capped":false,"section":["Examples","Real numbers"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"before":{"layer":"Consider 12 a 3 b 2 − 30 a 4 b c + 18 a 2 b 3 c 2 . {\\displaystyle 12a^{3}b^{2}-30a^{4}bc+18a^{2}b^{3}c^{2}\\,.} Since the factor 6 a 2 b {\\displaystyle 6a^{2}b} occurs in all summands, ","segments":[{"text":"Consider "},{"display":true,"tex":"12a^{3}b^{2}-30a^{4}bc+18a^{2}b^{3}c^{2}\\,."},{"text":" Since the factor "},{"tex":"6a^{2}b"},{"text":" occurs in all summands, "}]},"layer":"it can be factored out.","segments":[{"text":"it can be factored out."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":3,"sha256":"3e9cd51d23e5265c374f3d358f7c630b9a460bacf11c85cb63a6c87f1ce9f8a3"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-103118-1369824603::In-text #a91c8af8","item":"In-text #a91c8af8","kind":"example","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Finset.mul_sum","end_line":60,"library":"mathlib","line":59,"location_key":"3a9abae0f38619e9536ce1585e66eabb96a5083392f1d5e59178b2becb573544","module":"Mathlib.Algebra.BigOperators.Ring.Finset","note":"It states the law that the displayed factorisation uses, for an arbitrary semiring and an arbitrary finite family.","pair_key":"76e24848f57e0f7a6ff0775f8c54a3a530d40540ec9dc489cc4433ed89fa1ed9","path":"Mathlib/Algebra/BigOperators/Ring/Finset.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.mul_sum {ι : Type*} {R : Type*} [NonUnitalNonAssocSemiring R] (s : Finset ι) (f : ι → R) (a : R) : a * ∑ i ∈ s, f i = ∑ i ∈ s, a * f i"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"mul_sub","end_line":348,"library":"mathlib","line":348,"location_key":"4ecb0babeebc1cc1d2885dc9892461d67917e80649883f36b38632c45e839742","module":"Mathlib.Algebra.Ring.Defs","note":"It handles the subtraction sign inside the bracket of the displayed identity.","pair_key":"655de4b971d249c158da5efc92269dc301089d239c1b88a3f95d98d93bd1bcd5","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_sub {α : Type u} [NonUnitalNonAssocRing α] (a b c : α) : a * (b - c) = a * b - a * c"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"cbc169c0902942431a415b58186d5afad11067e8c09e09dbf6d950def5ce77aa","prominence":"supporting","quote":{"exact":"That is, due to the distributive law one obtains 12 a 3"},"quote_capped":true,"section":["Examples","Real numbers"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"That is, due to the distributive law one obtains 12 a 3 b 2 − 30 a 4 b c + 18 a 2 b 3 c 2 = 6 a 2 b ( 2 a b − 5 a 2 c + 3 b 2 c 2 ) . {\\displaystyle 12a^{3}b^{2}-30a^{4}bc+18a^{2}b^{3}c^{2}=6a^{2}b\\left(2ab-5a^{2}c+3b^{2}c^{2}\\right).}","segments":[{"text":"That is, due to the distributive law one obtains "},{"display":true,"tex":"12a^{3}b^{2}-30a^{4}bc+18a^{2}b^{3}c^{2}=6a^{2}b\\left(2ab-5a^{2}c+3b^{2}c^{2}\\right)."}]},"unresolved":null},{"absence":null,"basis":"dcf96d2ce016bead3be50181270429d72282aed96581105cc4da836d97e74462","coverage":null,"id":"enwiki-103118-1369824603::In-text #c9196753","item":"In-text #c9196753","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Matrix.nonUnitalNonAssocSemiring","end_line":376,"library":"mathlib","line":371,"location_key":"dcf96d2ce016bead3be50181270429d72282aed96581105cc4da836d97e74462","module":"Mathlib.Data.Matrix.Mul","note":"The instance speaks of square matrices only, while the passage also covers products of rectangular matrices, and its remaining fields are the other semiring axioms.","pair_key":"0e009009494c3560d11164e6944af13fdaf8f6bcb23b33005f54b939e23cba52","path":"Mathlib/Data/Matrix/Mul.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Matrix.nonUnitalNonAssocSemiring {n : Type*} {α : Type v} [NonUnitalNonAssocSemiring α] [Fintype n] : NonUnitalNonAssocSemiring (Matrix n n α)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Matrix.mul_add","end_line":364,"library":"mathlib","line":361,"location_key":"8ca0e9825743e4ea865025d79bbe2b1d684267b484eaa19f1c53796c1969dae0","module":"Mathlib.Data.Matrix.Mul","note":"It carries the left law alone; the law with the sum on the other side is a separate declaration.","pair_key":"7c67499e98999645035fed86ac5a3f3027e0d195de51b438a54eb9060292f221","path":"Mathlib/Data/Matrix/Mul.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Matrix.mul_add {m : Type*} {n : Type*} {o : Type*} {α : Type v} [NonUnitalNonAssocSemiring α] [Fintype n] (L : Matrix m n α) (M N : Matrix n o α) : L * (M + N) = L * M + L * N"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Matrix.add_mul","end_line":369,"library":"mathlib","line":366,"location_key":"a1ef9dbbf40e184ce42d15c6644a00eb9167cf565faa6d2293cac18b444274fc","module":"Mathlib.Data.Matrix.Mul","note":"It carries the right law alone, so it covers one of the two laws the passage asserts.","pair_key":"a3685e3f75de000ade5f03b3318c8c7296eaa7dc585aa28c995976d3c406b600","path":"Mathlib/Data/Matrix/Mul.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Matrix.add_mul {l : Type*} {m : Type*} {n : Type*} {α : Type v} [NonUnitalNonAssocSemiring α] [Fintype m] (L M : Matrix l m α) (N : Matrix m n α) : (L + M) * N = L * N + M * N"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"9693f74bb2e3dd6adb799e080185e6b4963cfcab52ff64852be9065b166053f1","prominence":"central","quote":{"exact":"The distributive law is valid for matrix multiplication."},"quote_capped":false,"section":["Examples","Matrices"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"The distributive law is valid for matrix multiplication.","segments":[{"text":"The distributive law is valid for matrix multiplication."}]},"unresolved":null},{"absence":null,"basis":"422fcf6820e40959b31cac2a8ac0836dd595af15caf33464f91104b4cdaf4830","coverage":null,"id":"enwiki-103118-1369824603::In-text #7dbb8c97","item":"In-text #7dbb8c97","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Matrix.add_mul","end_line":369,"library":"mathlib","line":366,"location_key":"422fcf6820e40959b31cac2a8ac0836dd595af15caf33464f91104b4cdaf4830","module":"Mathlib.Data.Matrix.Mul","note":"Mathlib widens the passage twice over: the entries may sit in any non-unital non-associative semiring, and rows and columns may be indexed by arbitrary types with only the shared index required finite.","pair_key":"c6007fac863ad6d0084339813e260d282e3d6f28cae3609cefbf4abf13b3cb5b","path":"Mathlib/Data/Matrix/Mul.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Matrix.add_mul {l : Type*} {m : Type*} {n : Type*} {α : Type v} [NonUnitalNonAssocSemiring α] [Fintype m] (L M : Matrix l m α) (N : Matrix m n α) : (L + M) * N = L * N + M * N"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"efed68f5d2aa9842b03b4797a4a103a4973c62eb0fbc254ffb93a8b0f28aaea2","prominence":"supporting","quote":{"exact":"More precisely, ( A + B ) ⋅ C = A ⋅"},"quote_capped":true,"section":["Examples","Matrices"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"after":{"layer":" A ⋅ ( B + C ) = A ⋅ B + A ⋅ C {\\displaystyle A\\cdot (B+C)=A\\cdot B+A\\cdot C} for all l × m {\\displaystyle l\\times m} -matrices A {\\displaystyle A} and m × n {\\displaystyle m\\times n} -matrices B , C . {\\displaystyle B,C.} Because the commutative property does not hold for matrix multiplication, the second law does","segments":[{"text":" "},{"display":true,"tex":"A\\cdot (B+C)=A\\cdot B+A\\cdot C"},{"text":" for all "},{"tex":"l\\times m"},{"text":" -matrices "},{"tex":"A"},{"text":" and "},{"tex":"m\\times n"},{"text":" -matrices "},{"tex":"B,C."},{"text":" Because the commutative property does not hold for matrix multiplication, the second law does"}],"trimmed":true},"layer":"More precisely, ( A + B ) ⋅ C = A ⋅ C + B ⋅ C {\\displaystyle (A+B)\\cdot C=A\\cdot C+B\\cdot C} for all l × m {\\displaystyle l\\times m} -matrices A , B {\\displaystyle A,B} and m × n {\\displaystyle m\\times n} -matrices C , {\\displaystyle C,} as well as","segments":[{"text":"More precisely, "},{"display":true,"tex":"(A+B)\\cdot C=A\\cdot C+B\\cdot C"},{"text":" for all "},{"tex":"l\\times m"},{"text":" -matrices "},{"tex":"A,B"},{"text":" and "},{"tex":"m\\times n"},{"text":" -matrices "},{"tex":"C,"},{"text":" as well as"}]},"unresolved":null},{"absence":null,"basis":"ac86415eae5c9d5fe46e52c4671c55329740fcb01ae8ef7e172d25e0ff2f739f","coverage":null,"id":"enwiki-103118-1369824603::In-text #74afa376","item":"In-text #74afa376","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Matrix.mul_add","end_line":364,"library":"mathlib","line":361,"location_key":"ac86415eae5c9d5fe46e52c4671c55329740fcb01ae8ef7e172d25e0ff2f739f","module":"Mathlib.Data.Matrix.Mul","note":"Mathlib widens the passage twice over: entries lie in any non-unital non-associative semiring and the rows and columns are indexed by arbitrary types, only the shared index being finite.","pair_key":"3bc53edf56f7a160c490d0c68e6806198acae613f04349ec530c138142db4473","path":"Mathlib/Data/Matrix/Mul.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Matrix.mul_add {m : Type*} {n : Type*} {o : Type*} {α : Type v} [NonUnitalNonAssocSemiring α] [Fintype n] (L : Matrix m n α) (M N : Matrix n o α) : L * (M + N) = L * M + L * N"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"485f1ad397ef2af87d3d9c7761f6635986afd1134eb557fa8b6f3818b7764ba1","prominence":"supporting","quote":{"exact":"A ⋅ ( B + C ) = A ⋅ B +"},"quote_capped":true,"section":["Examples","Matrices"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"after":{"layer":" Because the commutative property does not hold for matrix multiplication, the second law does not follow from the first law.","segments":[{"text":" Because the commutative property does not hold for matrix multiplication, the second law does not follow from the first law."}]},"before":{"layer":"More precisely, ( A + B ) ⋅ C = A ⋅ C + B ⋅ C {\\displaystyle (A+B)\\cdot C=A\\cdot C+B\\cdot C} for all l × m {\\displaystyle l\\times m} -matrices A , B {\\displaystyle A,B} and m × n {\\displaystyle m\\times n} -matrices C , {\\displaystyle C,} as well as ","segments":[{"text":"More precisely, "},{"display":true,"tex":"(A+B)\\cdot C=A\\cdot C+B\\cdot C"},{"text":" for all "},{"tex":"l\\times m"},{"text":" -matrices "},{"tex":"A,B"},{"text":" and "},{"tex":"m\\times n"},{"text":" -matrices "},{"tex":"C,"},{"text":" as well as "}]},"layer":"A ⋅ ( B + C ) = A ⋅ B + A ⋅ C {\\displaystyle A\\cdot (B+C)=A\\cdot B+A\\cdot C} for all l × m {\\displaystyle l\\times m} -matrices A {\\displaystyle A} and m × n {\\displaystyle m\\times n} -matrices B , C . {\\displaystyle B,C.}","segments":[{"display":true,"tex":"A\\cdot (B+C)=A\\cdot B+A\\cdot C"},{"text":" for all "},{"tex":"l\\times m"},{"text":" -matrices "},{"tex":"A"},{"text":" and "},{"tex":"m\\times n"},{"text":" -matrices "},{"tex":"B,C."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":4,"queries":5,"sha256":"79ee320b4843f9fc5aa8c9232c5ff06781311bec35c27a64f61a07cf6393c98b"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-103118-1369824603::In-text #0000e465","item":"In-text #0000e465","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"6e080ad8e1b5a4114447f50e6784b2d6b0a97e4c60f84bf15faf64338a7f0960","prominence":"supporting","quote":{"exact":"the commutative property does not hold for matrix multiplication"},"quote_capped":false,"section":["Examples","Matrices"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"after":{"layer":", the second law does not follow from the first law.","segments":[{"text":", the second law does not follow from the first law."}]},"before":{"layer":"A , B {\\displaystyle A,B} and m × n {\\displaystyle m\\times n} -matrices C , {\\displaystyle C,} as well as A ⋅ ( B + C ) = A ⋅ B + A ⋅ C {\\displaystyle A\\cdot (B+C)=A\\cdot B+A\\cdot C} for all l × m {\\displaystyle l\\times m} -matrices A {\\displaystyle A} and m × n {\\displaystyle m\\times n} -matrices B , C . {\\displaystyle B,C.} Because ","segments":[{"tex":"A,B"},{"text":" and "},{"tex":"m\\times n"},{"text":" -matrices "},{"tex":"C,"},{"text":" as well as "},{"display":true,"tex":"A\\cdot (B+C)=A\\cdot B+A\\cdot C"},{"text":" for all "},{"tex":"l\\times m"},{"text":" -matrices "},{"tex":"A"},{"text":" and "},{"tex":"m\\times n"},{"text":" -matrices "},{"tex":"B,C."},{"text":" Because "}],"trimmed":true},"layer":"the commutative property does not hold for matrix multiplication","segments":[{"text":"the commutative property does not hold for matrix multiplication"}]},"unresolved":null},{"absence":null,"basis":"c9757c90fe2ce490b43beef22abef8a8507dac82aee6a6362c92a81bd2b62535","coverage":null,"id":"enwiki-103118-1369824603::In-text #f9116967","item":"In-text #f9116967","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Ordinal.leftDistribClass","end_line":423,"library":"mathlib","line":421,"location_key":"c9757c90fe2ce490b43beef22abef8a8507dac82aee6a6362c92a81bd2b62535","module":"Mathlib.SetTheory.Ordinal.Arithmetic","note":"Mathlib keeps the left-hand ordinal law as a class instance on Ordinal rather than as a named equation.","pair_key":"0261125c01aac10fe63b44be6f3823f431e69747e8fe1aaa8e60130057faae36","path":"Mathlib/SetTheory/Ordinal/Arithmetic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Ordinal.leftDistribClass : LeftDistribClass Ordinal"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"left_distrib","end_line":89,"library":"mathlib","line":87,"location_key":"2b2e7ac9ff16d64f0f336b5bbbdef772b5ed16e3d45be2e5731865ba4f07aaf7","module":"Mathlib.Algebra.Ring.Defs","note":"Mathlib states this for any type carrying the left-distributivity class, so it generalises the ordinal case the passage speaks of.","pair_key":"2304bf4b0d19d84957311ebca21e648235f28aab1ab9ba73765fe9c2f1483049","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 left_distrib {R : Type v} [Mul R] [Add R] [LeftDistribClass R] (a b c : R) : a * (b + c) = a * b + a * c"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"5e3b7acacfea8275eb4c3dbf8febb50c66d28274c92d58c48a1fcfbfff17f83c","prominence":"supporting","quote":{"exact":"Multiplication of ordinal numbers, in contrast, is only left-distributive, not right-distributive."},"quote_capped":false,"section":["Examples","Other examples"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"Multiplication of ordinal numbers, in contrast, is only left-distributive, not right-distributive.","segments":[{"text":"Multiplication of ordinal numbers, in contrast, is only left-distributive, not right-distributive."}]},"unresolved":null},{"absence":null,"basis":"863597e68ddc3dbdc595c2b569f500ebf0634f20c2fbe0433182c4976bb9f3df","coverage":null,"id":"enwiki-103118-1369824603::In-text #30007937","item":"In-text #30007937","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"crossProduct","end_line":59,"library":"mathlib","line":47,"location_key":"863597e68ddc3dbdc595c2b569f500ebf0634f20c2fbe0433182c4976bb9f3df","module":"Mathlib.LinearAlgebra.CrossProduct","note":"Mathlib bundles the cross product as a bilinear map over an arbitrary commutative ring, so it also asserts compatibility with scalars and generalises the real three-dimensional case.","pair_key":"8601c16c0883c3ab32cd3e8566dc4d73901af8ccaf93556b1a238c3b60c996ff","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":"medium","declaration":"Cross.lieRing","end_line":134,"library":"mathlib","line":128,"location_key":"d9a9542976d0bd5bf89b13b6ea104d6b05e6f4bbae5125af5d1da4923b05e67e","module":"Mathlib.LinearAlgebra.CrossProduct","note":"Beyond the two additivity laws it also asserts the Jacobi identity and the vanishing of the bracket of a vector with itself, and it is stated over an arbitrary commutative ring, so it generalises what the conjunct claims.","pair_key":"42e50090160b181d4fe3d559e7a44bb2ebba722e6bc30cd32c6dcecd9d1a9328","path":"Mathlib/LinearAlgebra/CrossProduct.lean","proof_status":"definition","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Cross.lieRing {R : Type*} [CommRing R] : LieRing (Fin 3 → R)"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"cross_anticomm","end_line":70,"library":"mathlib","line":69,"location_key":"8f41a4b15281efe6a49db72fa7870b1c3563f8938c25709cfdd4e07881c7397f","module":"Mathlib.LinearAlgebra.CrossProduct","note":"It states that exchanging the two arguments negates the product; turning that into the failure of commutativity would also need a pair whose cross product is non-zero and that two is invertible.","pair_key":"56e52a8cd331102199cf02e5418ed376d636bcc9654bb573c73d962f1cda5310","path":"Mathlib/LinearAlgebra/CrossProduct.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem cross_anticomm {R : Type*} [CommRing R] (v w : Fin 3 → R) : -(crossProduct v) w = (crossProduct w) v"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"90c8340c14b48996088497b779a9a075a600043976f088cab40ece443a62b138","prominence":"supporting","quote":{"exact":"The cross product is left- and right-distributive over vector addition, though not"},"quote_capped":true,"section":["Examples","Other examples"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"The cross product is left- and right-distributive over vector addition, though not commutative.","segments":[{"text":"The cross product is left- and right-distributive over vector addition, though not commutative."}]},"unresolved":null},{"absence":null,"basis":"4e78af8e7c3517ac9f4faf76d0e1f7693c769bf55b1cbc5d498c5cff268a1f9b","coverage":null,"id":"enwiki-103118-1369824603::In-text #1c578600","item":"In-text #1c578600","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.union_inter_distrib_left","end_line":934,"library":"mathlib","line":933,"location_key":"4e78af8e7c3517ac9f4faf76d0e1f7693c769bf55b1cbc5d498c5cff268a1f9b","module":"Mathlib.Data.Set.Basic","note":null,"pair_key":"62cc1086b285fdcaad798fde260065d01574ec328ef96b1f6fc4d27ae8806127","path":"Mathlib/Data/Set/Basic.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.union_inter_distrib_left {α : Type u} (s t u : Set α) : s ∪ t ∩ u = (s ∪ t) ∩ (s ∪ u)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.inter_union_distrib_right","end_line":937,"library":"mathlib","line":936,"location_key":"bcd3dcc62c3ae48805b411d740e90744da883cf3bfbf487f852d9cc19f2a7220","module":"Mathlib.Data.Set.Basic","note":"This is the same law with the two operands of the union exchanged, which for the commutative union is the form the article calls right-distributivity.","pair_key":"fc8aeeb640cefbede80528ecb383f4b8f6aae2c07f39b52dac30796ed338e96a","path":"Mathlib/Data/Set/Basic.lean","proof_status":"proved","rank":2,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.inter_union_distrib_right {α : Type u} (s t u : Set α) : s ∩ t ∪ u = (s ∪ u) ∩ (t ∪ u)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"46ec3fbd46fecf881e3f4e4853be2ac55b0f85779fb0b39c99b2adb2aa6c8e5a","prominence":"supporting","quote":{"exact":"For sets, the union is distributive over intersection"},"quote_capped":false,"section":["Examples","Other examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"after":{"layer":", and intersection is distributive over union.","segments":[{"text":", and intersection is distributive over union."}]},"layer":"For sets, the union is distributive over intersection","segments":[{"text":"For sets, the union is distributive over intersection"}]},"unresolved":null},{"absence":null,"basis":"a6c64795cfcf914cf1961bc607daad1937a3de3422646f6d9859abb782190c0b","coverage":null,"id":"enwiki-103118-1369824603::In-text #d874a8ea","item":"In-text #d874a8ea","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.inter_union_distrib_left","end_line":928,"library":"mathlib","line":927,"location_key":"a6c64795cfcf914cf1961bc607daad1937a3de3422646f6d9859abb782190c0b","module":"Mathlib.Data.Set.Basic","note":null,"pair_key":"e73a18433439f406b2f0f585092ad4e1c744036919da7bd7537558278712d6af","path":"Mathlib/Data/Set/Basic.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.inter_union_distrib_left {α : Type u} (s t u : Set α) : s ∩ (t ∪ u) = s ∩ t ∪ s ∩ u"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.union_inter_distrib_right","end_line":931,"library":"mathlib","line":930,"location_key":"dcc52f1f6d253de386c5358f68c116a0f72529fdcbd5ac6303fab1c7c1733ba8","module":"Mathlib.Data.Set.Basic","note":"This is the same law with the two operands of the intersection exchanged, the form the article calls right-distributivity, which for the commutative intersection says the same thing.","pair_key":"b8904f9311153c6beee91d55ebc259174b470be2edb24f2bee9b6b0fd9d0d675","path":"Mathlib/Data/Set/Basic.lean","proof_status":"proved","rank":2,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.union_inter_distrib_right {α : Type u} (s t u : Set α) : (s ∪ t) ∩ u = s ∩ u ∪ t ∩ u"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"efe728c6ea8301700cc4266da80d7e5d26c1c80a8e498b3e8e1eda119cabbe89","prominence":"supporting","quote":{"exact":"intersection is distributive over union."},"quote_capped":false,"section":["Examples","Other examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"before":{"layer":"For sets, the union is distributive over intersection, and ","segments":[{"text":"For sets, the union is distributive over intersection, and "}]},"layer":"intersection is distributive over union.","segments":[{"text":"intersection is distributive over union."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"878a93404486dad576b86744793cf73d4793075141491267d3982306f73c818c","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"2ef0aff07cb609796441df96fb4bdfd47291dc19847e8291007b189f7eb0a669","text":"disjunction distributes over conjunction"},{"id":"c2","part":"6eb500a3c35cbb26fd4a79f047a07a47954dac0e379c18a17c3325d2127f56fd","text":"conjunction distributes over disjunction"}],"parts":["2ef0aff07cb609796441df96fb4bdfd47291dc19847e8291007b189f7eb0a669","6eb500a3c35cbb26fd4a79f047a07a47954dac0e379c18a17c3325d2127f56fd"],"relation":"exactMatch","status":"formalized"},"id":"enwiki-103118-1369824603::In-text #d58ba421","item":"In-text #d58ba421","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"or_and_left","end_line":130,"library":"lean-core","line":128,"location_key":"2ef0aff07cb609796441df96fb4bdfd47291dc19847e8291007b189f7eb0a669","module":"Init.PropLemmas","note":"Lean writes the law as an equivalence of propositions, with the disjunct outside the bracket on the left.","pair_key":"e0790ff73801f25130a4ebb8eaf9bbd30578ec870c08cf928600ea3906290565","path":"src/Init/PropLemmas.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem or_and_left {a b c : Prop} : a ∨ b ∧ c ↔ (a ∨ b) ∧ (a ∨ c)"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"and_or_left","end_line":122,"library":"lean-core","line":120,"location_key":"6eb500a3c35cbb26fd4a79f047a07a47954dac0e379c18a17c3325d2127f56fd","module":"Init.PropLemmas","note":"Lean writes the companion law as an equivalence of propositions, with the conjunct outside the bracket on the left.","pair_key":"65da4241a3565cf318b14cfe05d089c49482fb4205c1d3353cd5a291c1c8293f","path":"src/Init/PropLemmas.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem and_or_left {a b c : Prop} : a ∧ (b ∨ c) ↔ a ∧ b ∨ a ∧ c"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"be68135cd7883717f4cd982bec5675e2edf5512e5ff887637033e6072f2aebeb","prominence":"supporting","quote":{"exact":"Logical disjunction (\"or\") is distributive over logical conjunction (\"and\"), and vice versa."},"quote_capped":false,"section":["Examples","Other examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"Logical disjunction (\"or\") is distributive over logical conjunction (\"and\"), and vice versa.","segments":[{"text":"Logical disjunction (\"or\") is distributive over logical conjunction (\"and\"), and vice versa."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"2f92aec808baf9c1f0595a1bc1edb28808fd4b1bdbeeed26322ff35d6d7a76a3","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"e16e883f8f54459194e8d72cd345db27778e5844cc02de4d678f744f5a3358f5","text":"the maximum distributes over the minimum: max(a, min(b,c)) = min(max(a,b), max(a,c))"},{"id":"c2","part":"0d1456bd86256cf30b86900428dc4a781590bf41ccad30d99b15838241cab3ab","text":"the minimum distributes over the maximum: min(a, max(b,c)) = max(min(a,b), min(a,c))"}],"parts":["e16e883f8f54459194e8d72cd345db27778e5844cc02de4d678f744f5a3358f5","0d1456bd86256cf30b86900428dc4a781590bf41ccad30d99b15838241cab3ab"],"relation":"exactMatch","status":"formalized"},"id":"enwiki-103118-1369824603::In-text #2d77c722","item":"In-text #2d77c722","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"max_min_distrib_left","end_line":65,"library":"mathlib","line":64,"location_key":"e16e883f8f54459194e8d72cd345db27778e5844cc02de4d678f744f5a3358f5","module":"Mathlib.Order.MinMax","note":"Lean's linear-order class is its notion of a totally ordered set, the setting the passage names beside the reals.","pair_key":"39db2b67dd240122fa7196f40948bbc1c77827576da8019b2daf413314f7e387","path":"Mathlib/Order/MinMax.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem max_min_distrib_left {α : Type u} [LinearOrder α] (a b c : α) : Max.max a (Min.min b c) = Min.min (Max.max a b) (Max.max a c)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"min_max_distrib_left","end_line":63,"library":"mathlib","line":63,"location_key":"0d1456bd86256cf30b86900428dc4a781590bf41ccad30d99b15838241cab3ab","module":"Mathlib.Order.MinMax","note":"Lean states the companion identity over the same linear-order class, which is its notion of a totally ordered set.","pair_key":"d793c1f16b1afe8ec0cb92d75d4d1a1964fd3c05dd6b62795275b5ef400895a6","path":"Mathlib/Order/MinMax.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem min_max_distrib_left {α : Type u} [LinearOrder α] (a b c : α) : Min.min a (Max.max b c) = Max.max (Min.min a b) (Min.min a c)"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.max_min_distrib_left","end_line":147,"library":"lean-core","line":147,"location_key":"e6e5e8658001ebc8bfc5a7b12fb2964514a1e5e18ca89cc852113be1d1b3aca4","module":"Init.Data.Int.LemmasAux","note":"Lean fixes the carrier to the integers, one of the totally ordered sets the passage speaks of.","pair_key":"f08a0391bec073f5e8705be4c88791b020c121ad1054ff7b59820ed0f76e37e7","path":"src/Init/Data/Int/LemmasAux.lean","proof_status":"proved","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.max_min_distrib_left (a b c : Int) : Max.max a (Min.min b c) = Min.min (Max.max a b) (Max.max a c)"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.min_max_distrib_left","end_line":149,"library":"lean-core","line":149,"location_key":"d83a99b1cb8641d41e3cc9a13217a2793914c6c9f7b4fd12198276e7b5a1f21b","module":"Init.Data.Int.LemmasAux","note":"Lean fixes the carrier to the integers, again one of the passage's totally ordered sets.","pair_key":"358f123f374e4aad8a65cb11342d0d4e8bd3704aa3e343322f962b64ba123830","path":"src/Init/Data/Int/LemmasAux.lean","proof_status":"proved","rank":4,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.min_max_distrib_left (a b c : Int) : Min.min a (Max.max b c) = Max.max (Min.min a b) (Min.min a c)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"1223e47478acd0e316cac8ee9d362cb2ce5942f0939aaf575c6b9119052acbe5","prominence":"supporting","quote":{"exact":"For real numbers (and for any totally ordered set), the maximum operation"},"quote_capped":true,"section":["Examples","Other examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"For real numbers (and for any totally ordered set), the maximum operation is distributive over the minimum operation, and vice versa: max ( a , min ( b , c ) ) = min ( max ( a , b ) , max ( a , c ) ) and min ( a , max ( b , c ) ) = max ( min ( a , b ) , min ( a , c ) ) . {\\displaystyle \\max(a,\\min(b,c))=\\min(\\max(a,b),\\max(a,c))\\quad {\\text{ and }}\\quad \\min(a,\\max(b,c))=\\max(\\min(a,b),\\min(a,c)).}","segments":[{"text":"For real numbers (and for any totally ordered set), the maximum operation is distributive over the minimum operation, and vice versa: "},{"display":true,"tex":"\\max(a,\\min(b,c))=\\min(\\max(a,b),\\max(a,c))\\quad {\\text{ and }}\\quad \\min(a,\\max(b,c))=\\max(\\min(a,b),\\min(a,c))."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":5,"queries":6,"sha256":"9e6f3789fc3faf7b6e2aa9b7b7e14ef6ca3d2e1101ff266aa3d2f0dca50221b9"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-103118-1369824603::In-text #ac50841c","item":"In-text #ac50841c","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"a509c3031778f0d4f0b6e7798bc68e3f8603b00e572880f6e2d169cf087a116c","prominence":"supporting","quote":{"exact":"For integers, the greatest common divisor is distributive over the least common"},"quote_capped":true,"section":["Examples","Other examples"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"For integers, the greatest common divisor is distributive over the least common multiple, and vice versa: gcd ( a , lcm ⁡ ( b , c ) ) = lcm ⁡ ( gcd ( a , b ) , gcd ( a , c ) ) and lcm ⁡ ( a , gcd ( b , c ) ) = gcd ( lcm ⁡ ( a , b ) , lcm ⁡ ( a , c ) ) . {\\displaystyle \\gcd(a,\\operatorname {lcm} (b,c))=\\operatorname {lcm} (\\gcd(a,b),\\gcd(a,c))\\quad {\\text{ and }}\\quad \\operatorname {lcm} (a,\\gcd(b,c))=\\gcd(\\operatorname {lcm} (a,b),\\operatorname {lcm} (a,c)).}","segments":[{"text":"For integers, the greatest common divisor is distributive over the least common multiple, and vice versa: "},{"display":true,"tex":"\\gcd(a,\\operatorname {lcm} (b,c))=\\operatorname {lcm} (\\gcd(a,b),\\gcd(a,c))\\quad {\\text{ and }}\\quad \\operatorname {lcm} (a,\\gcd(b,c))=\\gcd(\\operatorname {lcm} (a,b),\\operatorname {lcm} (a,c))."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"0fa4366e41d1587a291b9b9a9198ed22b50c266ba56789ee66889b7ef29f7234","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"8f5bea5d95ca812cef83ded972c050d1d647aeafdbea01ee78d84676c9fb3db2","text":"addition distributes over the maximum: a + max(b,c) = max(a+b, a+c)"},{"id":"c2","part":"36d075ad88a29af9579ca79aa6786de1868a3f130903c383b37380e08add2640","text":"addition distributes over the minimum: a + min(b,c) = min(a+b, a+c)"}],"parts":["8f5bea5d95ca812cef83ded972c050d1d647aeafdbea01ee78d84676c9fb3db2","36d075ad88a29af9579ca79aa6786de1868a3f130903c383b37380e08add2640"],"relation":"broadMatch","status":"formalized"},"id":"enwiki-103118-1369824603::In-text #4d46c426","item":"In-text #4d46c426","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"max_add_add_left","end_line":58,"library":"mathlib","line":58,"location_key":"8f5bea5d95ca812cef83ded972c050d1d647aeafdbea01ee78d84676c9fb3db2","module":"Mathlib.Algebra.Order.Monoid.Unbundled.MinMax","note":"Lean states the identity for every linearly ordered carrier whose addition respects the order, and writes the sum side first.","pair_key":"482c523817432817c4f4e765adb5e6b92d4a43ced2201f24a19b8670aad7dbae","path":"Mathlib/Algebra/Order/Monoid/Unbundled/MinMax.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem max_add_add_left {α : Type*} [LinearOrder α] [Add α] [AddLeftMono α] (a b c : α) : Max.max (a + b) (a + c) = a + Max.max b c"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"min_add_add_left","end_line":54,"library":"mathlib","line":54,"location_key":"36d075ad88a29af9579ca79aa6786de1868a3f130903c383b37380e08add2640","module":"Mathlib.Algebra.Order.Monoid.Unbundled.MinMax","note":"Lean states the companion identity over the same ordered additive setting, again with the sum side written first.","pair_key":"5c37e710b226aac7cd39fff2984d3d96ff13ea8a35a1ddd0af16c31613dffc73","path":"Mathlib/Algebra/Order/Monoid/Unbundled/MinMax.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem min_add_add_left {α : Type*} [LinearOrder α] [Add α] [AddLeftMono α] (a b c : α) : Min.min (a + b) (a + c) = a + Min.min b c"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.max_add_left","end_line":467,"library":"lean-core","line":464,"location_key":"28dec521be8dd7c4c022b50e12600db40dca441c1b3e462f62d0b5eac7ac4b09","module":"Init.Data.Int.Order","note":"Lean fixes the carrier to the integers, where the passage speaks of the real numbers.","pair_key":"fea54e430319d2cd120a308b8ab257d9e70dfe49b2e9d1422ee9a1ded7d21d35","path":"src/Init/Data/Int/Order.lean","proof_status":"proved","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.max_add_left (a b c : Int) : Max.max (a + b) (a + c) = a + Max.max b c"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.min_add_left","end_line":424,"library":"lean-core","line":421,"location_key":"54b5caa9c79de18d546bdd7ba6944835ef4f396750269274cd89fab661c25ccf","module":"Init.Data.Int.Order","note":"Lean fixes the carrier to the integers, again narrower than the real numbers of the passage.","pair_key":"51e06a56a14b2b98703ee6e830bcd0877bc6dac0f5854b2826c3b40308253ea3","path":"src/Init/Data/Int/Order.lean","proof_status":"proved","rank":4,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.min_add_left (a b c : Int) : Min.min (a + b) (a + c) = a + Min.min b c"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"93b2385c43badd945b316b95f6a143026dd59c234dfeb71b4c6ca8540d03e64a","prominence":"supporting","quote":{"exact":"For real numbers, addition distributes over the maximum operation, and also over"},"quote_capped":true,"section":["Examples","Other examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"For real numbers, addition distributes over the maximum operation, and also over the minimum operation: a + max ( b , c ) = max ( a + b , a + c ) and a + min ( b , c ) = min ( a + b , a + c ) . {\\displaystyle a+\\max(b,c)=\\max(a+b,a+c)\\quad {\\text{ and }}\\quad a+\\min(b,c)=\\min(a+b,a+c).}","segments":[{"text":"For real numbers, addition distributes over the maximum operation, and also over the minimum operation: "},{"display":true,"tex":"a+\\max(b,c)=\\max(a+b,a+c)\\quad {\\text{ and }}\\quad a+\\min(b,c)=\\min(a+b,a+c)."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":4,"queries":5,"sha256":"96a095279ac1bccc191db1f23c3bb49879ee15345b8268dbdb9ff552165e76b3"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-103118-1369824603::In-text #77b38d4d","item":"In-text #77b38d4d","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"39915299324b265d07d19f4fa6f32bddd5deb2f51e2ad5023738ed27d806ff54","prominence":"supporting","quote":{"exact":"For binomial multiplication, distribution is sometimes referred to as the FOIL Method[2]"},"quote_capped":true,"section":["Examples","Other examples"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"For binomial multiplication, distribution is sometimes referred to as the FOIL Method[2] (First terms a c , {\\displaystyle ac,} Outer a d , {\\displaystyle ad,} Inner b c , {\\displaystyle bc,} and Last b d {\\displaystyle bd} ) such as: ( a + b ) ⋅ ( c + d ) = a c + a d + b c + b d . {\\displaystyle (a+b)\\cdot (c+d)=ac+ad+bc+bd.}","segments":[{"text":"For binomial multiplication, distribution is sometimes referred to as the FOIL Method"},{"ref":"[2]"},{"text":" (First terms "},{"tex":"ac,"},{"text":" Outer "},{"tex":"ad,"},{"text":" Inner "},{"tex":"bc,"},{"text":" and Last "},{"tex":"bd"},{"text":" ) such as: "},{"tex":"(a+b)\\cdot (c+d)=ac+ad+bc+bd."}]},"unresolved":null},{"absence":null,"basis":"e61194b760897e326e732bea470166efaf78ef2a63ff68fcfb4306d81707b929","coverage":{"basis":false,"bundle_key":"ea0228d117123d8cefeb655f05789aff500353cce8286d4aec393cbc03a935d8","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"466ff2ff5e4f78e9c7cd8c84de242f9d8801a16631b5bee555abfbe5ac4f60e9","text":"in a semiring, u(v+w) = uv + uw"},{"id":"c2","part":"69189b001f8f85053fc2ba423865a496a674540ee9d59edaf9029a29f9706596","text":"in a semiring, (u+v)w = uw + vw"}],"parts":["466ff2ff5e4f78e9c7cd8c84de242f9d8801a16631b5bee555abfbe5ac4f60e9","69189b001f8f85053fc2ba423865a496a674540ee9d59edaf9029a29f9706596"],"relation":"broadMatch","status":"formalized"},"id":"enwiki-103118-1369824603::In-text #730ff103","item":"In-text #730ff103","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"NonUnitalNonAssocSemiring.toDistrib","end_line":119,"library":"mathlib","line":119,"location_key":"e61194b760897e326e732bea470166efaf78ef2a63ff68fcfb4306d81707b929","module":"Mathlib.Algebra.Ring.Defs","note":"Lean records in one instance that both one-sided laws hold in any carrier with the additive and multiplicative structure of a semiring, associativity and a unit aside.","pair_key":"f5692d668c7f2817b0e7356475146d148ad3a815268b58de7de5b4330594b303","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 NonUnitalNonAssocSemiring.toDistrib {α : Type u} [self : NonUnitalNonAssocSemiring α] : Distrib α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_add","end_line":91,"library":"mathlib","line":91,"location_key":"466ff2ff5e4f78e9c7cd8c84de242f9d8801a16631b5bee555abfbe5ac4f60e9","module":"Mathlib.Algebra.Ring.Defs","note":"Lean states the equation for any carrier with the two operations and the left-hand distributive class, which every semiring provides.","pair_key":"c6d0df24552f535c86a1e77cbb7373c040a326cb529671cbb6982d95222bdb44","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 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":"add_mul","end_line":97,"library":"mathlib","line":97,"location_key":"69189b001f8f85053fc2ba423865a496a674540ee9d59edaf9029a29f9706596","module":"Mathlib.Algebra.Ring.Defs","note":"Lean states the companion equation over the same light hypotheses, which every semiring satisfies.","pair_key":"628b60c749fdf2db8122b1006c89ba8f013bccc81a5070d68716a36e7fa0f668","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 add_mul {R : Type v} [Mul R] [Add R] [RightDistribClass R] (a b c : R) : (a + b) * c = a * c + b * c"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"32030bf0617220b097121045cea199cf8d2d9aed137678ab5e508541bdee72aa","prominence":"central","quote":{"exact":"In all semirings, including the complex numbers, the quaternions, polynomials, and matrices,"},"quote_capped":true,"section":["Examples","Other examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"before":{"layer":" multiplication, distribution is sometimes referred to as the FOIL Method[2] (First terms a c , {\\displaystyle ac,} Outer a d , {\\displaystyle ad,} Inner b c , {\\displaystyle bc,} and Last b d {\\displaystyle bd} ) such as: ( a + b ) ⋅ ( c + d ) = a c + a d + b c + b d . {\\displaystyle (a+b)\\cdot (c+d)=ac+ad+bc+bd.} ","lead_in":true,"segments":[{"text":" multiplication, distribution is sometimes referred to as the FOIL Method"},{"ref":"[2]"},{"text":" (First terms "},{"tex":"ac,"},{"text":" Outer "},{"tex":"ad,"},{"text":" Inner "},{"tex":"bc,"},{"text":" and Last "},{"tex":"bd"},{"text":" ) such as: "},{"tex":"(a+b)\\cdot (c+d)=ac+ad+bc+bd."},{"text":" "}],"trimmed":true},"layer":"In all semirings, including the complex numbers, the quaternions, polynomials, and matrices, multiplication distributes over addition: u ( v + w ) = u v + u w , ( u + v ) w = u w + v w . {\\displaystyle u(v+w)=uv+uw,(u+v)w=uw+vw.}","segments":[{"text":"In all semirings, including the complex numbers, the quaternions, polynomials, and matrices, multiplication distributes over addition: "},{"tex":"u(v+w)=uv+uw,(u+v)w=uw+vw."}]},"unresolved":null},{"absence":null,"basis":"16d460078609f911d69456106e3205d82c38ea701d812a735dc5cc0f6a655cee","coverage":null,"id":"enwiki-103118-1369824603::In-text #6a105631","item":"In-text #6a105631","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"NonUnitalNonAssocSemiring.toDistrib","end_line":119,"library":"mathlib","line":119,"location_key":"16d460078609f911d69456106e3205d82c38ea701d812a735dc5cc0f6a655cee","module":"Mathlib.Algebra.Ring.Defs","note":"Lean's class here requires no associativity, so it covers the non-associative algebras the passage names alongside the associative ones.","pair_key":"c5bb0d0f31816234e827dc442ce1590ff0b38db4c8e2850a03a1a84343c65968","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 NonUnitalNonAssocSemiring.toDistrib {α : Type u} [self : NonUnitalNonAssocSemiring α] : Distrib α"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_add","end_line":91,"library":"mathlib","line":91,"location_key":"83cb847d293641855ecebf150fdbdc7b978fbca74ca1deda25e98b24eb004ac9","module":"Mathlib.Algebra.Ring.Defs","note":"It gives the law with the sum on the right of the product and leaves the companion law to add_mul.","pair_key":"3f96a07bef0d8db00d2d2bb5b522da320fead31543357a96dbc87e9c1003e75c","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 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":"add_mul","end_line":97,"library":"mathlib","line":97,"location_key":"a42d1d17578c5e92e261a50942c99a6fd24d2abe3a7ec876ff455ba01c0f6812","module":"Mathlib.Algebra.Ring.Defs","note":"It gives the law with the sum on the left of the product, the companion of mul_add.","pair_key":"1beb705cd41a45f04df99357a8200b5214e8f8c2127e11bf5fc5fe26a17523ca","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 add_mul {R : Type v} [Mul R] [Add R] [RightDistribClass R] (a b c : R) : (a + b) * c = a * c + b * c"},"statement":false},{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Octonion.instNonAssocRing","end_line":305,"library":"tauceti","line":296,"location_key":"a2b54ecb2fe7ef9edf32d94fd17deca1a60570820bbab7c9d50a5d1b23f79120","module":"TauCeti.Algebra.Octonion.Basic","note":"Lean records the law for the octonions as part of their ring instance, which is the non-associative algebra the passage names.","pair_key":"53f8802ddd9a7bac1491fe4af5a840000dfd57547c7279d9eff71afb30efa65e","path":"TauCeti/Algebra/Octonion/Basic.lean","proof_status":"definition","rank":4,"relation":"narrowMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"instance TauCeti.Octonion.instNonAssocRing {R : Type*} [CommRing R] : NonAssocRing (TauCeti.Octonion R)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d2043c3a3e47b79fced3537a1809fa4a03bc8a222a537a54ebf7227ed5027b27","prominence":"supporting","quote":{"exact":"In all algebras over a field, including the octonions and other non-associative"},"quote_capped":true,"section":["Examples","Other examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"before":{"layer":"In all semirings, including the complex numbers, the quaternions, polynomials, and matrices, multiplication distributes over addition: u ( v + w ) = u v + u w , ( u + v ) w = u w + v w . {\\displaystyle u(v+w)=uv+uw,(u+v)w=uw+vw.} ","lead_in":true,"segments":[{"text":"In all semirings, including the complex numbers, the quaternions, polynomials, and matrices, multiplication distributes over addition: "},{"tex":"u(v+w)=uv+uw,(u+v)w=uw+vw."},{"text":" "}]},"layer":"In all algebras over a field, including the octonions and other non-associative algebras, multiplication distributes over addition.","segments":[{"text":"In all algebras over a field, including the octonions and other non-associative algebras, multiplication distributes over addition."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"82d456c4d23eaa20d384ab6279709e5661b53db799d18583792e9fcac526805b","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"b12119737e8ab3a15b7cece69959ca9e7538f1b4a6089788c33cdf2220ee44f0","text":"P ∧ (Q ∨ R) is equivalent to (P ∧ Q) ∨ (P ∧ R)"},{"id":"c2","part":"08c15eb3e91c631b28e40ce71704b0a8fe1bb0b870360354890d007be4ade437","text":"P ∨ (Q ∧ R) is equivalent to (P ∨ Q) ∧ (P ∨ R)"}],"parts":["b12119737e8ab3a15b7cece69959ca9e7538f1b4a6089788c33cdf2220ee44f0","08c15eb3e91c631b28e40ce71704b0a8fe1bb0b870360354890d007be4ade437"],"relation":"exactMatch","status":"formalized"},"id":"enwiki-103118-1369824603::In-text #cf329973","item":"In-text #cf329973","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"and_or_left","end_line":122,"library":"lean-core","line":120,"location_key":"b12119737e8ab3a15b7cece69959ca9e7538f1b4a6089788c33cdf2220ee44f0","module":"Init.PropLemmas","note":"Lean's iff between propositions is the logical equivalence the passage's symbol stands for.","pair_key":"70a757c4797c3e3fee1856e8c30eeccee956593110fc0782508db75fdc01518b","path":"src/Init/PropLemmas.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem and_or_left {a b c : Prop} : a ∧ (b ∨ c) ↔ a ∧ b ∨ a ∧ c"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"or_and_left","end_line":130,"library":"lean-core","line":128,"location_key":"08c15eb3e91c631b28e40ce71704b0a8fe1bb0b870360354890d007be4ade437","module":"Init.PropLemmas","note":"Lean again states the rule as an iff between propositions, which is the equivalence the passage's symbol denotes.","pair_key":"9217dd97af57112d4147fa2a8fa64891750d984718d9064b9398c0dca7b8aa62","path":"src/Init/PropLemmas.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem or_and_left {a b c : Prop} : a ∨ b ∧ c ↔ (a ∨ b) ∧ (a ∨ c)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"4fd6338e2cae74c1d8b21e1561488f4f0327bf12f4a79a6a9bbef998a0a3d185","prominence":"central","quote":{"exact":"The rules are ( P ∧ ( Q ∨ R ) )"},"quote_capped":true,"section":["Propositional logic","Rule of replacement"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"The rules are ( P ∧ ( Q ∨ R ) ) ⇔ ( ( P ∧ Q ) ∨ ( P ∧ R ) ) and ( P ∨ ( Q ∧ R ) ) ⇔ ( ( P ∨ Q ) ∧ ( P ∨ R ) ) {\\displaystyle (P\\land (Q\\lor R))\\Leftrightarrow ((P\\land Q)\\lor (P\\land R))\\qquad {\\text{ and }}\\qquad (P\\lor (Q\\land R))\\Leftrightarrow ((P\\lor Q)\\land (P\\lor R))} where \" ⇔ {\\displaystyle \\Leftrightarrow } \", also written ≡ , {\\displaystyle \\,\\equiv ,\\,} is a metalogical symbol representing \"can be replaced in a proof with\" or \"is logically equivalent to\".","segments":[{"text":"The rules are "},{"display":true,"tex":"(P\\land (Q\\lor R))\\Leftrightarrow ((P\\land Q)\\lor (P\\land R))\\qquad {\\text{ and }}\\qquad (P\\lor (Q\\land R))\\Leftrightarrow ((P\\lor Q)\\land (P\\lor R))"},{"text":" where \" "},{"tex":"\\Leftrightarrow"},{"text":" \", also written "},{"tex":"\\,\\equiv ,\\,"},{"text":" is a metalogical symbol representing \"can be replaced in a proof with\" or \"is logically equivalent to\"."}]},"unresolved":null},{"absence":null,"basis":"173d5219496cbea89c45ebaa4afdc3209361271a4893ae6cb71405b75ddb968d","coverage":null,"id":"enwiki-103118-1369824603::In-text #ba62fed0","item":"In-text #ba62fed0","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"and_or_left","end_line":122,"library":"lean-core","line":120,"location_key":"173d5219496cbea89c45ebaa4afdc3209361271a4893ae6cb71405b75ddb968d","module":"Init.PropLemmas","note":"Stated as an iff between Props, which is how the article reads its metalogical double arrow.","pair_key":"3e175ade08b634877ac0ec980616e7ddd6a8f4c99f55cf0fba99da34fdbde0d6","path":"src/Init/PropLemmas.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem and_or_left {a b c : Prop} : a ∧ (b ∨ c) ↔ a ∧ b ∨ a ∧ c"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"or_and_left","end_line":130,"library":"lean-core","line":128,"location_key":"d183d81a96d6c6c7bd749d3c2ab1ed1e68624677d1d1f9a341714b5af11117ad","module":"Init.PropLemmas","note":null,"pair_key":"9052c364ea74cded3b4be7ff1f28fe54655a11b350a4ef06aaeb1efa2c043123","path":"src/Init/PropLemmas.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem or_and_left {a b c : Prop} : a ∨ b ∧ c ↔ (a ∨ b) ∧ (a ∨ c)"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"and_and_left","end_line":69,"library":"lean-core","line":69,"location_key":"18fb1f8ab5809988b97066b0a67f6bd5c2a2fe28f53fb84c5bf594d088686b7e","module":"Init.PropLemmas","note":null,"pair_key":"cad26d717a2b00e4b772d948cb92c3d0b2eed6ec5705d6224aae5ca1cd180f06","path":"src/Init/PropLemmas.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem and_and_left {a b c : Prop} : a ∧ b ∧ c ↔ (a ∧ b) ∧ a ∧ c"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"or_or_distrib_left","end_line":95,"library":"lean-core","line":95,"location_key":"4315d0678b83a570648d1f6e1f5273a336cd2a54d991ebb797c0cf0921c48ed9","module":"Init.PropLemmas","note":null,"pair_key":"e33c6a8625e2c515872ec6003577a724bf1ca2a7dd883dfee3b3369c73039486","path":"src/Init/PropLemmas.lean","proof_status":"proved","rank":4,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem or_or_distrib_left {a b c : Prop} : a ∨ b ∨ c ↔ (a ∨ b) ∨ a ∨ c"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"imp_and","end_line":115,"library":"lean-core","line":114,"location_key":"8ed30357702f11064d4fa297e4febdd56092cc03c0ceea2ec03ebcca351e7042","module":"Init.PropLemmas","note":"The sort argument ranges over any Sort, and a proposition is one of them, so the arrow form is the instance that matters here.","pair_key":"186f459f3637e9c66749a90bf8384dfd663b4fbe8e909971fd593c42db88332f","path":"src/Init/PropLemmas.lean","proof_status":"proved","rank":5,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem imp_and {b c : Prop} {α : Sort u_1} : (∀ (a : α), b ∧ c) ↔ (∀ (a : α), b) ∧ ∀ (a : α), c"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"bd809f821c5eff9486b80d711647cc4e7fa7dc4ede4bdf116107948b40f66073","prominence":"central","quote":{"exact":"The following are truth-functional tautologies. ( P ∧ ( Q ∨ R"},"quote_capped":true,"section":["Propositional logic","Truth functional connectives"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"The following are truth-functional tautologies. ( P ∧ ( Q ∨ R ) ) ⇔ ( ( P ∧ Q ) ∨ ( P ∧ R ) ) Distribution of conjunction over disjunction ( P ∨ ( Q ∧ R ) ) ⇔ ( ( P ∨ Q ) ∧ ( P ∨ R ) ) Distribution of disjunction over conjunction ( P ∧ ( Q ∧ R ) ) ⇔ ( ( P ∧ Q ) ∧ ( P ∧ R ) ) Distribution of conjunction over conjunction ( P ∨ ( Q ∨ R ) ) ⇔ ( ( P ∨ Q ) ∨ ( P ∨ R ) ) Distribution of disjunction over disjunction ( P → ( Q → R ) ) ⇔ ( ( P → Q ) → ( P → R ) ) Distribution of implication ( P → ( Q ↔ R ) ) ⇔ ( ( P → Q ) ↔ ( P → R ) ) Distribution of implication over equivalence ( P → ( Q ∧ R ) ) ⇔ ( ( P → Q ) ∧ ( P → R ) ) Distribution of implication over conjunction ( P ∨ ( Q ↔ R ) ) ⇔ ( ( P ∨ Q ) ↔ ( P ∨ R ) ) Distribution of disjunction over equivalence {\\displaystyle {\\begin{alignedat}{13}&(P&&\\;\\land &&(Q\\lor R))&&\\;\\Leftrightarrow \\;&&((P\\land Q)&&\\;\\lor (P\\land R))&&\\quad {\\text{ Distribution of }}&&{\\text{ conjunction }}&&{\\text{ over }}&&{\\text{ disjunction }}\\\\&(P&&\\;\\lor &&(Q\\land R))&&\\;\\Leftrightarrow \\;&&((P\\lor Q)&&\\;\\land (P\\lor R))&&\\quad {\\text{ Distribution of }}&&{\\text{ disjunction }}&&{\\text{ over }}&&{\\text{ conjunction }}\\\\&(P&&\\;\\land &&(Q\\land R))&&\\;\\Leftrightarrow \\;&&((P\\land Q)&&\\;\\land (P\\land R))&&\\quad {\\text{ Distribution of }}&&{\\text{ conjunction }}&&{\\text{ over }}&&{\\text{ conjunction }}\\\\&(P&&\\;\\lor &&(Q\\lor R))&&\\;\\Leftrightarrow \\;&&((P\\lor Q)&&\\;\\lor (P\\lor R))&&\\quad {\\text{ Distribution of }}&&{\\text{ disjunction }}&&{\\text{ over }}&&{\\text{ disjunction }}\\\\&(P&&\\to &&(Q\\to R))&&\\;\\Leftrightarrow \\;&&((P\\to Q)&&\\to (P\\to R))&&\\quad {\\text{ Distribution of }}&&{\\text{ implication }}&&{\\text{ }}&&{\\text{ }}\\\\&(P&&\\to &&(Q\\leftrightarrow R))&&\\;\\Leftrightarrow \\;&&((P\\to Q)&&\\leftrightarrow (P\\to R))&&\\quad {\\text{ Distribution of }}&&{\\text{ implication }}&&{\\text{ over }}&&{\\text{ equivalence }}\\\\&(P&&\\to &&(Q\\land R))&&\\;\\Leftrightarrow \\;&&((P\\to Q)&&\\;\\land (P\\to R))&&\\quad {\\text{ Distribution of }}&&{\\text{ implication }}&&{\\text{ over }}&&{\\text{ conjunction }}\\\\&(P&&\\;\\lor &&(Q\\leftrightarrow R))&&\\;\\Leftrightarrow \\;&&((P\\lor Q)&&\\leftrightarrow (P\\lor R))&&\\quad {\\text{ Distribution of }}&&{\\text{ disjunction }}&&{\\text{ over }}&&{\\text{ equivalence }}\\\\\\end{alignedat}}}","segments":[{"text":"The following are truth-functional tautologies. "},{"display":true,"tex":"\\begin{alignedat}{13}&(P&&\\;\\land &&(Q\\lor R))&&\\;\\Leftrightarrow \\;&&((P\\land Q)&&\\;\\lor (P\\land R))&&\\quad {\\text{ Distribution of }}&&{\\text{ conjunction }}&&{\\text{ over }}&&{\\text{ disjunction }}\\\\&(P&&\\;\\lor &&(Q\\land R))&&\\;\\Leftrightarrow \\;&&((P\\lor Q)&&\\;\\land (P\\lor R))&&\\quad {\\text{ Distribution of }}&&{\\text{ disjunction }}&&{\\text{ over }}&&{\\text{ conjunction }}\\\\&(P&&\\;\\land &&(Q\\land R))&&\\;\\Leftrightarrow \\;&&((P\\land Q)&&\\;\\land (P\\land R))&&\\quad {\\text{ Distribution of }}&&{\\text{ conjunction }}&&{\\text{ over }}&&{\\text{ conjunction }}\\\\&(P&&\\;\\lor &&(Q\\lor R))&&\\;\\Leftrightarrow \\;&&((P\\lor Q)&&\\;\\lor (P\\lor R))&&\\quad {\\text{ Distribution of }}&&{\\text{ disjunction }}&&{\\text{ over }}&&{\\text{ disjunction }}\\\\&(P&&\\to &&(Q\\to R))&&\\;\\Leftrightarrow \\;&&((P\\to Q)&&\\to (P\\to R))&&\\quad {\\text{ Distribution of }}&&{\\text{ implication }}&&{\\text{ }}&&{\\text{ }}\\\\&(P&&\\to &&(Q\\leftrightarrow R))&&\\;\\Leftrightarrow \\;&&((P\\to Q)&&\\leftrightarrow (P\\to R))&&\\quad {\\text{ Distribution of }}&&{\\text{ implication }}&&{\\text{ over }}&&{\\text{ equivalence }}\\\\&(P&&\\to &&(Q\\land R))&&\\;\\Leftrightarrow \\;&&((P\\to Q)&&\\;\\land (P\\to R))&&\\quad {\\text{ Distribution of }}&&{\\text{ implication }}&&{\\text{ over }}&&{\\text{ conjunction }}\\\\&(P&&\\;\\lor &&(Q\\leftrightarrow R))&&\\;\\Leftrightarrow \\;&&((P\\lor Q)&&\\leftrightarrow (P\\lor R))&&\\quad {\\text{ Distribution of }}&&{\\text{ disjunction }}&&{\\text{ over }}&&{\\text{ equivalence }}\\\\\\end{alignedat}"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"b6ce04269d6c5112fb3af7ee8b3ab543dc3f03ea94964442efe2da0c7f319dea"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-103118-1369824603::In-text #08ab0d58","item":"In-text #08ab0d58","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"and_or_left","end_line":122,"library":"lean-core","line":120,"location_key":"57578d16ff6399759525c334ab003c5f8f4b89770251481ad1b83df57b2286fa","module":"Init.PropLemmas","note":"The single distributive law over three propositions; the four-variable equivalences follow only after several applications of it together with commutativity.","pair_key":"52629d51c8c0901cf2284532f93e1b69615f2fd2b44bfc11a6ec4d4027704ce5","path":"src/Init/PropLemmas.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem and_or_left {a b c : Prop} : a ∧ (b ∨ c) ↔ a ∧ b ∨ a ∧ c"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"or_and_left","end_line":130,"library":"lean-core","line":128,"location_key":"93e03005837fcd3bf087a2973c5b83d29288192953ad9150722fb2402c0e5dcd","module":"Init.PropLemmas","note":"The dual single law; again several applications and a reassociation are needed before either displayed equivalence appears.","pair_key":"75e98460f2e738e3e68348f8bd844b992438189d25739b18d9ecb9d900202f12","path":"src/Init/PropLemmas.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem or_and_left {a b c : Prop} : a ∨ b ∧ c ↔ (a ∨ b) ∧ (a ∨ c)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"c78a0c957af2e2794ca8caad1bdccf7928640fea585f7a907ead101c49f28502","prominence":"supporting","quote":{"exact":"( ( P ∧ Q ) ∨ ( R ∧ S )"},"quote_capped":true,"section":["Propositional logic","Truth functional connectives"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"before":{"layer":"Double distribution ","lead_in":true,"segments":[{"text":"Double distribution "}]},"layer":"( ( P ∧ Q ) ∨ ( R ∧ S ) ) ⇔ ( ( ( P ∨ R ) ∧ ( P ∨ S ) ) ∧ ( ( Q ∨ R ) ∧ ( Q ∨ S ) ) ) ( ( P ∨ Q ) ∧ ( R ∨ S ) ) ⇔ ( ( ( P ∧ R ) ∨ ( P ∧ S ) ) ∨ ( ( Q ∧ R ) ∨ ( Q ∧ S ) ) ) {\\displaystyle {\\begin{alignedat}{13}&((P\\land Q)&&\\;\\lor (R\\land S))&&\\;\\Leftrightarrow \\;&&(((P\\lor R)\\land (P\\lor S))&&\\;\\land ((Q\\lor R)\\land (Q\\lor S)))&&\\\\&((P\\lor Q)&&\\;\\land (R\\lor S))&&\\;\\Leftrightarrow \\;&&(((P\\land R)\\lor (P\\land S))&&\\;\\lor ((Q\\land R)\\lor (Q\\land S)))&&\\\\\\end{alignedat}}}","segments":[{"display":true,"tex":"\\begin{alignedat}{13}&((P\\land Q)&&\\;\\lor (R\\land S))&&\\;\\Leftrightarrow \\;&&(((P\\lor R)\\land (P\\lor S))&&\\;\\land ((Q\\lor R)\\land (Q\\lor S)))&&\\\\&((P\\lor Q)&&\\;\\land (R\\lor S))&&\\;\\Leftrightarrow \\;&&(((P\\land R)\\lor (P\\land S))&&\\;\\lor ((Q\\land R)\\lor (Q\\land S)))&&\\\\\\end{alignedat}"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"8fc4cf38e812d0da8fec75960c1a7efeafbc8db62ee5443e9f5eb8f420dade48"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-103118-1369824603::In-text #16eef42e","item":"In-text #16eef42e","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"bcb49672ff34f833ff8e854d737ba799faccbc1e85d86efada892d96343d64dd","prominence":"supporting","quote":{"exact":"In approximate arithmetic, such as floating-point arithmetic, the distributive property of multiplication"},"quote_capped":true,"section":["Distributivity and rounding"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"after":{"layer":" because of the limitations of arithmetic precision.","segments":[{"text":" because of the limitations of arithmetic precision."}]},"layer":"In approximate arithmetic, such as floating-point arithmetic, the distributive property of multiplication (and division) over addition may fail","segments":[{"text":"In approximate arithmetic, such as floating-point arithmetic, the distributive property of multiplication (and division) over addition may fail"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"9f25b0af42f0d87c6a753bbeee52e907d9b5419bc74edc373ca81e62c514893c"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-103118-1369824603::In-text #f7dc6bb1","item":"In-text #f7dc6bb1","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"11a71342a9e77cfbadfc2949d7a6888ce5eb681635b5d2d505578b39f9505d9c","prominence":"supporting","quote":{"exact":"For example, the identity 1 / 3 + 1 / 3 +"},"quote_capped":true,"section":["Distributivity and rounding"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"For example, the identity 1 / 3 + 1 / 3 + 1 / 3 = ( 1 + 1 + 1 ) / 3 {\\displaystyle 1/3+1/3+1/3=(1+1+1)/3} fails in decimal arithmetic, regardless of the number of significant digits.","segments":[{"text":"For example, the identity "},{"tex":"1/3+1/3+1/3=(1+1+1)/3"},{"text":" fails in decimal arithmetic, regardless of the number of significant digits."}]},"unresolved":null},{"absence":null,"basis":"5a90fb689b3e945998d6f0b6b0a3d94704b96e7028c0506de281d26cb697b4c8","coverage":null,"id":"enwiki-103118-1369824603::In-text #c5b20e1e","item":"In-text #c5b20e1e","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Semiring","end_line":142,"library":"mathlib","line":141,"location_key":"5a90fb689b3e945998d6f0b6b0a3d94704b96e7028c0506de281d26cb697b4c8","module":"Mathlib.Algebra.Ring.Defs","note":"Mathlib gathers the two operations, their units and the two distributive laws into a single type class.","pair_key":"a1bbd1785b7375f98ef38df0974a0a27caa8b4930ac87a51f4f89fdfdd645f83","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class Semiring : Type u → Type u"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Distrib","end_line":66,"library":"mathlib","line":62,"location_key":"d7470a542f4d9c96f8013698dc10077726899177a4c8ab0f20b619d7882cb7dc","module":"Mathlib.Algebra.Ring.Defs","note":"Mathlib isolates the distributive requirement itself as a class over a carrier with multiplication and addition.","pair_key":"9067ed17efbbd0562beebe15f489f87649d1991b0782dacacf44d765ca5029b9","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class Distrib : Type u_1 → Type u_1"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6e6087d5cad1818ba37acdf7db977532a74302fdcfe153100749101d19f4ca1b","prominence":"central","quote":{"exact":"A semiring has two binary operations, commonly denoted + {\\displaystyle \\,+\\,} and"},"quote_capped":true,"section":["In rings and other structures"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"A semiring has two binary operations, commonly denoted + {\\displaystyle \\,+\\,} and ∗ , {\\displaystyle \\,*,} and requires that ∗ {\\displaystyle \\,*\\,} must distribute over + . {\\displaystyle \\,+.}","segments":[{"text":"A semiring has two binary operations, commonly denoted "},{"tex":"\\,+\\,"},{"text":" and "},{"tex":"\\,*,"},{"text":" and requires that "},{"tex":"\\,*\\,"},{"text":" must distribute over "},{"tex":"\\,+."}]},"unresolved":null},{"absence":null,"basis":"c0b41670890164bcbe9b8c27687e429a5b3915f7aaac45d412c44a362fc0547c","coverage":null,"id":"enwiki-103118-1369824603::In-text #204883a9","item":"In-text #204883a9","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Ring","end_line":146,"library":"mathlib","line":146,"location_key":"c0b41670890164bcbe9b8c27687e429a5b3915f7aaac45d412c44a362fc0547c","module":"Mathlib.Algebra.Ring.Defs","note":"Mathlib carries the additive inverse as a negation operation inside the structure, with subtraction derived from it, where the passage speaks of inverses existing.","pair_key":"85f0aaa3ea6b1898b156daa7538f2187940bd0b792875e476239f7e37f0fa758","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"definition","rank":1,"relation":"closeMatch","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":"eff820445d7d5a1a8296a820cade3026eb9955fb58ab5323a319b523082dc2e8","prominence":"central","quote":{"exact":"A ring is a semiring with additive inverses."},"quote_capped":false,"section":["In rings and other structures"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"A ring is a semiring with additive inverses.","segments":[{"text":"A ring is a semiring with additive inverses."}]},"unresolved":null},{"absence":null,"basis":"0d07cdfa70cb7a9adb7754c677d1c24efc3d6b34fe837e15c20d71a13f7379bb","coverage":null,"id":"enwiki-103118-1369824603::In-text #b2107c63","item":"In-text #b2107c63","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Lattice","end_line":226,"library":"mathlib","line":226,"location_key":"0d07cdfa70cb7a9adb7754c677d1c24efc3d6b34fe837e15c20d71a13f7379bb","module":"Mathlib.Order.Defs.Lattice","note":"Mathlib presents the two operations as the join and the meet of a partial order, the order being recoverable from either operation.","pair_key":"9c7a238f53778b12b34aeec1a7c6725472eb37d48d62ca0ccab67bd60a516af5","path":"Mathlib/Order/Defs/Lattice.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class Lattice : Type u → Type u"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Lattice.mk'","end_line":234,"library":"mathlib","line":207,"location_key":"e5e18f62a0d11bb6e0539a3f96e21aefeb2d03ea1f22f81146b4e1a9f8ba1e06","module":"Mathlib.Order.Lattice","note":"It builds Mathlib's lattice structure from the purely equational data of two binary operations, which is the presentation the passage uses.","pair_key":"623bdd5c983d829330e59742c353ea07265381f16a4736672791fca33be8bb74","path":"Mathlib/Order/Lattice.lean","proof_status":"definition","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Lattice.mk' {α : Type*} [Max α] [Min α] : (∀ (a b : α), a ⊔ b = b ⊔ a) → (∀ (a b c : α), a ⊔ b ⊔ c = a ⊔ (b ⊔ c)) → (∀ (a b : α), a ⊓ b = b ⊓ a) → (∀ (a b c : α), a ⊓ b ⊓ c = a ⊓ (b ⊓ c)) → (∀ (a b : α), a ⊔ a ⊓ b = a) → (∀ (a b : α), a ⊓ (a ⊔ b) = a) → Lattice α"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7c373b48cdd86dbafe2a6fd5de6d29fa26a007f714b1c242410e8cdedaba47b2","prominence":"central","quote":{"exact":"A lattice is another kind of algebraic structure with two binary operations,"},"quote_capped":true,"section":["In rings and other structures"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"after":{"layer":" If either of these operations distributes over the other (say ∧ {\\displaystyle \\,\\land \\,} distributes over ∨ {\\displaystyle \\,\\lor } ), then the reverse also holds ( ∨ {\\displaystyle \\,\\lor \\,} distributes over ∧ {\\displaystyle \\,\\land \\,} ), and the lattice is called distributive.","segments":[{"text":" If either of these operations distributes over the other (say "},{"tex":"\\,\\land \\,"},{"text":" distributes over "},{"tex":"\\,\\lor"},{"text":" ), then the reverse also holds ( "},{"tex":"\\,\\lor \\,"},{"text":" distributes over "},{"tex":"\\,\\land \\,"},{"text":" ), and the lattice is called distributive."}]},"layer":"A lattice is another kind of algebraic structure with two binary operations, ∧ and ∨ . {\\displaystyle \\,\\land {\\text{ and }}\\lor .}","segments":[{"text":"A lattice is another kind of algebraic structure with two binary operations, "},{"tex":"\\,\\land {\\text{ and }}\\lor ."}]},"unresolved":null},{"absence":null,"basis":"6925eb6ea648b811987060714d3fa55dc11c01a8a6549291ea5b41e1c7454289","coverage":null,"id":"enwiki-103118-1369824603::In-text #87974fb7","item":"In-text #87974fb7","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"inf_sup_left","end_line":329,"library":"mathlib","line":323,"location_key":"6925eb6ea648b811987060714d3fa55dc11c01a8a6549291ea5b41e1c7454289","module":"Mathlib.Order.Defs.Lattice","note":"The class hypothesis carries the one distributive law and the conclusion is the other, so this is the exchange read in a single direction.","pair_key":"42a6f2444c665e6a91725bbd5ab2314cb80307c8438e3f5a98f90bd0a1bf0dcf","path":"Mathlib/Order/Defs/Lattice.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem inf_sup_left {α : Type u} [DistribLattice α] (a b c : α) : a ⊓ (b ⊔ c) = a ⊓ b ⊔ a ⊓ c"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"DistribLattice.ofInfSupLe","end_line":307,"library":"mathlib","line":301,"location_key":"d5f1561ee1667eb82870fa2fbaa243791c2aab1bc3c50ad72ec0ca5f03b974c6","module":"Mathlib.Order.Defs.Lattice","note":"It carries the exchange the other way round, turning the assumed law into the structure that bears the dual one.","pair_key":"1dfb112b025a8f501e98c5055078438f1ae5d7555e913d5294601fa19aef20c4","path":"Mathlib/Order/Defs/Lattice.lean","proof_status":"definition","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"abbrev DistribLattice.ofInfSupLe {α : Type u} [Lattice α] : (∀ (a b c : α), a ⊓ (b ⊔ c) ≤ a ⊓ b ⊔ a ⊓ c) → DistribLattice α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"DistribLattice","end_line":296,"library":"mathlib","line":294,"location_key":"1e60e2be82fac4fb820f9ee5c64a29782c7b321a7b1b8d650ff71b90e9e5c69e","module":"Mathlib.Order.Defs.Lattice","note":"Mathlib fixes one of the four interchangeable distributive conditions, written as an inequality, as the class's axiom and gives the class the passage's name.","pair_key":"50bd374449dd6127122c1c2edae2f9f4a9df946ab72cabc896939e99125b310b","path":"Mathlib/Order/Defs/Lattice.lean","proof_status":"definition","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class DistribLattice : Type u_1 → Type u_1"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"be140eb5a5bfdeb6b4b0cf2b26bd469cb2760c71e69a9605e97ee52c4cdb63d9","prominence":"central","quote":{"exact":"If either of these operations distributes over the other (say ∧ {\\displaystyle"},"quote_capped":true,"section":["In rings and other structures"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"before":{"layer":"A lattice is another kind of algebraic structure with two binary operations, ∧ and ∨ . {\\displaystyle \\,\\land {\\text{ and }}\\lor .} ","segments":[{"text":"A lattice is another kind of algebraic structure with two binary operations, "},{"tex":"\\,\\land {\\text{ and }}\\lor ."},{"text":" "}]},"layer":"If either of these operations distributes over the other (say ∧ {\\displaystyle \\,\\land \\,} distributes over ∨ {\\displaystyle \\,\\lor } ), then the reverse also holds ( ∨ {\\displaystyle \\,\\lor \\,} distributes over ∧ {\\displaystyle \\,\\land \\,} ), and the lattice is called distributive.","segments":[{"text":"If either of these operations distributes over the other (say "},{"tex":"\\,\\land \\,"},{"text":" distributes over "},{"tex":"\\,\\lor"},{"text":" ), then the reverse also holds ( "},{"tex":"\\,\\lor \\,"},{"text":" distributes over "},{"tex":"\\,\\land \\,"},{"text":" ), and the lattice is called distributive."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"78344c6b0734c364e3dffc2d1e75fc62093d9bb234eb37ebb3ddfde7f270b164","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"226c518d2f940a2f28cbf5b1430718b89022f8a13e8ce4c49e75840021233bd1","text":"a Boolean algebra may be read as a Boolean ring"},{"id":"c2","part":"f10b732d7a31344a50016cb84cb9d6086415eb9841c8aef3282d76af91470e3d","text":"a Boolean algebra may be read as a Boolean (distributive) lattice"}],"parts":["226c518d2f940a2f28cbf5b1430718b89022f8a13e8ce4c49e75840021233bd1","f10b732d7a31344a50016cb84cb9d6086415eb9841c8aef3282d76af91470e3d"],"relation":"broadMatch","status":"formalized"},"id":"enwiki-103118-1369824603::In-text #1e911cb6","item":"In-text #1e911cb6","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"BooleanAlgebra.toBooleanRing","end_line":432,"library":"mathlib","line":427,"location_key":"226c518d2f940a2f28cbf5b1430718b89022f8a13e8ce4c49e75840021233bd1","module":"Mathlib.Algebra.Ring.BooleanRing","note":"Its addition is symmetric difference, its multiplication meet, with bottom and top as the two constants.","pair_key":"8ab27307d0a011fa1f5d994e63b558d7f21e28ebe4592fe7faa06322592f91a2","path":"Mathlib/Algebra/Ring/BooleanRing.lean","proof_status":"definition","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"abbrev BooleanAlgebra.toBooleanRing {α : Type*} [BooleanAlgebra α] : BooleanRing α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"GeneralizedCoheytingAlgebra.toDistribLattice","end_line":511,"library":"mathlib","line":508,"location_key":"f10b732d7a31344a50016cb84cb9d6086415eb9841c8aef3282d76af91470e3d","module":"Mathlib.Order.Heyting.Basic","note":"Mathlib proves this for the wider class of generalized co-Heyting algebras, which Lean reaches from a Boolean algebra through the two instances named above.","pair_key":"433dd05b0240919fed7592f02972fa6ae90cad8eeaaabb1c6a64bb9ce9459799","path":"Mathlib/Order/Heyting/Basic.lean","proof_status":"definition","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance GeneralizedCoheytingAlgebra.toDistribLattice {α : Type*} [GeneralizedCoheytingAlgebra α] : DistribLattice α"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"cc5c7a3d00fa888b8bd80001832a32aa03b7a69bc22a6e8d2652026b4837a2f7","prominence":"supporting","quote":{"exact":"A Boolean algebra can be interpreted either as a special kind of"},"quote_capped":true,"section":["In rings and other structures"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"A Boolean algebra can be interpreted either as a special kind of ring (a Boolean ring) or a special kind of distributive lattice (a Boolean lattice).","segments":[{"text":"A Boolean algebra can be interpreted either as a special kind of ring (a Boolean ring) or a special kind of distributive lattice (a Boolean lattice)."}]},"unresolved":null},{"absence":null,"basis":"22f6a174d3883c211d5890bf1ef3ff3562b4d8578e5c466ef565801aeca52657","coverage":null,"id":"enwiki-103118-1369824603::In-text #c354239d","item":"In-text #c354239d","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Fintype.prod_sum","end_line":306,"library":"mathlib","line":305,"location_key":"22f6a174d3883c211d5890bf1ef3ff3562b4d8578e5c466ef565801aeca52657","module":"Mathlib.Algebra.BigOperators.Ring.Finset","note":"Mathlib's version asks the semiring to be commutative, so it reaches those of the passage's semirings that commute.","pair_key":"0f2a4864a3a89f3ec475df81d47cbc14ed19a8bd913cd3f2307e0caf091bc1b7","path":"Mathlib/Algebra/BigOperators/Ring/Finset.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Fintype.prod_sum {ι : Type*} {R : Type*} [Fintype ι] [CommSemiring R] [DecidableEq ι] {κ : ι → Type*} [(i : ι) → Fintype (κ i)] (f : (i : ι) → κ i → R) : ∏ i, ∑ j, f i j = ∑ x, ∏ i, f i (x i)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Finset.prod_sum","end_line":152,"library":"mathlib","line":124,"location_key":"1d50ef90a859fcfe6b4763bd009b7010a9656b3dc2c34d0e48d58c81bcb2fb0e","module":"Mathlib.Algebra.BigOperators.Ring.Finset","note":"It indexes the resulting sum by Mathlib's dependent-choice finset and again asks for commutativity.","pair_key":"ab6cdb0c9f45666b4f961523c9b47c269d56cb5c6546913922924fb0e2a818c3","path":"Mathlib/Algebra/BigOperators/Ring/Finset.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.prod_sum {ι : Type*} {R : Type*} [CommSemiring R] [DecidableEq ι] {κ : ι → Type*} (s : Finset ι) (t : (i : ι) → Finset (κ i)) (f : (i : ι) → κ i → R) : ∏ a ∈ s, ∑ b ∈ t a, f a b = ∑ p ∈ s.pi t, ∏ x ∈ s.attach, f (↑x) (p ↑x ⋯)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f31734ab152e8dcee2640cbdcea3495bdea01e47035b67294c2db9123ea50fb8","prominence":"central","quote":{"exact":"In any semiring, distributivity can be used to show that any product"},"quote_capped":true,"section":["In rings and other structures"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"In any semiring, distributivity can be used to show that any product of sums is a sum of products (though not every sum of products is necessarily a product of sums).","segments":[{"text":"In any semiring, distributivity can be used to show that any product of sums is a sum of products (though not every sum of products is necessarily a product of sums)."}]},"unresolved":null},{"absence":null,"basis":"f4a9cd285b8f4e91e7af93a8af8f95e6b5edd9eb0b83a08d758b430cadb34883","coverage":null,"id":"enwiki-103118-1369824603::In-text #c073faa6","item":"In-text #c073faa6","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Fintype.prod_sum","end_line":306,"library":"mathlib","line":305,"location_key":"f4a9cd285b8f4e91e7af93a8af8f95e6b5edd9eb0b83a08d758b430cadb34883","module":"Mathlib.Algebra.BigOperators.Ring.Finset","note":"The declaration asks the semiring to be commutative and indexes the families by finite types instead of counting from one.","pair_key":"68389d4f8b58a161fe0c5b7c2e24904c9ba8e0f532d7ac277db179a38e662a1c","path":"Mathlib/Algebra/BigOperators/Ring/Finset.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Fintype.prod_sum {ι : Type*} {R : Type*} [Fintype ι] [CommSemiring R] [DecidableEq ι] {κ : ι → Type*} [(i : ι) → Fintype (κ i)] (f : (i : ι) → κ i → R) : ∏ i, ∑ j, f i j = ∑ x, ∏ i, f i (x i)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Finset.prod_univ_sum","end_line":159,"library":"mathlib","line":157,"location_key":"6dfc84413d39dc6f6a4bcf78c7bfda87e3e3b43079d029588f34a337a008d116","module":"Mathlib.Algebra.BigOperators.Ring.Finset","note":"It states the same expansion with the inner ranges given as finite sets, and again with commutativity assumed.","pair_key":"a3cff3b544c2c6c2aa67c4dca532d2e82a5f35d2495090136a623b73fbe7b4f5","path":"Mathlib/Algebra/BigOperators/Ring/Finset.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.prod_univ_sum {ι : Type*} {R : Type*} [CommSemiring R] [DecidableEq ι] {κ : ι → Type*} [Fintype ι] (t : (i : ι) → Finset (κ i)) (f : (i : ι) → κ i → R) : ∏ i, ∑ j ∈ t i, f i j = ∑ x ∈ Fintype.piFinset t, ∏ i, f i (x i)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"72f8b49f4e03c1bee3c99d7b74f1a728dd25cf3bc352c807030194c0e348e1eb","prominence":"central","quote":{"exact":"The general formula reads: ∏ i = 1 m ( ∑ j"},"quote_capped":true,"section":["In rings and other structures"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"after":{"layer":" Structures without two-sided distributive laws are near-rings and near-fields.","segments":[{"text":" Structures without two-sided distributive laws are near-rings and near-fields."}]},"layer":"The general formula reads: ∏ i = 1 m ( ∑ j = 1 n i a i , j ) = ∑ j 1 = 1 n 1 ∑ j 2 = 1 n 2 ⋯ ∑ j m = 1 n m ∏ i = 1 m a i , j i {\\displaystyle \\prod _{i=1}^{m}\\left(\\sum _{j=1}^{n_{i}}a_{i,j}\\right)=\\sum _{j_{1}=1}^{n_{1}}\\sum _{j_{2}=1}^{n_{2}}\\cdots \\sum _{j_{m}=1}^{n_{m}}\\;\\prod _{i=1}^{m}a_{i,j_{i}}}","segments":[{"text":"The general formula reads: "},{"display":true,"tex":"\\prod _{i=1}^{m}\\left(\\sum _{j=1}^{n_{i}}a_{i,j}\\right)=\\sum _{j_{1}=1}^{n_{1}}\\sum _{j_{2}=1}^{n_{2}}\\cdots \\sum _{j_{m}=1}^{n_{m}}\\;\\prod _{i=1}^{m}a_{i,j_{i}}"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"3299dfeef43e6d465cd5e6a0582e23ce775f7715d02316b8cd6e8b02032be138"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-103118-1369824603::In-text #c4428ae0","item":"In-text #c4428ae0","kind":"definition","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"RightDistribClass","end_line":76,"library":"mathlib","line":74,"location_key":"26bca4f943232cc432bbe929e951af91d6e7fccbf7158cfd0e2887ba5fc93518","module":"Mathlib.Algebra.Ring.Defs","note":"It records one axiom on a bare type with two operations and builds no structure of its own.","pair_key":"ca18127f04c87499dd6a1885aa40cf07478f641c303f89e3773978cf6b9946b1","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class RightDistribClass (R : Type*) [Mul R] [Add R] : Prop"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"b8c616d410a886b7d5d293756627651c5bf954dbdd8948310cc96f75c2464ec9","prominence":"supporting","quote":{"exact":"Structures without two-sided distributive laws are near-rings and"},"quote_capped":false,"section":["In rings and other structures"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"after":{"layer":" near-fields.","segments":[{"text":" near-fields."}]},"before":{"layer":"The general formula reads: ∏ i = 1 m ( ∑ j = 1 n i a i , j ) = ∑ j 1 = 1 n 1 ∑ j 2 = 1 n 2 ⋯ ∑ j m = 1 n m ∏ i = 1 m a i , j i {\\displaystyle \\prod _{i=1}^{m}\\left(\\sum _{j=1}^{n_{i}}a_{i,j}\\right)=\\sum _{j_{1}=1}^{n_{1}}\\sum _{j_{2}=1}^{n_{2}}\\cdots \\sum _{j_{m}=1}^{n_{m}}\\;\\prod _{i=1}^{m}a_{i,j_{i}}} ","segments":[{"text":"The general formula reads: "},{"display":true,"tex":"\\prod _{i=1}^{m}\\left(\\sum _{j=1}^{n_{i}}a_{i,j}\\right)=\\sum _{j_{1}=1}^{n_{1}}\\sum _{j_{2}=1}^{n_{2}}\\cdots \\sum _{j_{m}=1}^{n_{m}}\\;\\prod _{i=1}^{m}a_{i,j_{i}}"},{"text":" "}]},"layer":"Structures without two-sided distributive laws are near-rings and","segments":[{"text":"Structures without two-sided distributive laws are near-rings and"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"19e9732da1818f5064745524b9d25c138cb9bc7bbc59a91361a0c460b029536d"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-103118-1369824603::In-text #b8a78efa","item":"In-text #b8a78efa","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"6c86209feccf30459b66e29384af337df5ec438ccc8637c755b1eb8d675ea15e","prominence":"supporting","quote":{"exact":"near-fields."},"quote_capped":false,"section":["In rings and other structures"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"before":{"layer":"∏ i = 1 m ( ∑ j = 1 n i a i , j ) = ∑ j 1 = 1 n 1 ∑ j 2 = 1 n 2 ⋯ ∑ j m = 1 n m ∏ i = 1 m a i , j i {\\displaystyle \\prod _{i=1}^{m}\\left(\\sum _{j=1}^{n_{i}}a_{i,j}\\right)=\\sum _{j_{1}=1}^{n_{1}}\\sum _{j_{2}=1}^{n_{2}}\\cdots \\sum _{j_{m}=1}^{n_{m}}\\;\\prod _{i=1}^{m}a_{i,j_{i}}} Structures without two-sided distributive laws are near-rings and ","segments":[{"display":true,"tex":"\\prod _{i=1}^{m}\\left(\\sum _{j=1}^{n_{i}}a_{i,j}\\right)=\\sum _{j_{1}=1}^{n_{1}}\\sum _{j_{2}=1}^{n_{2}}\\cdots \\sum _{j_{m}=1}^{n_{m}}\\;\\prod _{i=1}^{m}a_{i,j_{i}}"},{"text":" Structures without two-sided distributive laws are near-rings and "}],"trimmed":true},"layer":"near-fields.","segments":[{"text":"near-fields."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"5947030df0d5f6393b1cace22181ff8341ef90a0d297d3a16da24df73bb7e3d7"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-103118-1369824603::In-text #e00e239c","item":"In-text #e00e239c","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"0270afd1313d9b52aff1598416c7146eff18dabd772391d77f9d71747a2f26cd","prominence":"supporting","quote":{"exact":"The operations are usually defined to be distributive on the right but"},"quote_capped":true,"section":["In rings and other structures"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"The operations are usually defined to be distributive on the right but not on the left.","segments":[{"text":"The operations are usually defined to be distributive on the right but not on the left."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"eaa63ecf96da9dbe78766ea75717893af19f170aacf7b7080838045fae9e5b0c"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-103118-1369824603::In-text #1a04e11f","item":"In-text #1a04e11f","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"6401a32a260738ae6ab9c3e03274427a17e9a8ee2c5080dc479434369c80e042","prominence":"supporting","quote":{"exact":"An application of this principle are the notions of sub-distributivity, where equality"},"quote_capped":true,"section":["Generalizations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"after":{"layer":" super-distributivity, where equality is replaced by \"greater than or equal\".","segments":[{"text":" super-distributivity, where equality is replaced by \"greater than or equal\"."}]},"layer":"An application of this principle are the notions of sub-distributivity, where equality is replaced by \"less than or equal\"; and","segments":[{"text":"An application of this principle are the notions of sub-distributivity, where equality is replaced by \"less than or equal\"; and"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"0493e21c1e4c6200160d82aba8c6877281f6e7f2dbad6bbed654455a24ee7fd5"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-103118-1369824603::In-text #3a8784b4","item":"In-text #3a8784b4","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"6c0abfdd51ee8514393b96ae1a0f991f93f4625d15866bad054bba33dfd6c89c","prominence":"supporting","quote":{"exact":"super-distributivity, where equality is replaced by \"greater than or equal\"."},"quote_capped":false,"section":["Generalizations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"before":{"layer":"An application of this principle are the notions of sub-distributivity, where equality is replaced by \"less than or equal\"; and ","segments":[{"text":"An application of this principle are the notions of sub-distributivity, where equality is replaced by \"less than or equal\"; and "}]},"layer":"super-distributivity, where equality is replaced by \"greater than or equal\".","segments":[{"text":"super-distributivity, where equality is replaced by \"greater than or equal\"."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"3c19e918dc71dd2b5fdd9cc5cebcaa29bec2e467847e87b698d6a47290aeffd9"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-103118-1369824603::In-text #aba7df74","item":"In-text #aba7df74","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"9e512de0ffe865223046590988e182c25ae6ad14792810f14fa5389b8f9b913b","prominence":"central","quote":{"exact":"In category theory, if ( S , μ , ν ) {\\displaystyle"},"quote_capped":true,"section":["Generalizations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"after":{"layer":" This is exactly the data needed to define a monad structure on S ′ . S {\\displaystyle S^{\\prime }.S} : the multiplication map is S ′ μ . μ ′ S 2 . S ′ λ S {\\displaystyle S^{\\prime }\\mu .\\mu ^{\\prime }S^{2}.S^{\\prime }\\lambda S} and the unit map is η ′ S . η . {\\displaystyle \\eta ^{\\prime }S.\\eta .} A generalized","segments":[{"text":" This is exactly the data needed to define a monad structure on "},{"tex":"S^{\\prime }.S"},{"text":" : the multiplication map is "},{"tex":"S^{\\prime }\\mu .\\mu ^{\\prime }S^{2}.S^{\\prime }\\lambda S"},{"text":" and the unit map is "},{"tex":"\\eta ^{\\prime }S.\\eta ."},{"text":" A generalized"}],"trimmed":true},"layer":"In category theory, if ( S , μ , ν ) {\\displaystyle (S,\\mu ,\\nu )} and ( S ′ , μ ′ , ν ′ ) {\\displaystyle \\left(S^{\\prime },\\mu ^{\\prime },\\nu ^{\\prime }\\right)} are monads on a category C , {\\displaystyle C,} a distributive law S . S ′ → S ′ . S {\\displaystyle S.S^{\\prime }\\to S^{\\prime }.S} is a natural transformation λ : S . S ′ → S ′ . S {\\displaystyle \\lambda :S.S^{\\prime }\\to S^{\\prime }.S} such that ( S ′ , λ ) {\\displaystyle \\left(S^{\\prime },\\lambda \\right)} is a lax map of monads S → S {\\displaystyle S\\to S} and ( S , λ ) {\\displaystyle (S,\\lambda )} is a colax map of monads S ′ → S ′ . {\\displaystyle S^{\\prime }\\to S^{\\prime }.}","segments":[{"text":"In category theory, if "},{"tex":"(S,\\mu ,\\nu )"},{"text":" and "},{"tex":"\\left(S^{\\prime },\\mu ^{\\prime },\\nu ^{\\prime }\\right)"},{"text":" are monads on a category "},{"tex":"C,"},{"text":" a distributive law "},{"tex":"S.S^{\\prime }\\to S^{\\prime }.S"},{"text":" is a natural transformation "},{"tex":"\\lambda :S.S^{\\prime }\\to S^{\\prime }.S"},{"text":" such that "},{"tex":"\\left(S^{\\prime },\\lambda \\right)"},{"text":" is a lax map of monads "},{"tex":"S\\to S"},{"text":" and "},{"tex":"(S,\\lambda )"},{"text":" is a colax map of monads "},{"tex":"S^{\\prime }\\to S^{\\prime }."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"2df38cf3488b434e71920482230792662ee5a71374b6a41e49ee20ffa0ea4eaf"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-103118-1369824603::In-text #58dffda5","item":"In-text #58dffda5","kind":"construction","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"d028babfbc479764bbed3bbb9128c7572ce6c268273a87e4639db89d8d7bffb8","prominence":"supporting","quote":{"exact":"This is exactly the data needed to define a monad structure on"},"quote_capped":true,"section":["Generalizations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"after":{"layer":" A generalized distributive law has also been proposed in the area of information theory.","segments":[{"text":" A generalized distributive law has also been proposed in the area of information theory."}]},"before":{"layer":"λ : S . S ′ → S ′ . S {\\displaystyle \\lambda :S.S^{\\prime }\\to S^{\\prime }.S} such that ( S ′ , λ ) {\\displaystyle \\left(S^{\\prime },\\lambda \\right)} is a lax map of monads S → S {\\displaystyle S\\to S} and ( S , λ ) {\\displaystyle (S,\\lambda )} is a colax map of monads S ′ → S ′ . {\\displaystyle S^{\\prime }\\to S^{\\prime }.} ","segments":[{"tex":"\\lambda :S.S^{\\prime }\\to S^{\\prime }.S"},{"text":" such that "},{"tex":"\\left(S^{\\prime },\\lambda \\right)"},{"text":" is a lax map of monads "},{"tex":"S\\to S"},{"text":" and "},{"tex":"(S,\\lambda )"},{"text":" is a colax map of monads "},{"tex":"S^{\\prime }\\to S^{\\prime }."},{"text":" "}],"trimmed":true},"layer":"This is exactly the data needed to define a monad structure on S ′ . S {\\displaystyle S^{\\prime }.S} : the multiplication map is S ′ μ . μ ′ S 2 . S ′ λ S {\\displaystyle S^{\\prime }\\mu .\\mu ^{\\prime }S^{2}.S^{\\prime }\\lambda S} and the unit map is η ′ S . η . {\\displaystyle \\eta ^{\\prime }S.\\eta .}","segments":[{"text":"This is exactly the data needed to define a monad structure on "},{"tex":"S^{\\prime }.S"},{"text":" : the multiplication map is "},{"tex":"S^{\\prime }\\mu .\\mu ^{\\prime }S^{2}.S^{\\prime }\\lambda S"},{"text":" and the unit map is "},{"tex":"\\eta ^{\\prime }S.\\eta ."}]},"unresolved":null},{"absence":null,"basis":"e705a38032039970a453792f77aaaca25de4bc1d9bfde4278c38a6f72828b0b1","coverage":null,"id":"enwiki-103118-1369824603::In-text #1527e8fe","item":"In-text #1527e8fe","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_inv_rev","end_line":328,"library":"mathlib","line":327,"location_key":"e705a38032039970a453792f77aaaca25de4bc1d9bfde4278c38a6f72828b0b1","module":"Mathlib.Algebra.Group.DivInvMonoid","note":"Mathlib proves the identity for division monoids, a class to which every group belongs.","pair_key":"b6f7a7095550c2dd67b28e129be084bbf672ca0472b4d73798d943b634f32ada","path":"Mathlib/Algebra/Group/DivInvMonoid.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_inv_rev {G : Type*} [DivisionMonoid G] (a b : G) : (a * b)⁻¹ = b⁻¹ * a⁻¹"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"49717ba5dfb52e996d5944eed6fd627357aa9768e83ab8e925ed9a1f9015adcd","prominence":"central","quote":{"exact":"The ubiquitous identity that relates inverses to the binary operation in any"},"quote_capped":true,"section":["Generalizations","Antidistributivity"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"The ubiquitous identity that relates inverses to the binary operation in any group, namely ( x y ) − 1 = y − 1 x − 1 , {\\displaystyle (xy)^{-1}=y^{-1}x^{-1},} which is taken as an axiom in the more general context of a semigroup with involution, has sometimes been called an antidistributive property (of inversion as a unary operation).","segments":[{"text":"The ubiquitous identity that relates inverses to the binary operation in any group, namely "},{"tex":"(xy)^{-1}=y^{-1}x^{-1},"},{"text":" which is taken as an axiom in the more general context of a semigroup with involution, has sometimes been called an antidistributive property (of inversion as a unary operation)."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"10c230d46f7ecbc2e0766883a083a09875978c611bb121b2a02b4425a8ba6b6e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-103118-1369824603::In-text #fc8bae54","item":"In-text #fc8bae54","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"2d2afe182daaa91eca9f591f65355f72eed1d330532650dfac38d1bacf5e435e","prominence":"supporting","quote":{"exact":"In the context of a near-ring, which removes the commutativity of the"},"quote_capped":true,"section":["Generalizations","Antidistributivity"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"layer":"In the context of a near-ring, which removes the commutativity of the additively written group and assumes only one-sided distributivity, one can speak of (two-sided) distributive elements but also of antidistributive elements.","segments":[{"text":"In the context of a near-ring, which removes the commutativity of the additively written group and assumes only one-sided distributivity, one can speak of (two-sided) distributive elements but also of antidistributive elements."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"7e87a60e149f6b87c3be2abfb669c36f87d6d91e0333d32e61c7f076561ea4a8"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-103118-1369824603::In-text #3f3dc75b","item":"In-text #3f3dc75b","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"8a07191e84c21b78fbad52d761e816d6e79f0249186a3112ee99fddf0fb7e560","prominence":"supporting","quote":{"exact":"The latter reverse the order of (the non-commutative) addition"},"quote_capped":false,"section":["Generalizations","Antidistributivity"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"after":{"layer":"; assuming a left-nearring (i.e. one which all elements distribute when multiplied on the left), then an antidistributive element a {\\displaystyle a} reverses the order of addition when multiplied to the right: ( x + y ) a = y a + x a . {\\displaystyle (x+y)a=ya+xa.}","segments":[{"text":"; assuming a left-nearring (i.e. one which all elements distribute when multiplied on the left), then an antidistributive element "},{"tex":"a"},{"text":" reverses the order of addition when multiplied to the right: "},{"tex":"(x+y)a=ya+xa."}]},"layer":"The latter reverse the order of (the non-commutative) addition","segments":[{"text":"The latter reverse the order of (the non-commutative) addition"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"1ecfc6c419a18951eb931607b61d097182afe240015c6e366fa26ff1ef9c30c7"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-103118-1369824603::In-text #f5e3b9f6","item":"In-text #f5e3b9f6","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"bcd1af94951fd4121de74900a7a64fbc6a14ce0e63c80d41fdf752d5c390d3cd","prominence":"supporting","quote":{"exact":"assuming a left-nearring (i.e. one which all elements distribute when multiplied on"},"quote_capped":true,"section":["Generalizations","Antidistributivity"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"before":{"layer":"The latter reverse the order of (the non-commutative) addition; ","segments":[{"text":"The latter reverse the order of (the non-commutative) addition; "}]},"layer":"assuming a left-nearring (i.e. one which all elements distribute when multiplied on the left), then an antidistributive element a {\\displaystyle a} reverses the order of addition when multiplied to the right: ( x + y ) a = y a + x a . {\\displaystyle (x+y)a=ya+xa.}","segments":[{"text":"assuming a left-nearring (i.e. one which all elements distribute when multiplied on the left), then an antidistributive element "},{"tex":"a"},{"text":" reverses the order of addition when multiplied to the right: "},{"tex":"(x+y)a=ya+xa."}]},"unresolved":null},{"absence":null,"basis":"90352f482a58c870974a1fe142557287f3800a485c9750f672845b6556844421","coverage":null,"id":"enwiki-103118-1369824603::In-text #f0f2a970","item":"In-text #f0f2a970","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"or_imp","end_line":136,"library":"lean-core","line":135,"location_key":"90352f482a58c870974a1fe142557287f3800a485c9750f672845b6556844421","module":"Init.PropLemmas","note":null,"pair_key":"f1b6fb661f4376247ebca47310b14175a83d5ba005bada548bb73b592e1c6dc3","path":"src/Init/PropLemmas.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem or_imp {a b c : Prop} : a ∨ b → c ↔ (a → c) ∧ (b → c)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"sup_himp_distrib","end_line":282,"library":"mathlib","line":279,"location_key":"a8c138091625046198e6ba9fbfb6e77c5e0dab40a8ee501046d6e817537e1aa4","module":"Mathlib.Order.Heyting.Basic","note":"Mathlib proves the law in every generalized Heyting algebra, which covers the Boolean algebras the passage has in view.","pair_key":"c2fa3234e615c971bf96df018f430b74d9f098509bead56d6b9e9dc41e278ffc","path":"Mathlib/Order/Heyting/Basic.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem sup_himp_distrib {α : Type*} [GeneralizedHeytingAlgebra α] (a b c : α) : a ⊔ b ⇨ c = (a ⇨ c) ⊓ (b ⇨ c)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"86644e261c4288af6f3de8ba7ed0c773fe363061a50aacba678e09f6ce08db29","prominence":"supporting","quote":{"exact":"In the study of propositional logic and Boolean algebra, the term antidistributive"},"quote_capped":true,"section":["Generalizations","Antidistributivity"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"after":{"layer":" ( a ∧ b ) ⇒ c ≡ ( a ⇒ c ) ∨ ( b ⇒ c ) . {\\displaystyle (a\\land b)\\Rightarrow c\\equiv (a\\Rightarrow c)\\lor (b\\Rightarrow c).}","segments":[{"text":" "},{"display":true,"tex":"(a\\land b)\\Rightarrow c\\equiv (a\\Rightarrow c)\\lor (b\\Rightarrow c)."}]},"layer":"In the study of propositional logic and Boolean algebra, the term antidistributive law is sometimes used to denote the interchange between conjunction and disjunction when implication factors over them:[7] ( a ∨ b ) ⇒ c ≡ ( a ⇒ c ) ∧ ( b ⇒ c ) {\\displaystyle (a\\lor b)\\Rightarrow c\\equiv (a\\Rightarrow c)\\land (b\\Rightarrow c)}","segments":[{"text":"In the study of propositional logic and Boolean algebra, the term antidistributive law is sometimes used to denote the interchange between conjunction and disjunction when implication factors over them:"},{"ref":"[7]"},{"text":" "},{"display":true,"tex":"(a\\lor b)\\Rightarrow c\\equiv (a\\Rightarrow c)\\land (b\\Rightarrow c)"}]},"unresolved":null},{"absence":null,"basis":"c8bf8ecad668414537eee31b323471a900d3f578b3025e450907d34604cbe6f3","coverage":null,"id":"enwiki-103118-1369824603::In-text #cd3a1059","item":"In-text #cd3a1059","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"not_and_or","end_line":422,"library":"mathlib","line":422,"location_key":"c8bf8ecad668414537eee31b323471a900d3f578b3025e450907d34604cbe6f3","module":"Mathlib.Basic.Logic.Basic","note":"Mathlib states the case in which the conclusion is falsity, where an implication into falsity is by definition a negation.","pair_key":"f7526695bebee317500ef3d694d126b3165d40c3ecf1a6aabbe2f31ad4f7876b","path":"Mathlib/Basic/Logic/Basic.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem not_and_or {a b : Prop} : ¬(a ∧ b) ↔ ¬a ∨ ¬b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"02834fc57043dcfd6229f8b28860e74d738e4728fbe34410ec6bd434d0f90f62","prominence":"supporting","quote":{"exact":"( a ∧ b ) ⇒ c ≡ ( a ⇒ c"},"quote_capped":true,"section":["Generalizations","Antidistributivity"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=103118&oldid=1369824603","text":{"before":{"layer":"of propositional logic and Boolean algebra, the term antidistributive law is sometimes used to denote the interchange between conjunction and disjunction when implication factors over them:[7] ( a ∨ b ) ⇒ c ≡ ( a ⇒ c ) ∧ ( b ⇒ c ) {\\displaystyle (a\\lor b)\\Rightarrow c\\equiv (a\\Rightarrow c)\\land (b\\Rightarrow c)} ","segments":[{"text":"of propositional logic and Boolean algebra, the term antidistributive law is sometimes used to denote the interchange between conjunction and disjunction when implication factors over them:"},{"ref":"[7]"},{"text":" "},{"display":true,"tex":"(a\\lor b)\\Rightarrow c\\equiv (a\\Rightarrow c)\\land (b\\Rightarrow c)"},{"text":" "}],"trimmed":true},"layer":"( a ∧ b ) ⇒ c ≡ ( a ⇒ c ) ∨ ( b ⇒ c ) . {\\displaystyle (a\\land b)\\Rightarrow c\\equiv (a\\Rightarrow c)\\lor (b\\Rightarrow c).}","segments":[{"display":true,"tex":"(a\\land b)\\Rightarrow c\\equiv (a\\Rightarrow c)\\lor (b\\Rightarrow c)."}]},"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":200335,"images":[{"author":"Stephan Kulla (User:Stephan Kulla)","file":"Illustration_of_distributive_property_with_rectangles.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","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"}],"marks":365,"passages":64,"sha256":"a2b17e267275fd38e7f248c78c9394206e80cc77c6809f980791a04dc40c4a87","unplaced":[]},"record_set":"23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602","records_sha256":"3e886efa420935cf7ffd1a9a779345fe8e5cd435d3513463f79f360b4b975ad7","revision":1369824603,"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":"256ca518ac979c9b99dd664f4f43ce70caf7b2b10d49485c849015033c1ec3d8","layer_sha256":"bfa38db78f7c6a224208bcaf05f3b18cabb6fe2dbfd70471a3689e2934fc8be0","renderer":"web-html/3"},"source_id":"enwiki-103118-1369824603","summary":{"by_library":{"lean-core":{"complete":18,"incomplete":0,"locations":18,"passages":9,"related":2},"mathlib":{"complete":76,"incomplete":0,"locations":76,"passages":39,"related":7},"tauceti":{"complete":1,"incomplete":0,"locations":1,"passages":1,"related":0}},"by_prominence":{"central":{"by_status":{"formalized":9,"not_formalized":1,"partial":6,"statement_only":0,"unresolved":0},"passages":16},"subject":{"by_status":{"formalized":1,"not_formalized":0,"partial":0,"statement_only":0,"unresolved":0},"passages":1},"supporting":{"by_status":{"formalized":17,"not_formalized":21,"partial":9,"statement_only":0,"unresolved":0},"passages":47}},"by_proof_status":{"definition":30,"proved":74},"by_relation":{"broadMatch":16,"closeMatch":7,"exactMatch":8,"hasPart":50,"narrowMatch":14,"relatedMatch":9},"by_status":{"formalized":27,"not_formalized":22,"partial":15,"statement_only":0,"unresolved":0},"locations":95,"passages":64,"related":9},"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":"Distributive property","universe":{"frozen":"2026-10-17","id":"u1","libraries":48,"sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"wikidata":"Q187959"}
