{"assessment":{"class":"B","importance":"top"},"audit":{"blind":true,"ended":"2026-11-03T02:10:43.537Z","figures":[{"ci95":[0.4891,0.9935],"drawn":36,"id":"primary","label":"Strong links (exact, close or broad match) on supporting passages that have exactly the right relation","n_eff":5.1,"population":1029,"share":0.9234,"weights":"relation and library"},{"ci95":[0.3979,0.9202],"drawn":48,"id":"S2","label":"Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation","n_eff":8.1,"population":1740,"share":0.734,"weights":"relation and library"},{"ci95":[0.7268,0.9357],"drawn":44,"id":"CS","label":"Central and subject passages whose formalization status is right","n_eff":42.0,"population":1905,"share":0.8615,"weights":"recorded status"},{"ci95":[0.2519,0.8658],"drawn":12,"id":"S3","label":"'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it)","n_eff":6.1,"population":1236,"share":0.5957,"weights":"article"}],"independent":false,"items":224,"models":[{"model":"claude-opus-5-5","model_name":"Claude Opus 5.5"}],"operator":"jack","run_id":"tierA-batch1-audit","started":"2026-11-02T21:10:01.351Z"},"campaign":"run:loc-tierA-b1a+chal-tierA-b1","licence":{"mapping":"CC0-1.0","text":"CC-BY-SA-4.0"},"pageid":9710,"passages":[{"absence":null,"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #a5e37fdf","item":"In-text #a5e37fdf","kind":"definition","locations":[],"outcome":"unresolved","passage_ends_in_suffix":false,"passage_key":"8713bcbc5bc2b736d544636e46b82dd682714d988f4557111c5d9406ec97f72a","prominence":"subject","quote":{"exact":"Elementary algebra, also known as high school algebra or college algebra,[1] encompasses"},"quote_capped":true,"section":[],"status":null,"subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Elementary algebra, also known as high school algebra or college algebra,[1] encompasses the basic concepts of algebra.","segments":[{"text":"Elementary algebra, also known as high school algebra or college algebra,"},{"ref":"[1]"},{"text":" encompasses the basic concepts of algebra."}]},"unresolved":{"challenge":"survived"}},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"4836eb8509836bde42f08489ee4763639f1201058af9e788cb0b95930d927f16"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #ef5b562d","item":"In-text #ef5b562d","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"15d1ce1d171f124212e464ba4213725506af0abe3b4b9f5cf42d51992bff3454","prominence":"central","quote":{"exact":"In mathematics, a basic algebraic operation is a mathematical operation similar to"},"quote_capped":true,"section":["Algebraic operations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"In mathematics, a basic algebraic operation is a mathematical operation similar to any one of the common operations of elementary algebra, which include addition, subtraction, multiplication, division, raising to a whole number power, and taking roots (fractional power).[5]","segments":[{"text":"In mathematics, a basic algebraic operation is a mathematical operation similar to any one of the common operations of elementary algebra, which include addition, subtraction, multiplication, division, raising to a whole number power, and taking roots (fractional power)."},{"ref":"[5]"}]},"unresolved":null},{"absence":null,"basis":"84e0e7e634769528d80d1cb60a6df36418cbfca7a3f9de3530b051ccaaaa571b","coverage":null,"id":"enwiki-9710-1380664138::In-text #b2b41bf8","item":"In-text #b2b41bf8","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Function.OfArity","end_line":31,"library":"mathlib","line":31,"location_key":"84e0e7e634769528d80d1cb60a6df36418cbfca7a3f9de3530b051ccaaaa571b","module":"Mathlib.Logic.Function.OfArity","note":"Mathlib writes the arguments one after another and keeps the equivalence that carries that form to the tuple form the passage uses.","pair_key":"9223fc6598af766a222d7db0e45eed70fd3c66f8549ac0a409b9fe5240d9135a","path":"Mathlib/Logic/Function/OfArity.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"abbrev Function.OfArity : Type u → Type u → ℕ → Type u"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Function.OfArity.curryEquiv","end_line":131,"library":"mathlib","line":130,"location_key":"85ac24d975c3bf4dbfd83a2f49902451fb4c7c94cf7bb4a636cc553bfd2e0cf8","module":"Mathlib.Data.Fin.Tuple.Curry","note":"It is the bijection between maps on tuples of a fixed length and maps taking that many arguments, so it links two ways of writing one operation rather than defining the notion.","pair_key":"e6b38815a2ccc3db9cecb2e3912e7f24c71258946e015bf7969c2823ba4f777e","path":"Mathlib/Data/Fin/Tuple/Curry.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Function.OfArity.curryEquiv {α β : Type u} (n : ℕ) : ((Fin n → α) → β) ≃ Function.OfArity α β n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"655d35f4b76b3f573ba1e68cc39c4d5679ffe92e1b77d0c0334e14a2a935a924","prominence":"central","quote":{"exact":"An algebraic operation on a set ⁠ S {\\displaystyle S} ⁠ may"},"quote_capped":true,"section":["Algebraic operations"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"An algebraic operation on a set ⁠ S {\\displaystyle S} ⁠ may be defined more formally as a function that maps to ⁠ S {\\displaystyle S} ⁠ the tuples of a given length of elements of ⁠ S {\\displaystyle S} ⁠.","segments":[{"text":"An algebraic operation on a set ⁠ "},{"tex":"S"},{"text":" ⁠ may be defined more formally as a function that maps to ⁠ "},{"tex":"S"},{"text":" ⁠ the tuples of a given length of elements of ⁠ "},{"tex":"S"},{"text":" ⁠."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"9d1886b958c1742c66853d527492bf340d02fe6c41edcc4763dcba9d7d5c25f8"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #c73cefd2","item":"In-text #c73cefd2","kind":"definition","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Function.OfArity","end_line":31,"library":"mathlib","line":31,"location_key":"b445c3dc9231e136f3ee48b78c5f5f152fc52912ccc6bafe516b2733bd9479d7","module":"Mathlib.Logic.Function.OfArity","note":"Its natural-number index counts the arguments an operation takes, but the abbreviation introduces the type of those maps and never fixes a word for that number.","pair_key":"bf3a4275efc3d50ebae20ec2609d725ac97a7cd03365136ac2895b060d97095d","path":"Mathlib/Logic/Function/OfArity.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"abbrev Function.OfArity : Type u → Type u → ℕ → Type u"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Function.OfArity.curryEquiv","end_line":131,"library":"mathlib","line":130,"location_key":"e385e2b58277b87d4cb00cf445f927915ba15835c3b43c9831665bb908a014e6","module":"Mathlib.Data.Fin.Tuple.Curry","note":"It matches maps on tuples of a given length with maps of that many arguments, so the tuple length and the index meet through it and only together with the type it indexes.","pair_key":"972c8cf326dac8b370e92973497e54bbc0e329b6bb1b3a4e70b1882d331990e6","path":"Mathlib/Data/Fin/Tuple/Curry.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Function.OfArity.curryEquiv {α β : Type u} (n : ℕ) : ((Fin n → α) → β) ≃ Function.OfArity α β n"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"7f274525d6017429e4fa40c657fb2ae47f112eb0eaf779148387fe6b176dcff9","prominence":"supporting","quote":{"exact":"The length of the tuples is called the arity of the operation,"},"quote_capped":false,"section":["Algebraic operations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"after":{"layer":" and each member of the tuple is called an operand.","segments":[{"text":" and each member of the tuple is called an operand."}]},"layer":"The length of the tuples is called the arity of the operation,","segments":[{"text":"The length of the tuples is called the arity of the operation,"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"788cbda15a402eedc44e51655319b94d169d06f01ad4afd4f05b3619b54c22a3"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #0bd2e884","item":"In-text #0bd2e884","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"84d947e08fa14fd3a0a92288621c490cfa18b61340ddea44adc5c308a9e9cf18","prominence":"supporting","quote":{"exact":"each member of the tuple is called an operand."},"quote_capped":false,"section":["Algebraic operations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"The length of the tuples is called the arity of the operation, and ","segments":[{"text":"The length of the tuples is called the arity of the operation, and "}]},"layer":"each member of the tuple is called an operand.","segments":[{"text":"each member of the tuple is called an operand."}]},"unresolved":null},{"absence":null,"basis":"63a63107adb75b9b78f0e15a665f01253348e7154176f65857ef535d457c5da1","coverage":null,"id":"enwiki-9710-1380664138::In-text #c732408e","item":"In-text #c732408e","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"finTwoArrowEquiv","end_line":51,"library":"mathlib","line":50,"location_key":"63a63107adb75b9b78f0e15a665f01253348e7154176f65857ef535d457c5da1","module":"Mathlib.Logic.Equiv.Fin.Basic","note":"Mathlib writes a two-entry tuple as a map out of a two-element index and supplies its identification with the product of S with itself, where the passage speaks of the pair of operands.","pair_key":"06fa61a6053b213406023cd049e4a5a189d70ec3d2c08eeb2484eba99a284844","path":"Mathlib/Logic/Equiv/Fin/Basic.lean","proof_status":"definition","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def finTwoArrowEquiv (α : Type*) : (Fin 2 → α) ≃ α × α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"low","declaration":"Function.OfArity.uncurry_two_eq_uncurry","end_line":139,"library":"mathlib","line":137,"location_key":"4888ee87286a6306ea77bfed4558d672ada3f5bb1c2ac79c84ee9cfb316dcf6a","module":"Mathlib.Data.Fin.Tuple.Curry","note":"It rewrites a two-argument map read on a tuple as the paired form composed with that identification, so it already works inside the naming the passage introduces instead of asserting it.","pair_key":"303f916082008144290c10b58cda46f5f8b0c2a1119481ad375577967fbc0e53","path":"Mathlib/Data/Fin/Tuple/Curry.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.OfArity.uncurry_two_eq_uncurry {α β : Type u} (f : Function.OfArity α β 2) : f.uncurry = Function.uncurry f ∘ ⇑(finTwoArrowEquiv α)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2974c363fd6ab34c88ee62aa3d36ef7fca68dd6343a31b3f0855da1a24ec0626","prominence":"central","quote":{"exact":"The most common case is the case of arity two, where the"},"quote_capped":true,"section":["Algebraic operations"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"The most common case is the case of arity two, where the operation is called a binary operation and the operands form an ordered pair.","segments":[{"text":"The most common case is the case of arity two, where the operation is called a binary operation and the operands form an ordered pair."}]},"unresolved":null},{"absence":null,"basis":"0b53fcc545b957f6a5b4f9e18e27085daa42dbf3c02926595f49f9cb92dd390b","coverage":null,"id":"enwiki-9710-1380664138::In-text #af5a5ee7","item":"In-text #af5a5ee7","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.sqrt","end_line":112,"library":"mathlib","line":111,"location_key":"0b53fcc545b957f6a5b4f9e18e27085daa42dbf3c02926595f49f9cb92dd390b","module":"Mathlib.Analysis.Real.Sqrt","note":"Mathlib's root is total on the reals and answers zero on the negatives, which leaves untouched its being a map of one input.","pair_key":"899708732fb0168e5c2b7e12a776eb3595e91b150a7b54cdad7346e0bca0e85b","path":"Mathlib/Analysis/Real/Sqrt.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Real.sqrt : ℝ → ℝ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Function.End","end_line":47,"library":"mathlib","line":47,"location_key":"64f27b729d77ebda9543791a5477ad573ac39c07151652b3f212950bcc167cc0","module":"Mathlib.Algebra.Group.End","note":"Mathlib keeps this type for the composition monoid on it, and the data it names is the maps of one input from a set to itself.","pair_key":"11d29b44488c7be43f3e81cb3c72b72ffde7845f35b5dee5347caee2429b36db","path":"Mathlib/Algebra/Group/End.lean","proof_status":"definition","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Function.End : Type u_4 → Type u_4"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"45a8ce4db5623c454f65e1fad61d86f05eab3434a5e4c4d5fb6558c522d59c83","prominence":"central","quote":{"exact":"A unary operation is an operation of arity one that has only"},"quote_capped":true,"section":["Algebraic operations"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"A unary operation is an operation of arity one that has only one operand; for example, the square root.","segments":[{"text":"A unary operation is an operation of arity one that has only one operand; for example, the square root."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"1892c24889a53ffac3558463f626b18dacd3e1b2b1f21343cd16b4d0025f9686"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #20132130","item":"In-text #20132130","kind":"example","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"triple_product_eq_det","end_line":106,"library":"mathlib","line":103,"location_key":"f57019c1ef4057e0973681aa811feb30fe51b56165db075bdb0cf5de3ea8f021","module":"Mathlib.LinearAlgebra.CrossProduct","note":"Mathlib states a determinant identity for the product of three vectors over a commutative ring; it works with that product as an expression in three vectors without classifying it by how many inputs it consumes.","pair_key":"538c7ba1cf5f3efd35c27426800b4e275de27028fc2a7818b8060d73a4c58608","path":"Mathlib/LinearAlgebra/CrossProduct.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem triple_product_eq_det {R : Type*} [CommRing R] (u v w : Fin 3 → R) : u ⬝ᵥ (crossProduct v) w = Matrix.det ![u, v, w]"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"08d65a28c15fdc0626aa7d6e73d4c1bbc65684d62a59e3381e8e5b8aa8cef22f","prominence":"supporting","quote":{"exact":"An example of a ternary operation (arity three) is the triple product."},"quote_capped":false,"section":["Algebraic operations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"An example of a ternary operation (arity three) is the triple product.","segments":[{"text":"An example of a ternary operation (arity three) is the triple product."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"9a825a01494e62e0ec74cf4fc3f6155482575a290057f79085f5b24158591a3c"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #8a0ea62d","item":"In-text #8a0ea62d","kind":"definition","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"dotProduct","end_line":77,"library":"mathlib","line":76,"location_key":"d529f1e078476487ee0a8215b26bd890040af6bdfa365f11cd0850aba995d585","module":"Mathlib.Data.Matrix.Mul","note":"It gives the entrywise sum of products itself and asserts nothing about what such an operation is called.","pair_key":"43a2c32c651382c64f784304a65bc51514619c9b8927ec878d79f4298f8c0270","path":"Mathlib/Data/Matrix/Mul.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def dotProduct {m : Type*} {α : Type v} [Fintype m] [Mul α] [AddCommMonoid α] : (m → α) → (m → α) → α"},"statement":false},{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"Cslib.Complexity.Algebraic.ArithmeticCircuit","library":"atlas","line":42,"location_key":"bb85afc84807957d36c5292e1c311ec572a0dacbff7517bfc729a25a40c75c12","module":"CSLibExt.Complexity.Algebraic.ArithmeticCircuit","note":"It models operations built up from scalar addition, subtraction and multiplication, but inside a circuit-complexity setting and with no claim about terminology.","pair_key":"1a398a93f6ffb382a0ab9e794db53df2b0a6b1c0c2e0cf6257a98bbce5df2320","path":"CSLibExt/Complexity/Algebraic/ArithmeticCircuit.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"structure Cslib.Complexity.Algebraic.ArithmeticCircuit : Type u → Type v → Type w → Type (max (max u v) w)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e404c342841cc21cd131437836024ac72c50b858e8941f7bdd953a002ce3d8a3","prominence":"supporting","quote":{"exact":"The term algebraic operation may also be used for operations that may"},"quote_capped":true,"section":["Algebraic operations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"The term algebraic operation may also be used for operations that may be defined by compounding basic algebraic operations, such as the dot product.","segments":[{"text":"The term algebraic operation may also be used for operations that may be defined by compounding basic algebraic operations, such as the dot product."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"3cf54120a4ddbcafc48723739323ab1ea4693d476009e83befc6eb3c65eaff61"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #f6ad24b8","item":"In-text #f6ad24b8","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"f330ed323716356b86125b3e5474f08116ae7b989a72d9fab0369d4c022843fd","prominence":"supporting","quote":{"exact":"In calculus and mathematical analysis, algebraic operation is also used for the"},"quote_capped":true,"section":["Algebraic operations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"In calculus and mathematical analysis, algebraic operation is also used for the operations that may be defined by purely algebraic methods.","segments":[{"text":"In calculus and mathematical analysis, algebraic operation is also used for the operations that may be defined by purely algebraic methods."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"5eef18c4b69e1bd932f50f6740e86884811c63b548667da49778bc82397127f4"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #ee28f173","item":"In-text #ee28f173","kind":"example","locations":[{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.NumberTheory.TranscendenceWanted.gelfondSchneider_real_rpow","library":"atlas","line":2454,"location_key":"475d18563f3fa901d2ead3359085104691119b9d28426f88d154179802fb6047","module":"MathlibExt.NumberTheory.GelfondSchneider","note":"It concerns the transcendence over the rationals of one real power, not whether raising to a real exponent counts as an algebraic operation.","pair_key":"de87874b346472d3138fb0267a204cb04c1b010cf5adf9c31cc17f28e7c86247","path":"MathlibExt/NumberTheory/GelfondSchneider.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.NumberTheory.TranscendenceWanted.gelfondSchneider_real_rpow (α β : ℝ) : 0 < α → α ≠ 1 → IsAlgebraic ℚ α → IsAlgebraic ℚ β → Irrational β → Transcendental ℚ (α.rpow β)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"10b2cddb189f1bef87930dbd2a23a2d3a60bafcdceb6b5dd36b153a6324994b1","prominence":"supporting","quote":{"exact":"For example, exponentiation with an integer or rational exponent is an algebraic"},"quote_capped":true,"section":["Algebraic operations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"For example, exponentiation with an integer or rational exponent is an algebraic operation, but not the general exponentiation with a real or complex exponent.","segments":[{"text":"For example, exponentiation with an integer or rational exponent is an algebraic operation, but not the general exponentiation with a real or complex exponent."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"de03703bc3f314793e292627879ce82ae47d80c5667cfadfe1efab750b5793d6"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #fdccf7e7","item":"In-text #fdccf7e7","kind":"example","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"deriv","end_line":155,"library":"mathlib","line":154,"location_key":"d679b8f75a24cfca91bf66e26e4290cefd15a1f3072774f2d670e402be0dc931","module":"Mathlib.Analysis.Calculus.Deriv.Basic","note":"It defines the derivative by a limit but says nothing about the derivative falling outside the algebraic operations.","pair_key":"bfe3603e0df632d366caa8162c17b43c08c7bc20d4ec4cad8f0b374e78fe7a01","path":"Mathlib/Analysis/Calculus/Deriv/Basic.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def deriv {𝕜 : Type u} [NontriviallyNormedField 𝕜] {F : Type v} [AddCommGroup F] [_root_.Module 𝕜 F] [TopologicalSpace F] : (𝕜 → F) → 𝕜 → F"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Polynomial.derivative","end_line":54,"library":"mathlib","line":47,"location_key":"7ca02df4f49d410865fa9eb1c5486dbb09b0a2895740ae71aec9f18ab9e37bf2","module":"Mathlib.Algebra.Polynomial.Derivative","note":"It is the formal derivative of a polynomial, given by an algebraic rule on coefficients, and carries no claim of the passage's kind.","pair_key":"44ae7a3496f3243d1ee3db78722f5b9048a521e1242a78a4e3c43fe690ca27fb","path":"Mathlib/Algebra/Polynomial/Derivative.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Polynomial.derivative {R : Type u} [Semiring R] : R[X] →ₗ[R] R[X]"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"1c1cec11d5b7d518f769a073f65cf3a918e083659adea8192a177dee7c8289d9","prominence":"supporting","quote":{"exact":"Also, the derivative is an operation that is not algebraic."},"quote_capped":false,"section":["Algebraic operations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Also, the derivative is an operation that is not algebraic.","segments":[{"text":"Also, the derivative is an operation that is not algebraic."}]},"unresolved":null},{"absence":null,"basis":"2b47f0d82c3ba9109dbe095ef35132d47ed8050e3bac338c70d5f3796bcc556d","coverage":null,"id":"enwiki-9710-1380664138::In-text #7ec3a3b3","item":"In-text #7ec3a3b3","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polynomial.coeff","end_line":559,"library":"mathlib","line":558,"location_key":"2b47f0d82c3ba9109dbe095ef35132d47ed8050e3bac338c70d5f3796bcc556d","module":"Mathlib.Algebra.Polynomial.Basic","note":"The library fixes one indeterminate, while the article's coefficients sit in expressions with several letters, and it answers zero for a power the expression does not display.","pair_key":"2194744cb845dd2c084b7367225a3dca691494518424ddfc583bb6f07bb9059b","path":"Mathlib/Algebra/Polynomial/Basic.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Polynomial.coeff {R : Type u} [Semiring R] : R[X] → ℕ →₀ R"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MvPolynomial.coeff_monomial","end_line":580,"library":"mathlib","line":578,"location_key":"819884fa1a42f9ce442662ec76d1c3f6e797134a92c554a6aacb2a950efcf794","module":"Mathlib.Algebra.MvPolynomial.Basic","note":"It is the computation rule giving back the coefficient of a single displayed term rather than the definition of a coefficient.","pair_key":"b098a32c3dbdf9a503c24fbd56f0e1ff9ca19d489642dad511fb4f66fc3e73fc","path":"Mathlib/Algebra/MvPolynomial/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem MvPolynomial.coeff_monomial {R : Type u} {σ : Type*} [CommSemiring R] [DecidableEq σ] (m n : σ →₀ ℕ) (a : R) : ((MvPolynomial.monomial n) a).coeff m = if n = m then a else 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"bfdc10bb6be964b3cba1f95552fe03cba535811816e52b10f1670074fa2cd9e1","prominence":"central","quote":{"exact":"A coefficient is a numerical value, or letter representing a numerical constant,"},"quote_capped":true,"section":["Algebraic notation"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"A coefficient is a numerical value, or letter representing a numerical constant, that multiplies a variable (the operator is omitted).","segments":[{"text":"A coefficient is a numerical value, or letter representing a numerical constant, that multiplies a variable (the operator is omitted)."}]},"unresolved":null},{"absence":null,"basis":"f487d7b9cdcf8ad37d163b737bb090acfe98b91fe43e6b76ddb3b520daf37da6","coverage":null,"id":"enwiki-9710-1380664138::In-text #f109603b","item":"In-text #f109603b","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MvPolynomial.monomial","end_line":92,"library":"mathlib","line":91,"location_key":"f487d7b9cdcf8ad37d163b737bb090acfe98b91fe43e6b76ddb3b520daf37da6","module":"Mathlib.Algebra.MvPolynomial.Basic","note":"The library allows coefficients in any commutative semiring, beyond the numbers the article has in view, and packages the construction as a linear map in the coefficient; its polynomials are sums of such pieces, which is how the article's plus and minus signs separate terms.","pair_key":"edb82a89411a678de26c108b85f7cc8cea709cdbed94aee6bb4c7d2a0dcc7da3","path":"Mathlib/Algebra/MvPolynomial/Basic.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def MvPolynomial.monomial {R : Type u} {σ : Type*} [CommSemiring R] : (σ →₀ ℕ) → R →ₗ[R] MvPolynomial σ R"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polynomial.monomial","end_line":378,"library":"mathlib","line":375,"location_key":"7106ec946120d6c00bfe706acd713870d1075f78e00148c116642135be11e276","module":"Mathlib.Algebra.Polynomial.Basic","note":"It covers only expressions in one indeterminate, where the article's own example carries two letters.","pair_key":"52d80bdc39920b16f3d3456a2dbc243825b6f40024c0d1c67e7e7523ad0e03fd","path":"Mathlib/Algebra/Polynomial/Basic.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Polynomial.monomial {R : Type u} [Semiring R] : ℕ → R →ₗ[R] R[X]"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"5b8c7f3f2c67aac84cc5cb812a2082d83275afda1de41f82bd14fea314d06f8e","prominence":"central","quote":{"exact":"A term is an addend or a summand, a group of coefficients,"},"quote_capped":true,"section":["Algebraic notation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"A term is an addend or a summand, a group of coefficients, variables, constants and exponents that may be separated from the other terms by the plus and minus operators.[9]","segments":[{"text":"A term is an addend or a summand, a group of coefficients, variables, constants and exponents that may be separated from the other terms by the plus and minus operators."},{"ref":"[9]"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":3,"sha256":"da96fc34b1c5d22e68123012c090f526da35ec1ec029bf4a02a05ad72c8636e1"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #70d28581","item":"In-text #70d28581","kind":"notation","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"MvPolynomial.X","end_line":125,"library":"mathlib","line":124,"location_key":"0c1104b2afd341dc88271b3bffa0ffe27c3a11b5760c82c87c8e2e59902ced9b","module":"Mathlib.Algebra.MvPolynomial.Basic","note":"It builds the variable attached to an index and makes no claim that written letters are what stand for variables.","pair_key":"f5f427b2b9076e750bc20a0117f9cd61e84de145b3ffa4dc23e1849e39384ba4","path":"Mathlib/Algebra/MvPolynomial/Basic.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def MvPolynomial.X {R : Type u} {σ : Type*} [CommSemiring R] : σ → MvPolynomial σ R"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"MvPolynomial.C","end_line":104,"library":"mathlib","line":103,"location_key":"7615e40901db8a5e9d68cc637ea6cf6b625aa1c4cb306aa668e16a75784cb5d0","module":"Mathlib.Algebra.MvPolynomial.Basic","note":"It embeds a number as a constant expression and says nothing about letters being used for constants.","pair_key":"335c072c676b294551782e74c96165c055fff4a7e6c6a44bec490d82aaa2bda0","path":"Mathlib/Algebra/MvPolynomial/Basic.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def MvPolynomial.C {R : Type u} {σ : Type*} [CommSemiring R] : R →+* MvPolynomial σ R"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"5dc820cbe1647404983561c0332802a41ecff3758f25ec907188712a0d7a0115","prominence":"supporting","quote":{"exact":"Letters represent variables and constants."},"quote_capped":false,"section":["Algebraic notation"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Letters represent variables and constants.","segments":[{"text":"Letters represent variables and constants."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"91229afc3f07e7fd38c28381dea963d6c3a98058efab0704f4f0fe4a1043d7ee"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #d154158f","item":"In-text #d154158f","kind":"notation","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"c9e4a0822eca9b0accaefd9a76e803ba545350621f1fc96dae22742ed7228d36","prominence":"supporting","quote":{"exact":"By convention, letters at the beginning of the alphabet (e.g. a ,"},"quote_capped":true,"section":["Algebraic notation"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"after":{"layer":", and those toward the end of the alphabet (e.g. x , y {\\displaystyle x,y} and z) are used to represent variables.","segments":[{"text":", and those toward the end of the alphabet (e.g. "},{"tex":"x,y"},{"text":" and z) are used to represent variables."}]},"layer":"By convention, letters at the beginning of the alphabet (e.g. a , b , c {\\displaystyle a,b,c} ) are typically used to represent constants","segments":[{"text":"By convention, letters at the beginning of the alphabet (e.g. "},{"tex":"a,b,c"},{"text":" ) are typically used to represent constants"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"d0f6e9e9f3010ebfc5bccb44501d108d0b00ce5a59be27f54ef98afe49070879"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #28fcd66f","item":"In-text #28fcd66f","kind":"notation","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"436ec986c7e59b242a61d7e8e8085a4474b58ad1e3331eff017ca43657476795","prominence":"supporting","quote":{"exact":"those toward the end of the alphabet (e.g. x , y {\\displaystyle"},"quote_capped":true,"section":["Algebraic notation"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"By convention, letters at the beginning of the alphabet (e.g. a , b , c {\\displaystyle a,b,c} ) are typically used to represent constants, and ","segments":[{"text":"By convention, letters at the beginning of the alphabet (e.g. "},{"tex":"a,b,c"},{"text":" ) are typically used to represent constants, and "}]},"layer":"those toward the end of the alphabet (e.g. x , y {\\displaystyle x,y} and z) are used to represent variables.[10]","segments":[{"text":"those toward the end of the alphabet (e.g. "},{"tex":"x,y"},{"text":" and z) are used to represent variables."},{"ref":"[10]"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"96ad6d68345d45d29da3afdaeb80f3c30a6771a020b5e7c8457357cc72a281fc"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #1b6501ab","item":"In-text #1b6501ab","kind":"notation","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"02b7872d3e9d51aa5a28f47252b257188f6b75f5a7e3c4d7982e8602cac3c3cf","prominence":"supporting","quote":{"exact":"Multiplication symbols are usually omitted, and implied when there is no space"},"quote_capped":true,"section":["Algebraic notation"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Multiplication symbols are usually omitted, and implied when there is no space between two variables or terms, or when a coefficient is used.","segments":[{"text":"Multiplication symbols are usually omitted, and implied when there is no space between two variables or terms, or when a coefficient is used."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"29f645c9f9decf0e0b65321726370c9c00d2820739045e19c2b9be333bd1483a"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #d29187ae","item":"In-text #d29187ae","kind":"notation","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"c89cceeae7d8ec68e14482493fc8a060161e1fd1c2c404964f5f43cfdc6dfdae","prominence":"supporting","quote":{"exact":"For example, 3 × x 2 {\\displaystyle 3\\times x^{2}} is written as"},"quote_capped":true,"section":["Algebraic notation"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"after":{"layer":" , and 2 × x × y {\\displaystyle 2\\times x\\times y} may be written 2 x y {\\displaystyle 2xy} .","segments":[{"text":" , and "},{"tex":"2\\times x\\times y"},{"text":" may be written "},{"tex":"2xy"},{"text":" ."}]},"layer":"For example, 3 × x 2 {\\displaystyle 3\\times x^{2}} is written as 3 x 2 {\\displaystyle 3x^{2}}","segments":[{"text":"For example, "},{"tex":"3\\times x^{2}"},{"text":" is written as "},{"tex":"3x^{2}"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"4198972c81535027d8a6f7dd6e4d31165adc75071729955b2c62fd1dc544cee6"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #bca2882f","item":"In-text #bca2882f","kind":"notation","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"1f03411eb1e0fdaec8696420d0ddf4c666205edb92a38d39a6294dfdd211d6d8","prominence":"supporting","quote":{"exact":"2 × x × y {\\displaystyle 2\\times x\\times y} may be written"},"quote_capped":true,"section":["Algebraic notation"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"For example, 3 × x 2 {\\displaystyle 3\\times x^{2}} is written as 3 x 2 {\\displaystyle 3x^{2}} , and ","segments":[{"text":"For example, "},{"tex":"3\\times x^{2}"},{"text":" is written as "},{"tex":"3x^{2}"},{"text":" , and "}]},"layer":"2 × x × y {\\displaystyle 2\\times x\\times y} may be written 2 x y {\\displaystyle 2xy} .","segments":[{"tex":"2\\times x\\times y"},{"text":" may be written "},{"tex":"2xy"},{"text":" ."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"f70a72db9beea61746dbec7f6890be751a7342c38974b0ae6721db118390bbd3"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #c0a957f8","item":"In-text #c0a957f8","kind":"notation","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"23c3aa4d203b202ad93034f444c25b776d04fba8868212d1c034a48554d10060","prominence":"supporting","quote":{"exact":"Usually terms with the highest power (exponent), are written on the left,"},"quote_capped":true,"section":["Algebraic notation"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Usually terms with the highest power (exponent), are written on the left, for example, x 2 {\\displaystyle x^{2}} is written to the left of x.","segments":[{"text":"Usually terms with the highest power (exponent), are written on the left, for example, "},{"tex":"x^{2}"},{"text":" is written to the left of x."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"605e7d7c0bf9557e4653130a0bb70e175e651bd21f2716ba4fcfd5c890f7c782"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #beafd518","item":"In-text #beafd518","kind":"notation","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"one_mul","end_line":92,"library":"mathlib","line":91,"location_key":"c15ae679d31a3acca7b73c33ff7e1889784f81ba6a718abec54c60eb2b7adcd2","module":"Mathlib.Algebra.Group.Monoid","note":"This is the identity behind the practice, not the practice itself: it says a unit factor changes nothing, while the passage says that factor goes unwritten.","pair_key":"c42b99afd2b2dfb43a6149dd667ee5b61f5150146f3fed9fe4b7deaf6151ea7e","path":"Mathlib/Algebra/Group/Monoid.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem one_mul {M : Type*} [MulOneClass M] (a : M) : 1 * a = a"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"a1e9a3f0463c5fa8e7f646e39d20062635a1979245f16f715383b39d360c8e7a","prominence":"supporting","quote":{"exact":"When a coefficient is one, it is usually omitted (e.g. 1 x"},"quote_capped":true,"section":["Algebraic notation"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"When a coefficient is one, it is usually omitted (e.g. 1 x 2 {\\displaystyle 1x^{2}} is written x 2 {\\displaystyle x^{2}} ).[15]","segments":[{"text":"When a coefficient is one, it is usually omitted (e.g. "},{"tex":"1x^{2}"},{"text":" is written "},{"tex":"x^{2}"},{"text":" )."},{"ref":"[15]"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"d599e9f99c9d6c7e64c202565f0dfa9523b71de30a66459a4c67f2f8e6bbce36"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #6ca0cd38","item":"In-text #6ca0cd38","kind":"notation","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"pow_one","end_line":415,"library":"mathlib","line":415,"location_key":"9cdd5952b5c3b00c92ab93bf5456bc179d3af3ede99fba891f37073da5bc2805","module":"Mathlib.Algebra.Group.Monoid","note":"It gives the value of a first power, which is why the exponent may go unwritten, but the rule of writing is a further convention it does not record.","pair_key":"69c5b7bb190360cc390c961a692ab5c3f4eaa400a9cacf3cf7431ba028a35476","path":"Mathlib/Algebra/Group/Monoid.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem pow_one {M : Type*} [Monoid M] (a : M) : a ^ 1 = a"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"c9a71355f7be75008311a34ad52c8a4dcd8119ef28535607a9a04a4ad616aee0","prominence":"supporting","quote":{"exact":"Likewise when the exponent (power) is one, (e.g. 3 x 1 {\\displaystyle"},"quote_capped":true,"section":["Algebraic notation"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Likewise when the exponent (power) is one, (e.g. 3 x 1 {\\displaystyle 3x^{1}} is written 3 x {\\displaystyle 3x} ).[16]","segments":[{"text":"Likewise when the exponent (power) is one, (e.g. "},{"tex":"3x^{1}"},{"text":" is written "},{"tex":"3x"},{"text":" )."},{"ref":"[16]"}]},"unresolved":null},{"absence":null,"basis":"9fa88d2b4cc51a100997ebeedcec9504f06267ed8508b6b6c691d9bbeef45863","coverage":null,"id":"enwiki-9710-1380664138::In-text #890726ad","item":"In-text #890726ad","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"pow_zero","end_line":408,"library":"mathlib","line":407,"location_key":"9fa88d2b4cc51a100997ebeedcec9504f06267ed8508b6b6c691d9bbeef45863","module":"Mathlib.Algebra.Group.Monoid","note":"Mathlib states the law for any monoid, so it reaches well past the numbers here; it also settles the zero base by a default value, a case the following sentence of the article sets aside and on which nothing in the passage depends.","pair_key":"9e7f91b81966db785fe013470831142842b8b27d19f0cb30e414539ae8b785b8","path":"Mathlib/Algebra/Group/Monoid.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem pow_zero {M : Type*} [Monoid M] (a : M) : a ^ 0 = 1"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.pow_zero","end_line":795,"library":"lean-core","line":795,"location_key":"04fbaa5799c55b5cd8cec1601240ed8c1a9e525e8f8a9ae920545f3c5d14974e","module":"Init.Data.Nat.Basic","note":"Lean core states the law for natural numbers alone, so it covers the whole numbers among the quantities this section allows.","pair_key":"5ab28b8ac8c46de5c5a1880c3fb86de9447313bad3d2c6a9eeaec8990fca34af","path":"src/Init/Data/Nat/Basic.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.pow_zero (n : Nat) : n ^ 0 = 1"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"8ceda450b95eb66e44bf6768413383c31a21e1fb37c6c83f67a289f943b2de1d","prominence":"supporting","quote":{"exact":"When the exponent is zero, the result is always 1 (e.g. x"},"quote_capped":true,"section":["Algebraic notation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"When the exponent is zero, the result is always 1 (e.g. x 0 {\\displaystyle x^{0}} is always rewritten to 1).[17]","segments":[{"text":"When the exponent is zero, the result is always 1 (e.g. "},{"tex":"x^{0}"},{"text":" is always rewritten to 1)."},{"ref":"[17]"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"09e250e21470663f00305b677e4cc1d13de0256c21754248e56cbfb623e9f9bd"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #2822db11","item":"In-text #2822db11","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"b67f8d0286e5a1f5888a7897a5e0596bc9af615d2b00ebadd035fb03ceed9a67","prominence":"supporting","quote":{"exact":"However 0 0 {\\displaystyle 0^{0}} , being undefined, should not appear in"},"quote_capped":true,"section":["Algebraic notation"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"However 0 0 {\\displaystyle 0^{0}} , being undefined, should not appear in an expression, and care should be taken in simplifying expressions in which variables may appear in exponents.","segments":[{"text":"However "},{"tex":"0^{0}"},{"text":" , being undefined, should not appear in an expression, and care should be taken in simplifying expressions in which variables may appear in exponents."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #26677807","item":"In-text #26677807","kind":"notation","locations":[],"outcome":"unresolved","passage_ends_in_suffix":false,"passage_key":"d21a6b719e8fa53c7d3b35d05b41dccbc5d4bd4de70a3459743531af73f89b96","prominence":"supporting","quote":{"exact":"As an illustration of this, while exponents are usually formatted using superscripts,"},"quote_capped":true,"section":["Algebraic notation","Alternative notation"],"status":null,"subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"after":{"layer":" so x 2 {\\displaystyle x^{2}} is written as \"x^2\".","segments":[{"text":" so "},{"tex":"x^{2}"},{"text":" is written as \"x^2\"."}]},"layer":"As an illustration of this, while exponents are usually formatted using superscripts, e.g., x 2 {\\displaystyle x^{2}} , in plain text, and in the TeX mark-up language, the caret symbol ^ represents exponentiation,","segments":[{"text":"As an illustration of this, while exponents are usually formatted using superscripts, e.g., "},{"tex":"x^{2}"},{"text":" , in plain text, and in the TeX mark-up language, the caret symbol ^ represents exponentiation,"}]},"unresolved":{"challenge":"sampled_out"}},{"absence":null,"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #7f480115","item":"In-text #7f480115","kind":"notation","locations":[],"outcome":"unresolved","passage_ends_in_suffix":false,"passage_key":"8e2598bf614ca196259241ae3a22111cade7acd9563d30885fb534dd791f3ba2","prominence":"supporting","quote":{"exact":"x 2 {\\displaystyle x^{2}} is written as \"x^2\".[18][19]"},"quote_capped":false,"section":["Algebraic notation","Alternative notation"],"status":null,"subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"As an illustration of this, while exponents are usually formatted using superscripts, e.g., x 2 {\\displaystyle x^{2}} , in plain text, and in the TeX mark-up language, the caret symbol ^ represents exponentiation, so ","segments":[{"text":"As an illustration of this, while exponents are usually formatted using superscripts, e.g., "},{"tex":"x^{2}"},{"text":" , in plain text, and in the TeX mark-up language, the caret symbol ^ represents exponentiation, so "}]},"layer":"x 2 {\\displaystyle x^{2}} is written as \"x^2\".[18][19]","segments":[{"tex":"x^{2}"},{"text":" is written as \"x^2\"."},{"ref":"[18][19]"}]},"unresolved":{"challenge":"sampled_out"}},{"absence":null,"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #8d37865a","item":"In-text #8d37865a","kind":"definition","locations":[],"outcome":"unresolved","passage_ends_in_suffix":false,"passage_key":"bee95a880e06da6d1fd1f71d9cde3a32301f978b16cbf621012644e80de4d0db","prominence":"central","quote":{"exact":"Elementary algebra builds on and extends arithmetic[26] by introducing letters called variables"},"quote_capped":true,"section":["Concepts","Variables"],"status":null,"subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Elementary algebra builds on and extends arithmetic[26] by introducing letters called variables to represent general (non-specified) numbers. This is useful for several reasons.","segments":[{"text":"Elementary algebra builds on and extends arithmetic"},{"ref":"[26]"},{"text":" by introducing letters called variables to represent general (non-specified) numbers. This is useful for several reasons."}]},"unresolved":{"challenge":"survived"}},{"absence":null,"basis":"79c32af9e7302f7279357a9306a2069a3e3ed1c7eacce095c8138017756729e2","coverage":null,"id":"enwiki-9710-1380664138::In-text #36679c48","item":"In-text #36679c48","kind":"example","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"sub_eq_iff_eq_add'","end_line":952,"library":"mathlib","line":952,"location_key":"79c32af9e7302f7279357a9306a2069a3e3ed1c7eacce095c8138017756729e2","module":"Mathlib.Algebra.Group.Basic","note":"The lemma carries the equation the passage writes down; the surrounding remark that letters may stand for values not yet known is not something it asserts.","pair_key":"7be646bdb58e8b6dfe32b2466c028de19bad8b3cb3870fd7d6bb70df93461838","path":"Mathlib/Algebra/Group/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem sub_eq_iff_eq_add' {G : Type*} [AddCommGroup G] {a b c : G} : a - b = c ↔ a = b + c"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"8d749976856848a1493536155ab45cc9306667c5fed821fc0a73c2ff970e5609","prominence":"supporting","quote":{"exact":"Variables may represent numbers whose values are not yet known. For example,"},"quote_capped":true,"section":["Concepts","Variables"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Variables may represent numbers whose values are not yet known. For example, if the temperature of the current day, C, is 20 degrees higher than the temperature of the previous day, P, then the problem can be described algebraically as C = P + 20 {\\displaystyle C=P+20} .","segments":[{"text":"Variables may represent numbers whose values are not yet known. For example, if the temperature of the current day, C, is 20 degrees higher than the temperature of the previous day, P, then the problem can be described algebraically as "},{"tex":"C=P+20"},{"text":" ."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"d5adebef06f41f0295f1f5d4758fb48cf06a8169e0ce07e13a7d5c71841219c4"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #18667be5","item":"In-text #18667be5","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"cdb0a3fa9060737119218d178ba54de27a314ad9618265105043f40daca40070","prominence":"supporting","quote":{"exact":"Variables allow one to describe general problems,[4] without specifying the values of"},"quote_capped":true,"section":["Concepts","Variables"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Variables allow one to describe general problems,[4] without specifying the values of the quantities that are involved. For example, it can be stated specifically that 5 minutes is equivalent to 60 × 5 = 300 {\\displaystyle 60\\times 5=300} seconds.","segments":[{"text":"Variables allow one to describe general problems,"},{"ref":"[4]"},{"text":" without specifying the values of the quantities that are involved. For example, it can be stated specifically that 5 minutes is equivalent to "},{"tex":"60\\times 5=300"},{"text":" seconds."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"ef4b8bc88f9fa0d0969ae10112ac19288e94fc8b9b8dcccef6df3b0665849a4e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #2459f0a7","item":"In-text #2459f0a7","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"7054d57563eaca1359434ac263feb9e6540e002174c956e2750bb5704b8a63bc","prominence":"supporting","quote":{"exact":"A more general (algebraic) description may state that the number of seconds,"},"quote_capped":true,"section":["Concepts","Variables"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"A more general (algebraic) description may state that the number of seconds, s = 60 × m {\\displaystyle s=60\\times m} , where m is the number of minutes.","segments":[{"text":"A more general (algebraic) description may state that the number of seconds, "},{"tex":"s=60\\times m"},{"text":" , where m is the number of minutes."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"9d26ea2f4430485967947c8bdf5b222e246777de65675bc82e5c04a3252156b3"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #c69c8314","item":"In-text #c69c8314","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"f9aeaed25e2e1c52b311000fa8643f1d4314f5d25c49cc6fb3da34c734917ac6","prominence":"supporting","quote":{"exact":"Variables allow one to describe mathematical relationships between quantities that may vary.[28]"},"quote_capped":true,"section":["Concepts","Variables"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Variables allow one to describe mathematical relationships between quantities that may vary.[28] For example, the relationship between the circumference, c, and diameter, d, of a circle is described by π = c / d {\\displaystyle \\pi =c/d} .","segments":[{"text":"Variables allow one to describe mathematical relationships between quantities that may vary."},{"ref":"[28]"},{"text":" For example, the relationship between the circumference, c, and diameter, d, of a circle is described by "},{"tex":"\\pi =c/d"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"e4d47f1c9c5f38fff651978942a7b4bf542e8ce13f92105ec404ed05b3aef3a9","coverage":null,"id":"enwiki-9710-1380664138::In-text #023ba302","item":"In-text #023ba302","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"add_comm","end_line":257,"library":"mathlib","line":257,"location_key":"e4d47f1c9c5f38fff651978942a7b4bf542e8ce13f92105ec404ed05b3aef3a9","module":"Mathlib.Algebra.Group.Semigroup","note":"Mathlib proves the identity for every type with commutative addition, which is more general than the article's real and complex numbers.","pair_key":"da2ced81268e5191023b0d6d9e041a6ce2f09ef034a751dc4e0493fd15ffc447","path":"Mathlib/Algebra/Group/Semigroup.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem add_comm {G : Type*} [AddCommMagma G] (a b : G) : a + b = b + a"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Nat.add_comm","end_line":159,"library":"lean-core","line":154,"location_key":"906fdd51930ef7c9543201ba97a884f6c91bbf778f15f62c2236e2cf6b761c77","module":"Init.Data.Nat.Basic","note":"The declaration is restricted to ℕ, where the passage speaks of arbitrary numbers.","pair_key":"1a7a998c0eb73abd354dd9bab963ab43611ffdc3707b96205acfdf5fbf776872","path":"src/Init/Data/Nat/Basic.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.add_comm (n m : Nat) : n + m = m + n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"be1cafcc42d7287fa1f03643a4519967e20214efd67a6ed53ca273f452f022bf","prominence":"central","quote":{"exact":"Variables allow one to describe some mathematical properties. For example, a basic"},"quote_capped":true,"section":["Concepts","Variables"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Variables allow one to describe some mathematical properties. For example, a basic property of addition is commutativity which states that the order of numbers being added together does not matter. Commutativity is stated algebraically as ( a + b ) = ( b + a ) {\\displaystyle (a+b)=(b+a)} .","segments":[{"text":"Variables allow one to describe some mathematical properties. For example, a basic property of addition is commutativity which states that the order of numbers being added together does not matter. Commutativity is stated algebraically as "},{"tex":"(a+b)=(b+a)"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"68bb1d2772c1c5e7e52a95b7899b791c520ee30afd4fda637dd9ca781be4fb9f","coverage":null,"id":"enwiki-9710-1380664138::In-text #deee1fbc","item":"In-text #deee1fbc","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"nsmul_eq_mul","end_line":189,"library":"mathlib","line":186,"location_key":"68bb1d2772c1c5e7e52a95b7899b791c520ee30afd4fda637dd9ca781be4fb9f","module":"Mathlib.Algebra.Ring.Defs","note":"Mathlib encodes the repeated sum as the natural-number scalar action and the coefficient as a cast numeral, and states the rule for any non-associative semiring.","pair_key":"379cb7b3ff78c4ad0733a6ed2f3f3a6af562f4391b93039cd005a53daced3bce","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 nsmul_eq_mul {α : Type u} [NonAssocSemiring α] (n : ℕ) (a : α) : n • a = ↑n * a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"two_mul","end_line":181,"library":"mathlib","line":180,"location_key":"af9f0519fe33d820039f6150734603daba0b644d08fdfaa7b7b5e7c12a6c1951","module":"Mathlib.Algebra.Ring.Defs","note":"The declaration collects two repeated summands where the passage's display collects three.","pair_key":"2b3638b922ac2a68f41b197faa798b4e8122fd65382da5b3410aa158a8ec2080","path":"Mathlib/Algebra/Ring/Defs.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem two_mul {α : Type u} [NonAssocSemiring α] (n : α) : 2 * n = n + n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c0c169b519d7d07c21e4ae5324758e9739a5af750d533aea5f03a8ad85bdd191","prominence":"supporting","quote":{"exact":"Added terms are simplified using coefficients. For example, x + x +"},"quote_capped":true,"section":["Concepts","Simplifying expressions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"For example, ","lead_in":true,"segments":[{"text":"For example, "}]},"layer":"Added terms are simplified using coefficients. For example, x + x + x {\\displaystyle x+x+x} can be simplified as 3 x {\\displaystyle 3x} (where 3 is a numerical coefficient).","segments":[{"text":"Added terms are simplified using coefficients. For example, "},{"tex":"x+x+x"},{"text":" can be simplified as "},{"tex":"3x"},{"text":" (where 3 is a numerical coefficient)."}]},"unresolved":null},{"absence":null,"basis":"c60ff8d6dd4210a268e648bdae6b2af5f9bcf2808f6ffd3dbe332779aae27448","coverage":null,"id":"enwiki-9710-1380664138::In-text #7c2fcb06","item":"In-text #7c2fcb06","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"pow_three'","end_line":436,"library":"mathlib","line":436,"location_key":"c60ff8d6dd4210a268e648bdae6b2af5f9bcf2808f6ffd3dbe332779aae27448","module":"Mathlib.Algebra.Group.Monoid","note":"Mathlib states the identity for any monoid, which is more general than the article's numbers.","pair_key":"30651aaa106afff554a819c04097ce77d48b55db9209159e99e29a2d089b1f9c","path":"Mathlib/Algebra/Group/Monoid.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem pow_three' {M : Type*} [Monoid M] (a : M) : a ^ 3 = a * a * a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"pow_three","end_line":439,"library":"mathlib","line":439,"location_key":"894fd7ac17b92434cc5b2129497ab2665e48057239199f0baa185044c8fc42e3","module":"Mathlib.Algebra.Group.Monoid","note":"Same identity with the triple product bracketed to the right, stated for any monoid.","pair_key":"6c239e48af444e1a27f4b2836156cc2fe720c24946f122aafaa0c6627bb1b241","path":"Mathlib/Algebra/Group/Monoid.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem pow_three {M : Type*} [Monoid M] (a : M) : a ^ 3 = a * (a * a)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"bddf1d90ffedd80f52cd6136e291847c0684c6bf0f13b8f430bbaf4f4e862dd9","prominence":"supporting","quote":{"exact":"Multiplied terms are simplified using exponents. For example, x × x ×"},"quote_capped":true,"section":["Concepts","Simplifying expressions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Multiplied terms are simplified using exponents. For example, x × x × x {\\displaystyle x\\times x\\times x} is represented as x 3 {\\displaystyle x^{3}}","segments":[{"text":"Multiplied terms are simplified using exponents. For example, "},{"tex":"x\\times x\\times x"},{"text":" is represented as "},{"tex":"x^{3}"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"5bb825dcae25029dc09db374608eb75d179550d41dd8e4c563aadc905a2363ea"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #05606c7d","item":"In-text #05606c7d","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"b288e13852a53a77c7e20f791c111c50cc31c654d82d6c65d7a85c9e0123b9cb","prominence":"supporting","quote":{"exact":"Like terms are added together,[30] for example, 2 x 2 + 3"},"quote_capped":true,"section":["Concepts","Simplifying expressions"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"For example, x × x × x {\\displaystyle x\\times x\\times x} is represented as x 3 {\\displaystyle x^{3}} ","lead_in":true,"segments":[{"text":"For example, "},{"tex":"x\\times x\\times x"},{"text":" is represented as "},{"tex":"x^{3}"},{"text":" "}]},"layer":"Like terms are added together,[30] for example, 2 x 2 + 3 a b − x 2 + a b {\\displaystyle 2x^{2}+3ab-x^{2}+ab} is written as x 2 + 4 a b {\\displaystyle x^{2}+4ab} , because the terms containing x 2 {\\displaystyle x^{2}} are added together, and the terms containing a b {\\displaystyle ab} are added together.","segments":[{"text":"Like terms are added together,"},{"ref":"[30]"},{"text":" for example, "},{"tex":"2x^{2}+3ab-x^{2}+ab"},{"text":" is written as "},{"tex":"x^{2}+4ab"},{"text":" , because the terms containing "},{"tex":"x^{2}"},{"text":" are added together, and the terms containing "},{"tex":"ab"},{"text":" are added together."}]},"unresolved":null},{"absence":null,"basis":"6315e9156dff4a6194839820f665fd883bd13c18bb114d142f85154d07b5325c","coverage":null,"id":"enwiki-9710-1380664138::In-text #1d5c70a1","item":"In-text #1d5c70a1","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"mul_add","end_line":91,"library":"mathlib","line":91,"location_key":"6315e9156dff4a6194839820f665fd883bd13c18bb114d142f85154d07b5325c","module":"Mathlib.Algebra.Ring.Defs","note":"Mathlib states left distributivity for any multiplication distributing over addition, which is more general than the article's numbers, and the passage's final display writes the same two products in the coefficient-and-exponent notation the article has just introduced.","pair_key":"4db77ef1acc1ea3ca0cbd744cdb594edaaa04275c53528e61499e443b187cb9c","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":"246ea1bb661d71681ccf19078e42e3dacd4dc089a3248616d25ecff5d82de944","prominence":"supporting","quote":{"exact":"Brackets can be \"multiplied out\", using the distributive property. For example, x"},"quote_capped":true,"section":["Concepts","Simplifying expressions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Brackets can be \"multiplied out\", using the distributive property. For example, x ( 2 x + 3 ) {\\displaystyle x(2x+3)} can be written as ( x × 2 x ) + ( x × 3 ) {\\displaystyle (x\\times 2x)+(x\\times 3)} which can be written as 2 x 2 + 3 x {\\displaystyle 2x^{2}+3x}","segments":[{"text":"Brackets can be \"multiplied out\", using the distributive property. For example, "},{"tex":"x(2x+3)"},{"text":" can be written as "},{"tex":"(x\\times 2x)+(x\\times 3)"},{"text":" which can be written as "},{"tex":"2x^{2}+3x"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":3,"sha256":"b3fa10892b287060c30c4d6ebe888808a796bd427a4a384dcfc488d7a86f6095"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #5e613001","item":"In-text #5e613001","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"c226e9fadbaf17473cfb20b387c95fc172466aae75472f6f86b9a53ea875e57a","prominence":"supporting","quote":{"exact":"Expressions can be factored. For example, 6 x 5 + 3 x"},"quote_capped":true,"section":["Concepts","Simplifying expressions"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"For example, x ( 2 x + 3 ) {\\displaystyle x(2x+3)} can be written as ( x × 2 x ) + ( x × 3 ) {\\displaystyle (x\\times 2x)+(x\\times 3)} which can be written as 2 x 2 + 3 x {\\displaystyle 2x^{2}+3x} ","lead_in":true,"segments":[{"text":"For example, "},{"tex":"x(2x+3)"},{"text":" can be written as "},{"tex":"(x\\times 2x)+(x\\times 3)"},{"text":" which can be written as "},{"tex":"2x^{2}+3x"},{"text":" "}]},"layer":"Expressions can be factored. For example, 6 x 5 + 3 x 2 {\\displaystyle 6x^{5}+3x^{2}} , by dividing both terms by the common factor, 3 x 2 {\\displaystyle 3x^{2}} can be written as 3 x 2 ( 2 x 3 + 1 ) {\\displaystyle 3x^{2}(2x^{3}+1)}","segments":[{"text":"Expressions can be factored. For example, "},{"tex":"6x^{5}+3x^{2}"},{"text":" , by dividing both terms by the common factor, "},{"tex":"3x^{2}"},{"text":" can be written as "},{"tex":"3x^{2}(2x^{3}+1)"}]},"unresolved":null},{"absence":null,"basis":"1d0327f08a60c1d1f7f7577c24beb89266e1a01e3e888c5e1134f8b182dcbbe1","coverage":null,"id":"enwiki-9710-1380664138::In-text #02edcab6","item":"In-text #02edcab6","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Eq","end_line":76,"library":"lean-core","line":73,"location_key":"1d0327f08a60c1d1f7f7577c24beb89266e1a01e3e888c5e1134f8b182dcbbe1","module":"Init.Prelude","note":"Lean's equality is defined for any sort, not only for the numerical expressions of the article, and the notation with the equals sign is its own.","pair_key":"cd1710c1abc00fac95e6321121a0511a67800d3aef40aae9e91cb38751272065","path":"src/Init/Prelude.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"inductive Eq {α : Sort u_1} : α → α → Prop"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"77122b869b2bfd165f23206087a90b0fe9a80c7966f3016253ca0b7149332230","prominence":"central","quote":{"exact":"An equation states that two expressions are equal using the symbol for"},"quote_capped":true,"section":["Concepts","Equations"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"An equation states that two expressions are equal using the symbol for equality, = (the equals sign).[31]","segments":[{"text":"An equation states that two expressions are equal using the symbol for equality, = (the equals sign)."},{"ref":"[31]"}]},"unresolved":null},{"absence":null,"basis":"4c535f0286ffd4a7c09f1524225fe03ce6fd794a10b9eda1bc6489317a1c6347","coverage":null,"id":"enwiki-9710-1380664138::In-text #0a2747dd","item":"In-text #0a2747dd","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"EuclideanGeometry.dist_sq_eq_dist_sq_add_dist_sq_iff_angle_eq_pi_div_two","end_line":332,"library":"mathlib","line":327,"location_key":"4c535f0286ffd4a7c09f1524225fe03ce6fd794a10b9eda1bc6489317a1c6347","module":"Mathlib.Geometry.Euclidean.Angle.Unoriented.RightAngle","note":"Mathlib proves an equivalence between the length relation and the right angle, and states it in any real inner product space, both of which reach beyond the passage's plane triangle.","pair_key":"0ce2a0702c89c45f5ad018ac00ec7c085b87001fb1497f073581e085c2ec00a4","path":"Mathlib/Geometry/Euclidean/Angle/Unoriented/RightAngle.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem EuclideanGeometry.dist_sq_eq_dist_sq_add_dist_sq_iff_angle_eq_pi_div_two {V : Type*} {P : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] (p₁ p₂ p₃ : P) : Dist.dist p₁ p₃ * Dist.dist p₁ p₃ = Dist.dist p₁ p₂ * Dist.dist p₁ p₂ + Dist.dist p₃ p₂ * Dist.dist p₃ p₂ ↔ EuclideanGeometry.angle p₁ p₂ p₃ = π / 2"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"InnerProductGeometry.norm_add_sq_eq_norm_sq_add_norm_sq'","end_line":52,"library":"mathlib","line":50,"location_key":"ec204f11219741cfdffe346fa14ca9190d5b78aa734e8a2e05f15e04fb1fe692","module":"Mathlib.Geometry.Euclidean.Angle.Unoriented.RightAngle","note":"Mathlib states the identity for vectors in any real inner product space, which is more general than the passage's plane triangle.","pair_key":"1250a449e40e3482b85311daf4f2e8ea0d1e257071ef8ce2977008cb39e83d28","path":"Mathlib/Geometry/Euclidean/Angle/Unoriented/RightAngle.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem InnerProductGeometry.norm_add_sq_eq_norm_sq_add_norm_sq' {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] (x y : V) : InnerProductGeometry.angle x y = π / 2 → ‖x + y‖ * ‖x + y‖ = ‖x‖ * ‖x‖ + ‖y‖ * ‖y‖"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"818dc45a12be2183a0bf90f66ad27e6c78649305a5084e3f5c92a55adac1dde1","prominence":"central","quote":{"exact":"One of the best-known equations describes Pythagoras' law relating the length of"},"quote_capped":true,"section":["Concepts","Equations"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"One of the best-known equations describes Pythagoras' law relating the length of the sides of a right angle triangle:[32] c 2 = a 2 + b 2 {\\displaystyle c^{2}=a^{2}+b^{2}}","segments":[{"text":"One of the best-known equations describes Pythagoras' law relating the length of the sides of a right angle triangle:"},{"ref":"[32]"},{"text":" "},{"tex":"c^{2}=a^{2}+b^{2}"}]},"unresolved":null},{"absence":null,"basis":"a249a5e6b3d6f045e4fa4074de8a068efd418a9acc8aa1896d1b00cd161bbb8d","coverage":null,"id":"enwiki-9710-1380664138::In-text #bdd7f840","item":"In-text #bdd7f840","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"EuclideanGeometry.dist_sq_eq_dist_sq_add_dist_sq_iff_angle_eq_pi_div_two","end_line":332,"library":"mathlib","line":327,"location_key":"a249a5e6b3d6f045e4fa4074de8a068efd418a9acc8aa1896d1b00cd161bbb8d","module":"Mathlib.Geometry.Euclidean.Angle.Unoriented.RightAngle","note":"Side lengths appear as distances between points written as products d * d, and the declaration also gives the converse direction from the equation back to the right angle.","pair_key":"c9af7c39e3986ebbded0aaeaa70f0c9b859fdee996d3313ad20e951a5363bd9a","path":"Mathlib/Geometry/Euclidean/Angle/Unoriented/RightAngle.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem EuclideanGeometry.dist_sq_eq_dist_sq_add_dist_sq_iff_angle_eq_pi_div_two {V : Type*} {P : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] (p₁ p₂ p₃ : P) : Dist.dist p₁ p₃ * Dist.dist p₁ p₃ = Dist.dist p₁ p₂ * Dist.dist p₁ p₂ + Dist.dist p₃ p₂ * Dist.dist p₃ p₂ ↔ EuclideanGeometry.angle p₁ p₂ p₃ = π / 2"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"InnerProductGeometry.norm_add_sq_eq_norm_sq_add_norm_sq_iff_angle_eq_pi_div_two","end_line":47,"library":"mathlib","line":44,"location_key":"42d7f0a71cc699993dfec9604f0a2da34e59c53fae9b313082f2b684867a234b","module":"Mathlib.Geometry.Euclidean.Angle.Unoriented.RightAngle","note":"The sides enter as vector norms, the hypotenuse being the sum of the two leg vectors rather than a distance between named corners.","pair_key":"6f43fd6070ae60c945f81f02b461dfa7818bffe4ac71270179aa70602a0b74f7","path":"Mathlib/Geometry/Euclidean/Angle/Unoriented/RightAngle.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem InnerProductGeometry.norm_add_sq_eq_norm_sq_add_norm_sq_iff_angle_eq_pi_div_two {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] (x y : V) : ‖x + y‖ * ‖x + y‖ = ‖x‖ * ‖x‖ + ‖y‖ * ‖y‖ ↔ InnerProductGeometry.angle x y = π / 2"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"EuclideanGeometry.law_cos","end_line":250,"library":"mathlib","line":250,"location_key":"e90612345557624f68dc3449e313cad992ddce04714013132ee1499fe890562e","module":"Mathlib.Geometry.Euclidean.Triangle","note":"It relates the three side lengths of any triangle through a cosine term, and getting from it to the article's law needs the value of the cosine at a right angle, a separate named lemma.","pair_key":"7b4ce5cf1d0d85f20a1fdb71c2fb2795c4574737c27a84896c7d1c89bacb0d84","path":"Mathlib/Geometry/Euclidean/Triangle.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem EuclideanGeometry.law_cos {V : Type*} {P : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] (p₁ p₂ p₃ : P) : Dist.dist p₁ p₃ * Dist.dist p₁ p₃ = Dist.dist p₁ p₂ * Dist.dist p₁ p₂ + Dist.dist p₃ p₂ * Dist.dist p₃ p₂ - 2 * Dist.dist p₁ p₂ * Dist.dist p₃ p₂ * Real.cos (EuclideanGeometry.angle p₁ p₂ p₃)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"588f3908244dc0b00d1b6a06f91bd5328c123bd81391a388e3a06cef56cde902","prominence":"central","quote":{"exact":"This equation states that c 2 {\\displaystyle c^{2}} , representing the square"},"quote_capped":true,"section":["Concepts","Equations"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"This equation states that c 2 {\\displaystyle c^{2}} , representing the square of the length of the side that is the hypotenuse, the side opposite the right angle, is equal to the sum (addition) of the squares of the other two sides whose lengths are represented by a and b.","segments":[{"text":"This equation states that "},{"tex":"c^{2}"},{"text":" , representing the square of the length of the side that is the hypotenuse, the side opposite the right angle, is equal to the sum (addition) of the squares of the other two sides whose lengths are represented by a and b."}]},"unresolved":null},{"absence":null,"basis":"5642eea3ac263084ebf9999cbc22441da5575f84234efcc887a1403545aae9d1","coverage":null,"id":"enwiki-9710-1380664138::In-text #c5924a7f","item":"In-text #c5924a7f","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Eq","end_line":76,"library":"lean-core","line":73,"location_key":"5642eea3ac263084ebf9999cbc22441da5575f84234efcc887a1403545aae9d1","module":"Init.Prelude","note":"Lean states the relation for terms of any type, where the article has expressions standing for numbers.","pair_key":"1cb1ffdff5f6281add623ff346fc0b364a6de88a58b488b54659fe67da4ad57a","path":"src/Init/Prelude.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"inductive Eq {α : Sort u_1} : α → α → Prop"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"4ebeffc383e6aaabfa4263b33af4369d9a37753ba26c85e12fdb0ddcf4d10fe9","prominence":"central","quote":{"exact":"An equation is the claim that two expressions have the same value"},"quote_capped":true,"section":["Concepts","Equations"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"An equation is the claim that two expressions have the same value and are equal.","segments":[{"text":"An equation is the claim that two expressions have the same value and are equal."}]},"unresolved":null},{"absence":null,"basis":"ecbce161f466ed66bfc1ef5c461e4f1051edb3244e7ff36f49beba5375407158","coverage":null,"id":"enwiki-9710-1380664138::In-text #677521bb","item":"In-text #677521bb","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"add_comm","end_line":257,"library":"mathlib","line":257,"location_key":"ecbce161f466ed66bfc1ef5c461e4f1051edb3244e7ff36f49beba5375407158","module":"Mathlib.Algebra.Group.Semigroup","note":"Lean states the commutativity law for any type with commutative addition, where the article speaks of numbers.","pair_key":"1b43fc2e9288c9dcd63c93460165275aa1077224391ce66ab5d055499d2f7a04","path":"Mathlib/Algebra/Group/Semigroup.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem add_comm {G : Type*} [AddCommMagma G] (a b : G) : a + b = b + a"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Nat.add_comm","end_line":159,"library":"lean-core","line":154,"location_key":"8be4c4859f858c96516cface2daefa5c00bcf7b56407e236d8003d54d8ffe528","module":"Init.Data.Nat.Basic","note":"It is the same commutativity equation restricted to the natural numbers.","pair_key":"40cf4bdd53c049fbd82638606d3cc3b349cb447964e97a3d936d160220065ea6","path":"src/Init/Data/Nat/Basic.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.add_comm (n m : Nat) : n + m = m + n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b92e95360906b23cc862682f7f9eaf234d029e8fd00eda26a6fcd15ce9f721dd","prominence":"supporting","quote":{"exact":"Some equations are true for all values of the involved variables (such"},"quote_capped":true,"section":["Concepts","Equations"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"after":{"layer":"; such equations are called identities.","segments":[{"text":"; such equations are called identities."}]},"layer":"Some equations are true for all values of the involved variables (such as a + b = b + a {\\displaystyle a+b=b+a} )","segments":[{"text":"Some equations are true for all values of the involved variables (such as "},{"tex":"a+b=b+a"},{"text":" )"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"08d537fc80d59a848fcf640891b000dde53d059d1d9ac0d5b782d1594e33e40f"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #4beaf338","item":"In-text #4beaf338","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"f56239d7abb5167369d9d1f8a13c2b78b0ade36350dacbf1a9b725f9d8b6829b","prominence":"central","quote":{"exact":"such equations are called identities."},"quote_capped":false,"section":["Concepts","Equations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"Some equations are true for all values of the involved variables (such as a + b = b + a {\\displaystyle a+b=b+a} ); ","segments":[{"text":"Some equations are true for all values of the involved variables (such as "},{"tex":"a+b=b+a"},{"text":" ); "}]},"layer":"such equations are called identities.","segments":[{"text":"such equations are called identities."}]},"unresolved":null},{"absence":null,"basis":"fbbd0ed65a9196c750ce8c8d9e788c97bb4fc4df30fca1ffc0537d91ecdddfbf","coverage":null,"id":"enwiki-9710-1380664138::In-text #1f414788","item":"In-text #1f414788","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"sq_eq_sq_iff_eq_or_eq_neg","end_line":217,"library":"mathlib","line":216,"location_key":"fbbd0ed65a9196c750ce8c8d9e788c97bb4fc4df30fca1ffc0537d91ecdddfbf","module":"Mathlib.Algebra.Ring.Commute","note":"It settles the example's solutions only; the article's naming of equations that hold for some values alone is not stated by it.","pair_key":"7e03e82c59752cbf805801c8c36a4be6d5b6c6e475f1524abaef1136df869782","path":"Mathlib/Algebra/Ring/Commute.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem sq_eq_sq_iff_eq_or_eq_neg {R : Type u} [CommRing R] [NoZeroDivisors R] {a b : R} : a ^ 2 = b ^ 2 ↔ a = b ∨ a = -b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"3e3f1b9cc84664d3fbdf6f68480f434efb490eccfbb21a83540ace5b45d2572c","prominence":"central","quote":{"exact":"Conditional equations are true for only some values of the involved variables,"},"quote_capped":true,"section":["Concepts","Equations"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Conditional equations are true for only some values of the involved variables, e.g. x 2 − 1 = 8 {\\displaystyle x^{2}-1=8} is true only for x = 3 {\\displaystyle x=3} and x = − 3 {\\displaystyle x=-3} .","segments":[{"text":"Conditional equations are true for only some values of the involved variables, e.g. "},{"tex":"x^{2}-1=8"},{"text":" is true only for "},{"tex":"x=3"},{"text":" and "},{"tex":"x=-3"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"0b5724f07d22642c797c1a3358ebbd9bffa771feb0b50440ee6faf3cad78e50c","coverage":null,"id":"enwiki-9710-1380664138::In-text #72fe2efc","item":"In-text #72fe2efc","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polynomial.IsRoot","end_line":351,"library":"mathlib","line":350,"location_key":"0b5724f07d22642c797c1a3358ebbd9bffa771feb0b50440ee6faf3cad78e50c","module":"Mathlib.Algebra.Polynomial.Eval.Defs","note":"It covers equations in one unknown written with zero on the other side, where the passage speaks of equations in general.","pair_key":"f06dc5a1ed96fcce7ac0ce1bc46dc3ad0142d7be497c63abbfdb35438777745d","path":"Mathlib/Algebra/Polynomial/Eval/Defs.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Polynomial.IsRoot {R : Type u} [Semiring R] : R[X] → R → Prop"},"statement":true},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polynomial.rootSet","end_line":578,"library":"mathlib","line":576,"location_key":"86504439c63141eaf4fa91b571011b08c583684168244622dc6f0c3de41bd753","module":"Mathlib.Algebra.Polynomial.Roots","note":"It gathers the solutions of a polynomial equation into a set, for equations of that one shape.","pair_key":"c5c6ba5329bfb8a231a308286a8b3f01d5a431783e94fb920a50cd3a341207f1","path":"Mathlib/Algebra/Polynomial/Roots.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Polynomial.rootSet {T : Type w} [CommRing T] : T[X] → (S : Type*) → [CommRing S] → [IsDomain S] → [Algebra T S] → Set S"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"537ec55256fd5eb785d4801d7086b3ee472cf3d6a7bc81d0124dae40290e168f","prominence":"central","quote":{"exact":"The values of the variables which make the equation true are the"},"quote_capped":true,"section":["Concepts","Equations"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"The values of the variables which make the equation true are the solutions of the equation and can be found through equation solving.","segments":[{"text":"The values of the variables which make the equation true are the solutions of the equation and can be found through equation solving."}]},"unresolved":null},{"absence":null,"basis":"7b289fa9cb65e4803d7615f9cbf5b99e7fc327e4a19acfa87fc8b8ccfd273dcb","coverage":null,"id":"enwiki-9710-1380664138::In-text #77698e2c","item":"In-text #77698e2c","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"LT","end_line":1415,"library":"lean-core","line":1413,"location_key":"7b289fa9cb65e4803d7615f9cbf5b99e7fc327e4a19acfa87fc8b8ccfd273dcb","module":"Init.Prelude","note":"Lean keeps the relation as a class over an arbitrary type and derives the greater-than form from it by exchanging the two sides.","pair_key":"3803a7fd2c99675c6cd520fc243df1c1cd989d3801409006f464d99291bca1f9","path":"src/Init/Prelude.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"class LT : Type u → Type u"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"GT.gt","end_line":1420,"library":"lean-core","line":1420,"location_key":"9ba88ec98889dd2a2019e9c0c487d9a0483a14395159bd18dd7bee466bcb7524","module":"Init.Prelude","note":"It records one of the two forms the passage names, the other being its unfolding with the sides exchanged.","pair_key":"17b0b46e3b1d199f00b1a9b6cf3db7a04fb7a9623673db2a8c86d5301658a64c","path":"src/Init/Prelude.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"abbrev GT.gt {α : Type u} [LT α] : α → α → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e6ad2c03fa7d390fa29294a9f1d94f0bb9a3faf0ab31ccd1f81df9a943da66ed","prominence":"central","quote":{"exact":"Another type of equation is inequality. Inequalities are used to show that"},"quote_capped":true,"section":["Concepts","Equations"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Another type of equation is inequality. Inequalities are used to show that one side of the equation is greater, or less, than the other.","segments":[{"text":"Another type of equation is inequality. Inequalities are used to show that one side of the equation is greater, or less, than the other."}]},"unresolved":null},{"absence":null,"basis":"a01208310c6e9427b97f7145a5056afd25b973ccfc9592c8900d4600e34a5895","coverage":null,"id":"enwiki-9710-1380664138::In-text #18d9e557","item":"In-text #18d9e557","kind":"notation","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"GT.gt","end_line":1420,"library":"lean-core","line":1420,"location_key":"a01208310c6e9427b97f7145a5056afd25b973ccfc9592c8900d4600e34a5895","module":"Init.Prelude","note":"Lean fixes the meaning of the symbol for every type carrying a comparison relation, by turning that relation around.","pair_key":"21c895afe5eeb06c973219d89f8b33db1c62990fa371da499fecc30b315548b1","path":"src/Init/Prelude.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"abbrev GT.gt {α : Type u} [LT α] : α → α → Prop"},"statement":true},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"«term_>_»","end_line":378,"library":"lean-core","line":378,"location_key":"fbb130a138fc74df3c98fcd1ced4f45a98c559dc5727fcb48b3eb067eaa18dd7","module":"Init.Notation","note":"It is the syntax declaration introducing the symbol, while what the symbol means is carried by GT.gt.","pair_key":"812b7a90e85540c2232d8bae5d85207597e7f9e281f0a7f4955aa72500042eeb","path":"src/Init/Notation.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def «term_>_» : Lean.TrailingParserDescr"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"10ede5be98a7bedc231d79fe0bb19b3e176c7f863d6c8a1db692b67af2bae217","prominence":"supporting","quote":{"exact":"The symbols used for this are: a > b {\\displaystyle a>b} where"},"quote_capped":true,"section":["Concepts","Equations"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"after":{"layer":", and a < b {\\displaystyle a<b} where < {\\displaystyle <} represents 'less than'.","segments":[{"text":", and "},{"tex":"a<b"},{"text":" where "},{"tex":"<"},{"text":" represents 'less than'."}]},"layer":"The symbols used for this are: a > b {\\displaystyle a>b} where > {\\displaystyle >} represents 'greater than'","segments":[{"text":"The symbols used for this are: "},{"tex":"a>b"},{"text":" where "},{"tex":">"},{"text":" represents 'greater than'"}]},"unresolved":null},{"absence":null,"basis":"52f67b9fb36d8fe7d99887feb6b87e96209a7fee5babd53221e8ee9142df0c55","coverage":null,"id":"enwiki-9710-1380664138::In-text #385eb69f","item":"In-text #385eb69f","kind":"notation","locations":[{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"LT","end_line":1415,"library":"lean-core","line":1413,"location_key":"52f67b9fb36d8fe7d99887feb6b87e96209a7fee5babd53221e8ee9142df0c55","module":"Init.Prelude","note":"Lean's class supplies the a < b notation for any type equipped with such a relation.","pair_key":"4e41c6b897287b14a791dfa459517904abcee30966deeda384278972a71ad65c","path":"src/Init/Prelude.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"class LT : Type u → Type u"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.instLT","end_line":267,"library":"mathlib","line":266,"location_key":"3aa28536a7c871d89f5f19df1ad7e04b82a50c927ef841f118996f3b426b9033","module":"Mathlib.Basic.Real.Basic","note":"The article does not pin its numbers to the reals, so this covers the real case alone.","pair_key":"95e540b4c1ed7ed1c4d51d1d5c837fe40381077adcc8b8fd157a73362829627f","path":"Mathlib/Basic/Real/Basic.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Real.instLT : LT ℝ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c3e9c1e8a8a44acd8c4eca92021e4860cd9520d567d3b7f04cf2394a3accff7b","prominence":"supporting","quote":{"exact":"a < b {\\displaystyle a<b} where < {\\displaystyle <} represents 'less than'."},"quote_capped":false,"section":["Concepts","Equations"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"The symbols used for this are: a > b {\\displaystyle a>b} where > {\\displaystyle >} represents 'greater than', and ","segments":[{"text":"The symbols used for this are: "},{"tex":"a>b"},{"text":" where "},{"tex":">"},{"text":" represents 'greater than', and "}]},"layer":"a < b {\\displaystyle a<b} where < {\\displaystyle <} represents 'less than'.","segments":[{"tex":"a<b"},{"text":" where "},{"tex":"<"},{"text":" represents 'less than'."}]},"unresolved":null},{"absence":null,"basis":"2cdd327511a03dea040992241d17defe2f7527c8953eef3f031067415841c5fb","coverage":null,"id":"enwiki-9710-1380664138::In-text #43c7a81d","item":"In-text #43c7a81d","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"add_lt_add_right","end_line":103,"library":"mathlib","line":103,"location_key":"2cdd327511a03dea040992241d17defe2f7527c8953eef3f031067415841c5fb","module":"Mathlib.Algebra.Order.Monoid.Unbundled.Basic","note":"It carries the addition case of the passage, leaving subtraction, multiplication and division to other declarations.","pair_key":"5458387ba7da54c2ccd3f6e08423bfc420ab09f59ea98bcad53cc5d2e2698981","path":"Mathlib/Algebra/Order/Monoid/Unbundled/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem add_lt_add_right {α : Type*} {b c : α} [Add α] [LT α] [AddLeftStrictMono α] : b < c → ∀ (a : α), a + b < a + c"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"sub_lt_sub_right","end_line":596,"library":"mathlib","line":596,"location_key":"66253f590e4fe62f7e970eaabf4e9a102029d2e9983404033d9aec52eb08abee","module":"Mathlib.Algebra.Order.Group.Unbundled.Basic","note":"It carries the subtraction case of the passage only.","pair_key":"2c2752a76052ecd1fcbb363bc1012cee9739ae8dd5e96a0b991d718b54836d91","path":"Mathlib/Algebra/Order/Group/Unbundled/Basic.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem sub_lt_sub_right {α : Type u} [AddGroup α] [LT α] [AddRightStrictMono α] {a b : α} : a < b → ∀ (c : α), a - c < b - c"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"mul_lt_mul_of_pos_right","end_line":238,"library":"mathlib","line":237,"location_key":"8adc3db48e4224f36009e31afc9672109d02ee93d8a4f45daad85df43c0ec286","module":"Mathlib.Algebra.Order.GroupWithZero.Defs","note":"It carries the multiplication case and asks the multiplier to be positive, which the article's next sentence treats separately.","pair_key":"da1471c9bed4e98fc4eb525d0a274cb87d4909a42e9d4a0f3a8cd3d97c251c44","path":"Mathlib/Algebra/Order/GroupWithZero/Defs.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_lt_mul_of_pos_right {α : Type*} [Mul α] [Zero α] [Preorder α] {a b c : α} [MulPosStrictMono α] : b < c → 0 < a → b * a < c * a"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"div_lt_div_of_pos_right","end_line":1200,"library":"mathlib","line":1198,"location_key":"7132736e1b9e85117510dde4b1b4dbac1e4b9fc7becc08cc038b2c790b576451","module":"Mathlib.Algebra.Order.GroupWithZero.Basic","note":"It carries the division case and asks the divisor to be positive.","pair_key":"fbbbfb7e3255afbf77a384ce938e5e82d2c5d8925f641a5348a65e39568926ca","path":"Mathlib/Algebra/Order/GroupWithZero/Basic.lean","proof_status":"proved","rank":4,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem div_lt_div_of_pos_right {G₀ : Type*} [GroupWithZero G₀] [PartialOrder G₀] [MulPosReflectLT G₀] {a b c : G₀} : a < b → 0 < c → a / c < b / c"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"50f34ebd8dba8aec4497a03ade28c83252938fbc50cc8321558c4b98049ae1c4","prominence":"supporting","quote":{"exact":"Just like standard equality equations, numbers can be added, subtracted, multiplied or"},"quote_capped":true,"section":["Concepts","Equations"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Just like standard equality equations, numbers can be added, subtracted, multiplied or divided.","segments":[{"text":"Just like standard equality equations, numbers can be added, subtracted, multiplied or divided."}]},"unresolved":null},{"absence":null,"basis":"179c2919f60c20142e6b980f6a78a98fe161058837350ca647e12a52cc0c0520","coverage":null,"id":"enwiki-9710-1380664138::In-text #5102805d","item":"In-text #5102805d","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_lt_mul_of_neg_right","end_line":230,"library":"mathlib","line":222,"location_key":"179c2919f60c20142e6b980f6a78a98fe161058837350ca647e12a52cc0c0520","module":"Mathlib.Algebra.Order.Ring.Unbundled.Basic","note":"It carries the multiplication half of the passage, with the multiplier written on the right.","pair_key":"438cfb1740d9e5ddd3c32eb031f0ec67d7d6634f8016629fdd5b079d29d066d9","path":"Mathlib/Algebra/Order/Ring/Unbundled/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_lt_mul_of_neg_right {R : Type u} [Semiring R] [PartialOrder R] {a b c : R} [ExistsAddOfLE R] [MulPosStrictMono R] [AddRightStrictMono R] [AddRightReflectLT R] : b < a → c < 0 → a * c < b * c"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_lt_mul_of_neg_left","end_line":220,"library":"mathlib","line":212,"location_key":"74a3cbe23c5463866eba0633fbb52f397b436419dec76025c85629e76247d2ae","module":"Mathlib.Algebra.Order.Ring.Unbundled.Basic","note":"It carries the multiplication half with the multiplier written on the left.","pair_key":"5af76414f26d28c8737187c6faa06c6be70591826301cc745fe5356ac2253128","path":"Mathlib/Algebra/Order/Ring/Unbundled/Basic.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_lt_mul_of_neg_left {R : Type u} [Semiring R] [PartialOrder R] {a b c : R} [ExistsAddOfLE R] [PosMulStrictMono R] [AddRightStrictMono R] [AddRightReflectLT R] : b < a → c < 0 → c * a < c * b"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"div_lt_div_of_neg_of_lt","end_line":457,"library":"mathlib","line":455,"location_key":"9eab434e4fd5b833f4e3ce7be1cf598a8eb73a2a89fb6f8526a0cbf2b9eae716","module":"Mathlib.Algebra.Order.Field.Basic","note":"It carries the division half of the passage.","pair_key":"7e581abe82fcd799d0440c546d60a253fa5ef06aa6d7f7db551c8b7e546e32a9","path":"Mathlib/Algebra/Order/Field/Basic.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem div_lt_div_of_neg_of_lt {α : Type*} [Field α] [PartialOrder α] [PosMulReflectLT α] [IsStrictOrderedRing α] {a b c : α} : c < 0 → b < a → a / c < b / c"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6a38099a7f5f2d5c49badd719c42097713ee90aafbe1054b0e7fb0fb8dde3998","prominence":"central","quote":{"exact":"The only exception is that when multiplying or dividing by a negative"},"quote_capped":true,"section":["Concepts","Equations"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"The only exception is that when multiplying or dividing by a negative number, the inequality symbol must be flipped.","segments":[{"text":"The only exception is that when multiplying or dividing by a negative number, the inequality symbol must be flipped."}]},"unresolved":null},{"absence":null,"basis":"b33d12016dd3257eb2ad27377977e4b85018a07e4acec432eb91ccfb03ee3e50","coverage":{"basis":false,"bundle_key":"b1d1867e0682e3b9c680f44826ebe5bda1895d667c58ec9cf81c7b933759e51f","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"1850fea2740bbfd61ce9ad3eabc580795bd919488d3a1a6cfc059c663b89cd0d","text":"equality is reflexive: b = b"},{"id":"c2","part":"7d8dd068ca21d7126828e5d7e4cc76310d5607983b34f25167ebc113ac98ec55","text":"equality is symmetric: if a = b then b = a"},{"id":"c3","part":"706ca3de7a9f2d464f8c7688efc5fb034a54cf42fff6264e60858a336c9dfd9d","text":"equality is transitive: if a = b and b = c then a = c"}],"parts":["1850fea2740bbfd61ce9ad3eabc580795bd919488d3a1a6cfc059c663b89cd0d","7d8dd068ca21d7126828e5d7e4cc76310d5607983b34f25167ebc113ac98ec55","706ca3de7a9f2d464f8c7688efc5fb034a54cf42fff6264e60858a336c9dfd9d"],"relation":"exactMatch","status":"formalized"},"id":"enwiki-9710-1380664138::In-text #ecb592fd","item":"In-text #ecb592fd","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"eq_equivalence","end_line":465,"library":"mathlib","line":464,"location_key":"b33d12016dd3257eb2ad27377977e4b85018a07e4acec432eb91ccfb03ee3e50","module":"Mathlib.Basic.Logic.Basic","note":"Lean packages the three properties as the fields of its Equivalence structure for equality.","pair_key":"37a4f2bb675b24e316ca72739d52c3031e2b1381e968527fd4244ec93d7370ec","path":"Mathlib/Basic/Logic/Basic.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem eq_equivalence {α : Sort*} : Equivalence Eq"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"rfl","end_line":343,"library":"lean-core","line":343,"location_key":"1850fea2740bbfd61ce9ad3eabc580795bd919488d3a1a6cfc059c663b89cd0d","module":"Init.Prelude","note":"This is the term that proves reflexivity of equality in Lean.","pair_key":"636b72e5d50a3cc7184ac15397c8d17735c84a9cdbb3e65a43b2273eadadee20","path":"src/Init/Prelude.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def rfl {α : Sort u} {a : α} : a = a"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Eq.symm","end_line":373,"library":"lean-core","line":372,"location_key":"7d8dd068ca21d7126828e5d7e4cc76310d5607983b34f25167ebc113ac98ec55","module":"Init.Prelude","note":"Its docstring states symmetry of equality in the same words as the passage.","pair_key":"0ee9990cd9930b9b797ca1c49c4a42747194f8af3ec4678d4801a8e981ddf689","path":"src/Init/Prelude.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Eq.symm {α : Sort u} {a b : α} : a = b → b = a"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Eq.trans","end_line":389,"library":"lean-core","line":388,"location_key":"706ca3de7a9f2d464f8c7688efc5fb034a54cf42fff6264e60858a336c9dfd9d","module":"Init.Prelude","note":"Its docstring states transitivity of equality in the same words as the passage.","pair_key":"558c737109fbf85379e5e905b3d076a2a3ae3caf50b56a638311d17e65d6e26f","path":"src/Init/Prelude.lean","proof_status":"proved","rank":4,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Eq.trans {α : Sort u} {a b c : α} : a = b → b = c → a = c"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"5226f424d17fc1db134fc753b6d423b323231af1589c043cbc47fef65bac89dc","prominence":"central","quote":{"exact":"By definition, equality is an equivalence relation, meaning it is reflexive (i.e."},"quote_capped":true,"section":["Concepts","Equations","Properties of equality"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"By definition, equality is an equivalence relation, meaning it is reflexive (i.e. b = b {\\displaystyle b=b} ), symmetric (i.e. if a = b {\\displaystyle a=b} then b = a {\\displaystyle b=a} ), and transitive (i.e. if a = b {\\displaystyle a=b} and b = c {\\displaystyle b=c} then a = c {\\displaystyle a=c} ).[33]","segments":[{"text":"By definition, equality is an equivalence relation, meaning it is reflexive (i.e. "},{"tex":"b=b"},{"text":" ), symmetric (i.e. if "},{"tex":"a=b"},{"text":" then "},{"tex":"b=a"},{"text":" ), and transitive (i.e. if "},{"tex":"a=b"},{"text":" and "},{"tex":"b=c"},{"text":" then "},{"tex":"a=c"},{"text":" )."},{"ref":"[33]"}]},"unresolved":null},{"absence":null,"basis":"ad852d12353e5ef051e5f2f3287fb90871dd93739ef5d4cca71301287f77b9ac","coverage":null,"id":"enwiki-9710-1380664138::In-text #e5443957","item":"In-text #e5443957","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Eq.subst","end_line":362,"library":"lean-core","line":361,"location_key":"ad852d12353e5ef051e5f2f3287fb90871dd93739ef5d4cca71301287f77b9ac","module":"Init.Prelude","note":"Lean's predicate argument is the arbitrary statement about the first symbol that the passage speaks of.","pair_key":"9d757e1e80f7d36c56ff6bd37e14cc7a9550b1a86e4065a07ef755bbd05426ac","path":"src/Init/Prelude.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Eq.subst {α : Sort u} {motive : α → Prop} {a b : α} : a = b → motive a → motive b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c2100aa27f6479ee4490985c1ff32e904ed6991e56741eaf6540dcdd19a4327e","prominence":"central","quote":{"exact":"It also satisfies the important property that if two symbols are used"},"quote_capped":true,"section":["Concepts","Equations","Properties of equality"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"It also satisfies the important property that if two symbols are used for equal things, then one symbol can be substituted for the other in any true statement about the first and the statement will remain true. This implies the following properties:","segments":[{"text":"It also satisfies the important property that if two symbols are used for equal things, then one symbol can be substituted for the other in any true statement about the first and the statement will remain true. This implies the following properties:"}]},"unresolved":null},{"absence":null,"basis":"e7fab89e9034c758fd05f02de69cce932f4e7b756c1b125edbf43a59a9c48292","coverage":null,"id":"enwiki-9710-1380664138::In-text #d37cf4cf","item":"In-text #d37cf4cf","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Lean.Omega.Int.add_congr","end_line":78,"library":"lean-core","line":77,"location_key":"e7fab89e9034c758fd05f02de69cce932f4e7b756c1b125edbf43a59a9c48292","module":"Init.Omega.Int","note":"It states the first conjunct for integer quantities, where the article leaves its numbers unrestricted.","pair_key":"7ce652c1df44d0ee3cb0715f1a77d634fc51b69ef8b4156ec71b9fa0238649e4","path":"src/Init/Omega/Int.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Lean.Omega.Int.add_congr {a b c d : Int} : a = b → c = d → a + c = b + d"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Lean.Omega.Int.mul_congr","end_line":81,"library":"lean-core","line":80,"location_key":"818eaaf02bf5565504e4d9baaf99c174b0c8e07ba5207cc5a886fd725eaea7c2","module":"Init.Omega.Int","note":"It states the second conjunct for integer quantities only.","pair_key":"564894f8fd9f7b66a65310952d3a5a4a650158b8e02c6d2595350d1f76e7b133","path":"src/Init/Omega/Int.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Lean.Omega.Int.mul_congr {a b c d : Int} : a = b → c = d → a * c = b * d"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"congr","end_line":426,"library":"lean-core","line":425,"location_key":"efb3a5d5746f1ad0380ae2d6bade243fe99f040aa1ee38163a33f0da718ef40b","module":"Init.Prelude","note":"Reaching the passage from it also needs a congruence step turning a = b into an equality of the two partial sums.","pair_key":"5999973fb79410d12a88711f9160e9dfd5d3adf0a4e065132680aaa5a7813a24","path":"src/Init/Prelude.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem congr {α : Sort u} {β : Sort v} {f₁ f₂ : α → β} {a₁ a₂ : α} : f₁ = f₂ → a₁ = a₂ → f₁ a₁ = f₂ a₂"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"192a52c867f1e5ddedefebc8ace7d30569c7b6eb13e1088a765732f5c1798897","prominence":"supporting","quote":{"exact":"if a = b {\\displaystyle a=b} and c = d {\\displaystyle c=d}"},"quote_capped":true,"section":["Concepts","Equations","Properties of equality"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"This implies the following properties: ","lead_in":true,"segments":[{"text":"This implies the following properties: "}]},"layer":"if a = b {\\displaystyle a=b} and c = d {\\displaystyle c=d} then a + c = b + d {\\displaystyle a+c=b+d} and a c = b d {\\displaystyle ac=bd} ;","segments":[{"text":"if "},{"tex":"a=b"},{"text":" and "},{"tex":"c=d"},{"text":" then "},{"tex":"a+c=b+d"},{"text":" and "},{"tex":"ac=bd"},{"text":" ;"}]},"unresolved":null},{"absence":null,"basis":"15ea2fba44bc559938bde6e47081bf469174d5d42a59902aeb1290762a7ec2bb","coverage":null,"id":"enwiki-9710-1380664138::In-text #67ae2698","item":"In-text #67ae2698","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"congrArg","end_line":416,"library":"lean-core","line":415,"location_key":"15ea2fba44bc559938bde6e47081bf469174d5d42a59902aeb1290762a7ec2bb","module":"Init.Prelude","note":"Lean's function argument is filled in twice here, once by adding c and once by multiplying by c.","pair_key":"8b96ae11752cd12530d49b96343d62cad995b6ca6218830367bd84d9f01540f1","path":"src/Init/Prelude.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem congrArg {α : Sort u} {β : Sort v} {a₁ a₂ : α} (f : α → β) : a₁ = a₂ → f a₁ = f a₂"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Lean.Omega.Int.mul_congr_left","end_line":84,"library":"lean-core","line":83,"location_key":"4d0bd8bb41a785b48ee30e74b9107e0d4005f9199b09f4f656382288bcb1a2a1","module":"Init.Omega.Int","note":"It states the second conjunct for integer quantities only.","pair_key":"7abcb1b038926960349ccf2237fdd8f2a4a1dd84659abf6fc3af4f59e5266119","path":"src/Init/Omega/Int.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Lean.Omega.Int.mul_congr_left {a b : Int} : a = b → ∀ (c : Int), a * c = b * c"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"63c42c8b70a95d17d64cbc672706211447e2d390dce35b83050285ced1833a19","prominence":"supporting","quote":{"exact":"if a = b {\\displaystyle a=b} then a + c = b"},"quote_capped":true,"section":["Concepts","Equations","Properties of equality"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"if a = b {\\displaystyle a=b} and c = d {\\displaystyle c=d} then a + c = b + d {\\displaystyle a+c=b+d} and a c = b d {\\displaystyle ac=bd} ; ","lead_in":true,"segments":[{"text":"if "},{"tex":"a=b"},{"text":" and "},{"tex":"c=d"},{"text":" then "},{"tex":"a+c=b+d"},{"text":" and "},{"tex":"ac=bd"},{"text":" ; "}]},"layer":"if a = b {\\displaystyle a=b} then a + c = b + c {\\displaystyle a+c=b+c} and a c = b c {\\displaystyle ac=bc} ;","segments":[{"text":"if "},{"tex":"a=b"},{"text":" then "},{"tex":"a+c=b+c"},{"text":" and "},{"tex":"ac=bc"},{"text":" ;"}]},"unresolved":null},{"absence":null,"basis":"92a35182c6b19f0a7705f43a0986d2e8c9a3e98a268dc98f4fb648df94027a86","coverage":null,"id":"enwiki-9710-1380664138::In-text #e7000242","item":"In-text #e7000242","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"congrArg","end_line":416,"library":"lean-core","line":415,"location_key":"92a35182c6b19f0a7705f43a0986d2e8c9a3e98a268dc98f4fb648df94027a86","module":"Init.Prelude","note":"The declaration's function argument is the article's arbitrary f, applied to its two equal quantities.","pair_key":"967434ae0e6aac088effa2bf7997a64ed514b58fd7971e9985470f4d266ccc81","path":"src/Init/Prelude.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem congrArg {α : Sort u} {β : Sort v} {a₁ a₂ : α} (f : α → β) : a₁ = a₂ → f a₁ = f a₂"},"statement":false},{"challenge":"survived","commit":"4453b52d2468f4c346a8711d728c0742e7483c9b","confidence":"high","declaration":"congr_arg","end_line":66,"library":"batteries","line":66,"location_key":"52dbae1539d885975fb05294516f167cc4056b24a43a3ba6d2f61ed023472e1a","module":"Batteries.Logic","note":"This library restates the same fact under its own name.","pair_key":"3d06be2c109f97dd36ea663d86dbd09677d8373829b488764a42e862eb685de4","path":"Batteries/Logic.lean","proof_status":"proved","rank":2,"relation":"exactMatch","repo":"https://github.com/leanprover-community/batteries","signature":{"elided":false,"text":"theorem congr_arg {α : Sort u} {β : Sort v} {a₁ a₂ : α} (f : α → β) : a₁ = a₂ → f a₁ = f a₂"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"da072fd5ac8a5cc605e63c1456fddd7a884bb3e513b4acbc7d901c586d9e2f48","prominence":"central","quote":{"exact":"more generally, for any function f, if a = b {\\displaystyle a=b}"},"quote_capped":true,"section":["Concepts","Equations","Properties of equality"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"if a = b {\\displaystyle a=b} then a + c = b + c {\\displaystyle a+c=b+c} and a c = b c {\\displaystyle ac=bc} ; ","lead_in":true,"segments":[{"text":"if "},{"tex":"a=b"},{"text":" then "},{"tex":"a+c=b+c"},{"text":" and "},{"tex":"ac=bc"},{"text":" ; "}]},"layer":"more generally, for any function f, if a = b {\\displaystyle a=b} then f ( a ) = f ( b ) {\\displaystyle f(a)=f(b)} .","segments":[{"text":"more generally, for any function f, if "},{"tex":"a=b"},{"text":" then "},{"tex":"f(a)=f(b)"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"c92fa9ba9fc6ef5dfc2fd5f5c5aef82b198c6385ace1eacf1c7c9a19661f7329","coverage":null,"id":"enwiki-9710-1380664138::In-text #9e2729c9","item":"In-text #9e2729c9","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"lt_trans","end_line":97,"library":"mathlib","line":97,"location_key":"c92fa9ba9fc6ef5dfc2fd5f5c5aef82b198c6385ace1eacf1c7c9a19661f7329","module":"Mathlib.Order.Defs.PartialOrder","note":"The declaration asserts the same implication about the strict order, with no further hypothesis.","pair_key":"51be8306952a27ec86a7ae8d4d5a9599cf56cd361351d02451a4215f6ae8b085","path":"Mathlib/Order/Defs/PartialOrder.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem lt_trans {α : Type*} [Preorder α] {a b c : α} : a < b → b < c → a < c"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.lt_trans","end_line":2082,"library":"lean-core","line":2081,"location_key":"faf4706b273315193c1a072a08cdf12f58336bca9f5003e374264cf8d7057ac0","module":"Init.Prelude","note":"The statement is the passage restricted to the counting numbers of Lean's core library.","pair_key":"ffb6a87cb13930da92005529e24e4a8ea0f58d184e6806967324f44c4641982e","path":"src/Init/Prelude.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.lt_trans {n m k : Nat} : n < m → m < k → n < k"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7e7aa58a9f325180b0f1826c6015afc6e4fc5f7528fbe77c8e81b5165c84e857","prominence":"central","quote":{"exact":"If a < b {\\displaystyle a<b} and b < c {\\displaystyle b<c}"},"quote_capped":true,"section":["Concepts","Equations","Properties of inequality"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"The relations less than < {\\displaystyle <} and greater than > {\\displaystyle >} have the property of transitivity:[34] ","lead_in":true,"segments":[{"text":"The relations less than "},{"tex":"<"},{"text":" and greater than "},{"tex":">"},{"text":" have the property of transitivity:"},{"ref":"[34]"},{"text":" "}]},"layer":"If a < b {\\displaystyle a<b} and b < c {\\displaystyle b<c} then a < c {\\displaystyle a<c} ;","segments":[{"text":"If "},{"tex":"a<b"},{"text":" and "},{"tex":"b<c"},{"text":" then "},{"tex":"a<c"},{"text":" ;"}]},"unresolved":null},{"absence":null,"basis":"d80ade57c37653959e59665a6afb544299c836b34614f55b178e041a227a3d86","coverage":null,"id":"enwiki-9710-1380664138::In-text #514424bb","item":"In-text #514424bb","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"add_lt_add","end_line":150,"library":"mathlib","line":150,"location_key":"d80ade57c37653959e59665a6afb544299c836b34614f55b178e041a227a3d86","module":"Mathlib.Algebra.Order.Monoid.Unbundled.Basic","note":"Lean states the same implication for an addition that is strictly monotone on the left and on the right.","pair_key":"97b6e9bdc32e73bea1a671a4b6beea1c3336add4ec5cbe0d26e8438d0582ccfe","path":"Mathlib/Algebra/Order/Monoid/Unbundled/Basic.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem add_lt_add {α : Type*} {a b c d : α} [Add α] [Preorder α] [AddLeftStrictMono α] [AddRightStrictMono α] : a < b → c < d → a + c < b + d"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.add_lt_add","end_line":778,"library":"lean-core","line":777,"location_key":"09902802fac2e329f2a25072570b237fc42b64ced748301c34a263129032d72a","module":"Init.Data.Int.Order","note":"The same implication, stated only for the integers of Lean's core library.","pair_key":"58313c4641154c54bb740cdf0b1abbb0a56eb2f3e280613a754b41899b9c91aa","path":"src/Init/Data/Int/Order.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.add_lt_add {a b c d : Int} : a < b → c < d → a + c < b + d"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"504d0074917f36d67286ce54fbd21915029ac54f8ad027fb8b01b5c088388f86","prominence":"supporting","quote":{"exact":"If a < b {\\displaystyle a<b} and c < d {\\displaystyle c<d}"},"quote_capped":true,"section":["Concepts","Equations","Properties of inequality"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"If a < b {\\displaystyle a<b} and b < c {\\displaystyle b<c} then a < c {\\displaystyle a<c} ; ","lead_in":true,"segments":[{"text":"If "},{"tex":"a<b"},{"text":" and "},{"tex":"b<c"},{"text":" then "},{"tex":"a<c"},{"text":" ; "}]},"layer":"If a < b {\\displaystyle a<b} and c < d {\\displaystyle c<d} then a + c < b + d {\\displaystyle a+c<b+d} ;","segments":[{"text":"If "},{"tex":"a<b"},{"text":" and "},{"tex":"c<d"},{"text":" then "},{"tex":"a+c<b+d"},{"text":" ;"}]},"unresolved":null},{"absence":null,"basis":"123862156812ce1386d765d77884fba1f1b80f9e2f4003f110179e019706e897","coverage":null,"id":"enwiki-9710-1380664138::In-text #f8553c74","item":"In-text #f8553c74","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_lt_mul_of_pos_right","end_line":238,"library":"mathlib","line":237,"location_key":"123862156812ce1386d765d77884fba1f1b80f9e2f4003f110179e019706e897","module":"Mathlib.Algebra.Order.GroupWithZero.Defs","note":"Lean writes the positivity hypothesis as 0 < c, which is what c > 0 abbreviates, and puts the factor on the right as the passage does.","pair_key":"5190938614193b2813f0c4a27e90ea630e1eea89feb9aaee4687e9a763999ac5","path":"Mathlib/Algebra/Order/GroupWithZero/Defs.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_lt_mul_of_pos_right {α : Type*} [Mul α] [Zero α] [Preorder α] {a b c : α} [MulPosStrictMono α] : b < c → 0 < a → b * a < c * a"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.mul_lt_mul_of_pos_right","end_line":550,"library":"lean-core","line":545,"location_key":"745b594e67e6f44c49f009669ae21d36c4a0553796d12ae84f810ddfc93c8a6e","module":"Init.Data.Int.Order","note":"The same implication, stated only for the integers of Lean's core library.","pair_key":"1182de9b7311dd6cc8549f19630bff22d00ff952d7d0aa7adeed09af9c7e4729","path":"src/Init/Data/Int/Order.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.mul_lt_mul_of_pos_right {a b c : Int} : a < b → 0 < c → a * c < b * c"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b1626281132a523dec10f8473d89890d58d32e291d1f363ee6d499744a45d017","prominence":"supporting","quote":{"exact":"If a < b {\\displaystyle a<b} and c > 0 {\\displaystyle c>0}"},"quote_capped":true,"section":["Concepts","Equations","Properties of inequality"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"If a < b {\\displaystyle a<b} and c < d {\\displaystyle c<d} then a + c < b + d {\\displaystyle a+c<b+d} ;[35] ","lead_in":true,"segments":[{"text":"If "},{"tex":"a<b"},{"text":" and "},{"tex":"c<d"},{"text":" then "},{"tex":"a+c<b+d"},{"text":" ;"},{"ref":"[35]"},{"text":" "}]},"layer":"If a < b {\\displaystyle a<b} and c > 0 {\\displaystyle c>0} then a c < b c {\\displaystyle ac<bc} ;","segments":[{"text":"If "},{"tex":"a<b"},{"text":" and "},{"tex":"c>0"},{"text":" then "},{"tex":"ac<bc"},{"text":" ;"}]},"unresolved":null},{"absence":null,"basis":"f95561878c46f38cab658bc46a72696e8fda5a0dfe674b7350140262e803ca88","coverage":null,"id":"enwiki-9710-1380664138::In-text #63283166","item":"In-text #63283166","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_lt_mul_of_neg_right","end_line":230,"library":"mathlib","line":222,"location_key":"f95561878c46f38cab658bc46a72696e8fda5a0dfe674b7350140262e803ca88","module":"Mathlib.Algebra.Order.Ring.Unbundled.Basic","note":"Lean multiplies on the right by the negative factor and concludes with the two products swapped, as the passage writes them.","pair_key":"9d8077a4891a98467fbc45668bbe0b67c0bca31d7b6990d91caf1ba6c0754df3","path":"Mathlib/Algebra/Order/Ring/Unbundled/Basic.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_lt_mul_of_neg_right {R : Type u} [Semiring R] [PartialOrder R] {a b c : R} [ExistsAddOfLE R] [MulPosStrictMono R] [AddRightStrictMono R] [AddRightReflectLT R] : b < a → c < 0 → a * c < b * c"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.mul_lt_mul_of_neg_right","end_line":1214,"library":"lean-core","line":1209,"location_key":"1e26749303b0f2df4b27e37abc0f4874a5d86ea58ad42996b99ce96046207988","module":"Init.Data.Int.Order","note":"The same implication, stated only for the integers of Lean's core library.","pair_key":"24e22a29eb2071dc554e575f56f1a8e673656f6e03b9c15e4273666f93c083b6","path":"src/Init/Data/Int/Order.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.mul_lt_mul_of_neg_right {a b c : Int} : b < a → c < 0 → a * c < b * c"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"68f49ad17b115fad5f55840dac0d77509faedb6d71e812ff26a27539395074b1","prominence":"supporting","quote":{"exact":"If a < b {\\displaystyle a<b} and c < 0 {\\displaystyle c<0}"},"quote_capped":true,"section":["Concepts","Equations","Properties of inequality"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"If a < b {\\displaystyle a<b} and c > 0 {\\displaystyle c>0} then a c < b c {\\displaystyle ac<bc} ; ","lead_in":true,"segments":[{"text":"If "},{"tex":"a<b"},{"text":" and "},{"tex":"c>0"},{"text":" then "},{"tex":"ac<bc"},{"text":" ; "}]},"layer":"If a < b {\\displaystyle a<b} and c < 0 {\\displaystyle c<0} then b c < a c {\\displaystyle bc<ac} .","segments":[{"text":"If "},{"tex":"a<b"},{"text":" and "},{"tex":"c<0"},{"text":" then "},{"tex":"bc<ac"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"f65bfc84c3ff8037f881447827a16efb03a3ae99f830804fc5bbb86f45317b74","coverage":null,"id":"enwiki-9710-1380664138::In-text #d9e6cc74","item":"In-text #d9e6cc74","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"gt_iff_lt","end_line":2338,"library":"lean-core","line":2338,"location_key":"f65bfc84c3ff8037f881447827a16efb03a3ae99f830804fc5bbb86f45317b74","module":"Init.Core","note":"Lean states the equivalence with the greater-than side written first; the equivalence itself is symmetric.","pair_key":"3f2253e19cf035cf9c8e0d12497a70304a907c6ec0266e9ad7939a3a2d26f26e","path":"src/Init/Core.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem gt_iff_lt {α : Type u_1} [LT α] {x y : α} : x > y ↔ y < x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"af77a28c6fbd6b816fa2054330e8ef0e7ad2d3e340cf954c405efc85fcfbe0ad","prominence":"central","quote":{"exact":"a < b {\\displaystyle a<b} is equivalent to b > a {\\displaystyle"},"quote_capped":true,"section":["Concepts","Equations","Properties of inequality"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"By reversing the inequation, < {\\displaystyle <} and > {\\displaystyle >} can be swapped,[36] for example: ","lead_in":true,"segments":[{"text":"By reversing the inequation, "},{"tex":"<"},{"text":" and "},{"tex":">"},{"text":" can be swapped,"},{"ref":"[36]"},{"text":" for example: "}]},"layer":"a < b {\\displaystyle a<b} is equivalent to b > a {\\displaystyle b>a}","segments":[{"tex":"a<b"},{"text":" is equivalent to "},{"tex":"b>a"}]},"unresolved":null},{"absence":null,"basis":"386f118ac1aede6f95fd733288c45ab944e6956aeee1698a6397386a1ba55c6c","coverage":null,"id":"enwiki-9710-1380664138::In-text #9993e347","item":"In-text #9993e347","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MvPolynomial.bind₁","end_line":68,"library":"mathlib","line":67,"location_key":"386f118ac1aede6f95fd733288c45ab944e6956aeee1698a6397386a1ba55c6c","module":"Mathlib.Algebra.MvPolynomial.Monad","note":"The library carries out the passage's operation for polynomial expressions only, not for written expressions of any shape.","pair_key":"007af77fc255e95f8c2938a23800f08a21a3737fb6c63b3b17f444b761f31700","path":"Mathlib/Algebra/MvPolynomial/Monad.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def MvPolynomial.bind₁ {σ : Type*} {τ : Type*} {R : Type*} [CommSemiring R] : (σ → MvPolynomial τ R) → MvPolynomial σ R →ₐ[R] MvPolynomial τ R"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7ee6d71cc83f10b03b7a8cb8d4f06abdd461f0e511b1e50a32deb30be03139c5","prominence":"central","quote":{"exact":"Substitution is replacing the terms in an expression to create a new"},"quote_capped":true,"section":["Concepts","Substitution"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Substitution is replacing the terms in an expression to create a new expression.","segments":[{"text":"Substitution is replacing the terms in an expression to create a new expression."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"6197ad673844b9bc260d706fc1beb4d97e4caf59e77694e091f9e7a73ea45d77"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #15644f8d","item":"In-text #15644f8d","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"9eb44082f2a3d62ca07bb47bfa028ad539ce78053df1ed2ef757f4b1f857e6da","prominence":"supporting","quote":{"exact":"Substituting 3 for a in the expression a*5 makes a new expression"},"quote_capped":true,"section":["Concepts","Substitution"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Substituting 3 for a in the expression a*5 makes a new expression 3*5 with meaning 15.","segments":[{"text":"Substituting 3 for a in the expression a*5 makes a new expression 3*5 with meaning 15."}]},"unresolved":null},{"absence":null,"basis":"67696519d4285669a43b006121eec39d64547daccd514901b109f2bc14a288e5","coverage":null,"id":"enwiki-9710-1380664138::In-text #7a5c43b6","item":"In-text #7a5c43b6","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"Arxiv.«1308.0994».Formula.subst","end_line":100,"library":"formal-conjectures","line":96,"location_key":"67696519d4285669a43b006121eec39d64547daccd514901b109f2bc14a288e5","module":"FormalConjectures.Arxiv.«1308.0994».BoxdotConjecture","note":"The library carries the passage out for the formulas of one formalized paper rather than for statements written in any language.","pair_key":"79414ca6b89037d7e0ba936fb50ea6d4b41c8071944fef3d5f5a97ffdfd4e574","path":"FormalConjectures/Arxiv/1308.0994/BoxdotConjecture.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def Arxiv.«1308.0994».Formula.subst : (ℕ → Arxiv.«1308.0994».Formula) → Arxiv.«1308.0994».Formula → Arxiv.«1308.0994».Formula"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"5f2bcd95423a18088742af6fd3567937d2bad5f91289cd7692b64e4058f66b52","prominence":"supporting","quote":{"exact":"Substituting the terms of a statement makes a new statement."},"quote_capped":false,"section":["Concepts","Substitution"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Substituting the terms of a statement makes a new statement.","segments":[{"text":"Substituting the terms of a statement makes a new statement."}]},"unresolved":null},{"absence":null,"basis":"f9d172013e0db1cba560cb8cb2858252140ef9fd75c38442499c6c713990d143","coverage":null,"id":"enwiki-9710-1380664138::In-text #10d39f75","item":"In-text #10d39f75","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"FirstOrder.Language.BoundedFormula.realize_subst","end_line":438,"library":"mathlib","line":429,"location_key":"f9d172013e0db1cba560cb8cb2858252140ef9fd75c38442499c6c713990d143","module":"Mathlib.ModelTheory.Semantics","note":"Lean records the semantics of substitution as an equivalence between truth of the substituted formula and truth of the original at the composed assignment.","pair_key":"dceecba1ce19457e3bd41710cc2fd751a9e9b63252d5efcb83536090c5fa58d1","path":"Mathlib/ModelTheory/Semantics.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem FirstOrder.Language.BoundedFormula.realize_subst {L : FirstOrder.Language} {M : Type w} [L.Structure M] {α : Type u'} {β : Type v'} {n : ℕ} {φ : L.BoundedFormula α n} {tf : α → L.Term β} {v : β → M} {xs : Fin n → M} : (φ.subst tf).Realize v xs ↔ φ.Realize (fun a ↦ FirstOrder.Language.Term.realize v (tf a)) xs"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"FirstOrder.Language.Term.realize_subst","end_line":126,"library":"mathlib","line":122,"location_key":"f7de3bee5a9c9000ecd524c1eac26e5655782fcaba485b0ad4c964984b334507","module":"Mathlib.ModelTheory.Semantics","note":"This computes the value of a substituted term and says nothing about the truth of a statement, so it does not carry the passage's conclusion.","pair_key":"ca93037fa94eca274a8aaa2b2f46636624c6f978fa1d7b8f0ba9549dde775028","path":"Mathlib/ModelTheory/Semantics.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem FirstOrder.Language.Term.realize_subst {L : FirstOrder.Language} {M : Type w} [L.Structure M] {α : Type u'} {β : Type v'} {t : L.Term α} {tf : α → L.Term β} {v : β → M} : FirstOrder.Language.Term.realize v (t.subst tf) = FirstOrder.Language.Term.realize (fun a ↦ FirstOrder.Language.Term.realize v (tf a)) t"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"540458349ffc68ebf4e8e0386a2d09d6158749a8ce5a831e9f63a4872b4b3b17","prominence":"central","quote":{"exact":"When the original statement is true independently of the values of the"},"quote_capped":true,"section":["Concepts","Substitution"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"When the original statement is true independently of the values of the terms, the statement created by substitutions is also true.","segments":[{"text":"When the original statement is true independently of the values of the terms, the statement created by substitutions is also true."}]},"unresolved":null},{"absence":null,"basis":"f61f78662f6183d8b883bd88b1be30f6a4c65cf1c286705f94b903d574c53caa","coverage":null,"id":"enwiki-9710-1380664138::In-text #e7a000c7","item":"In-text #e7a000c7","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"pow_two","end_line":431,"library":"mathlib","line":431,"location_key":"f61f78662f6183d8b883bd88b1be30f6a4c65cf1c286705f94b903d574c53caa","module":"Mathlib.Algebra.Group.Monoid","note":"Lean writes the square as a power with exponent two rather than as a separately introduced abbreviation, and the equation it proves is the one the passage uses as the definition.","pair_key":"3d10ec969212029e1426fae8e9a095d921061a5a2d8222c7fefccda7bc434917","path":"Mathlib/Algebra/Group/Monoid.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem pow_two {M : Type*} [Monoid M] (a : M) : a ^ 2 = a * a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"sq","end_line":433,"library":"mathlib","line":433,"location_key":"319fd0f6d5d8d19e46a62e72f1b347b03462966c81a7bfffe36b41191cbfe143","module":"Mathlib.Algebra.Group.Monoid","note":"This is the name Mathlib usually quotes for the same equation, recorded alongside the other spelling.","pair_key":"81ba31a66f64760e67200281323f0370d200f824ef32e03a8ea6a7dfa9f2127a","path":"Mathlib/Algebra/Group/Monoid.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem sq {M : Type*} [Monoid M] (a : M) : a ^ 2 = a * a"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"0f404747206584cab22cd5c0f00887708bb65d8aa9ddfd4853401fb0684da6bc","prominence":"supporting","quote":{"exact":"definitions can be made in symbolic terms and interpreted through substitution: if"},"quote_capped":true,"section":["Concepts","Substitution"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"Hence, ","segments":[{"text":"Hence, "}]},"layer":"definitions can be made in symbolic terms and interpreted through substitution: if a 2 := a × a {\\displaystyle a^{2}:=a\\times a} is meant as the definition of a 2 , {\\displaystyle a^{2},} as the product of a with itself, substituting 3 for a informs the reader of this statement that 3 2 {\\displaystyle 3^{2}} means 3 × 3 = 9.","segments":[{"text":"definitions can be made in symbolic terms and interpreted through substitution: if "},{"tex":"a^{2}:=a\\times a"},{"text":" is meant as the definition of "},{"tex":"a^{2},"},{"text":" as the product of a with itself, substituting 3 for a informs the reader of this statement that "},{"tex":"3^{2}"},{"text":" means 3 × 3 = 9."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"deeeef2e148282f563e644bcc2b3c23ccf95b7a51fc42dce3ae66a4c5d2d3c3a"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #07e33acb","item":"In-text #07e33acb","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"add_eq_zero_iff_eq_neg","end_line":646,"library":"mathlib","line":646,"location_key":"25f6ca4b06c087534cba06d93fa63f91e7308a1483a80620de5552bfe34b825b","module":"Mathlib.Algebra.Group.Basic","note":"It turns the equation into the statement that the unknown is minus one, but getting from there to the passage's conclusion still needs a separate fact about one and its negation.","pair_key":"7782d44b353c88e0882c61dec96702c3be8345ec0f9d61a130539c7511877243","path":"Mathlib/Algebra/Group/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem add_eq_zero_iff_eq_neg {G : Type*} [AddGroup G] {a b : G} : a + b = 0 ↔ a = -b"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"one_add_one_eq_two","end_line":167,"library":"mathlib","line":164,"location_key":"08adc75f7ce3dded40577cb3776d795f6a9ff42c1247f384cf9d47c6ebd67316","module":"Mathlib.Data.Nat.Cast.Defs","note":"It fixes a numeral identity and leaves the passage's implication about the unknown entirely open.","pair_key":"b2c08beb9ad583e5e27f5345d951c350600e351db5bc180cd977e7fe3999feb5","path":"Mathlib/Data/Nat/Cast/Defs.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem one_add_one_eq_two {R : Type*} [AddMonoidWithOne R] : 1 + 1 = 2"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"9ed8a5093f673f21c0caf8f7a72567b115e72bfecaa8bdb704e5faa640c251eb","prominence":"supporting","quote":{"exact":"For example, taking the statement x + 1 = 0, if x"},"quote_capped":true,"section":["Concepts","Substitution"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"For example, taking the statement x + 1 = 0, if x is substituted with 1, this implies 1 + 1 = 2 = 0, which is false, which implies that if x + 1 = 0 then x cannot be 1.","segments":[{"text":"For example, taking the statement x + 1 = 0, if x is substituted with 1, this implies 1 + 1 = 2 = 0, which is false, which implies that if x + 1 = 0 then x cannot be 1."}]},"unresolved":null},{"absence":null,"basis":"8fe9c205873112b88f898a197cbdd0236db0572f9061228dd084f571cb6a94de","coverage":null,"id":"enwiki-9710-1380664138::In-text #5046e27f","item":"In-text #5046e27f","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Int.eq_zero_or_eq_zero_of_mul_eq_zero","end_line":50,"library":"mathlib","line":50,"location_key":"8fe9c205873112b88f898a197cbdd0236db0572f9061228dd084f571cb6a94de","module":"Mathlib.Data.Int.Order.Basic","note":"Lean fixes the integers and states the same implication from a vanishing product to a vanishing factor.","pair_key":"2bbfe13cec70fcd9793e773c99a8723b984fc3731f8044049608e04feeff9890","path":"Mathlib/Data/Int/Order/Basic.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Int.eq_zero_or_eq_zero_of_mul_eq_zero {a b : ℤ} : a * b = 0 → a = 0 ∨ b = 0"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.mul_eq_zero","end_line":557,"library":"lean-core","line":551,"location_key":"b31985862bf6b59d944dad9c8f2b248edf83d845d60bca190e0e9affe832ab1e","module":"Init.Data.Int.Lemmas","note":"Lean states the integer zero-product property as an equivalence, of which the passage asserts the forward half.","pair_key":"70a689c9b501559d194e18111d754af99dba2100310146c66fc0cee53c19e803","path":"src/Init/Data/Int/Lemmas.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.mul_eq_zero {a b : Int} : a * b = 0 ↔ a = 0 ∨ b = 0"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_eq_zero","end_line":295,"library":"mathlib","line":293,"location_key":"e5ae7db5051732c2a337707555c7adac3b2afea0d5b3042eecc8b4eab28b6780","module":"Mathlib.Algebra.GroupWithZero.Defs","note":"This is the universe's abstract form of the law, instantiated at the integers through the domain instance for them.","pair_key":"c7c4a35b88665b5763de9ccd6a1dc39e474a01dfe8fa786198a03e328c3d39e2","path":"Mathlib/Algebra/GroupWithZero/Defs.lean","proof_status":"proved","rank":3,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_eq_zero {M₀ : Type*} [MulZeroClass M₀] [NoZeroDivisors M₀] {a b : M₀} : a * b = 0 ↔ a = 0 ∨ b = 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"335a40e34f9dbc02099c78219a1977b2fe86480c777db9d8cd37c3f86572e769","prominence":"central","quote":{"exact":"If x and y are integers,"},"quote_capped":false,"section":["Concepts","Substitution"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"after":{"layer":" rationals, or real numbers, then xy = 0 implies x = 0 or y = 0.","segments":[{"text":" rationals, or real numbers, then xy = 0 implies x = 0 or y = 0."}]},"layer":"If x and y are integers,","segments":[{"text":"If x and y are integers,"}]},"unresolved":null},{"absence":null,"basis":"38398e4ebb1707a692078815a681155f76814e6a25867aae32bd41eb9c5ae5d5","coverage":null,"id":"enwiki-9710-1380664138::In-text #78fb14a5","item":"In-text #78fb14a5","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Rat.mul_eq_zero","end_line":558,"library":"lean-core","line":550,"location_key":"38398e4ebb1707a692078815a681155f76814e6a25867aae32bd41eb9c5ae5d5","module":"Init.Data.Rat.Lemmas","note":"Lean states the law for the rationals as an equivalence, and the passage asserts its forward direction.","pair_key":"30011a2794015a3ab0b5335b1a5118544b46733548c5313b7659455fcb5f9ef4","path":"src/Init/Data/Rat/Lemmas.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Rat.mul_eq_zero {a b : Rat} : a * b = 0 ↔ a = 0 ∨ b = 0"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_eq_zero","end_line":295,"library":"mathlib","line":293,"location_key":"85f0ea2c991dc0e5816934da35a2462452ec54847766ece361ae69fb608105c8","module":"Mathlib.Algebra.GroupWithZero.Defs","note":"The abstract law applies to the rationals through the domain instance Mathlib records for them.","pair_key":"69c21c37e196431a245c9482017272759e360e76e9886c3b8c0168de1f180920","path":"Mathlib/Algebra/GroupWithZero/Defs.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_eq_zero {M₀ : Type*} [MulZeroClass M₀] [NoZeroDivisors M₀] {a b : M₀} : a * b = 0 ↔ a = 0 ∨ b = 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c181246b97bfb59f1938f250580e192cb2a98b6597d76d25d2170deea80b15be","prominence":"supporting","quote":{"exact":"rationals, or"},"quote_capped":false,"section":["Concepts","Substitution"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"after":{"layer":" real numbers, then xy = 0 implies x = 0 or y = 0.","segments":[{"text":" real numbers, then xy = 0 implies x = 0 or y = 0."}]},"before":{"layer":"If x and y are integers, ","segments":[{"text":"If x and y are integers, "}]},"layer":"rationals, or","segments":[{"text":"rationals, or"}]},"unresolved":null},{"absence":null,"basis":"20e11426476c1f4af9c9f9e67d7d6bfd58bbd7d343f0872c7d3538cf38858830","coverage":null,"id":"enwiki-9710-1380664138::In-text #c7c50123","item":"In-text #c7c50123","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.instIsDomain","end_line":474,"library":"mathlib","line":474,"location_key":"20e11426476c1f4af9c9f9e67d7d6bfd58bbd7d343f0872c7d3538cf38858830","module":"Mathlib.Basic.Real.Basic","note":"This is the real-number instance of the property, and the chain from it through cancellation to absence of zero divisors is instance resolution rather than a bridging lemma; it also carries nontriviality, which the passage does not mention.","pair_key":"0f4c6b6c37253493d32098949144a3a53b83fa075bc4dbc41a91baebd065749e","path":"Mathlib/Basic/Real/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Real.instIsDomain : IsDomain ℝ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_eq_zero","end_line":295,"library":"mathlib","line":293,"location_key":"b684ed6330dbed922e7650c0cc244abf9368823a44fa4440f48755c005bc149a","module":"Mathlib.Algebra.GroupWithZero.Defs","note":"The abstract law reaches the reals through the domain instance recorded for them.","pair_key":"dec83c649d50305537e505d445afbd3ae7584d74735d64a9d2a9b8790bbae605","path":"Mathlib/Algebra/GroupWithZero/Defs.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_eq_zero {M₀ : Type*} [MulZeroClass M₀] [NoZeroDivisors M₀] {a b : M₀} : a * b = 0 ↔ a = 0 ∨ b = 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"4bb5c68132974babcf0b062fe32570c0da9c86b6f2b37d814afb91997ffa6ecf","prominence":"supporting","quote":{"exact":"real numbers, then xy = 0 implies x = 0 or y"},"quote_capped":true,"section":["Concepts","Substitution"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"If x and y are integers, rationals, or ","segments":[{"text":"If x and y are integers, rationals, or "}]},"layer":"real numbers, then xy = 0 implies x = 0 or y = 0.","segments":[{"text":"real numbers, then xy = 0 implies x = 0 or y = 0."}]},"unresolved":null},{"absence":null,"basis":"9e22bdf8abd680208d956d8e01cd1de2f49f702b5ab550882d2403f7a312cead","coverage":null,"id":"enwiki-9710-1380664138::In-text #8bc9864e","item":"In-text #8bc9864e","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_eq_zero","end_line":295,"library":"mathlib","line":293,"location_key":"9e22bdf8abd680208d956d8e01cd1de2f49f702b5ab550882d2403f7a312cead","module":"Mathlib.Algebra.GroupWithZero.Defs","note":"The declaration is the same law whose two slots the passage fills with a and with the product of b and c.","pair_key":"eb670b6168f79af5e9382da290b8ac5da3cca414d6432ff09d5e6d8329a065ee","path":"Mathlib/Algebra/GroupWithZero/Defs.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_eq_zero {M₀ : Type*} [MulZeroClass M₀] [NoZeroDivisors M₀] {a b : M₀} : a * b = 0 ↔ a = 0 ∨ b = 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"9bd09201e08c61a003bdf8d2330ed225d39e890999a0ef6af79a4331cddb574c","prominence":"supporting","quote":{"exact":"Consider abc = 0. Then, substituting a for x and bc for"},"quote_capped":true,"section":["Concepts","Substitution"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Consider abc = 0. Then, substituting a for x and bc for y, we learn a = 0 or bc = 0.","segments":[{"text":"Consider abc = 0. Then, substituting a for x and bc for y, we learn a = 0 or bc = 0."}]},"unresolved":null},{"absence":null,"basis":"b0eeb140791c0e78e93f5b44afd8e44271cc5fb5bd68d9c29251ac2930a955c8","coverage":null,"id":"enwiki-9710-1380664138::In-text #a49f2175","item":"In-text #a49f2175","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_eq_zero","end_line":295,"library":"mathlib","line":293,"location_key":"b0eeb140791c0e78e93f5b44afd8e44271cc5fb5bd68d9c29251ac2930a955c8","module":"Mathlib.Algebra.GroupWithZero.Defs","note":"The declaration is the same law with its two slots filled by the passage's b and c.","pair_key":"744002162153c903db768cad9fa6ef0f4143469d6e91007e6ba825ad08a11d6b","path":"Mathlib/Algebra/GroupWithZero/Defs.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_eq_zero {M₀ : Type*} [MulZeroClass M₀] [NoZeroDivisors M₀] {a b : M₀} : a * b = 0 ↔ a = 0 ∨ b = 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"4921015d5f9a3a077e16ecd6a938985aa4aea026501150861bedc69508c6ee24","prominence":"supporting","quote":{"exact":"Then we can substitute again, letting x = b and y ="},"quote_capped":true,"section":["Concepts","Substitution"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Then we can substitute again, letting x = b and y = c, to show that if bc = 0 then b = 0 or c = 0.","segments":[{"text":"Then we can substitute again, letting x = b and y = c, to show that if bc = 0 then b = 0 or c = 0."}]},"unresolved":null},{"absence":null,"basis":"6985c62e5dfe6ae4ad95a5406fc59cec677762e3c7d3f56321feb3795382591c","coverage":null,"id":"enwiki-9710-1380664138::In-text #ad85d04f","item":"In-text #ad85d04f","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"mul_eq_zero","end_line":295,"library":"mathlib","line":293,"location_key":"6985c62e5dfe6ae4ad95a5406fc59cec677762e3c7d3f56321feb3795382591c","module":"Mathlib.Algebra.GroupWithZero.Defs","note":"Lean's theorem is about a product of two factors over any type with no zero divisors; the article's three-factor form is this same theorem read twice, once with the first two letters grouped together.","pair_key":"f98197d6873dafd4966c53bad857440da632d211c01623efd08cd2093cf95416","path":"Mathlib/Algebra/GroupWithZero/Defs.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_eq_zero {M₀ : Type*} [MulZeroClass M₀] [NoZeroDivisors M₀] {a b : M₀} : a * b = 0 ↔ a = 0 ∨ b = 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f4a74bfa5c3dc182a5662c42a1fce1a9f3efaf53c34cbdd003c388c73d8877a2","prominence":"supporting","quote":{"exact":"Therefore, if abc = 0, then a = 0 or (b ="},"quote_capped":true,"section":["Concepts","Substitution"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"after":{"layer":" so abc = 0 implies a = 0 or b = 0 or c = 0.","segments":[{"text":" so abc = 0 implies a = 0 or b = 0 or c = 0."}]},"layer":"Therefore, if abc = 0, then a = 0 or (b = 0 or c = 0),","segments":[{"text":"Therefore, if abc = 0, then a = 0 or (b = 0 or c = 0),"}]},"unresolved":null},{"absence":null,"basis":"5e10507359e41f62fedc8056c1e6dd0c2c1c218c703b2cb3c787901bc7afc821","coverage":null,"id":"enwiki-9710-1380664138::In-text #0c3a888b","item":"In-text #0c3a888b","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"mul_eq_zero","end_line":295,"library":"mathlib","line":293,"location_key":"5e10507359e41f62fedc8056c1e6dd0c2c1c218c703b2cb3c787901bc7afc821","module":"Mathlib.Algebra.GroupWithZero.Defs","note":"The Lean statement is typeclass-based, so one theorem covers the integers, the rationals and the reals at once, and the article's three letters come from reading it at two groupings of the product.","pair_key":"01fe42406c4ca971e00242164fe4b0ae5f7c5a2b5aa19a9cdc3d5270c4cbc780","path":"Mathlib/Algebra/GroupWithZero/Defs.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_eq_zero {M₀ : Type*} [MulZeroClass M₀] [NoZeroDivisors M₀] {a b : M₀} : a * b = 0 ↔ a = 0 ∨ b = 0"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.mul_eq_zero","end_line":557,"library":"lean-core","line":551,"location_key":"a5ab239699605b21082bdc07675fed8aa261d9db83d64d7d76d5250f694409be","module":"Init.Data.Int.Lemmas","note":"The integer-specific form of the same law, recorded because the passage names the integers, but it speaks of two factors in one number system only.","pair_key":"682a42353cf8a12a18bfdfcb8b60dd13d880ede1a5d0120de9ba2bf664f76122","path":"src/Init/Data/Int/Lemmas.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.mul_eq_zero {a b : Int} : a * b = 0 ↔ a = 0 ∨ b = 0"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Rat.mul_eq_zero","end_line":558,"library":"lean-core","line":550,"location_key":"5b7dd3e2f87e8239ee46e44265260d34470defa965fd2729ad302b85a2d76c24","module":"Init.Data.Rat.Lemmas","note":"The rational-number form of the same law, recorded because the passage names the rationals, again for two factors only.","pair_key":"a328bc1bc1b4734a4960f49c27498e895efe7f48825a0a8993594b1c882ddc62","path":"src/Init/Data/Rat/Lemmas.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Rat.mul_eq_zero {a b : Rat} : a * b = 0 ↔ a = 0 ∨ b = 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"1d8c4173b1f5c9b4481ce8a0b500e8e0cdcfb9b0d1f8ce8f204ba32fc51f1053","prominence":"central","quote":{"exact":"abc = 0 implies a = 0 or b = 0 or"},"quote_capped":true,"section":["Concepts","Substitution"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"Therefore, if abc = 0, then a = 0 or (b = 0 or c = 0), so ","segments":[{"text":"Therefore, if abc = 0, then a = 0 or (b = 0 or c = 0), so "}]},"layer":"abc = 0 implies a = 0 or b = 0 or c = 0.","segments":[{"text":"abc = 0 implies a = 0 or b = 0 or c = 0."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"3f98b2e5a07f858b348e52a8b0c4e68430dbcd12b73420fcee7d92fa8f706845"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #8628d370","item":"In-text #8628d370","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"4fff37f71f0b55aa4d326236288b1640a4962cebc6e2d0d3fd3d8298c35a24bc","prominence":"central","quote":{"exact":"when they are plotted, they describe a straight line."},"quote_capped":false,"section":["Solving algebraic equations","Linear equations with one variable"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"Linear equations are so-called, because ","segments":[{"text":"Linear equations are so-called, because "}]},"layer":"when they are plotted, they describe a straight line.","segments":[{"text":"when they are plotted, they describe a straight line."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"62e97c34d6b6666bc38ba28a277b52e313b89a0e256515432ca5881df6d84562"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #4fb75bef","item":"In-text #4fb75bef","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"2d84c9f47f9dd64fdda1f9d306c64a4bdaa729733e3ccf56e1d67c7b1f3dce32","prominence":"central","quote":{"exact":"They contain only constant numbers and a single variable without an exponent."},"quote_capped":true,"section":["Solving algebraic equations","Linear equations with one variable"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"They contain only constant numbers and a single variable without an exponent. As an example, consider:","segments":[{"text":"They contain only constant numbers and a single variable without an exponent. As an example, consider:"}]},"unresolved":null},{"absence":null,"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #4a9bd4f7","item":"In-text #4a9bd4f7","kind":"example","locations":[],"outcome":"unresolved","passage_ends_in_suffix":false,"passage_key":"951fd1abbcd278746efb8c4625fe53b7a5ddfbb42de78bb1b159bc9c0ddace08","prominence":"supporting","quote":{"exact":"Problem in words: If you double the age of a child and"},"quote_capped":true,"section":["Solving algebraic equations","Linear equations with one variable"],"status":null,"subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"As an example, consider: ","lead_in":true,"segments":[{"text":"As an example, consider: "}]},"layer":"Problem in words: If you double the age of a child and add 4, the resulting answer is 12. How old is the child?","segments":[{"text":"Problem in words: If you double the age of a child and add 4, the resulting answer is 12. How old is the child?"}]},"unresolved":{"challenge":"sampled_out"}},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"4458752ed95414c15de258e4233baab0b9a92682c4ad3281efb056925e533683"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #9409d12e","item":"In-text #9409d12e","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"a4f8673f23cf65b2b09340569badd1a3354532f89cc4dee3f64eebb463263bbe","prominence":"supporting","quote":{"exact":"Equivalent equation: 2 x + 4 = 12 {\\displaystyle 2x+4=12} where x"},"quote_capped":true,"section":["Solving algebraic equations","Linear equations with one variable"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Equivalent equation: 2 x + 4 = 12 {\\displaystyle 2x+4=12} where x represent the child's age","segments":[{"text":"Equivalent equation: "},{"tex":"2x+4=12"},{"text":" where x represent the child's age"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"ee44a71ae0f09712fddac8d150c0f169a25894965a81f5cff92ddc79a0a28e02"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #50e1afec","item":"In-text #50e1afec","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"a2baf3f83ed79747fe6c2954e8e159865e5e4a24c3491eeceb0ed1dc549e9044","prominence":"supporting","quote":{"exact":"1. Equation to solve: 2 x + 4 = 12 {\\displaystyle 2x+4=12}"},"quote_capped":false,"section":["Solving algebraic equations","Linear equations with one variable"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"1. Equation to solve: 2 x + 4 = 12 {\\displaystyle 2x+4=12}","segments":[{"text":"1. Equation to solve: "},{"tex":"2x+4=12"}]},"unresolved":null},{"absence":null,"basis":"42f51f3f23dc2e7ddaad4947e336e332f5bbb5466743797f51eeedca6c3c81ee","coverage":null,"id":"enwiki-9710-1380664138::In-text #859ab61a","item":"In-text #859ab61a","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"sub_left_inj","end_line":733,"library":"mathlib","line":733,"location_key":"42f51f3f23dc2e7ddaad4947e336e332f5bbb5466743797f51eeedca6c3c81ee","module":"Mathlib.Algebra.Group.Basic","note":"Lean states this as an equivalence between the two equalities, so one direction of it is the step the passage takes, and it is stated for subtraction in any additive group rather than for these particular numbers.","pair_key":"3b96feb6771fd6b5c92531064773498183a25d93563f9509b6a3877760d2c98e","path":"Mathlib/Algebra/Group/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem sub_left_inj {G : Type*} [AddGroup G] {a b c : G} : b - a = c - a ↔ b = c"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"congrArg","end_line":416,"library":"lean-core","line":415,"location_key":"403a1032ffc3f1d3a48d6965f991c76bfc500a2efed3743be4f3e53abcd2d23e","module":"Init.Prelude","note":"This is the congruence rule for an arbitrary function, so the article's operation of taking four from both sides is one choice of that function.","pair_key":"dc25b8b7d9dcaca87361f88b83ef4e118ece5aaa60828bb1f7caf163011a585b","path":"src/Init/Prelude.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem congrArg {α : Sort u} {β : Sort v} {a₁ a₂ : α} (f : α → β) : a₁ = a₂ → f a₁ = f a₂"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c50c0d206650d9741743649edaf88a9ef7d19c025c64307247ee97413452da22","prominence":"supporting","quote":{"exact":"2. Subtract 4 from both sides: 2 x + 4 − 4"},"quote_capped":true,"section":["Solving algebraic equations","Linear equations with one variable"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"2. Subtract 4 from both sides: 2 x + 4 − 4 = 12 − 4 {\\displaystyle 2x+4-4=12-4}","segments":[{"text":"2. Subtract 4 from both sides: "},{"tex":"2x+4-4=12-4"}]},"unresolved":null},{"absence":null,"basis":"a12472c1c2d8635bca8503e0ec2aa3167d6ee550bac68cefe4f8d1483dab8b5a","coverage":null,"id":"enwiki-9710-1380664138::In-text #578f802d","item":"In-text #578f802d","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"add_sub_cancel_right","end_line":80,"library":"mathlib","line":80,"location_key":"a12472c1c2d8635bca8503e0ec2aa3167d6ee550bac68cefe4f8d1483dab8b5a","module":"Mathlib.Algebra.Group.Defs","note":"The lemma is the cancellation fact behind this step; the numeric side 12 - 4 = 8 is pure evaluation.","pair_key":"4361c68fc593f8bc36d63e2bd699afdf8fd2439544efade201b6f2ce6ed6f3fd","path":"Mathlib/Algebra/Group/Defs.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem add_sub_cancel_right {G : Type*} [AddGroup G] (a b : G) : a + b - b = a"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"64e8c6b6e2dddc3551f4345f955866be142ff74050423b9db87376f763467f6a","prominence":"supporting","quote":{"exact":"3. This simplifies to: 2 x = 8 {\\displaystyle 2x=8}"},"quote_capped":false,"section":["Solving algebraic equations","Linear equations with one variable"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"3. This simplifies to: 2 x = 8 {\\displaystyle 2x=8}","segments":[{"text":"3. This simplifies to: "},{"tex":"2x=8"}]},"unresolved":null},{"absence":null,"basis":"2361d32d8d8d4a5325c111ebe8d10434f6f40fea8af07a636b01ccba235adeba","coverage":null,"id":"enwiki-9710-1380664138::In-text #002da083","item":"In-text #002da083","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"congrArg","end_line":416,"library":"lean-core","line":415,"location_key":"2361d32d8d8d4a5325c111ebe8d10434f6f40fea8af07a636b01ccba235adeba","module":"Init.Prelude","note":"This is the inference the step performs: applying one and the same operation to two equal quantities.","pair_key":"29114eb1991d4c1f5b792118413482ca19d70e107e19ad9e40cddfd23c0fb434","path":"src/Init/Prelude.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem congrArg {α : Sort u} {β : Sort v} {a₁ a₂ : α} (f : α → β) : a₁ = a₂ → f a₁ = f a₂"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"div_left_inj'","end_line":343,"library":"mathlib","line":343,"location_key":"f7ab772d99f07ce00be8659686a23bb226729f812ff2663a41b1db8a1fe0dcd9","module":"Mathlib.Algebra.GroupWithZero.Units.Basic","note":"The declaration states an equivalence where the passage uses only one direction of it.","pair_key":"44d0d2ee59a06562d5566617c7042cbe3769e8e443b4c5fed88733b22c3a9c5e","path":"Mathlib/Algebra/GroupWithZero/Units/Basic.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem div_left_inj' {G₀ : Type*} [GroupWithZero G₀] {a b c : G₀} : c ≠ 0 → (a / c = b / c ↔ a = b)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a8a8a5a6245f745dee412bb0a7f3beb805decbb01013b6148258de99623ed269","prominence":"supporting","quote":{"exact":"4. Divide both sides by 2: 2 x 2 = 8 2"},"quote_capped":true,"section":["Solving algebraic equations","Linear equations with one variable"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"4. Divide both sides by 2: 2 x 2 = 8 2 {\\displaystyle {\\frac {2x}{2}}={\\frac {8}{2}}}","segments":[{"text":"4. Divide both sides by 2: "},{"tex":"{\\frac {2x}{2}}={\\frac {8}{2}}"}]},"unresolved":null},{"absence":null,"basis":"9ca2a007d31bf1462590d909dd7eacbef47ab1f01a98747178793d8ba73701bf","coverage":null,"id":"enwiki-9710-1380664138::In-text #633a08e6","item":"In-text #633a08e6","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"mul_div_cancel_left₀","end_line":206,"library":"mathlib","line":205,"location_key":"9ca2a007d31bf1462590d909dd7eacbef47ab1f01a98747178793d8ba73701bf","module":"Mathlib.Algebra.GroupWithZero.Defs","note":"The nonzero-divisor condition is met by 2, so the cancellation applies to this step unchanged.","pair_key":"7021b3227ff6f1c164db9f18228dd736134c19952661716557f8010248fe1682","path":"Mathlib/Algebra/GroupWithZero/Defs.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_div_cancel_left₀ {M₀ : Type*} [CommMonoidWithZero M₀] [Div M₀] [MulDivCancelClass M₀] (b : M₀) {a : M₀} : a ≠ 0 → a * b / a = b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"4804456feca8e08fcd9cf286935921f8f42838f18a072373ee731372b64396ea","prominence":"supporting","quote":{"exact":"5. This simplifies to the solution: x = 4 {\\displaystyle x=4}"},"quote_capped":false,"section":["Solving algebraic equations","Linear equations with one variable"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"5. This simplifies to the solution: x = 4 {\\displaystyle x=4}","segments":[{"text":"5. This simplifies to the solution: "},{"tex":"x=4"}]},"unresolved":null},{"absence":null,"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #30733fb7","item":"In-text #30733fb7","kind":"theorem","locations":[],"outcome":"unresolved","passage_ends_in_suffix":false,"passage_key":"1133ff6272bbb2b4cc5d8d7581ce4deda7ff244e8b9f580fb66ce5411a98d22c","prominence":"supporting","quote":{"exact":"In words: the child is 4 years old."},"quote_capped":false,"section":["Solving algebraic equations","Linear equations with one variable"],"status":null,"subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"In words: the child is 4 years old.","segments":[{"text":"In words: the child is 4 years old."}]},"unresolved":{"challenge":"sampled_out"}},{"absence":null,"basis":"2c3fb88c614cae9f944a50fe0264bd9bd4c2a5d576459efaf4f7c4e19a154689","coverage":null,"id":"enwiki-9710-1380664138::In-text #1f0a045c","item":"In-text #1f0a045c","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polynomial.eq_X_add_C_of_degree_le_one","end_line":34,"library":"mathlib","line":29,"location_key":"2c3fb88c614cae9f944a50fe0264bd9bd4c2a5d576459efaf4f7c4e19a154689","module":"Mathlib.Algebra.Polynomial.Degree.SmallDegree","note":"Lean states the shape of the polynomial itself, so the constant standing on the right of the article's equation lies outside its conclusion.","pair_key":"cacaf5dea3063ffa7f6f38d7cc9d321caa15d2e4a215267a2a6ff211a1ed6bae","path":"Mathlib/Algebra/Polynomial/Degree/SmallDegree.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Polynomial.eq_X_add_C_of_degree_le_one {R : Type u} [Semiring R] {p : R[X]} : p.degree ≤ 1 → p = Polynomial.C (p.coeff 1) * Polynomial.X + Polynomial.C (p.coeff 0)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"cbbc11389df08170677e84ed396e22ecd891fc8e154a63a6f309e58815ea6953","prominence":"central","quote":{"exact":"The general form of a linear equation with one variable, can be"},"quote_capped":true,"section":["Solving algebraic equations","Linear equations with one variable"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"The general form of a linear equation with one variable, can be written as: a x + b = c {\\displaystyle ax+b=c}","segments":[{"text":"The general form of a linear equation with one variable, can be written as: "},{"tex":"ax+b=c"}]},"unresolved":null},{"absence":null,"basis":"ec3e7764be4abf27029621a9efcec21ea9df6e864c20d07fab2506a56e383b80","coverage":null,"id":"enwiki-9710-1380664138::In-text #7ed29eba","item":"In-text #7ed29eba","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polynomial.roots_degree_eq_one","end_line":534,"library":"mathlib","line":531,"location_key":"ec3e7764be4abf27029621a9efcec21ea9df6e864c20d07fab2506a56e383b80","module":"Mathlib.Algebra.Polynomial.FieldDivision","note":"The solution set is written as the multiset of roots and the quotient as a product with the inverse coefficient, which is the same notion in library notation.","pair_key":"c37945314a0c5942886bde1c410cd8eaf6ceccec0c472d999e3213ea9a80c1f7","path":"Mathlib/Algebra/Polynomial/FieldDivision.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Polynomial.roots_degree_eq_one {R : Type u} [Field R] {p : R[X]} : p.degree = 1 → p.roots = {-((p.coeff 1)⁻¹ * p.coeff 0)}"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"78cf6ac137e23501921129a1b451f7b9a6b38300cab5d1dfb1bfe3e4565f9ff6","prominence":"central","quote":{"exact":"Following the same procedure (i.e. subtract b from both sides, and then"},"quote_capped":true,"section":["Solving algebraic equations","Linear equations with one variable"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Following the same procedure (i.e. subtract b from both sides, and then divide by a), the general solution is given by x = c − b a {\\displaystyle x={\\frac {c-b}{a}}}","segments":[{"text":"Following the same procedure (i.e. subtract b from both sides, and then divide by a), the general solution is given by "},{"tex":"x={\\frac {c-b}{a}}"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"5e665b42cc392c4fcfb682041b1e095acda4b0447fcc9dbe602dbde5da337756"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #68a8fbc6","item":"In-text #68a8fbc6","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"a600f48fb8c6890622ccfa50c9de4471d031c0ce0ee884cddab593808953ad33","prominence":"central","quote":{"exact":"A linear equation with two variables has many (i.e. an infinite number"},"quote_capped":true,"section":["Solving algebraic equations","Linear equations with two variables"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"A linear equation with two variables has many (i.e. an infinite number of) solutions.[38] For example:","segments":[{"text":"A linear equation with two variables has many (i.e. an infinite number of) solutions."},{"ref":"[38]"},{"text":" For example:"}]},"unresolved":null},{"absence":null,"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #768db6f5","item":"In-text #768db6f5","kind":"example","locations":[],"outcome":"unresolved","passage_ends_in_suffix":false,"passage_key":"f39575f4901ab084e2a51dbf3a9aa70746e1c9710534466863da71b14619992d","prominence":"supporting","quote":{"exact":"Problem in words: A father is 22 years older than his son."},"quote_capped":true,"section":["Solving algebraic equations","Linear equations with two variables"],"status":null,"subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"For example: ","lead_in":true,"segments":[{"text":"For example: "}]},"layer":"Problem in words: A father is 22 years older than his son. How old are they?","segments":[{"text":"Problem in words: A father is 22 years older than his son. How old are they?"}]},"unresolved":{"challenge":"sampled_out"}},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"19268a308a5a2edab1721197bd6fecb9b80303d3c0f0dbcd32023c21df7dc121"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #bf4f2d87","item":"In-text #bf4f2d87","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"aca5cc728738987d067236567faed097603b1f55d70b73c56e7faa3f05d88ef5","prominence":"supporting","quote":{"exact":"Equivalent equation: y = x + 22 {\\displaystyle y=x+22} where y is"},"quote_capped":true,"section":["Solving algebraic equations","Linear equations with two variables"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Equivalent equation: y = x + 22 {\\displaystyle y=x+22} where y is the father's age, x is the son's age.","segments":[{"text":"Equivalent equation: "},{"tex":"y=x+22"},{"text":" where y is the father's age, x is the son's age."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"9468892048e313ad4616fca4001288d8fcf1c7015c16e275c03ced04f2132c9d"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #e42364e2","item":"In-text #e42364e2","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"5c2239c27f5918a5b9602307db5d05c894e741659da79e82765cd377550fe761","prominence":"central","quote":{"exact":"To solve a linear equation with two variables (unknowns), requires two related"},"quote_capped":true,"section":["Solving algebraic equations","Linear equations with two variables"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"To solve a linear equation with two variables (unknowns), requires two related equations. For example, if it was also revealed that:","segments":[{"text":"To solve a linear equation with two variables (unknowns), requires two related equations. For example, if it was also revealed that:"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"4006353d53ddfc83d72d9071cc7f70fc9aecbae98ce7329ce3886eae51b16530"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #84c87bc3","item":"In-text #84c87bc3","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"64d704ad62847698b31362c77ef28bf1895c64b8b0215887744f8eb13968fc9b","prominence":"supporting","quote":{"exact":"In 10 years, the father will be twice as old as his"},"quote_capped":true,"section":["Solving algebraic equations","Linear equations with two variables"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"Problem in words ","lead_in":true,"segments":[{"text":"Problem in words "}]},"layer":"In 10 years, the father will be twice as old as his son.","segments":[{"text":"In 10 years, the father will be twice as old as his son."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"bea58f19f5d080d8a3456aeae4ebb5e6125a215cc0c97179963884f06a65588e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #b1950390","item":"In-text #b1950390","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e4d6938ccf58d9b62b4e82dc5de2704d39a7a31c1faad2b9973d665e1f21a63b","prominence":"supporting","quote":{"exact":"Equivalent equation y + 10 = 2 × ( x + 10"},"quote_capped":true,"section":["Solving algebraic equations","Linear equations with two variables"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Equivalent equation y + 10 = 2 × ( x + 10 ) y = 2 × ( x + 10 ) − 10 Subtract 10 from both sides y = 2 x + 20 − 10 Multiple out brackets y = 2 x + 10 Simplify {\\displaystyle {\\begin{aligned}y+10&=2\\times (x+10)\\\\y&=2\\times (x+10)-10&&{\\text{Subtract 10 from both sides}}\\\\y&=2x+20-10&&{\\text{Multiple out brackets}}\\\\y&=2x+10&&{\\text{Simplify}}\\end{aligned}}}","segments":[{"text":"Equivalent equation "},{"tex":"\\begin{aligned}y+10&=2\\times (x+10)\\\\y&=2\\times (x+10)-10&&{\\text{Subtract 10 from both sides}}\\\\y&=2x+20-10&&{\\text{Multiple out brackets}}\\\\y&=2x+10&&{\\text{Simplify}}\\end{aligned}"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"b92e257871c3327960956e70fb0e1a43758f20a6af9769c822e1250c2d4c61d2"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #70eb6867","item":"In-text #70eb6867","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"63c63621a6e114ee59da754ac6bd63826c667bcf61de8ee74f0d7c5d6d005f10","prominence":"supporting","quote":{"exact":"Subtract the first equation from ( y − y ) = ("},"quote_capped":true,"section":["Solving algebraic equations","Linear equations with two variables"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"{ y = x + 22 First equation y = 2 x + 10 Second equation {\\displaystyle {\\begin{cases}y=x+22&{\\text{First equation}}\\\\y=2x+10&{\\text{Second equation}}\\end{cases}}} ","lead_in":true,"segments":[{"tex":"\\begin{cases}y=x+22&{\\text{First equation}}\\\\y=2x+10&{\\text{Second equation}}\\end{cases}"},{"text":" "}]},"layer":"Subtract the first equation from ( y − y ) = ( 2 x − x ) + 10 − 22 the second in order to remove y 0 = x − 12 Simplify 12 = x Add 12 to both sides x = 12 Rearrange {\\displaystyle {\\begin{aligned}&&&{\\text{Subtract the first equation from}}\\\\(y-y)&=(2x-x)+10-22&&{\\text{the second in order to remove }}y\\\\0&=x-12&&{\\text{Simplify}}\\\\12&=x&&{\\text{Add 12 to both sides}}\\\\x&=12&&{\\text{Rearrange}}\\end{aligned}}}","segments":[{"tex":"\\begin{aligned}&&&{\\text{Subtract the first equation from}}\\\\(y-y)&=(2x-x)+10-22&&{\\text{the second in order to remove }}y\\\\0&=x-12&&{\\text{Simplify}}\\\\12&=x&&{\\text{Add 12 to both sides}}\\\\x&=12&&{\\text{Rearrange}}\\end{aligned}"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"f512827da82f9aa7aabb8a83dca3dbaf3cc441a0a3ca6581781ccc8a381fa378"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #fe00ce0d","item":"In-text #fe00ce0d","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"992e991f19ffb112cb5130f7bb884a0c3fd803c525955895493e75100e865a8e","prominence":"supporting","quote":{"exact":"In other words, the son is aged 12,"},"quote_capped":false,"section":["Solving algebraic equations","Linear equations with two variables"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"after":{"layer":" and since the father 22 years older, he must be 34.","segments":[{"text":" and since the father 22 years older, he must be 34."}]},"layer":"In other words, the son is aged 12,","segments":[{"text":"In other words, the son is aged 12,"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"f038108ebadbf7d62a20743ac793ef61a11e28a0f8597cb2ca2702434350dfbf"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #728880e8","item":"In-text #728880e8","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"0ad202a5a1552dc598ccd6a062422c5b162e90943954381d6abe8fd828d7b954","prominence":"supporting","quote":{"exact":"the father 22 years older, he must be 34."},"quote_capped":false,"section":["Solving algebraic equations","Linear equations with two variables"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"In other words, the son is aged 12, and since ","segments":[{"text":"In other words, the son is aged 12, and since "}]},"layer":"the father 22 years older, he must be 34.","segments":[{"text":"the father 22 years older, he must be 34."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"4de7704d1f2b5c79bfd5ee818bace972774c35a26c711b7dcc300afb08e1cb69"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #aef6c0b8","item":"In-text #aef6c0b8","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"0e49284d34c066ef6439ab5b61d4f7e5f589941d249a552407a1a95b8e2fa785","prominence":"supporting","quote":{"exact":"In 10 years, the son will be 22,"},"quote_capped":false,"section":["Solving algebraic equations","Linear equations with two variables"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"after":{"layer":" and the father will be twice his age, 44.","segments":[{"text":" and the father will be twice his age, 44."}]},"layer":"In 10 years, the son will be 22,","segments":[{"text":"In 10 years, the son will be 22,"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"5f4cef939bf07446fcd229a422da3a035c0f44cba45d2d80403b381158918c8c"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #4ebe8054","item":"In-text #4ebe8054","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"9f14bc64ada1b6fcfb5f6646827bd8c48043d70c51a1e9fe124be21743ba98e7","prominence":"supporting","quote":{"exact":"the father will be twice his age, 44."},"quote_capped":false,"section":["Solving algebraic equations","Linear equations with two variables"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"In 10 years, the son will be 22, and ","segments":[{"text":"In 10 years, the son will be 22, and "}]},"layer":"the father will be twice his age, 44.","segments":[{"text":"the father will be twice his age, 44."}]},"unresolved":null},{"absence":null,"basis":"48a4565a8cb45d65a37bf982d146c8635a17b74848d937e26fbf5b69a0a094a7","coverage":null,"id":"enwiki-9710-1380664138::In-text #72c795bc","item":"In-text #72c795bc","kind":"definition","locations":[{"challenge":"downgraded","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polynomial.degree_quadratic","end_line":104,"library":"mathlib","line":101,"location_key":"48a4565a8cb45d65a37bf982d146c8635a17b74848d937e26fbf5b69a0a094a7","module":"Mathlib.Algebra.Polynomial.Degree.SmallDegree","note":"Lean writes the article's condition as the polynomial having degree equal to two, and states it over an arbitrary semiring rather than over numbers.","pair_key":"fe3ea9d693bd9c8ef3697315c47b5fd5865a41588b6713bb72be580893ab2186","path":"Mathlib/Algebra/Polynomial/Degree/SmallDegree.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Polynomial.degree_quadratic {R : Type u} {a b c : R} [Semiring R] : a ≠ 0 → (Polynomial.C a * Polynomial.X ^ 2 + Polynomial.C b * Polynomial.X + Polynomial.C c).degree = 2"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"08ce830330ddc20f334262dd4200d2487c10be8a29db06998e89705aa49d9df4","prominence":"central","quote":{"exact":"A quadratic equation is one which includes a term with an exponent"},"quote_capped":true,"section":["Solving algebraic equations","Quadratic equations"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"A quadratic equation is one which includes a term with an exponent of 2, for example, x 2 {\\displaystyle x^{2}} ,[40] and no term with higher exponent.","segments":[{"text":"A quadratic equation is one which includes a term with an exponent of 2, for example, "},{"tex":"x^{2}"},{"text":" ,"},{"ref":"[40]"},{"text":" and no term with higher exponent."}]},"unresolved":null},{"absence":null,"basis":"964ef6873bbcba7498d19de2c9f2d74cbb91248cc77ec13b450a7839dc51177b","coverage":null,"id":"enwiki-9710-1380664138::In-text #cf45257e","item":"In-text #cf45257e","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polynomial.eq_quadratic_of_degree_le_two","end_line":27,"library":"mathlib","line":22,"location_key":"964ef6873bbcba7498d19de2c9f2d74cbb91248cc77ec13b450a7839dc51177b","module":"Mathlib.RingTheory.Polynomial.SmallDegreeVieta","note":"It delivers the shape of the equation but leaves the nonvanishing of the leading coefficient to the degree hypothesis.","pair_key":"b5c4d1d82f1a8bfb08fa33016c15b5e2423591cfa9232e19325b23cd95f1628f","path":"Mathlib/RingTheory/Polynomial/SmallDegreeVieta.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Polynomial.eq_quadratic_of_degree_le_two {R : Type*} [Semiring R] {p : R[X]} : p.degree ≤ 2 → p = Polynomial.C (p.coeff 2) * Polynomial.X ^ 2 + Polynomial.C (p.coeff 1) * Polynomial.X + Polynomial.C (p.coeff 0)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polynomial.degree_quadratic","end_line":104,"library":"mathlib","line":101,"location_key":"cdce78e0e64f190d125f8d66622829bf85e62899e877cd7b467664951cb6eb06","module":"Mathlib.Algebra.Polynomial.Degree.SmallDegree","note":"It runs the opposite way, from a nonzero leading coefficient to degree two, so on its own it does not bring a given equation into the article's form.","pair_key":"cbe5cf0a65b709c3e3f2b4b358144c7dd7ce186bdbb74af44c91fcc3f1af9570","path":"Mathlib/Algebra/Polynomial/Degree/SmallDegree.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Polynomial.degree_quadratic {R : Type u} {a b c : R} [Semiring R] : a ≠ 0 → (Polynomial.C a * Polynomial.X ^ 2 + Polynomial.C b * Polynomial.X + Polynomial.C c).degree = 2"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"dba0102d8a444fa843b421f6bcb902467d27f364b69694dcecf60005df6c3bb9","prominence":"central","quote":{"exact":"In general, a quadratic equation can be expressed in the form a"},"quote_capped":true,"section":["Solving algebraic equations","Quadratic equations"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"In general, a quadratic equation can be expressed in the form a x 2 + b x + c = 0 {\\displaystyle ax^{2}+bx+c=0} ,[42] where a is not zero (if it were zero, then the equation would not be quadratic but linear).","segments":[{"text":"In general, a quadratic equation can be expressed in the form "},{"tex":"ax^{2}+bx+c=0"},{"text":" ,"},{"ref":"[42]"},{"text":" where a is not zero (if it were zero, then the equation would not be quadratic but linear)."}]},"unresolved":null},{"absence":null,"basis":"687ec574cf8a86e2ff79becd1ea62f90dd2f5b1e8e0cb6555f3668aedca287b9","coverage":null,"id":"enwiki-9710-1380664138::In-text #14ffa7c0","item":"In-text #14ffa7c0","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polynomial.coeff_ne_zero_of_eq_degree","end_line":238,"library":"mathlib","line":237,"location_key":"687ec574cf8a86e2ff79becd1ea62f90dd2f5b1e8e0cb6555f3668aedca287b9","module":"Mathlib.Algebra.Polynomial.Degree.Defs","note":"Lean states it for every exponent over any semiring; taken at exponent two it gives the article's quadratic term.","pair_key":"4b75c251f35bd9ffe82b1e6243ca186713c74e0315f4a6ab68aaf0c34d347afe","path":"Mathlib/Algebra/Polynomial/Degree/Defs.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Polynomial.coeff_ne_zero_of_eq_degree {R : Type u} {n : ℕ} [Semiring R] {p : R[X]} : p.degree = ↑n → p.coeff n ≠ 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6c5b732917c2a1b500a5f456bb658de615203d2af29c6c0112f5e0b988c43291","prominence":"supporting","quote":{"exact":"Because of this a quadratic equation must contain the term a x"},"quote_capped":true,"section":["Solving algebraic equations","Quadratic equations"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Because of this a quadratic equation must contain the term a x 2 {\\displaystyle ax^{2}} , which is known as the quadratic term.","segments":[{"text":"Because of this a quadratic equation must contain the term "},{"tex":"ax^{2}"},{"text":" , which is known as the quadratic term."}]},"unresolved":null},{"absence":null,"basis":"d627b929bfaac79c7b0d2aa173bf8684cb2d1149144416bca8e3f74ca4e447b2","coverage":null,"id":"enwiki-9710-1380664138::In-text #3aa24c56","item":"In-text #3aa24c56","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polynomial.coeff_ne_zero_of_eq_degree","end_line":238,"library":"mathlib","line":237,"location_key":"d627b929bfaac79c7b0d2aa173bf8684cb2d1149144416bca8e3f74ca4e447b2","module":"Mathlib.Algebra.Polynomial.Degree.Defs","note":"Lean phrases it for an arbitrary exponent over any semiring, and the coefficient at two of the article's trinomial is its a.","pair_key":"5389dc51fcf234197fc813770e8245e4e73f6bc82cf3e2904f033392fad06db3","path":"Mathlib/Algebra/Polynomial/Degree/Defs.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Polynomial.coeff_ne_zero_of_eq_degree {R : Type u} {n : ℕ} [Semiring R] {p : R[X]} : p.degree = ↑n → p.coeff n ≠ 0"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polynomial.leadingCoeff_ne_zero","end_line":363,"library":"mathlib","line":363,"location_key":"109aa87bdad592c0749d098fba3645364f701cc19186566f4c69993067e1d3eb","module":"Mathlib.Algebra.Polynomial.Degree.Defs","note":"It trades a nonvanishing leading coefficient for the polynomial being nonzero, so reaching the article's claim still needs a degree lemma.","pair_key":"f0359731c10e57b11dd4c76b34e91e9af7ae59bafd290af516441f553c6ba00f","path":"Mathlib/Algebra/Polynomial/Degree/Defs.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Polynomial.leadingCoeff_ne_zero {R : Type u} [Semiring R] {p : R[X]} : p.leadingCoeff ≠ 0 ↔ p ≠ 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c10001352ab77398d588d378061c8034fa5347287d288167c678757c4c46a116","prominence":"supporting","quote":{"exact":"a ≠ 0 {\\displaystyle a\\neq 0} ,"},"quote_capped":false,"section":["Solving algebraic equations","Quadratic equations"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"after":{"layer":" and so we may divide by a and rearrange the equation into the standard form","segments":[{"text":" and so we may divide by a and rearrange the equation into the standard form"}]},"before":{"layer":"Hence ","segments":[{"text":"Hence "}]},"layer":"a ≠ 0 {\\displaystyle a\\neq 0} ,","segments":[{"tex":"a\\neq 0"},{"text":" ,"}]},"unresolved":null},{"absence":null,"basis":"eece76547df17729e486fcb561f37101b4f8d34fffe88f70f0a75aa8e0b4353e","coverage":null,"id":"enwiki-9710-1380664138::In-text #8f24b385","item":"In-text #8f24b385","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"low","declaration":"Polynomial.monic_mul_leadingCoeff_inv","end_line":466,"library":"mathlib","line":464,"location_key":"eece76547df17729e486fcb561f37101b4f8d34fffe88f70f0a75aa8e0b4353e","module":"Mathlib.Algebra.Polynomial.Degree.Lemmas","note":"It yields the monic normalisation only; the values b/a and c/a of the two remaining coefficients are not part of its conclusion.","pair_key":"8cf14645139be5ed774ae2a460da853d1ba35ecf5324747fd6e683d8c8005d8b","path":"Mathlib/Algebra/Polynomial/Degree/Lemmas.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Polynomial.monic_mul_leadingCoeff_inv {K : Type*} [DivisionRing K] {p : K[X]} : p ≠ 0 → (p * Polynomial.C p.leadingCoeff⁻¹).Monic"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"ab369fbb8bc5625f9277732038189f86b1c72e50802f5f309b8d178b6d46e23c","prominence":"central","quote":{"exact":"we may divide by a and rearrange the equation into the standard"},"quote_capped":true,"section":["Solving algebraic equations","Quadratic equations"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"Hence a ≠ 0 {\\displaystyle a\\neq 0} , and so ","segments":[{"text":"Hence "},{"tex":"a\\neq 0"},{"text":" , and so "}]},"layer":"we may divide by a and rearrange the equation into the standard form x 2 + p x + q = 0 {\\displaystyle x^{2}+px+q=0} where p = b a {\\displaystyle p={\\frac {b}{a}}} and q = c a {\\displaystyle q={\\frac {c}{a}}} .","segments":[{"text":"we may divide by a and rearrange the equation into the standard form "},{"tex":"x^{2}+px+q=0"},{"text":" where "},{"tex":"p={\\frac {b}{a}}"},{"text":" and "},{"tex":"q={\\frac {c}{a}}"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"fd851c403453c929b63d64e0c03064671c2e79385a435d8d80550b8c2df1937f","coverage":null,"id":"enwiki-9710-1380664138::In-text #42c6f7f5","item":"In-text #42c6f7f5","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"quadratic_eq_zero_iff","end_line":89,"library":"mathlib","line":85,"location_key":"fd851c403453c929b63d64e0c03064671c2e79385a435d8d80550b8c2df1937f","module":"Mathlib.Algebra.QuadraticDiscriminant","note":"Lean states an equivalence over any field in which two is nonzero, so it also settles that no other value of x solves the equation.","pair_key":"bfea3443c56adb7b13d5a8f266e986d478e7f9fc8adc7dba5a37a7ff5ac45e4c","path":"Mathlib/Algebra/QuadraticDiscriminant.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem quadratic_eq_zero_iff {K : Type*} [Field K] [NeZero 2] {a b c : K} : a ≠ 0 → ∀ {s : K}, discrim a b c = s * s → ∀ (x : K), a * (x * x) + b * x + c = 0 ↔ x = (-b + s) / (2 * a) ∨ x = (-b - s) / (2 * a)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"quadratic_eq_zero_iff_of_discrim_eq_zero","end_line":103,"library":"mathlib","line":100,"location_key":"2b6b71b3bf4e5aaa1651e33d087d7b2ed494196339407254dcfc3a6c57f61d23","module":"Mathlib.Algebra.QuadraticDiscriminant","note":"It is the article's formula restricted to the one case where the two signs give the same value.","pair_key":"e6231b57cd68b71bb0b7243ee422410a1cf7c647ad96fdae5f8df6f8342ed22f","path":"Mathlib/Algebra/QuadraticDiscriminant.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem quadratic_eq_zero_iff_of_discrim_eq_zero {K : Type*} [Field K] [NeZero 2] {a b c : K} : a ≠ 0 → discrim a b c = 0 → ∀ (x : K), a * (x * x) + b * x + c = 0 ↔ x = -b / (2 * a)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"14d1fc8399de7853c2ced7f0aba63f7576b9f80bfe96b117d0428b8d9878771a","prominence":"central","quote":{"exact":"Solving this, by a process known as completing the square, leads to"},"quote_capped":true,"section":["Solving algebraic equations","Quadratic equations"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Solving this, by a process known as completing the square, leads to the quadratic formula x = − b ± b 2 − 4 a c 2 a , {\\displaystyle x={\\frac {-b\\pm {\\sqrt {b^{2}-4ac}}}{2a}},} where the symbol \"±\" indicates that both x = − b + b 2 − 4 a c 2 a and x = − b − b 2 − 4 a c 2 a {\\displaystyle x={\\frac {-b+{\\sqrt {b^{2}-4ac}}}{2a}}\\quad {\\text{and}}\\quad x={\\frac {-b-{\\sqrt {b^{2}-4ac}}}{2a}}} are solutions of the quadratic equation.","segments":[{"text":"Solving this, by a process known as completing the square, leads to the quadratic formula "},{"tex":"x={\\frac {-b\\pm {\\sqrt {b^{2}-4ac}}}{2a}},"},{"text":" where the symbol \"±\" indicates that both "},{"tex":"x={\\frac {-b+{\\sqrt {b^{2}-4ac}}}{2a}}\\quad {\\text{and}}\\quad x={\\frac {-b-{\\sqrt {b^{2}-4ac}}}{2a}}"},{"text":" are solutions of the quadratic equation."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"12ac3d969d6d39eeb3ebe4a30f04d7dc06adc92be26d801e5291b56e774a5a44"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #ade3cdd9","item":"In-text #ade3cdd9","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"68f3fb11b7b151bd61a36df02e3204a66af6485d2742063f52aeb77882d1fda2","prominence":"supporting","quote":{"exact":"As an example of factoring: x 2 + 3 x − 10"},"quote_capped":true,"section":["Solving algebraic equations","Quadratic equations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"As an example of factoring: x 2 + 3 x − 10 = 0 , {\\displaystyle x^{2}+3x-10=0,} which is the same thing as ( x + 5 ) ( x − 2 ) = 0. {\\displaystyle (x+5)(x-2)=0.}","segments":[{"text":"As an example of factoring: "},{"tex":"x^{2}+3x-10=0,"},{"text":" which is the same thing as "},{"tex":"(x+5)(x-2)=0."}]},"unresolved":null},{"absence":null,"basis":"f02157e3509d53125f38fb6bd22348a48390798b53b8a35cbee393c2d66e85c4","coverage":null,"id":"enwiki-9710-1380664138::In-text #343234a4","item":"In-text #343234a4","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"mul_eq_zero","end_line":295,"library":"mathlib","line":293,"location_key":"f02157e3509d53125f38fb6bd22348a48390798b53b8a35cbee393c2d66e85c4","module":"Mathlib.Algebra.GroupWithZero.Defs","note":"The lemma is phrased for an arbitrary multiplicative structure without zero divisors, and the article reads it off for the two real linear factors it has just written.","pair_key":"ebc7b7af8b02aab44f6466ca1ae0743fdc1ba0994c9e2168922bf9324714484b","path":"Mathlib/Algebra/GroupWithZero/Defs.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_eq_zero {M₀ : Type*} [MulZeroClass M₀] [NoZeroDivisors M₀] {a b : M₀} : a * b = 0 ↔ a = 0 ∨ b = 0"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"quadratic_eq_zero_iff","end_line":89,"library":"mathlib","line":85,"location_key":"a73848eb49ff0f92f7a96c8df784d4d92f45f27e6751a6626096cabe1e938c9e","module":"Mathlib.Algebra.QuadraticDiscriminant","note":"The declaration is stated for arbitrary coefficients over any field, and the article's factored equation is one choice of those coefficients.","pair_key":"6f2cb54ffc730aa5b0ca4df37ec5c840447629c328a404dfea7e983c42e13a5b","path":"Mathlib/Algebra/QuadraticDiscriminant.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem quadratic_eq_zero_iff {K : Type*} [Field K] [NeZero 2] {a b c : K} : a ≠ 0 → ∀ {s : K}, discrim a b c = s * s → ∀ (x : K), a * (x * x) + b * x + c = 0 ↔ x = (-b + s) / (2 * a) ∨ x = (-b - s) / (2 * a)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"baf5c4c9220ce0ce59d9b7040c885e9296e7ca43fc26bd4aec79fd2dda87bece","prominence":"central","quote":{"exact":"It follows from the zero-product property that either x = 2 {\\displaystyle"},"quote_capped":true,"section":["Solving algebraic equations","Quadratic equations"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"after":{"layer":", since precisely one of the factors must be equal to zero.","segments":[{"text":", since precisely one of the factors must be equal to zero."}]},"layer":"It follows from the zero-product property that either x = 2 {\\displaystyle x=2} or x = − 5 {\\displaystyle x=-5} are the solutions","segments":[{"text":"It follows from the zero-product property that either "},{"tex":"x=2"},{"text":" or "},{"tex":"x=-5"},{"text":" are the solutions"}]},"unresolved":null},{"absence":null,"basis":"e81c37191566034601949cb3d50c1d420efc9c1be402b1a914c48e2b7865cb6a","coverage":null,"id":"enwiki-9710-1380664138::In-text #8a403193","item":"In-text #8a403193","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"mul_eq_zero","end_line":295,"library":"mathlib","line":293,"location_key":"e81c37191566034601949cb3d50c1d420efc9c1be402b1a914c48e2b7865cb6a","module":"Mathlib.Algebra.GroupWithZero.Defs","note":"The declaration speaks of any two elements of a structure without zero divisors, and here the exclusivity comes for free because the two roots are different numbers.","pair_key":"9be1fda4e1b256b48dd5adb7b87e48af9e51cd2da392cb6b5c6d51bc021c04f4","path":"Mathlib/Algebra/GroupWithZero/Defs.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_eq_zero {M₀ : Type*} [MulZeroClass M₀] [NoZeroDivisors M₀] {a b : M₀} : a * b = 0 ↔ a = 0 ∨ b = 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"0a0a8fe100a35bfc3881df92a864896389bf93265b497b4e9d1539038e08fe42","prominence":"supporting","quote":{"exact":"precisely one of the factors must be equal to zero."},"quote_capped":false,"section":["Solving algebraic equations","Quadratic equations"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"It follows from the zero-product property that either x = 2 {\\displaystyle x=2} or x = − 5 {\\displaystyle x=-5} are the solutions, since ","segments":[{"text":"It follows from the zero-product property that either "},{"tex":"x=2"},{"text":" or "},{"tex":"x=-5"},{"text":" are the solutions, since "}]},"layer":"precisely one of the factors must be equal to zero.","segments":[{"text":"precisely one of the factors must be equal to zero."}]},"unresolved":null},{"absence":null,"basis":"b7eee27083ed5a4518dc1369ec1608b88410c8bd1da34efa81686eefa76a7b4d","coverage":null,"id":"enwiki-9710-1380664138::In-text #5bc651f1","item":"In-text #5bc651f1","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"IsAlgClosed.card_roots_eq_natDegree","end_line":115,"library":"mathlib","line":113,"location_key":"b7eee27083ed5a4518dc1369ec1608b88410c8bd1da34efa81686eefa76a7b4d","module":"Mathlib.FieldTheory.IsAlgClosed.Basic","note":"The declaration counts roots of any polynomial over any algebraically closed field, and the complex quadratic of the passage is one instance of that.","pair_key":"85cb5e123ca0158736807df30b42ae86e7b1d8b4e067856dff29d91c319b12e8","path":"Mathlib/FieldTheory/IsAlgClosed/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem IsAlgClosed.card_roots_eq_natDegree {k : Type u} [Field k] [IsAlgClosed k] {p : k[X]} : p.roots.card = p.natDegree"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"quadratic_ne_zero_of_discrim_ne_sq","end_line":76,"library":"mathlib","line":74,"location_key":"b34a6443a9e1a2386dc58897dc4ee1d0c8ade27febf1b24534ac5cd67e9979e2","module":"Mathlib.Algebra.QuadraticDiscriminant","note":"The declaration is stated for arbitrary coefficients in any commutative ring, so the real quadratic that witnesses the conjunct is one of its cases.","pair_key":"3afcaef0d8a9add834895e0304b791484fecf0e7917b906ac7d952845f6a87ff","path":"Mathlib/Algebra/QuadraticDiscriminant.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem quadratic_ne_zero_of_discrim_ne_sq {R : Type*} [CommRing R] {a b c : R} : (∀ (s : R), discrim a b c ≠ s ^ 2) → ∀ (x : R), a * (x * x) + b * x + c ≠ 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"74b1dbe20539908e45d728e7baedba43ec079bd676a7c6fc633210a0109889ca","prominence":"central","quote":{"exact":"All quadratic equations will have two solutions in the complex number system,"},"quote_capped":true,"section":["Solving algebraic equations","Quadratic equations"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"All quadratic equations will have two solutions in the complex number system, but need not have any in the real number system.","segments":[{"text":"All quadratic equations will have two solutions in the complex number system, but need not have any in the real number system."}]},"unresolved":null},{"absence":null,"basis":"b27d857f32e486a8815a05415d15642608658051bc13acbee2919b028e2b0cd6","coverage":null,"id":"enwiki-9710-1380664138::In-text #24e44ab4","item":"In-text #24e44ab4","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"sq_nonneg","end_line":618,"library":"mathlib","line":608,"location_key":"b27d857f32e486a8815a05415d15642608658051bc13acbee2919b028e2b0cd6","module":"Mathlib.Algebra.Order.Ring.Unbundled.Basic","note":"The declaration holds in any linearly ordered semiring carrying the listed order instances, the reals being one of these.","pair_key":"79c4b728e694de0f33cde32ab3a7c429474b8eee5195b9396cfc1fdb030eedb2","path":"Mathlib/Algebra/Order/Ring/Unbundled/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem sq_nonneg {R : Type u} [Semiring R] [LinearOrder R] [ExistsAddOfLE R] [PosMulMono R] [AddLeftMono R] (a : R) : 0 ≤ a ^ 2"},"statement":false},{"challenge":"downgraded","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"quadratic_ne_zero_of_discrim_ne_sq","end_line":76,"library":"mathlib","line":74,"location_key":"c6cf6f4d789b791aa30d0a5d71c5c4b2d2ab084b65e6e269295d6f759ea63ee3","module":"Mathlib.Algebra.QuadraticDiscriminant","note":"The declaration covers arbitrary coefficients over any commutative ring, and the article's equation is the choice of one, zero and one.","pair_key":"d884e12a9226d88f8cc7eb0f8e662762360cd6eb2698beedb79e8db159b7e3fe","path":"Mathlib/Algebra/QuadraticDiscriminant.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem quadratic_ne_zero_of_discrim_ne_sq {R : Type*} [CommRing R] {a b c : R} : (∀ (s : R), discrim a b c ≠ s ^ 2) → ∀ (x : R), a * (x * x) + b * x + c ≠ 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"9f5e03eabbe00b9791748a5d2c994d32d44789c7b7542dcc300e2b574d44d4b5","prominence":"supporting","quote":{"exact":"For example, x 2 + 1 = 0 {\\displaystyle x^{2}+1=0} has no"},"quote_capped":true,"section":["Solving algebraic equations","Quadratic equations"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"after":{"layer":" since no real number squared equals −1.","segments":[{"text":" since no real number squared equals −1."}]},"layer":"For example, x 2 + 1 = 0 {\\displaystyle x^{2}+1=0} has no real number solution","segments":[{"text":"For example, "},{"tex":"x^{2}+1=0"},{"text":" has no real number solution"}]},"unresolved":null},{"absence":null,"basis":"32d210e9516f3cb623a9a80cdb0a7cd9d1e2da7c8539570e00d093fe56469980","coverage":null,"id":"enwiki-9710-1380664138::In-text #8793d7a8","item":"In-text #8793d7a8","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"sq_nonneg","end_line":618,"library":"mathlib","line":608,"location_key":"32d210e9516f3cb623a9a80cdb0a7cd9d1e2da7c8539570e00d093fe56469980","module":"Mathlib.Algebra.Order.Ring.Unbundled.Basic","note":"The declaration is written for any linearly ordered semiring with the listed order instances, and the reals are one such setting.","pair_key":"27789cc695d00e8d808c91af3abd01abd0736901800a13ca76167e19a80cba8f","path":"Mathlib/Algebra/Order/Ring/Unbundled/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem sq_nonneg {R : Type u} [Semiring R] [LinearOrder R] [ExistsAddOfLE R] [PosMulMono R] [AddLeftMono R] (a : R) : 0 ≤ a ^ 2"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"IsSquare.nonneg","end_line":28,"library":"mathlib","line":24,"location_key":"6ec80f56e7511a02f46b9d4736418a2e81c79930eca59aa54d4f4c31d73ed403","module":"Mathlib.Algebra.Order.Ring.Basic","note":"The declaration speaks of any element that is a square in a linearly ordered semiring with the listed instances, not of the reals alone.","pair_key":"6ce651347a4b4ccb7064eb1e004e968a88b1f2f5d4b6084fb35fab88ebcce1d3","path":"Mathlib/Algebra/Order/Ring/Basic.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem IsSquare.nonneg {R : Type*} [Semiring R] [LinearOrder R] [ExistsAddOfLE R] [PosMulMono R] [AddLeftMono R] {x : R} : IsSquare x → 0 ≤ x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c3d2edcc91841c0a9558e05008c60a40d01ea51902f679fbde03d8a2be4c75cc","prominence":"supporting","quote":{"exact":"no real number squared equals −1."},"quote_capped":false,"section":["Solving algebraic equations","Quadratic equations"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"has no real number solution since ","segments":[{"text":"has no real number solution since "}]},"layer":"no real number squared equals −1.","segments":[{"text":"no real number squared equals −1."}]},"unresolved":null},{"absence":null,"basis":"b75a529099ba18cad84fea1cb593d13602cfb0ed6707e593135937091130db0c","coverage":null,"id":"enwiki-9710-1380664138::In-text #331aa1c6","item":"In-text #331aa1c6","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polynomial.rootMultiplicity_X_sub_C_pow","end_line":181,"library":"mathlib","line":178,"location_key":"b75a529099ba18cad84fea1cb593d13602cfb0ed6707e593135937091130db0c","module":"Mathlib.Algebra.Polynomial.RingDivision","note":"The declaration fixes the multiplicity for every exponent over every nontrivial commutative ring, and the article takes the exponent two case.","pair_key":"7753a9ea66e0492842c5ea897acea30a1d343b0b3ba4f9a3805bd2c16b84af9f","path":"Mathlib/Algebra/Polynomial/RingDivision.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Polynomial.rootMultiplicity_X_sub_C_pow {R : Type u} [CommRing R] [Nontrivial R] (a : R) (n : ℕ) : Polynomial.rootMultiplicity a ((Polynomial.X - Polynomial.C a) ^ n) = n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"539acb076cb2d83480fac1366facf47a5b132d077348a87a3595c02cbf9d06b9","prominence":"supporting","quote":{"exact":"Sometimes a quadratic equation has a root of multiplicity 2, such as:"},"quote_capped":true,"section":["Solving algebraic equations","Quadratic equations"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Sometimes a quadratic equation has a root of multiplicity 2, such as: ( x + 1 ) 2 = 0. {\\displaystyle (x+1)^{2}=0.}","segments":[{"text":"Sometimes a quadratic equation has a root of multiplicity 2, such as: "},{"tex":"(x+1)^{2}=0."}]},"unresolved":null},{"absence":null,"basis":"1de825a7c2ed2bf32b8788f89232e026e7a54e8f59ffec5e2345afc63fde4dba","coverage":null,"id":"enwiki-9710-1380664138::In-text #46501ccb","item":"In-text #46501ccb","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polynomial.rootMultiplicity_X_sub_C_pow","end_line":181,"library":"mathlib","line":178,"location_key":"1de825a7c2ed2bf32b8788f89232e026e7a54e8f59ffec5e2345afc63fde4dba","module":"Mathlib.Algebra.Polynomial.RingDivision","note":"Writing the factor as the unknown minus the constant minus one is the same polynomial as the one the article squares, and the lemma fixes its root multiplicity.","pair_key":"8190afaca3434154c7771bf0fbebc4e52083fa6691647f1ae188e3a650465e22","path":"Mathlib/Algebra/Polynomial/RingDivision.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Polynomial.rootMultiplicity_X_sub_C_pow {R : Type u} [CommRing R] [Nontrivial R] (a : R) (n : ℕ) : Polynomial.rootMultiplicity a ((Polynomial.X - Polynomial.C a) ^ n) = n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"86113f072a6456e69417e1e12115a64259dc653d860e108b07e82b10e8e80beb","prominence":"supporting","quote":{"exact":"For this equation, −1 is a root of multiplicity 2."},"quote_capped":false,"section":["Solving algebraic equations","Quadratic equations"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"For this equation, −1 is a root of multiplicity 2.","segments":[{"text":"For this equation, −1 is a root of multiplicity 2."}]},"unresolved":null},{"absence":null,"basis":"53d30266cc4f65efe8dc29dfd4cef93b6358feb5a3a921ac38eace9f8150cbec","coverage":null,"id":"enwiki-9710-1380664138::In-text #41841c2e","item":"In-text #41841c2e","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polynomial.count_roots","end_line":101,"library":"mathlib","line":97,"location_key":"53d30266cc4f65efe8dc29dfd4cef93b6358feb5a3a921ac38eace9f8150cbec","module":"Mathlib.Algebra.Polynomial.Roots","note":"The declaration ties the two readings together for any polynomial over any domain, and the article's squared factor is one of those polynomials.","pair_key":"4509dcd3447deefda7a6be1a3fed640ebbfc3eab9ee3787b6d078ef6aedb786f","path":"Mathlib/Algebra/Polynomial/Roots.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Polynomial.count_roots {R : Type u} {a : R} [CommRing R] [IsDomain R] [DecidableEq R] (p : R[X]) : Multiset.count a p.roots = Polynomial.rootMultiplicity a p"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"004161a588e14aec6722533cff1b32bb4bca8f8f20089a96edbbe3d821288987","prominence":"supporting","quote":{"exact":"This means −1 appears twice,"},"quote_capped":false,"section":["Solving algebraic equations","Quadratic equations"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"after":{"layer":" since the equation can be rewritten in factored form as","segments":[{"text":" since the equation can be rewritten in factored form as"}]},"layer":"This means −1 appears twice,","segments":[{"text":"This means −1 appears twice,"}]},"unresolved":null},{"absence":null,"basis":"fde0752e4bb63d70067e17f069c51a1a814e7b431219c075afb784fa4b0263fa","coverage":null,"id":"enwiki-9710-1380664138::In-text #9d73418b","item":"In-text #9d73418b","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"pow_two","end_line":431,"library":"mathlib","line":431,"location_key":"fde0752e4bb63d70067e17f069c51a1a814e7b431219c075afb784fa4b0263fa","module":"Mathlib.Algebra.Group.Monoid","note":"Lean states the identity for any monoid element; the passage writes the repeated factor with the root minus one displayed, which is the same real expression.","pair_key":"0a8ae9920dead1ef17eaa41fc46c9d1b9b493e33e775251ddb01d8317a01c47b","path":"Mathlib/Algebra/Group/Monoid.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem pow_two {M : Type*} [Monoid M] (a : M) : a ^ 2 = a * a"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"sub_neg_eq_add","end_line":507,"library":"mathlib","line":507,"location_key":"6254bbcdb969c1815f8f252bdb96f07b230c6ace5cbe5363afb572bf7b1200a2","module":"Mathlib.Algebra.Group.Basic","note":"It supplies the arithmetic rewriting by which the passage's factor x minus negative one equals x plus one, rather than the factoring of the squared term itself.","pair_key":"e4dd6bb3f13037c473a3332631838cde532959ca39c9c833e53e81d10bb7dba3","path":"Mathlib/Algebra/Group/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem sub_neg_eq_add {α : Type*} [SubtractionMonoid α] (a b : α) : a - -b = a + b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"893758ee42d96a9174f301ee8ae7a852d2e9a4313dbd37388db025d37c770388","prominence":"supporting","quote":{"exact":"the equation can be rewritten in factored form as [ x −"},"quote_capped":true,"section":["Solving algebraic equations","Quadratic equations"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"This means −1 appears twice, since ","segments":[{"text":"This means −1 appears twice, since "}]},"layer":"the equation can be rewritten in factored form as [ x − ( − 1 ) ] [ x − ( − 1 ) ] = 0. {\\displaystyle [x-(-1)][x-(-1)]=0.}","segments":[{"text":"the equation can be rewritten in factored form as "},{"tex":"[x-(-1)][x-(-1)]=0."}]},"unresolved":null},{"absence":null,"basis":"3e35dc52e1a4a0d70acb4e8200d70ba255d2c401e55f29c84b560290aebab4f1","coverage":null,"id":"enwiki-9710-1380664138::In-text #db1f580d","item":"In-text #db1f580d","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"IsAlgClosed.card_roots_eq_natDegree","end_line":115,"library":"mathlib","line":113,"location_key":"3e35dc52e1a4a0d70acb4e8200d70ba255d2c401e55f29c84b560290aebab4f1","module":"Mathlib.FieldTheory.IsAlgClosed.Basic","note":"The passage also describes the complex numbers as reals, imaginaries and their sums, which this count of roots leaves to the second card.","pair_key":"0da793f82946f21b5f03996ea18cc0a24557d8125c32f451b74c07a8627545c5","path":"Mathlib/FieldTheory/IsAlgClosed/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem IsAlgClosed.card_roots_eq_natDegree {k : Type u} [Field k] [IsAlgClosed k] {p : k[X]} : p.roots.card = p.natDegree"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Complex.re_add_im","end_line":265,"library":"mathlib","line":264,"location_key":"32f6eb8448a5cd6a1d94dc1418320378288778955a0e48c33a4a6c1090329481","module":"Mathlib.Basic.Complex.Basic","note":"Lean gives the decomposition as an identity on each complex number, with the imaginary part a real coefficient of i.","pair_key":"cb72caaf14ac9564d84ed4ed3f213e77cdf31c889ca562ff385170cbb53d122d","path":"Mathlib/Basic/Complex/Basic.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Complex.re_add_im (z : ℂ) : ↑z.re + ↑z.im * Complex.I = z"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"quadratic_eq_zero_iff","end_line":89,"library":"mathlib","line":85,"location_key":"cd4ec92c71a9917e3f395b419a818ead46d2802895437e0264d09ef22717c672","module":"Mathlib.Algebra.QuadraticDiscriminant","note":"It names the two solutions of a quadratic over a field once a square root of the discriminant is given, and over the complex numbers that square root comes from a separate existence theorem.","pair_key":"4961d796d3db8b5f068975b6c62f42c816817e100427c8c7cdb2ecbbf5e429d7","path":"Mathlib/Algebra/QuadraticDiscriminant.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem quadratic_eq_zero_iff {K : Type*} [Field K] [NeZero 2] {a b c : K} : a ≠ 0 → ∀ {s : K}, discrim a b c = s * s → ∀ (x : K), a * (x * x) + b * x + c = 0 ↔ x = (-b + s) / (2 * a) ∨ x = (-b - s) / (2 * a)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b536103bc4ecafba1718e12d9e40d79ea12b145ef06450d63138210f5c16ca8f","prominence":"central","quote":{"exact":"All quadratic equations have exactly two solutions in complex numbers (but they"},"quote_capped":true,"section":["Solving algebraic equations","Quadratic equations","Complex numbers"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"All quadratic equations have exactly two solutions in complex numbers (but they may be equal to each other), a category that includes real numbers, imaginary numbers, and sums of real and imaginary numbers.","segments":[{"text":"All quadratic equations have exactly two solutions in complex numbers (but they may be equal to each other), a category that includes real numbers, imaginary numbers, and sums of real and imaginary numbers."}]},"unresolved":null},{"absence":null,"basis":"441a8d20d678e8e3edc85fe522adb25d4b6a30c7d7ed23278bd175fc74f44459","coverage":null,"id":"enwiki-9710-1380664138::In-text #de191208","item":"In-text #de191208","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"quadratic_eq_zero_iff","end_line":89,"library":"mathlib","line":85,"location_key":"441a8d20d678e8e3edc85fe522adb25d4b6a30c7d7ed23278bd175fc74f44459","module":"Mathlib.Algebra.QuadraticDiscriminant","note":"Lean writes the quadratic as a times x times x plus b times x plus c and gives both roots as an equivalence valid for every x.","pair_key":"db0555c9c74cbe17c249bfecfd30c5d436aa3b2ddaef3c2d4926441c944f1756","path":"Mathlib/Algebra/QuadraticDiscriminant.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem quadratic_eq_zero_iff {K : Type*} [Field K] [NeZero 2] {a b c : K} : a ≠ 0 → ∀ {s : K}, discrim a b c = s * s → ∀ (x : K), a * (x * x) + b * x + c = 0 ↔ x = (-b + s) / (2 * a) ∨ x = (-b - s) / (2 * a)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"23ea8807464c8a3e70db275f11d88f0a173f42d84943b9e67c14bdb826698ac7","prominence":"supporting","quote":{"exact":"For example, the quadratic equation x 2 + x + 1 ="},"quote_capped":true,"section":["Solving algebraic equations","Quadratic equations","Complex numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"For example, the quadratic equation x 2 + x + 1 = 0 {\\displaystyle x^{2}+x+1=0} has solutions x = − 1 + − 3 2 and x = − 1 − − 3 2 . {\\displaystyle x={\\frac {-1+{\\sqrt {-3}}}{2}}\\quad \\quad {\\text{and}}\\quad \\quad x={\\frac {-1-{\\sqrt {-3}}}{2}}.}","segments":[{"text":"For example, the quadratic equation "},{"tex":"x^{2}+x+1=0"},{"text":" has solutions "},{"tex":"x={\\frac {-1+{\\sqrt {-3}}}{2}}\\quad \\quad {\\text{and}}\\quad \\quad x={\\frac {-1-{\\sqrt {-3}}}{2}}."}]},"unresolved":null},{"absence":null,"basis":"e7502cf4cf1616b3984f4e74efc70bccd4816e75f66f8874c8b9486cb35b7009","coverage":null,"id":"enwiki-9710-1380664138::In-text #6df5cf16","item":"In-text #6df5cf16","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.isSquare_iff","end_line":303,"library":"mathlib","line":302,"location_key":"e7502cf4cf1616b3984f4e74efc70bccd4816e75f66f8874c8b9486cb35b7009","module":"Mathlib.Analysis.Real.Sqrt","note":"Lean phrases having a square root as being a square and characterises that by being nonnegative, which fails at a negative radicand.","pair_key":"87a314579c93a9777449dfb7d22e7f139dca6ce823d3ee975dc810372d50ef26","path":"Mathlib/Analysis/Real/Sqrt.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.isSquare_iff {x : ℝ} : IsSquare x ↔ 0 ≤ x"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.sqrt_eq_zero_of_nonpos","end_line":141,"library":"mathlib","line":141,"location_key":"7f7f9909d567b69e7db81ca95894025a1036a9d1b73d30060e8f65fee9c0b5b0","module":"Mathlib.Analysis.Real.Sqrt","note":"It records the default value Lean's real square root takes at a nonpositive argument, a convention of the function rather than the absence of a real square root of minus three.","pair_key":"4aafe4ff3c2feba10391334b3f7a8c725a0726ebdfb46e3977c59bb63be157a2","path":"Mathlib/Analysis/Real/Sqrt.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.sqrt_eq_zero_of_nonpos {x : ℝ} : x ≤ 0 → √x = 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d90c99e826569d7349a0684fc23573d659f0074fbb98490dc90c7e66a153002c","prominence":"supporting","quote":{"exact":"− 3 {\\displaystyle {\\sqrt {-3}}} is not any real number,"},"quote_capped":false,"section":["Solving algebraic equations","Quadratic equations","Complex numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"after":{"layer":" both of these solutions for x are complex numbers.","segments":[{"text":" both of these solutions for x are complex numbers."}]},"before":{"layer":"Since ","segments":[{"text":"Since "}]},"layer":"− 3 {\\displaystyle {\\sqrt {-3}}} is not any real number,","segments":[{"tex":"\\sqrt {-3}"},{"text":" is not any real number,"}]},"unresolved":null},{"absence":null,"basis":"8376f9615dcc9721433b486aeb32862926a85da6979605e5a6d7981f9a815583","coverage":null,"id":"enwiki-9710-1380664138::In-text #e7c711ff","item":"In-text #e7c711ff","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"quadratic_ne_zero_of_discrim_ne_sq","end_line":76,"library":"mathlib","line":74,"location_key":"8376f9615dcc9721433b486aeb32862926a85da6979605e5a6d7981f9a815583","module":"Mathlib.Algebra.QuadraticDiscriminant","note":"Lean states the absence of a root over the given ring for every quadratic whose discriminant has no square root there.","pair_key":"3a82975eae77d99e033ec8466f60bac08e48ef8aa49e82937b3a37260f2ecab1","path":"Mathlib/Algebra/QuadraticDiscriminant.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem quadratic_ne_zero_of_discrim_ne_sq {R : Type*} [CommRing R] {a b c : R} : (∀ (s : R), discrim a b c ≠ s ^ 2) → ∀ (x : R), a * (x * x) + b * x + c ≠ 0"},"statement":false},{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"Polynomial.im_ne_zero_of_aeval_eq_zero","end_line":99,"library":"tauceti","line":94,"location_key":"111cedc6f9f3bdc67efad4dcbe3b51ae66cc05a39a27556d2b9819c33e4f1d20","module":"TauCeti.RingTheory.Polynomial.RealEtale","note":"It concludes that a complex root of an irreducible real quadratic has nonzero imaginary part, but reaching the passage needs the irreducibility of its polynomial from elsewhere.","pair_key":"0e4253b747c1d63b79918faa21d912e095676de5dadc073a5249d1372d766498","path":"TauCeti/RingTheory/Polynomial/RealEtale.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem Polynomial.im_ne_zero_of_aeval_eq_zero {p : ℝ[X]} : Irreducible p → p.natDegree = 2 → ∀ {z : ℂ}, (Polynomial.aeval z) p = 0 → z.im ≠ 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"0a00396fd35f8f044a2e525500e66d9a79eac98197b0d2d0ad53d88512f3b662","prominence":"supporting","quote":{"exact":"both of these solutions for x are complex numbers."},"quote_capped":false,"section":["Solving algebraic equations","Quadratic equations","Complex numbers"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"Since − 3 {\\displaystyle {\\sqrt {-3}}} is not any real number, ","segments":[{"text":"Since "},{"tex":"\\sqrt {-3}"},{"text":" is not any real number, "}]},"layer":"both of these solutions for x are complex numbers.","segments":[{"text":"both of these solutions for x are complex numbers."}]},"unresolved":null},{"absence":null,"basis":"b3b6485a29a353c762dacd5215a90ef0e0c9b82d0dbce138921ceba5ef3fc253","coverage":null,"id":"enwiki-9710-1380664138::In-text #03f9078a","item":"In-text #03f9078a","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.logb_eq_iff_rpow_eq","end_line":158,"library":"mathlib","line":155,"location_key":"b3b6485a29a353c762dacd5215a90ef0e0c9b82d0dbce138921ceba5ef3fc253","module":"Mathlib.Analysis.SpecialFunctions.Log.Base","note":"Lean's base-a logarithm unfolds to the quotient of the two natural logarithms that closes the passage's formula, and the declaration adds that the base differs from one, where that quotient would divide by zero.","pair_key":"5c8accd6ea0ca960ca08d0542453202d0dad6b87d5d115b2ac969c850e2dc053","path":"Mathlib/Analysis/SpecialFunctions/Log/Base.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.logb_eq_iff_rpow_eq {b x y : ℝ} : 0 < b → b ≠ 1 → 0 < y → (Real.logb b y = x ↔ b ^ x = y)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.rpow_logb","end_line":149,"library":"mathlib","line":147,"location_key":"69fd5b749d8b63e4ceffb150fc2038076a146152c799ff7b32f7e6434a627d61","module":"Mathlib.Analysis.SpecialFunctions.Log.Base","note":"It verifies the passage's proposed solution for a base away from one, the case in which Lean's base-a logarithm is well behaved.","pair_key":"8dd22008e250c2ab2f3e0c9f62ff3945479e9cd819cfb18863397ab3542590a3","path":"Mathlib/Analysis/SpecialFunctions/Log/Base.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.rpow_logb {b x : ℝ} : 0 < b → b ≠ 1 → 0 < x → b ^ Real.logb b x = x"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.log_div_log","end_line":48,"library":"mathlib","line":47,"location_key":"ef43de022fe2658ce77400e18290df367dccab5198305e76a1d9c4f21cf5b3f2","module":"Mathlib.Analysis.SpecialFunctions.Log.Base","note":"It restates Lean's base-a logarithm as the quotient of two natural logarithms, which is the inner step of the passage's formula rather than its solution claim.","pair_key":"e7fdcaed774cb100fe791beacddf4f1e51ade6033c77d5b4014e37e5c298ea4d","path":"Mathlib/Analysis/SpecialFunctions/Log/Base.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.log_div_log {b x : ℝ} : Real.log x / Real.log b = Real.logb b x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"ab262aeeb920f5de72becb291585ea71254b9050fb86b343db14eca7a73df03d","prominence":"central","quote":{"exact":"An exponential equation is one which has the form a x ="},"quote_capped":true,"section":["Solving algebraic equations","Exponential and logarithmic equations"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"An exponential equation is one which has the form a x = b {\\displaystyle a^{x}=b} for a > 0 {\\displaystyle a>0} ,[43] which has solution x = log a ⁡ b = ln ⁡ b ln ⁡ a {\\displaystyle x=\\log _{a}b={\\frac {\\ln b}{\\ln a}}} when b > 0 {\\displaystyle b>0} .","segments":[{"text":"An exponential equation is one which has the form "},{"tex":"a^{x}=b"},{"text":" for "},{"tex":"a>0"},{"text":" ,"},{"ref":"[43]"},{"text":" which has solution "},{"tex":"x=\\log _{a}b={\\frac {\\ln b}{\\ln a}}"},{"text":" when "},{"tex":"b>0"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"acc8129e666211b9dddd6cb4063e97e31b5b6eb89a033e139333f01767895018","coverage":null,"id":"enwiki-9710-1380664138::In-text #f257cdae","item":"In-text #f257cdae","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.logb_eq_iff_rpow_eq","end_line":158,"library":"mathlib","line":155,"location_key":"acc8129e666211b9dddd6cb4063e97e31b5b6eb89a033e139333f01767895018","module":"Mathlib.Analysis.SpecialFunctions.Log.Base","note":"Lean's real exponentiation is the power the passage writes with a real exponent, and its base-two logarithm is the one the passage names.","pair_key":"5e4f0b348e9670e506e0036f85dd8e8428d8cd7463966716da754ea3230fbafe","path":"Mathlib/Analysis/SpecialFunctions/Log/Base.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.logb_eq_iff_rpow_eq {b x y : ℝ} : 0 < b → b ≠ 1 → 0 < y → (Real.logb b y = x ↔ b ^ x = y)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.logb_rpow","end_line":136,"library":"mathlib","line":134,"location_key":"e7ad6b49a3d35eba689b7b0d03a3f10a4c61d37bbf0f6505f2aa79d0824f3c83","module":"Mathlib.Analysis.SpecialFunctions.Log.Base","note":"Lean states that the base-two logarithm undoes raising two to a real exponent, for any real exponent.","pair_key":"5df7485d7b49dbb9f231f74074da1a5568c1ce0f9f8fd1c6b8a0b69951c8e576","path":"Mathlib/Analysis/SpecialFunctions/Log/Base.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.logb_rpow {b x : ℝ} : 0 < b → b ≠ 1 → Real.logb b (b ^ x) = x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"9621aecc02673c97a627291bce49962d1562a8c72b2c7be84f0954150384dc01","prominence":"supporting","quote":{"exact":"For example, if 3 ⋅ 2 x − 1 + 1 ="},"quote_capped":true,"section":["Solving algebraic equations","Exponential and logarithmic equations"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"For example, if 3 ⋅ 2 x − 1 + 1 = 10 {\\displaystyle 3\\cdot 2^{x-1}+1=10} then, by subtracting 1 from both sides of the equation, and then dividing both sides by 3 we obtain 2 x − 1 = 3 {\\displaystyle 2^{x-1}=3} whence x − 1 = log 2 ⁡ 3 {\\displaystyle x-1=\\log _{2}3} or x = log 2 ⁡ 3 + 1. {\\displaystyle x=\\log _{2}3+1.}","segments":[{"text":"For example, if "},{"tex":"3\\cdot 2^{x-1}+1=10"},{"text":" then, by subtracting 1 from both sides of the equation, and then dividing both sides by 3 we obtain "},{"tex":"2^{x-1}=3"},{"text":" whence "},{"tex":"x-1=\\log _{2}3"},{"text":" or "},{"tex":"x=\\log _{2}3+1."}]},"unresolved":null},{"absence":null,"basis":"18d685f60964f244316f65161e88617e9e8c000960d24d601bfccb37a366416d","coverage":null,"id":"enwiki-9710-1380664138::In-text #1d57b024","item":"In-text #1d57b024","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.logb_eq_iff_rpow_eq","end_line":158,"library":"mathlib","line":155,"location_key":"18d685f60964f244316f65161e88617e9e8c000960d24d601bfccb37a366416d","module":"Mathlib.Analysis.SpecialFunctions.Log.Base","note":"Lean reads the equation through its base-a logarithm and real exponentiation, and asks for a base other than one and a positive argument, the range where the passage's logarithm makes sense.","pair_key":"a41e573b7882fd5a5b29ebe2cef250e063d1f9ecf54860590eba8bbbee9a6c02","path":"Mathlib/Analysis/SpecialFunctions/Log/Base.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.logb_eq_iff_rpow_eq {b x y : ℝ} : 0 < b → b ≠ 1 → 0 < y → (Real.logb b y = x ↔ b ^ x = y)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.logb_rpow","end_line":136,"library":"mathlib","line":134,"location_key":"db7396dde2c0c84adcd3278fc9ce927724b93e69fcf9627a91afaa1996707f83","module":"Mathlib.Analysis.SpecialFunctions.Log.Base","note":"It checks the passage's proposed solution for a base other than one, where Lean's base-a logarithm inverts exponentiation.","pair_key":"6b8050d349b4873c5066b70bcdebacd623bf0486cab5a25cae32edd7ebf798ce","path":"Mathlib/Analysis/SpecialFunctions/Log/Base.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.logb_rpow {b x : ℝ} : 0 < b → b ≠ 1 → Real.logb b (b ^ x) = x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a626b81564119e0a1cc558a6c02a6ccdc1e40a4a12b93da1c14b51022af2f0b1","prominence":"central","quote":{"exact":"A logarithmic equation is an equation of the form l o g"},"quote_capped":true,"section":["Solving algebraic equations","Exponential and logarithmic equations"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"A logarithmic equation is an equation of the form l o g a ( x ) = b {\\displaystyle log_{a}(x)=b} for a > 0 {\\displaystyle a>0} , which has solution x = a b . {\\displaystyle x=a^{b}.}","segments":[{"text":"A logarithmic equation is an equation of the form "},{"tex":"log_{a}(x)=b"},{"text":" for "},{"tex":"a>0"},{"text":" , which has solution "},{"tex":"x=a^{b}."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"ca211e25d7a0581292ae2ba9663be178a689f67f54fc95b4dc91b77eccdeb7f0"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #561e485c","item":"In-text #561e485c","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.logb_eq_iff_rpow_eq","end_line":158,"library":"mathlib","line":155,"location_key":"e8c0601b7e55fd3cd4f4d5f502a3a021c9e9d1632a1a325f3143498584986053","module":"Mathlib.Analysis.SpecialFunctions.Log.Base","note":"It characterises when a base-b logarithm takes a given value, which is the tool behind the worked example rather than the example itself.","pair_key":"7e43a202d293e5a79749992bb0363ed1019757f06a4d8f198eeaf6f16913577e","path":"Mathlib/Analysis/SpecialFunctions/Log/Base.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.logb_eq_iff_rpow_eq {b x y : ℝ} : 0 < b → b ≠ 1 → 0 < y → (Real.logb b y = x ↔ b ^ x = y)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"7412ddc06fdfe644badd84ab6b849535acd54da1810c7c0faa3a2219c3620485","prominence":"supporting","quote":{"exact":"For example, if 4 log 5 ⁡ ( x − 3 )"},"quote_capped":true,"section":["Solving algebraic equations","Exponential and logarithmic equations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"For example, if 4 log 5 ⁡ ( x − 3 ) − 2 = 6 {\\displaystyle 4\\log _{5}(x-3)-2=6} then, by adding 2 to both sides of the equation, followed by dividing both sides by 4, we get log 5 ⁡ ( x − 3 ) = 2 {\\displaystyle \\log _{5}(x-3)=2} whence x − 3 = 5 2 = 25 {\\displaystyle x-3=5^{2}=25} from which we obtain x = 28. {\\displaystyle x=28.}","segments":[{"text":"For example, if "},{"tex":"4\\log _{5}(x-3)-2=6"},{"text":" then, by adding 2 to both sides of the equation, followed by dividing both sides by 4, we get "},{"tex":"\\log _{5}(x-3)=2"},{"text":" whence "},{"tex":"x-3=5^{2}=25"},{"text":" from which we obtain "},{"tex":"x=28."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"e434f00a540a5508207da71fd2bbf002b21e0ec075a6129d01a154784105ea13"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #326e4ffb","item":"In-text #326e4ffb","kind":"definition","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"Real.nthRoot","end_line":36,"library":"formal-conjectures","line":35,"location_key":"c062c32288f7c365a19cfa5eef9c210df776bc5c2dbcc091253948d53c08559a","module":"FormalConjecturesForMathlib.Analysis.SpecialFunctions.NthRoot","note":"It provides the nth-root operation the passage's radical sign denotes, but it is a function on the reals and not the class of equations the passage names.","pair_key":"174a4ee8eec54037de2268c17305ec1ced7d519e6c28a5dbded58b156b9d43d4","path":"FormalConjecturesForMathlib/Analysis/SpecialFunctions/NthRoot.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def Real.nthRoot : ℕ → ℝ → ℝ"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"841bff6d5afe0a3825388afe85b7fe5b565dc49b68f2e696881a53a0e20dedf2","prominence":"central","quote":{"exact":"A radical equation is one that includes a radical sign, which includes"},"quote_capped":true,"section":["Solving algebraic equations","Radical equations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"A radical equation is one that includes a radical sign, which includes square roots, x , {\\displaystyle {\\sqrt {x}},} cube roots, x 3 {\\displaystyle {\\sqrt[{3}]{x}}} , and nth roots, x n {\\displaystyle {\\sqrt[{n}]{x}}} .","segments":[{"text":"A radical equation is one that includes a radical sign, which includes square roots, "},{"tex":"{\\sqrt {x}},"},{"text":" cube roots, "},{"tex":"\\sqrt[{3}]{x}"},{"text":" , and nth roots, "},{"tex":"\\sqrt[{n}]{x}"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"d0c9c2dbf4f8e15edaefe9bc222b1216c3a280c93d352ae2b93039b830a40c70","coverage":null,"id":"enwiki-9710-1380664138::In-text #66a19e8d","item":"In-text #66a19e8d","kind":"theorem","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"Real.nthRoot_of_nonneg","end_line":68,"library":"formal-conjectures","line":57,"location_key":"d0c9c2dbf4f8e15edaefe9bc222b1216c3a280c93d352ae2b93039b830a40c70","module":"FormalConjecturesForMathlib.Analysis.SpecialFunctions.NthRoot","note":"It carries the hypothesis that x is nonnegative, which the passage does not impose, so it states the rewriting on part of the passage's range of x; at index zero the reciprocal cast gives exponent zero, outside the indices the passage speaks of.","pair_key":"6d6b33a6912c33d4dbfcb5a9e7e17d7b5d0ac9e51cce778853e5d2d9513eafee","path":"FormalConjecturesForMathlib/Analysis/SpecialFunctions/NthRoot.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem Real.nthRoot_of_nonneg {n : ℕ} {r : ℝ} : 0 ≤ r → Real.nthRoot n r = r ^ (↑n)⁻¹"},"statement":false},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"Real.nthRoot_of_even","end_line":39,"library":"formal-conjectures","line":38,"location_key":"040c64773d4f0f237bd923cce9e56893b7d04d423b5206376f23f99085ef38c6","module":"FormalConjecturesForMathlib.Analysis.SpecialFunctions.NthRoot","note":"It fixes the index to be even, so it gives the passage's rewriting only for even roots.","pair_key":"1f2a3e60f6981592416c28e57fae40c53598a288ba7ecb33f54d64cf7d935f6c","path":"FormalConjecturesForMathlib/Analysis/SpecialFunctions/NthRoot.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem Real.nthRoot_of_even {n : ℕ} : Even n → ∀ (r : ℝ), Real.nthRoot n r = r ^ (↑n)⁻¹"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.sqrt_eq_rpow","end_line":996,"library":"mathlib","line":990,"location_key":"6b148e04af1d4e7e3e22ac8b83ff66865ee6a3dafcf66a213143d3293390e3b1","module":"Mathlib.Analysis.SpecialFunctions.Pow.Real","note":"This is the passage's rewriting at index two only, with the exponent written as one half.","pair_key":"0088f0ac70aaf3fdbafe1dda46653e549e5fb2702ae8bab767c00a7f46de5a0a","path":"Mathlib/Analysis/SpecialFunctions/Pow/Real.lean","proof_status":"proved","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.sqrt_eq_rpow (x : ℝ) : √x = x ^ (1 / 2)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"690200fd9ee0591aa6236ecc3daccfd58e149b642e6a73d7ff573f6ec94fdaad","prominence":"central","quote":{"exact":"Recall that an nth root can be rewritten in exponential format, so"},"quote_capped":true,"section":["Solving algebraic equations","Radical equations"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Recall that an nth root can be rewritten in exponential format, so that x n {\\displaystyle {\\sqrt[{n}]{x}}} is equivalent to x 1 n {\\displaystyle x^{\\frac {1}{n}}} .","segments":[{"text":"Recall that an nth root can be rewritten in exponential format, so that "},{"tex":"\\sqrt[{n}]{x}"},{"text":" is equivalent to "},{"tex":"x^{\\frac {1}{n}}"},{"text":" ."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"aba45ed03a92eb0bfc835a5c1d9f00b4befe47bf49ff640c35d53e09e57c5e23"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #3d8b93a6","item":"In-text #3d8b93a6","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.rpow_div_two_eq_sqrt","end_line":1001,"library":"mathlib","line":998,"location_key":"917c8d918c2f25fe1d83b8c2d929fb1c080b94bb1d038ee3198d680fc234d094","module":"Mathlib.Analysis.SpecialFunctions.Pow.Real","note":"For a nonnegative base it equates a half-integer power with a power of the square root, which keeps the cube outside the radical where the passage puts it inside.","pair_key":"f88789f785c4f467f921266c190b94a0b9de290b59b8836143bfd6fa87eaa717","path":"Mathlib/Analysis/SpecialFunctions/Pow/Real.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.rpow_div_two_eq_sqrt {x : ℝ} (r : ℝ) : 0 ≤ x → x ^ (r / 2) = √x ^ r"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.sqrt_eq_rpow","end_line":996,"library":"mathlib","line":990,"location_key":"ac171afa21357e855e05d9f42ff24c1ae01a82e4bc4883e0ca262c80a1d00d2e","module":"Mathlib.Analysis.SpecialFunctions.Pow.Real","note":"It rewrites a bare square root as a power one half and leaves the cube inside the radical untouched.","pair_key":"cb66243f8fd1ff062fdb287e7f757d67d4cce5729c3ee991f7047e636ccd2a61","path":"Mathlib/Analysis/SpecialFunctions/Pow/Real.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.sqrt_eq_rpow (x : ℝ) : √x = x ^ (1 / 2)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"c39cef8fa15df90386081721c8a5676e24b50012ecce22554ed693bdf92d3d0d","prominence":"supporting","quote":{"exact":"Combined with regular exponents (powers), then x 3 2 {\\displaystyle {\\sqrt[{2}]{x^{3}}}} (the"},"quote_capped":true,"section":["Solving algebraic equations","Radical equations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Combined with regular exponents (powers), then x 3 2 {\\displaystyle {\\sqrt[{2}]{x^{3}}}} (the square root of x cubed), can be rewritten as x 3 2 {\\displaystyle x^{\\frac {3}{2}}} .[44]","segments":[{"text":"Combined with regular exponents (powers), then "},{"tex":"\\sqrt[{2}]{x^{3}}"},{"text":" (the square root of x cubed), can be rewritten as "},{"tex":"x^{\\frac {3}{2}}"},{"text":" ."},{"ref":"[44]"}]},"unresolved":null},{"absence":null,"basis":"f93ae904ff0c4a43b9eff6946dce7e83d9efab1ab9ce39b19be16cc5a1531192","coverage":null,"id":"enwiki-9710-1380664138::In-text #7a14876c","item":"In-text #7a14876c","kind":"definition","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"Real.nthRoot_of_nonneg","end_line":68,"library":"formal-conjectures","line":57,"location_key":"f93ae904ff0c4a43b9eff6946dce7e83d9efab1ab9ce39b19be16cc5a1531192","module":"FormalConjecturesForMathlib.Analysis.SpecialFunctions.NthRoot","note":"It fixes the inner exponent to one and restricts to nonnegative x, where the passage allows any integer numerator and any x, so it gives that single case of the passage's equivalence of forms.","pair_key":"d24d90212a312dbd329e3464741bd653d20834147b2c82214e48cb4b982dcc41","path":"FormalConjecturesForMathlib/Analysis/SpecialFunctions/NthRoot.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem Real.nthRoot_of_nonneg {n : ℕ} {r : ℝ} : 0 ≤ r → Real.nthRoot n r = r ^ (↑n)⁻¹"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.sqrt_eq_rpow","end_line":996,"library":"mathlib","line":990,"location_key":"fe4d49ded82be37b6dac8b442dc7d57ce72fff79fe1e0a83ff19ac2f851ce264","module":"Mathlib.Analysis.SpecialFunctions.Pow.Real","note":"This is the passage's pair of forms at the single index two and numerator one, where the passage ranges over integer exponents.","pair_key":"9251fdc6412aff379c3a34cfc6a249486df8549f77caa98a250bf876c4eefc4f","path":"Mathlib/Analysis/SpecialFunctions/Pow/Real.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.sqrt_eq_rpow (x : ℝ) : √x = x ^ (1 / 2)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7370a044097612238da1e719b39478d266bdafa59b454e2f383e8065e0184a32","prominence":"central","quote":{"exact":"a common form of a radical equation is x m n ="},"quote_capped":true,"section":["Solving algebraic equations","Radical equations"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"So ","segments":[{"text":"So "}]},"layer":"a common form of a radical equation is x m n = a {\\displaystyle {\\sqrt[{n}]{x^{m}}}=a} (equivalent to x m n = a {\\displaystyle x^{\\frac {m}{n}}=a} ) where m and n are integers. It has real solution(s):","segments":[{"text":"a common form of a radical equation is "},{"tex":"{\\sqrt[{n}]{x^{m}}}=a"},{"text":" (equivalent to "},{"tex":"x^{\\frac {m}{n}}=a"},{"text":" ) where m and n are integers. It has real solution(s):"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":4,"queries":7,"sha256":"c069ef59e9fc71eab88a571913c844ad24aec9fe4a899337fb01090a71e21f87"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #0bed0cbc","item":"In-text #0bed0cbc","kind":"theorem","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"Polynomial.card_nthRootsFinset_two","end_line":59,"library":"tauceti","line":35,"location_key":"9bdaf9a36c0e4dbef671d6d347c20c531fbc2f795c9b7345dc9430b804efe414","module":"TauCeti.Algebra.Polynomial.RealClosed.RootsBelow","note":"Over a real closed field it counts the square roots of a by the sign of a, which is the counting shadow of the passage's table rather than its solution formulas.","pair_key":"2968a9d3a88ae64115c02fc05eba37d669adf38a2c1dfcfb57f5d48ce6cffca1","path":"TauCeti/Algebra/Polynomial/RealClosed/RootsBelow.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem Polynomial.card_nthRootsFinset_two {R : Type*} [Field R] [LinearOrder R] [IsStrictOrderedRing R] [IsRealClosed R] (a : R) : (Polynomial.nthRootsFinset 2 a).card = if 0 < a then 2 else if a = 0 then 1 else 0"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"2ea1857e88cdcd25a062dabe322683e7e8a5b49eb2adc5171c08e703b90f9c53","prominence":"central","quote":{"exact":"n is odd n is even"},"quote_capped":false,"section":["Solving algebraic equations","Radical equations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"n is odd n is even","segments":[{"text":"n is odd n is even"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"d8ef40c03ed4920c0e69c8699479200728aa5365a9167608d73948e5d3527261"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #ea3dcca8","item":"In-text #ea3dcca8","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.rpow_inv_natCast_pow","end_line":515,"library":"mathlib","line":513,"location_key":"e9ad4e38c1501f9eb65002741561c2c39eb88df68ec7baee26de4b68e9b9c67f","module":"Mathlib.Analysis.SpecialFunctions.Pow.Real","note":"For a nonnegative base it cancels a reciprocal power against the matching natural power, a step one could use here but not the example's pair of answers.","pair_key":"a3f04ab2f5d01504c8d2f72d87ca2411079e4ade95927e2e27ece7429aad4eba","path":"Mathlib/Analysis/SpecialFunctions/Pow/Real.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.rpow_inv_natCast_pow {x : ℝ} {n : ℕ} : 0 ≤ x → n ≠ 0 → (x ^ (↑n)⁻¹) ^ n = x"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"6ba4bdf909dff45e43b0211edf7188842588111cdaaf8f105267a53973c5e2f4","prominence":"supporting","quote":{"exact":"For example, if: ( x + 5 ) 2 / 3 ="},"quote_capped":true,"section":["Solving algebraic equations","Radical equations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"For example, if: ( x + 5 ) 2 / 3 = 4 {\\displaystyle (x+5)^{2/3}=4} then x + 5 = ± ( 4 ) 3 , x + 5 = ± 8 , x = − 5 ± 8 , {\\displaystyle {\\begin{aligned}x+5&=\\pm ({\\sqrt {4}})^{3},\\\\x+5&=\\pm 8,\\\\x&=-5\\pm 8,\\end{aligned}}} and thus x = 3 or x = − 13 {\\displaystyle x=3\\quad {\\text{or}}\\quad x=-13}","segments":[{"text":"For example, if: "},{"tex":"(x+5)^{2/3}=4"},{"text":" then "},{"tex":"\\begin{aligned}x+5&=\\pm ({\\sqrt {4}})^{3},\\\\x+5&=\\pm 8,\\\\x&=-5\\pm 8,\\end{aligned}"},{"text":" and thus "},{"tex":"x=3\\quad {\\text{or}}\\quad x=-13"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":5,"sha256":"9ce6baaf57fcacbacd410256c069a594e42c85df3036c1bdbe5182c672b0bdb3"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #8162da5a","item":"In-text #8162da5a","kind":"example","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Matrix.mulVec_injective_of_det_ne_zero","end_line":190,"library":"mathlib","line":188,"location_key":"5dbc59574bcface0d751a687e97b38b878dcd3f1b5bc7e9d5b3ff16de34bf067","module":"Mathlib.LinearAlgebra.Matrix.Nondegenerate","note":"It gives uniqueness of solutions for a square system with nonzero determinant, the general background of the example rather than the two equations the passage writes down.","pair_key":"073e5287ae7c3ab4f1448a8ac88758f05e3d8ee7e00fb8959a73e609ed0c837b","path":"Mathlib/LinearAlgebra/Matrix/Nondegenerate.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Matrix.mulVec_injective_of_det_ne_zero {m : Type*} {R : Type*} [CommRing R] [Fintype m] [DecidableEq m] {M : Matrix m m R} [NoZeroDivisors R] : M.det ≠ 0 → Function.Injective M.mulVec"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"b03e7c944ba2f076c24a165ca3da44970d10481bf397584430b5f0647d77b101","prominence":"supporting","quote":{"exact":"An example of solving a system of linear equations is by using"},"quote_capped":true,"section":["Solving algebraic equations","System of linear equations","Elimination method"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"An example of solving a system of linear equations is by using the elimination method: { 4 x + 2 y = 14 2 x − y = 1. {\\displaystyle {\\begin{cases}4x+2y&=14\\\\2x-y&=1.\\end{cases}}}","segments":[{"text":"An example of solving a system of linear equations is by using the elimination method: "},{"tex":"\\begin{cases}4x+2y&=14\\\\2x-y&=1.\\end{cases}"}]},"unresolved":null},{"absence":null,"basis":"eaae4233279e37b51a431c3280cc08d00911e3b564bb68b814403d4f328d51e1","coverage":null,"id":"enwiki-9710-1380664138::In-text #ea7fd80c","item":"In-text #ea7fd80c","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"mul_right_inj'","end_line":62,"library":"mathlib","line":62,"location_key":"eaae4233279e37b51a431c3280cc08d00911e3b564bb68b814403d4f328d51e1","module":"Mathlib.Algebra.GroupWithZero.Defs","note":"The declaration is stated for any multiplication in which a nonzero element cancels, and the doubled sides appear here already multiplied out.","pair_key":"873868981bca98a85d3917156af49ad4c441b46772273d123a830cac7c1a4e41","path":"Mathlib/Algebra/GroupWithZero/Defs.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_right_inj' {M₀ : Type*} [Mul M₀] [Zero M₀] [IsLeftCancelMulZero M₀] {a b c : M₀} : a ≠ 0 → (a * b = a * c ↔ b = c)"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"congrArg","end_line":416,"library":"lean-core","line":415,"location_key":"a0b00ac94bca1f8a7c3c10f29f4f00ab25d55310c10018f80b12fa557d71be8c","module":"Init.Prelude","note":"This is the bare inference the step performs, with no arithmetic assumption attached to it.","pair_key":"f8ed9d1ada6fc694c8ce11108486e08ae89d10bf7f94364efec872b2bcdc9203","path":"src/Init/Prelude.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem congrArg {α : Sort u} {β : Sort v} {a₁ a₂ : α} (f : α → β) : a₁ = a₂ → f a₁ = f a₂"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"5d2a29a69ad606495afbae028873db38a959b69fec30bc1f94689bdc885b4b95","prominence":"supporting","quote":{"exact":"Multiplying the terms in the second equation by 2: 4 x +"},"quote_capped":true,"section":["Solving algebraic equations","System of linear equations","Elimination method"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Multiplying the terms in the second equation by 2: 4 x + 2 y = 14 {\\displaystyle 4x+2y=14} 4 x − 2 y = 2. {\\displaystyle 4x-2y=2.}","segments":[{"text":"Multiplying the terms in the second equation by 2: "},{"tex":"4x+2y=14"},{"text":" "},{"tex":"4x-2y=2."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"72d2115cc3e1fe980ca3dbffa2d3418eefdc823d44074c01c76be14727069267"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #2468fe17","item":"In-text #2468fe17","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"2825563f6ecfea49640c45f7b21063d92c55dfe0cb9ab5668490aba0aff8b514","prominence":"supporting","quote":{"exact":"Adding the two equations together to get: 8 x = 16 {\\displaystyle"},"quote_capped":true,"section":["Solving algebraic equations","System of linear equations","Elimination method"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Adding the two equations together to get: 8 x = 16 {\\displaystyle 8x=16} which simplifies to x = 2. {\\displaystyle x=2.}","segments":[{"text":"Adding the two equations together to get: "},{"tex":"8x=16"},{"text":" which simplifies to "},{"tex":"x=2."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"72ce3479362536c4f327aa225ab537c8cb2916a28e8b41ebcf5e61e336d0db57"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #86189397","item":"In-text #86189397","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"74fcaf7dfc2303664a9658f43dacf328aaa4e934a1d6c1b913c72d6a0f46f1f6","prominence":"supporting","quote":{"exact":"it is then possible to deduce that y = 3 {\\displaystyle y=3}"},"quote_capped":true,"section":["Solving algebraic equations","System of linear equations","Elimination method"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"after":{"layer":" The full solution to this problem is then","segments":[{"text":" The full solution to this problem is then"}]},"before":{"layer":"Since the fact that x = 2 {\\displaystyle x=2} is known, ","segments":[{"text":"Since the fact that "},{"tex":"x=2"},{"text":" is known, "}]},"layer":"it is then possible to deduce that y = 3 {\\displaystyle y=3} by either of the original two equations (by using 2 instead of x )","segments":[{"text":"it is then possible to deduce that "},{"tex":"y=3"},{"text":" by either of the original two equations (by using 2 instead of x )"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"84fe4d288b560177abc0a634c38b3fb5475481207ceb8fd61d58d77e71e6bde6"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #36b3c456","item":"In-text #36b3c456","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"8796159f7359836d214f6954ada568f7083cf0edb35ba0df40c94226b66ca1d8","prominence":"central","quote":{"exact":"The full solution to this problem is then { x = 2"},"quote_capped":true,"section":["Solving algebraic equations","System of linear equations","Elimination method"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"Since the fact that x = 2 {\\displaystyle x=2} is known, it is then possible to deduce that y = 3 {\\displaystyle y=3} by either of the original two equations (by using 2 instead of x ) ","segments":[{"text":"Since the fact that "},{"tex":"x=2"},{"text":" is known, it is then possible to deduce that "},{"tex":"y=3"},{"text":" by either of the original two equations (by using 2 instead of x ) "}]},"layer":"The full solution to this problem is then { x = 2 y = 3. {\\displaystyle {\\begin{cases}x=2\\\\y=3.\\end{cases}}}","segments":[{"text":"The full solution to this problem is then "},{"tex":"\\begin{cases}x=2\\\\y=3.\\end{cases}"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"185959ef88e22886a0b02e702383a5f1c1ed521d7543609e54b3408da7aadffa"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #cd811360","item":"In-text #cd811360","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"242fb09d9379d45ba90f6d5447a05437f390eddc507959bc73bb425819794c7c","prominence":"supporting","quote":{"exact":"{ 4 x + 2 y = 14 2 x − y","prefix":". "},"quote_capped":true,"section":["Solving algebraic equations","System of linear equations","Substitution method"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"{ 4 x + 2 y = 14 2 x − y = 1. {\\displaystyle {\\begin{cases}4x+2y&=14\\\\2x-y&=1.\\end{cases}}}","segments":[{"tex":"\\begin{cases}4x+2y&=14\\\\2x-y&=1.\\end{cases}"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"22567bdb8f4cda1e3b4e08358752a35407753614be642b3dd1095b36ec5ed649"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #7e831367","item":"In-text #7e831367","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"022f927fb77709b390d8ff5f93d2d8c7722579bac7ef092cccbcad3576a6bd9f","prominence":"supporting","quote":{"exact":"Using the second equation: 2 x − y = 1 {\\displaystyle 2x-y=1}"},"quote_capped":false,"section":["Solving algebraic equations","System of linear equations","Substitution method"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Using the second equation: 2 x − y = 1 {\\displaystyle 2x-y=1}","segments":[{"text":"Using the second equation: "},{"tex":"2x-y=1"}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"f9b6538ebaa08da453bb30d41c47dcdad8b202971aabf2e347d89322ef36d690","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"b6a59e2c84fe41e1acc6368ffb00fcb0f8658c240cfa12d5419b5285e2b1cc4f","text":"subtracting 2x from each side of the second equation gives -y = 1 - 2x"},{"id":"c2","part":"b28ab041cf40782bdf7d6098845577b92b80da03e9b5be9cdb540d0ea0dc99e8","text":"multiplying that equation by -1 gives y = 2x - 1"}],"parts":["b6a59e2c84fe41e1acc6368ffb00fcb0f8658c240cfa12d5419b5285e2b1cc4f","b28ab041cf40782bdf7d6098845577b92b80da03e9b5be9cdb540d0ea0dc99e8"],"relation":"broadMatch","status":"formalized"},"id":"enwiki-9710-1380664138::In-text #ea45b10b","item":"In-text #ea45b10b","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"sub_left_inj","end_line":733,"library":"mathlib","line":733,"location_key":"b6a59e2c84fe41e1acc6368ffb00fcb0f8658c240cfa12d5419b5285e2b1cc4f","module":"Mathlib.Algebra.Group.Basic","note":"The declaration is stated for any additive group, and the left side appears here already simplified after the cancellation of the two like terms.","pair_key":"9e92b242f891bc9382f956705d855434d1c5286289eaf7fb3e85bf5e6522f12d","path":"Mathlib/Algebra/Group/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem sub_left_inj {G : Type*} [AddGroup G] {a b c : G} : b - a = c - a ↔ b = c"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"neg_eq_iff_eq_neg","end_line":308,"library":"mathlib","line":308,"location_key":"b28ab041cf40782bdf7d6098845577b92b80da03e9b5be9cdb540d0ea0dc99e8","module":"Mathlib.Algebra.Group.Basic","note":"Changing the sign on both sides is stated as an equivalence over any type whose negation is its own inverse, and the resulting right side appears here with its two terms reordered.","pair_key":"3206acefda28a93d0da0b7a34cc461203b0df2b15d45a74be36a8d83c95947bd","path":"Mathlib/Algebra/Group/Basic.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem neg_eq_iff_eq_neg {G : Type*} [InvolutiveNeg G] {a b : G} : -a = b ↔ a = -b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"8a04020a6228e92ff7cff5bd4ae1904d48721defc3f6853db108d17e85f4d32f","prominence":"supporting","quote":{"exact":"Subtracting 2 x {\\displaystyle 2x} from each side of the equation: 2"},"quote_capped":true,"section":["Solving algebraic equations","System of linear equations","Substitution method"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Subtracting 2 x {\\displaystyle 2x} from each side of the equation: 2 x − 2 x − y = 1 − 2 x − y = 1 − 2 x {\\displaystyle {\\begin{aligned}2x-2x-y&=1-2x\\\\-y&=1-2x\\end{aligned}}} and multiplying by −1: y = 2 x − 1. {\\displaystyle y=2x-1.}","segments":[{"text":"Subtracting "},{"tex":"2x"},{"text":" from each side of the equation: "},{"tex":"\\begin{aligned}2x-2x-y&=1-2x\\\\-y&=1-2x\\end{aligned}"},{"text":" and multiplying by −1: "},{"tex":"y=2x-1."}]},"unresolved":null},{"absence":null,"basis":"9eaa9176e880b78ee4e0bc506c05c7752b9ade24b2c70a009e707909e2d5b944","coverage":null,"id":"enwiki-9710-1380664138::In-text #375238f1","item":"In-text #375238f1","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Eq.subst","end_line":362,"library":"lean-core","line":361,"location_key":"9eaa9176e880b78ee4e0bc506c05c7752b9ade24b2c70a009e707909e2d5b944","module":"Init.Prelude","note":"The declaration is pure substitution, stated for an arbitrary predicate; the intermediate forms the passage displays are the same expression collected and the product multiplied out.","pair_key":"ab0b8fb6d19a86b34bbfd53a47b54c460235eff23ad691628f94d33e3877864d","path":"src/Init/Prelude.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Eq.subst {α : Sort u} {motive : α → Prop} {a b : α} : a = b → motive a → motive b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2ba42c6c996651dea340bf30125b54f58d5435af72a9a1bc22ad5de6a44f3ce6","prominence":"supporting","quote":{"exact":"Using this y value in the first equation in the original system:"},"quote_capped":true,"section":["Solving algebraic equations","System of linear equations","Substitution method"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Using this y value in the first equation in the original system: 4 x + 2 ( 2 x − 1 ) = 14 4 x + 4 x − 2 = 14 8 x − 2 = 14 {\\displaystyle {\\begin{aligned}4x+2(2x-1)&=14\\\\4x+4x-2&=14\\\\8x-2&=14\\end{aligned}}}","segments":[{"text":"Using this y value in the first equation in the original system: "},{"tex":"\\begin{aligned}4x+2(2x-1)&=14\\\\4x+4x-2&=14\\\\8x-2&=14\\end{aligned}"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"b92ad3324ce421a626901fda9d34296dbc16a0d9b3a37f60771fefef51987554"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #5f9d3841","item":"In-text #5f9d3841","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"sub_eq_iff_eq_add","end_line":772,"library":"mathlib","line":772,"location_key":"05ef44a39a631993984fbad559fd3a2cf47c301f5d026a8eae5676c79d2c14a2","module":"Mathlib.Algebra.Group.Basic","note":"The lemma moves a subtracted term across an equality in any additive group; it says nothing about the numeral 16 or about the value of the unknown.","pair_key":"2e10497bfd4d623ab24414e137d3ef393e5d3e75fad5db9f0d5f3c15ee74cd81","path":"Mathlib/Algebra/Group/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem sub_eq_iff_eq_add {G : Type*} [AddGroup G] {a b c : G} : a - b = c ↔ a = c + b"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"d842f691bf4958f344532c26ed11bf4463fe1e0d971bf18778093b079fdcf1ab","prominence":"supporting","quote":{"exact":"Adding 2 on each side of the equation: 8 x − 2"},"quote_capped":true,"section":["Solving algebraic equations","System of linear equations","Substitution method"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Adding 2 on each side of the equation: 8 x − 2 + 2 = 14 + 2 8 x = 16 {\\displaystyle {\\begin{aligned}8x-2+2&=14+2\\\\8x&=16\\end{aligned}}} which simplifies to x = 2 {\\displaystyle x=2}","segments":[{"text":"Adding 2 on each side of the equation: "},{"tex":"\\begin{aligned}8x-2+2&=14+2\\\\8x&=16\\end{aligned}"},{"text":" which simplifies to "},{"tex":"x=2"}]},"unresolved":null},{"absence":null,"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #57c71733","item":"In-text #57c71733","kind":"theorem","locations":[],"outcome":"unresolved","passage_ends_in_suffix":false,"passage_key":"4b5f92b2eccf341aa855b6ac0fdcb2dce32a2b1ed33211f5a082a14cb29c9010","prominence":"supporting","quote":{"exact":"Using this value in one of the equations, the same solution as"},"quote_capped":true,"section":["Solving algebraic equations","System of linear equations","Substitution method"],"status":null,"subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Using this value in one of the equations, the same solution as in the previous method is obtained.","segments":[{"text":"Using this value in one of the equations, the same solution as in the previous method is obtained."}]},"unresolved":{"challenge":"sampled_out"}},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"53827e133504dc6d7cc4264511a9b600430be35200ca19630fc50ca281d8edaf"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #1f26ec1d","item":"In-text #1f26ec1d","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Matrix.mulVec_cramer","end_line":284,"library":"mathlib","line":283,"location_key":"f1d211f3299337e5b145fb8c468eefad6117715119377f6bae69021b14ed4821","module":"Mathlib.LinearAlgebra.Matrix.Adjugate","note":"The lemma states that applying the matrix to the Cramer vector rescales the right-hand side by the determinant; it does not give the pair of values this system takes.","pair_key":"812d403a86c92e8359a8bd984f6ff6ecc2711faaecac3f132c6df97cd49440b6","path":"Mathlib/LinearAlgebra/Matrix/Adjugate.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Matrix.mulVec_cramer {n : Type v} {α : Type w} [DecidableEq n] [Fintype n] [CommRing α] (A : Matrix n n α) (b : n → α) : A.mulVec (A.cramer b) = A.det • b"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"6fee8aa43477973de2ebcccd5072e2b88cf758263a47f83ea0c99862c6c02ba4","prominence":"supporting","quote":{"exact":"{ x = 2 y = 3. {\\displaystyle {\\begin{cases}x=2\\\\y=3.\\end{cases}}}","prefix":". "},"quote_capped":false,"section":["Solving algebraic equations","System of linear equations","Substitution method"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"{ x = 2 y = 3. {\\displaystyle {\\begin{cases}x=2\\\\y=3.\\end{cases}}}","segments":[{"tex":"\\begin{cases}x=2\\\\y=3.\\end{cases}"}]},"unresolved":null},{"absence":null,"basis":"ad5dc2e5c96534fddba440956eb7a36d43f5efa8bea8dee31f958a7238bf43bf","coverage":null,"id":"enwiki-9710-1380664138::In-text #c4c05e03","item":"In-text #c4c05e03","kind":"theorem","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"MonochromaticQuantumGraph.eqSystem10_no_solution_d3","end_line":485,"library":"formal-conjectures","line":483,"location_key":"ad5dc2e5c96534fddba440956eb7a36d43f5efa8bea8dee31f958a7238bf43bf","module":"FormalConjectures.Paper.MonochromaticQuantumGraph","note":"The declaration pins one particular system of polynomial equations where the passage speaks of systems in general.","pair_key":"631da903048e86900b141f99ab3b3561faf3771cd66ee8668b62cbd5e9660450","path":"FormalConjectures/Paper/MonochromaticQuantumGraph.lean","proof_status":"statement_only","rank":1,"relation":"narrowMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem MonochromaticQuantumGraph.eqSystem10_no_solution_d3 : ¬∃ W, MonochromaticQuantumGraph.EqSystemN 10 3 W"},"statement":false},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"MonochromaticQuantumGraph.eqSystem_no_solution_ge6_ge3","end_line":576,"library":"formal-conjectures","line":573,"location_key":"01eaaf041d902e47fb745fa28767560dd7bc5a56e5267e344c1cdf6d72cdcbb5","module":"FormalConjectures.Paper.MonochromaticQuantumGraph","note":"The systems it speaks of are the quantum graph ones, a narrower collection than the systems of equations the passage ranges over.","pair_key":"11403ae330546d0e1e53f1de1f4ab3f7cf003500dd0a995520b4f91bfadab6c2","path":"FormalConjectures/Paper/MonochromaticQuantumGraph.lean","proof_status":"statement_only","rank":2,"relation":"narrowMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem MonochromaticQuantumGraph.eqSystem_no_solution_ge6_ge3 (N D : ℕ) : N ≥ 6 → Even N → D ≥ 3 → ¬∃ W, MonochromaticQuantumGraph.EqSystemN N D W"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a2001b3147216659e3c736b6cfb3de5e5058ce054728de631945034601f43b8a","prominence":"central","quote":{"exact":"However, there are also systems of equations which do not have any"},"quote_capped":true,"section":["Solving algebraic equations","Other types of systems of linear equations","Inconsistent systems"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"However, there are also systems of equations which do not have any solution.","segments":[{"text":"However, there are also systems of equations which do not have any solution."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"5ffde68352c6c880a8e030828aae43d7eb3e2d2d494ba3255b51af40a200db8a"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #4891af25","item":"In-text #4891af25","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"FirstOrder.Language.Theory.IsSatisfiable","end_line":67,"library":"mathlib","line":66,"location_key":"494cc94cd9821bc12f58f3651cc26e63e188dbc6c9d4de4f7ac7b5551d40d9ba","module":"Mathlib.ModelTheory.Satisfiability","note":"This defines when a first order theory has a model; the passage names the property of an equation system whose unknowns admit no assignment in a fixed domain.","pair_key":"15f366f3675885f09cb545038f217ff693bfb56e7e5a453e9a6e9adfad760188","path":"Mathlib/ModelTheory/Satisfiability.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def FirstOrder.Language.Theory.IsSatisfiable {L : FirstOrder.Language} : L.Theory → Prop"},"statement":true}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e6e52923e1fe0a1ef41fada6bc6bd5ef89788890f56d0613cb04fea112540cb7","prominence":"central","quote":{"exact":"Such a system is called inconsistent."},"quote_capped":false,"section":["Solving algebraic equations","Other types of systems of linear equations","Inconsistent systems"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Such a system is called inconsistent.","segments":[{"text":"Such a system is called inconsistent."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"144f2713e0f9e2b618e3b545e0827c7bab6276136cb2d3990557a0009081bcca"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #57d77d50","item":"In-text #57d77d50","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"ec42283299e37fcfcbf7ffdc86d6243aa2aa19903f4e1a352f7e9e3513368128","prominence":"supporting","quote":{"exact":"An obvious example is { x + y = 1 0 x"},"quote_capped":true,"section":["Solving algebraic equations","Other types of systems of linear equations","Inconsistent systems"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"An obvious example is { x + y = 1 0 x + 0 y = 2 . {\\displaystyle {\\begin{cases}{\\begin{aligned}x+y&=1\\\\0x+0y&=2\\,.\\end{aligned}}\\end{cases}}}","segments":[{"text":"An obvious example is "},{"tex":"\\begin{cases}{\\begin{aligned}x+y&=1\\\\0x+0y&=2\\,.\\end{aligned}}\\end{cases}"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"be2f20a0009f1aab17df3120452258e0e7d02cc898e5c0eec29d9427e2e49502"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #b1590c50","item":"In-text #b1590c50","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"df9894a25a525263adf8ad1c58c18dc1706bcd8ff5ad5d5218a24fd7ecda88cb","prominence":"supporting","quote":{"exact":"As 0≠2, the second equation in the system has no solution."},"quote_capped":false,"section":["Solving algebraic equations","Other types of systems of linear equations","Inconsistent systems"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"As 0≠2, the second equation in the system has no solution.","segments":[{"text":"As 0≠2, the second equation in the system has no solution."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"4455715bc149dccedf270d63a713b90a70bf08b6dba26e2ba0f9c75008ad2f1a"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #d7c7243a","item":"In-text #d7c7243a","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"808678436ef23db924379e126fa2553b5d1e83926cbe518721bcb5e02942f7ca","prominence":"supporting","quote":{"exact":"Therefore, the system has no solution."},"quote_capped":false,"section":["Solving algebraic equations","Other types of systems of linear equations","Inconsistent systems"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Therefore, the system has no solution.","segments":[{"text":"Therefore, the system has no solution."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"400b488fc26b5d1a79d7ef983cc76c260eca5cee1bbc6e4b0426d8691ee7ba16"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #456b5e2d","item":"In-text #456b5e2d","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"697afc3fed0a74c2cb09953a0e50978775407cdceec9345f56fe69eeb3abfb47","prominence":"supporting","quote":{"exact":"As an example, consider the system { 4 x + 2 y"},"quote_capped":true,"section":["Solving algebraic equations","Other types of systems of linear equations","Inconsistent systems"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"As an example, consider the system { 4 x + 2 y = 12 − 2 x − y = − 4 . {\\displaystyle {\\begin{cases}{\\begin{aligned}4x+2y&=12\\\\-2x-y&=-4\\,.\\end{aligned}}\\end{cases}}}","segments":[{"text":"As an example, consider the system "},{"tex":"\\begin{cases}{\\begin{aligned}4x+2y&=12\\\\-2x-y&=-4\\,.\\end{aligned}}\\end{cases}"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"a341add074977ccaf25870da8932cd20e607806586e28aa1f92ce0ef640b813c"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #adce951f","item":"In-text #adce951f","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"0d665da23a8a47ad3f6c3cecc95c9f2efcf222de67d8f4429f4041077f0afeb0","prominence":"supporting","quote":{"exact":"Multiplying by 2 both sides of the second equation, and adding it"},"quote_capped":true,"section":["Solving algebraic equations","Other types of systems of linear equations","Inconsistent systems"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Multiplying by 2 both sides of the second equation, and adding it to the first one results in 0 x + 0 y = 4 , {\\displaystyle 0x+0y=4\\,,} which clearly has no solution.","segments":[{"text":"Multiplying by 2 both sides of the second equation, and adding it to the first one results in "},{"tex":"0x+0y=4\\,,"},{"text":" which clearly has no solution."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"b613c325157bfe34e86289b8ac9e111903f8aa22939ed56e18da48283891dc5d"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #a19e0c8e","item":"In-text #a19e0c8e","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"40bcbd99bbb68412ebbe8635341666b40b8386573d39db5c23981b0752f73ef2","prominence":"central","quote":{"exact":"There are also systems which have infinitely many solutions, in contrast to"},"quote_capped":true,"section":["Solving algebraic equations","Other types of systems of linear equations","Undetermined systems"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"after":{"layer":" For example:","segments":[{"text":" For example:"}]},"layer":"There are also systems which have infinitely many solutions, in contrast to a system with a unique solution (meaning, a unique pair of values for x and y)","segments":[{"text":"There are also systems which have infinitely many solutions, in contrast to a system with a unique solution (meaning, a unique pair of values for x and y)"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"4543ea7826337175ea11e2288611e6ad0e7aa7ccfad32424c3192a4366c1e7ed"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #90fd0e99","item":"In-text #90fd0e99","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e7265b064596704a71dc0511c961933ada6e48fee22aa6de3c2149ac9de99d4b","prominence":"supporting","quote":{"exact":"For example: { 4 x + 2 y = 12 − 2"},"quote_capped":true,"section":["Solving algebraic equations","Other types of systems of linear equations","Undetermined systems"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"before":{"layer":"There are also systems which have infinitely many solutions, in contrast to a system with a unique solution (meaning, a unique pair of values for x and y) ","segments":[{"text":"There are also systems which have infinitely many solutions, in contrast to a system with a unique solution (meaning, a unique pair of values for x and y) "}]},"layer":"For example: { 4 x + 2 y = 12 − 2 x − y = − 6 {\\displaystyle {\\begin{cases}{\\begin{aligned}4x+2y&=12\\\\-2x-y&=-6\\end{aligned}}\\end{cases}}}","segments":[{"text":"For example: "},{"tex":"\\begin{cases}{\\begin{aligned}4x+2y&=12\\\\-2x-y&=-6\\end{aligned}}\\end{cases}"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"d0db4b4a140b0d31b62a659a2d633fbcbd4d79bee1ac6d8fbfb08a9a3afb4d02"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #f4b46dd9","item":"In-text #f4b46dd9","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"f2e394ad746b32797b716d51cc5df342a5b79f5bdd84bcaed5306d54c0bc0395","prominence":"supporting","quote":{"exact":"Isolating y in the second equation: y = − 2 x +"},"quote_capped":true,"section":["Solving algebraic equations","Other types of systems of linear equations","Undetermined systems"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Isolating y in the second equation: y = − 2 x + 6 {\\displaystyle y=-2x+6}","segments":[{"text":"Isolating y in the second equation: "},{"tex":"y=-2x+6"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"2bc825750db835c4ce48ef318935117de5cf83a6570b61505f67a21c935877e1"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #e1a7a2fb","item":"In-text #e1a7a2fb","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"a8acfa5b7f5b7b8d82f4fe247e879c5290578d54b410ac62f8551d3069bfcbad","prominence":"supporting","quote":{"exact":"And using this value in the first equation in the system: 4"},"quote_capped":true,"section":["Solving algebraic equations","Other types of systems of linear equations","Undetermined systems"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"And using this value in the first equation in the system: 4 x + 2 ( − 2 x + 6 ) = 12 4 x − 4 x + 12 = 12 12 = 12 {\\displaystyle {\\begin{aligned}4x+2(-2x+6)=12\\\\4x-4x+12=12\\\\12=12\\end{aligned}}}","segments":[{"text":"And using this value in the first equation in the system: "},{"tex":"\\begin{aligned}4x+2(-2x+6)=12\\\\4x-4x+12=12\\\\12=12\\end{aligned}"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"6f1faa3e044e06cd0ac839a2903d436e22e4be3d6778cd50a8d2a67d85cf1864"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #6bfea1ce","item":"In-text #6bfea1ce","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"8bd3fe735ad2a6b87bd19a34d909ee863025fd4cd9f912f3dd73c6d80d99255a","prominence":"supporting","quote":{"exact":"Indeed, one can easily verify (by just filling in some values of"},"quote_capped":true,"section":["Solving algebraic equations","Other types of systems of linear equations","Undetermined systems"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Indeed, one can easily verify (by just filling in some values of x) that for any x there is a solution as long as y = − 2 x + 6 {\\displaystyle y=-2x+6} .","segments":[{"text":"Indeed, one can easily verify (by just filling in some values of x) that for any x there is a solution as long as "},{"tex":"y=-2x+6"},{"text":" ."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"38c4f359b41a7b168b8bc1d91b37266f704b80943f6a48ce1b3c404c854e276e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #c0d46097","item":"In-text #c0d46097","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"c226338afd72e9fe70edbd202472d1b1a050cae1c9a1665b3ead43d92ebecacb","prominence":"supporting","quote":{"exact":"There is an infinite number of solutions for this system."},"quote_capped":false,"section":["Solving algebraic equations","Other types of systems of linear equations","Undetermined systems"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"There is an infinite number of solutions for this system.","segments":[{"text":"There is an infinite number of solutions for this system."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"1270d1c929fd63fda328be20631ae23d37265e3315663ef98f9c5ca756d4ada0"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #c12748b3","item":"In-text #c12748b3","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"d1da97af82d0e826292aa2199d9b8ad0e24e25331738f83d25a0ea50360876b2","prominence":"central","quote":{"exact":"Systems with more variables than the number of linear equations are called"},"quote_capped":true,"section":["Solving algebraic equations","Other types of systems of linear equations","Over- and underdetermined systems"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Systems with more variables than the number of linear equations are called underdetermined.","segments":[{"text":"Systems with more variables than the number of linear equations are called underdetermined."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"5464074583d00d8381b96c2c68595b011275cddca34116e02bb74b824b4a3892"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #6a0186b1","item":"In-text #6a0186b1","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"LinearMap.ker_ne_bot_of_finrank_lt","end_line":191,"library":"mathlib","line":185,"location_key":"299f5f444f59a044527e48919d7928b73719c0da6dd39829c3d1a4f681c04547","module":"Mathlib.LinearAlgebra.FiniteDimensional.Lemmas","note":"Its conclusion is that the kernel of the map is nonzero, which is a fact about the homogeneous part and not about how large the solution set of the given system is.","pair_key":"7c73751f55581e7035f5509dc159cf4ae057bbbf6268b9db42c1fa199dfab636","path":"Mathlib/LinearAlgebra/FiniteDimensional/Lemmas.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem LinearMap.ker_ne_bot_of_finrank_lt {K : Type u} {V : Type v} [DivisionRing K] [AddCommGroup V] [_root_.Module K V] {V₂ : Type v'} [AddCommGroup V₂] [_root_.Module K V₂] [FiniteDimensional K V] [FiniteDimensional K V₂] {f : V →ₗ[K] V₂} : Module.finrank K V₂ < Module.finrank K V → f.ker ≠ ⊥"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Int.Matrix.exists_ne_zero_int_vec_norm_le","end_line":175,"library":"mathlib","line":155,"location_key":"940aacb838a4b42d8fdbf0175bd166cdf9dc52666e3e1426e8080632290329d3","module":"Mathlib.NumberTheory.SiegelsLemma","note":"It produces one nonzero integer vector annihilated by the matrix, together with a height bound that the passage never mentions.","pair_key":"fecd1f78abbc61df4965d11a8e6b9863324c3924829c5e64b2db097d110506a9","path":"Mathlib/NumberTheory/SiegelsLemma.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Int.Matrix.exists_ne_zero_int_vec_norm_le {α : Type*} {β : Type*} [Fintype α] [Fintype β] (A : Matrix α β ℤ) : Fintype.card α < Fintype.card β → 0 < Fintype.card α → ∃ t, t ≠ 0 ∧ A.mulVec t = 0 ∧ ‖t‖ ≤ (↑(Fintype.card β) * Max.max 1 ‖A‖) ^ (↑(Fintype.card α) / (↑(Fintype.card β) - ↑(Fintype.card α)))"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"fc7ede17c0cca0dfd03761011cae050791b23954acac9a254ef128604774dbe5","prominence":"central","quote":{"exact":"Such a system, if it has any solutions, does not have a"},"quote_capped":true,"section":["Solving algebraic equations","Other types of systems of linear equations","Over- and underdetermined systems"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"Such a system, if it has any solutions, does not have a unique one but rather an infinitude of them.","segments":[{"text":"Such a system, if it has any solutions, does not have a unique one but rather an infinitude of them."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"e6390bef6bfb2fe9f892785f7378f99c89f4456f57525368bbf6183649aee666"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #29c029a2","item":"In-text #29c029a2","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"7231c060ded4410fdc9acdb31044c2da6aafbf1547ec5575200ab6c7185cda69","prominence":"supporting","quote":{"exact":"An example of such a system is { x + 2 y"},"quote_capped":true,"section":["Solving algebraic equations","Other types of systems of linear equations","Over- and underdetermined systems"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"An example of such a system is { x + 2 y = 10 y − z = 2. {\\displaystyle {\\begin{cases}{\\begin{aligned}x+2y&=10\\\\y-z&=2.\\end{aligned}}\\end{cases}}}","segments":[{"text":"An example of such a system is "},{"tex":"\\begin{cases}{\\begin{aligned}x+2y&=10\\\\y-z&=2.\\end{aligned}}\\end{cases}"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"bf6804ccae4a9ef48f1c6806737285db4cb3c8a8b5fd1192a0f96ce728b3cbf1"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #3b44e229","item":"In-text #3b44e229","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"d3d8c6af3d15b4897cc8c4530dc3e3e94980a57ac5856cf14ff451d8d34ba1e4","prominence":"central","quote":{"exact":"A system with a higher number of equations than variables is called"},"quote_capped":true,"section":["Solving algebraic equations","Other types of systems of linear equations","Over- and underdetermined systems"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"A system with a higher number of equations than variables is called overdetermined.","segments":[{"text":"A system with a higher number of equations than variables is called overdetermined."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"7495128099e317a7447c681a157290942fb8a4d8886ed6564999a7df7259ead7"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-9710-1380664138::In-text #44b137a4","item":"In-text #44b137a4","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MetaMathlibExt.rouche_capelli","library":"atlas","line":118,"location_key":"ab49cfaa4fec4b1fe40f0cd533d5e387f492cc7c1bf04d11f2201a8f3e74a1ba","module":"MathlibExt.LinearAlgebra.Matrix.RoucheCapelli","note":"It characterises solvability by an equality of two ranks and says nothing about one of the equations being built from the remaining ones.","pair_key":"b54e5fdc4c3537bbd703867c5af0c2935e2300ed0e221f3ae2ba91bfab6f937d","path":"MathlibExt/LinearAlgebra/Matrix/RoucheCapelli.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MetaMathlibExt.rouche_capelli {m : Type*} {n : Type*} [Fintype n] {K : Type*} [Field K] (A : Matrix m n K) (b : m → K) : (∃ x, A.mulVec x = b) ↔ A.rank = (Matrix.of fun i ↦ Sum.elim (A i) fun x ↦ b i).rank"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Module.exists_nontrivial_relation_of_finrank_lt_card","end_line":303,"library":"mathlib","line":298,"location_key":"06b008df3e930f9faf94353003a0390a6eda0a14f1f26e556bb61b0191360861","module":"Mathlib.LinearAlgebra.Dimension.Finite","note":"It yields a relation with some nonzero coefficient among the members of a finite set, without identifying any single member as built from the rest.","pair_key":"e407acceeade673134c6f5bed5c6ffa32d808831a5001083830603269aa906d4","path":"Mathlib/LinearAlgebra/Dimension/Finite.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Module.exists_nontrivial_relation_of_finrank_lt_card {R : Type*} {M : Type*} [Ring R] [AddCommGroup M] [_root_.Module R M] [Module.Finite R M] [StrongRankCondition R] {t : Finset M} : Module.finrank R M < t.card → ∃ f, ∑ e ∈ t, f e • e = 0 ∧ ∃ x ∈ t, f x ≠ 0"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"8172582b131b15c68cb02e89001b118ec40e35283e617ecdbe523389f3219839","prominence":"central","quote":{"exact":"If an overdetermined system has any solutions, necessarily some equations are linear"},"quote_capped":true,"section":["Solving algebraic equations","Other types of systems of linear equations","Over- and underdetermined systems"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=9710&oldid=1380664138","text":{"layer":"If an overdetermined system has any solutions, necessarily some equations are linear combinations of the others.","segments":[{"text":"If an overdetermined system has any solutions, necessarily some equations are linear combinations of the others."}]},"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-10-31T04:48:00Z","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-b1a","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-10-31T02:50:07Z"}},"reader":{"bytes":365245,"images":[{"author":"Iantresman / Iantresman at English Wikipedia","file":"Algebraic_equation_notation.svg","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0","project":"commons"},{"author":"Sweetness46 (talk)","file":"Algebraproblem.jpg","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0","project":"commons"},{"author":"Krishnavedala","file":"Binary_logarithm_plot_with_ticks.svg","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0","project":"commons"},{"author":"Theislikerice","file":"Divide_large.gif","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"},{"author":"Jim.belk","file":"Intersecting_Lines.svg","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"Iantresman","file":"Linear-equations-two-unknowns.svg","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0","project":"commons"},{"author":"Headbomb","file":"Lock-gray-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"User:Trappist the monk","file":"Lock-green.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"VulpesVulpes42, Headbomb","file":"Lock-red-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"https://phabricator.wikimedia.org/diffusion/GOJU/browse/master/AUTHORS.txt","file":"OOjs_UI_icon_edit-ltr-progressive.svg","licence":"PD","licence_url":null,"project":"en"},{"author":"Jim.belk","file":"Parallel_Lines.svg","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"OpenClipart","file":"People_icon.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"Iantresman","file":"Pi-equals-circumference-over-diametre.svg","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0","project":"commons"},{"author":"Original hand-drawn version: N.Mori Updated hand-drawn version: Rubber Duck (☮ • ✍)","file":"Polynomialdeg2.svg","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"AmericanXplorer13 (talk)","file":"Pythagorean_theorem_-_Ani.gif","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0","project":"commons"},{"author":"Iantresman","file":"Quadratic-equation.svg","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0","project":"commons"},{"author":"Iantresman","file":"Quadratic-linear-equations.svg","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0","project":"commons"},{"author":"Iantresman","file":"Quadratic_root.svg","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0","project":"commons"},{"author":"Newbzy","file":"Square_root_of_x.svg","licence":"GPL","licence_url":"https://www.gnu.org/licenses/gpl.html","project":"commons"},{"author":"PC78, based on work by Julian Herzog, Zscout370, Ed g2s and Erin Silversmith","file":"Symbol_category_class.svg","licence":"PD","licence_url":null,"project":"en"}],"marks":765,"passages":149,"sha256":"7e38e75c2d9eb3fa0a4fdc02d1261952a5935db3d32b12b492ad87515e37486b","unplaced":["enwiki-9710-1380664138::In-text #a5e37fdf","enwiki-9710-1380664138::In-text #26677807","enwiki-9710-1380664138::In-text #7f480115","enwiki-9710-1380664138::In-text #8d37865a","enwiki-9710-1380664138::In-text #4a9bd4f7","enwiki-9710-1380664138::In-text #30733fb7","enwiki-9710-1380664138::In-text #768db6f5","enwiki-9710-1380664138::In-text #57c71733"]},"record_set":"f1e67e43a41f537cd8e4cdcbdbaba86bd4ed58f1277aef79f9e34fb275f3edcc","records_sha256":"e8e62e6b7003e5c4b188a4eb848de0da3caab645aefcc69ad2b37c5d9ae777bd","revision":1380664138,"schema":"wikilean.articles.article/1","seal":{"created":"2026-11-01T14:25:17Z","schema":"cf-locate-recordset/2","set_id":"tierA-b1a","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","status_rule":3},"source":{"html_sha256":"f072798c1f4b6f598c8b38ac49912e13833b265ca8e6241504f469692abe86d9","layer_sha256":"cdee872d69f0d874e54dbe406653c7a6307c29d717c1b0426ce8d6035643b129","renderer":"web-html/3"},"source_id":"enwiki-9710-1380664138","summary":{"by_library":{"atlas":{"complete":0,"incomplete":0,"locations":0,"passages":0,"related":3},"batteries":{"complete":1,"incomplete":0,"locations":1,"passages":1,"related":0},"formal-conjectures":{"complete":4,"incomplete":2,"locations":6,"passages":4,"related":1},"lean-core":{"complete":29,"incomplete":0,"locations":29,"passages":24,"related":4},"mathlib":{"complete":91,"incomplete":0,"locations":91,"passages":66,"related":34},"tauceti":{"complete":0,"incomplete":0,"locations":0,"passages":0,"related":2}},"by_prominence":{"central":{"by_status":{"formalized":18,"not_formalized":15,"partial":19,"statement_only":0,"unresolved":1},"passages":53},"subject":{"by_status":{"formalized":0,"not_formalized":0,"partial":0,"statement_only":0,"unresolved":1},"passages":1},"supporting":{"by_status":{"formalized":35,"not_formalized":56,"partial":6,"statement_only":0,"unresolved":6},"passages":103}},"by_proof_status":{"definition":30,"proved":139,"statement_only":2},"by_relation":{"broadMatch":58,"exactMatch":10,"hasPart":28,"narrowMatch":31,"relatedMatch":44},"by_status":{"formalized":53,"not_formalized":71,"partial":25,"statement_only":0,"unresolved":8},"locations":127,"passages":157,"related":44},"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":"Elementary algebra","universe":{"frozen":"2026-10-17","id":"u1","libraries":48,"sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"wikidata":"Q211294"}
