{"assessment":{"class":"C","importance":"high"},"audit":{"blind":true,"ended":"2026-11-03T02:10:43.537Z","figures":[{"ci95":[0.4891,0.9935],"drawn":36,"id":"primary","label":"Strong links (exact, close or broad match) on supporting passages that have exactly the right relation","n_eff":5.1,"population":1029,"share":0.9234,"weights":"relation and library"},{"ci95":[0.3979,0.9202],"drawn":48,"id":"S2","label":"Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation","n_eff":8.1,"population":1740,"share":0.734,"weights":"relation and library"},{"ci95":[0.7268,0.9357],"drawn":44,"id":"CS","label":"Central and subject passages whose formalization status is right","n_eff":42.0,"population":1905,"share":0.8615,"weights":"recorded status"},{"ci95":[0.2519,0.8658],"drawn":12,"id":"S3","label":"'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it)","n_eff":6.1,"population":1236,"share":0.5957,"weights":"article"}],"independent":false,"items":224,"models":[{"model":"claude-opus-5-5","model_name":"Claude Opus 5.5"}],"operator":"jack","run_id":"tierA-batch1-audit","started":"2026-11-02T21:10:01.351Z"},"campaign":"run:loc-tierA-b1b+chal-tierA-b1","licence":{"mapping":"CC0-1.0","text":"CC-BY-SA-4.0"},"pageid":537048,"passages":[{"absence":null,"basis":"54c95dd3dae04258b2916feab7d116f1125bfde23dd6da8587793a6ec102daa9","coverage":null,"id":"enwiki-537048-1325039164::In-text #c4dad279","item":"In-text #c4dad279","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"low","declaration":"Polynomial.rootSet","end_line":578,"library":"mathlib","line":576,"location_key":"54c95dd3dae04258b2916feab7d116f1125bfde23dd6da8587793a6ec102daa9","module":"Mathlib.Algebra.Polynomial.Roots","note":"The declaration covers only polynomial equations over a commutative ring mapped into a domain, while the passage speaks of equations of every kind, including ones whose solutions are functions or sets.","pair_key":"d9fbcc46bbfe6a0be8f8be5b2b793ece6ca902948652407fab09d25691a528dc","path":"Mathlib/Algebra/Polynomial/Roots.lean","proof_status":"definition","rank":1,"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":"19e4089dd13392df429234d1de3e57d9692329d34fd70075f47e6423a77f0f97","prominence":"subject","quote":{"exact":"In mathematics, to solve an equation is to find the solutions of"},"quote_capped":true,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"In mathematics, to solve an equation is to find the solutions of an equation, which are the values (numbers, functions, sets, etc.) that fulfill the condition stated by the equation, consisting generally of two expressions related by an equals sign.","segments":[{"text":"In mathematics, to solve an equation is to find the solutions of an equation, which are the values (numbers, functions, sets, etc.) that fulfill the condition stated by the equation, consisting generally of two expressions related by an equals sign."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"6416e7298dd060b51b7de0e9ef421073b38f35901cfb39745622430b71fe5449"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #0d5c3b47","item":"In-text #0d5c3b47","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e9a11f90481f8af1494feac7064f4934e8a46399c78d31e62363d558bd45e546","prominence":"central","quote":{"exact":"When seeking a solution, one or more variables are designated as unknowns."},"quote_capped":false,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"When seeking a solution, one or more variables are designated as unknowns.","segments":[{"text":"When seeking a solution, one or more variables are designated as unknowns."}]},"unresolved":null},{"absence":null,"basis":"5cfe434a190f02931a55e61ee3751dd20bb4800ac3d47589336b2891a8829c04","coverage":null,"id":"enwiki-537048-1325039164::In-text #0e9a1859","item":"In-text #0e9a1859","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polynomial.IsRoot","end_line":351,"library":"mathlib","line":350,"location_key":"5cfe434a190f02931a55e61ee3751dd20bb4800ac3d47589336b2891a8829c04","module":"Mathlib.Algebra.Polynomial.Eval.Defs","note":"The declaration fixes the equation to a univariate polynomial one and the assignment to a single value, where the passage allows an equation of any kind and an assignment to several unknowns.","pair_key":"2425a85914e749b0b076a2d6762254b18b4b7e92656df27826922539ea348453","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}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"41797a8dee388b52c895b8ee56446012240d9a1604668e186b4a9538ddbe3b4e","prominence":"central","quote":{"exact":"A solution is an assignment of values to the unknown variables that"},"quote_capped":true,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"A solution is an assignment of values to the unknown variables that makes the equality in the equation true.","segments":[{"text":"A solution is an assignment of values to the unknown variables that makes the equality in the equation true."}]},"unresolved":null},{"absence":null,"basis":"0d62eaaf902b6eab3d75a8f09f4e8882c74f6e36e074ccac8521920982b971f1","coverage":null,"id":"enwiki-537048-1325039164::In-text #64a96995","item":"In-text #64a96995","kind":"definition","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"WeierstrassCurve.Affine.Equation","end_line":150,"library":"mathlib","line":149,"location_key":"0d62eaaf902b6eab3d75a8f09f4e8882c74f6e36e074ccac8521920982b971f1","module":"Mathlib.AlgebraicGeometry.EllipticCurve.Affine.Basic","note":"The declaration fixes one family of equations in two unknowns, where the passage speaks of an arbitrary equation with any number of unknowns.","pair_key":"68ccee052633007e7a53e88579371dd796059dc4d42771f05106c2230790d907","path":"Mathlib/AlgebraicGeometry/EllipticCurve/Affine/Basic.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def WeierstrassCurve.Affine.Equation {R : Type r} [CommRing R] : WeierstrassCurve.Affine R → R → R → Prop"},"statement":true},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polynomial.IsRoot","end_line":351,"library":"mathlib","line":350,"location_key":"19671d33c718059fdfed809f30184768ee6acd507bb6c858fe8381e10a58d8d9","module":"Mathlib.Algebra.Polynomial.Eval.Defs","note":"This covers only the one-unknown case of the passage, where a solution is a single value rather than a tuple.","pair_key":"c504f922eed778ba3d8439d020e314e45fe3900f82078be41304c1face361f22","path":"Mathlib/Algebra/Polynomial/Eval/Defs.lean","proof_status":"definition","rank":2,"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}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f85f943ae25468a9caf75384eb20a5c0e47b13528897d7bf8b1308895f57cf88","prominence":"supporting","quote":{"exact":"In other words, a solution is a value or a collection of"},"quote_capped":true,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"In other words, a solution is a value or a collection of values (one for each unknown) such that, when substituted for the unknowns, the equation becomes an equality.","segments":[{"text":"In other words, a solution is a value or a collection of values (one for each unknown) such that, when substituted for the unknowns, the equation becomes an equality."}]},"unresolved":null},{"absence":null,"basis":"1ebc7c451708219a0e16313bd88e2b71a4cbdf366debcbccee918e27e71f4e2e","coverage":null,"id":"enwiki-537048-1325039164::In-text #a0f68b4c","item":"In-text #a0f68b4c","kind":"definition","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polynomial.IsRoot","end_line":351,"library":"mathlib","line":350,"location_key":"1ebc7c451708219a0e16313bd88e2b71a4cbdf366debcbccee918e27e71f4e2e","module":"Mathlib.Algebra.Polynomial.Eval.Defs","note":"The declaration carries the naming only for polynomial equations, which the passage singles out while allowing the word elsewhere too; its docstring states that evaluation at a root is zero.","pair_key":"72aa489d9c99e0ee79d449f551e1b61300baf31fa186a813b405a0cfdd013ef2","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}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"4ec954b1c9f2c941bdf05522ffbbd05f014ceb5f9939a2df52ff2dd453a3bcea","prominence":"supporting","quote":{"exact":"A solution of an equation is often called a root of the"},"quote_capped":true,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"A solution of an equation is often called a root of the equation, particularly but not only for polynomial equations.","segments":[{"text":"A solution of an equation is often called a root of the equation, particularly but not only for polynomial equations."}]},"unresolved":null},{"absence":null,"basis":"990346951a51d93568781bd52977841daae7b3f52004f0d7923a0daa0a8408bf","coverage":null,"id":"enwiki-537048-1325039164::In-text #f07719d2","item":"In-text #f07719d2","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polynomial.rootSet","end_line":578,"library":"mathlib","line":576,"location_key":"990346951a51d93568781bd52977841daae7b3f52004f0d7923a0daa0a8408bf","module":"Mathlib.Algebra.Polynomial.Roots","note":"The declaration builds the set of solutions only for a polynomial equation into a domain, where the passage speaks of any equation whatsoever.","pair_key":"4106f91adb6cf2716f3e7980c3206ed3b02bb17c154b709b27e0f09b9a6f97eb","path":"Mathlib/Algebra/Polynomial/Roots.lean","proof_status":"definition","rank":1,"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":"97939d300e098d168618085fd58c0f5997e92e21874bb14cb2e8a61869318ad0","prominence":"central","quote":{"exact":"The set of all solutions of an equation is its solution set."},"quote_capped":false,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"The set of all solutions of an equation is its solution set.","segments":[{"text":"The set of all solutions of an equation is its solution set."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"51de03f76196a56fc6af38d700c60284373cabfeb39d9913b06ebb44b9f75135"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #44c1610d","item":"In-text #44c1610d","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"0841f9c0231105999bf46941b0006c64f5ef53f345e0c0bd8c9448b4cce9e9e8","prominence":"central","quote":{"exact":"Solving an equation numerically means that only numbers are admitted as solutions."},"quote_capped":false,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"Solving an equation numerically means that only numbers are admitted as solutions.","segments":[{"text":"Solving an equation numerically means that only numbers are admitted as solutions."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"9cf645c7b929145264d268ab918fb3ad6106e892d2c3afd2fede5e6381d613ff"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #81b4f77b","item":"In-text #81b4f77b","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"4cb84eb4d3a1b46333a2a17d20233106fa0fe03775d292ae5ec7d61250f8bd57","prominence":"supporting","quote":{"exact":"Solving an equation symbolically means that expressions can be used for representing"},"quote_capped":true,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"Solving an equation symbolically means that expressions can be used for representing the solutions.","segments":[{"text":"Solving an equation symbolically means that expressions can be used for representing the solutions."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"8f59317c3561f8b884049411afff21d6ad5d63640515f37a744b8720b14b8eb2"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #bd3a08ae","item":"In-text #bd3a08ae","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"ae2e0a754e2ea51f7f8c83efa715d3e555628661bd0c780b619fc0b0bcc2f28f","prominence":"supporting","quote":{"exact":"For example, the equation x + y = 2x – 1 is"},"quote_capped":true,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"after":{"layer":", because substituting y + 1 for x in the equation results in (y + 1) + y = 2(y + 1) – 1, a true statement.","segments":[{"text":", because substituting y + 1 for x in the equation results in (y + 1) + y = 2(y + 1) – 1, a true statement."}]},"layer":"For example, the equation x + y = 2x – 1 is solved for the unknown x by the expression x = y + 1","segments":[{"text":"For example, the equation x + y = 2x – 1 is solved for the unknown x by the expression x = y + 1"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"dc01c3afa035d7922624193ddd74a9c5343db9c5ba6f8ad6fdbd15d2f137ee73"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #4e299c0a","item":"In-text #4e299c0a","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"6cc28c86f6763688b0d4bb257e5501add2531ff7ecc6cd427954d52f7dc0b6cf","prominence":"supporting","quote":{"exact":"substituting y + 1 for x in the equation results in (y"},"quote_capped":true,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"before":{"layer":"For example, the equation x + y = 2x – 1 is solved for the unknown x by the expression x = y + 1, because ","segments":[{"text":"For example, the equation x + y = 2x – 1 is solved for the unknown x by the expression x = y + 1, because "}]},"layer":"substituting y + 1 for x in the equation results in (y + 1) + y = 2(y + 1) – 1, a true statement.","segments":[{"text":"substituting y + 1 for x in the equation results in (y + 1) + y = 2(y + 1) – 1, a true statement."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"15910cc8235e12f32e2620eadf017a030ed21b541a1c5ff1f29c31df9b6548e0"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #3e9371d1","item":"In-text #3e9371d1","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"953c84f7cef22c5172725130044eb16ebdf38f9f8d28c2cc32cfa3a65b683611","prominence":"supporting","quote":{"exact":"It is also possible to take the variable y to be the"},"quote_capped":true,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"It is also possible to take the variable y to be the unknown, and then the equation is solved by y = x – 1.","segments":[{"text":"It is also possible to take the variable y to be the unknown, and then the equation is solved by y = x – 1."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"6b1502ad5ed1ddc37127ea6fa0adb13b2358cb6ec0d821f037642bb88ca5e2cc"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #656e37f3","item":"In-text #656e37f3","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"5ea89e9d9d0b34298cd5c206269e84bce6720af0cdca7912a30b818b83424ff4","prominence":"supporting","quote":{"exact":"Or x and y can both be treated as unknowns, and then"},"quote_capped":true,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"after":{"layer":"; a symbolic solution is (x, y) = (a + 1, a), where the variable a may take any value.","segments":[{"text":"; a symbolic solution is (x, y) = (a + 1, a), where the variable a may take any value."}]},"layer":"Or x and y can both be treated as unknowns, and then there are many solutions to the equation","segments":[{"text":"Or x and y can both be treated as unknowns, and then there are many solutions to the equation"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"a2f73a37e89e15c39f16cee22962acbd315be9b3981d4eafdd279e6c13ba273e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #9ac8cd6a","item":"In-text #9ac8cd6a","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"7a8a475924f6d7098ba6d4d1840e1ab84b1a1855b66eb782f63ec95852a5c651","prominence":"supporting","quote":{"exact":"a symbolic solution is (x, y) = (a + 1, a), where"},"quote_capped":true,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"before":{"layer":"Or x and y can both be treated as unknowns, and then there are many solutions to the equation; ","segments":[{"text":"Or x and y can both be treated as unknowns, and then there are many solutions to the equation; "}]},"layer":"a symbolic solution is (x, y) = (a + 1, a), where the variable a may take any value.","segments":[{"text":"a symbolic solution is (x, y) = (a + 1, a), where the variable a may take any value."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"69f144fff1d03a58b1cc206e045bb85f36d5022c8acfedd146115c4fab979eb2"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #7f597ef8","item":"In-text #7f597ef8","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e02a2fe76038f33220cc5dc44bb2a6b0f2b8c8ece60e450582a339bb8fd34d42","prominence":"supporting","quote":{"exact":"Instantiating a symbolic solution with specific numbers gives a numerical solution"},"quote_capped":false,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"after":{"layer":"; for example, a = 0 gives (x, y) = (1, 0) (that is, x = 1, y = 0), and a = 1 gives (x, y) = (2, 1).","segments":[{"text":"; for example, a = 0 gives (x, y) = (1, 0) (that is, x = 1, y = 0), and a = 1 gives (x, y) = (2, 1)."}]},"layer":"Instantiating a symbolic solution with specific numbers gives a numerical solution","segments":[{"text":"Instantiating a symbolic solution with specific numbers gives a numerical solution"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"c76a8b5330ec8eec9ba0fd4d517b2149f640a5ebae5039bec592444abe5f5177"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #2f0a10b4","item":"In-text #2f0a10b4","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"317953c960e8ebcbd1a9a675ebf13d71e7a2fddb5d65d1aa9c0028c38a2342a0","prominence":"supporting","quote":{"exact":"for example, a = 0 gives (x, y) = (1, 0) (that"},"quote_capped":true,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"after":{"layer":", and a = 1 gives (x, y) = (2, 1).","segments":[{"text":", and a = 1 gives (x, y) = (2, 1)."}]},"before":{"layer":"Instantiating a symbolic solution with specific numbers gives a numerical solution; ","segments":[{"text":"Instantiating a symbolic solution with specific numbers gives a numerical solution; "}]},"layer":"for example, a = 0 gives (x, y) = (1, 0) (that is, x = 1, y = 0)","segments":[{"text":"for example, a = 0 gives (x, y) = (1, 0) (that is, x = 1, y = 0)"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"9a2f47a958e308a8403f50795372b5877818b6a5e9984e8e1a94a145f77b5557"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #82fc62e6","item":"In-text #82fc62e6","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"b20a5c0ee58130ab5ed0cdfffad11bb326d5d14b85c4558dba510cf2d2f310e2","prominence":"supporting","quote":{"exact":"a = 1 gives (x, y) = (2, 1)."},"quote_capped":false,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"before":{"layer":"Instantiating a symbolic solution with specific numbers gives a numerical solution; for example, a = 0 gives (x, y) = (1, 0) (that is, x = 1, y = 0), and ","segments":[{"text":"Instantiating a symbolic solution with specific numbers gives a numerical solution; for example, a = 0 gives (x, y) = (1, 0) (that is, x = 1, y = 0), and "}]},"layer":"a = 1 gives (x, y) = (2, 1).","segments":[{"text":"a = 1 gives (x, y) = (2, 1)."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #6f4bb605","item":"In-text #6f4bb605","kind":"notation","locations":[],"outcome":"unresolved","passage_ends_in_suffix":false,"passage_key":"9a3b1fe6417171b680d126ad12af851036485a0b27b036ec6ba7a5eae3397826","prominence":"supporting","quote":{"exact":"However, it is common to reserve x, y, z, ... to denote"},"quote_capped":true,"section":[],"status":null,"subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"However, it is common to reserve x, y, z, ... to denote the unknowns, and to use a, b, c, ... to denote the known variables, which are often called parameters.","segments":[{"text":"However, it is common to reserve x, y, z, ... to denote the unknowns, and to use a, b, c, ... to denote the known variables, which are often called parameters."}]},"unresolved":{"challenge":"sampled_out"}},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"8c52546704a7f8a51080c3e0d1573b49a85cd95957585b2356f84acd8280826c"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #771d4e7e","item":"In-text #771d4e7e","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"f396cac41cf0ec598d03296162fa21e04b1ef311cc976fd70d88dcbc7f60e086","prominence":"supporting","quote":{"exact":"When the task is to find the solution that is the best"},"quote_capped":true,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"When the task is to find the solution that is the best under some criterion, this is an optimization problem.","segments":[{"text":"When the task is to find the solution that is the best under some criterion, this is an optimization problem."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"c32538b92b4e14dda0f3682e60086380a6c5e3f5d7950a4e99fbbe1cb4fb9d28"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #6ab5d09b","item":"In-text #6ab5d09b","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"c134eafa2d28dca5a6505c9cdfd4a4f958698bd198aa69d2edbc23317dbff577","prominence":"central","quote":{"exact":"One general form of an equation is f ( x 1 ,"},"quote_capped":true,"section":["Overview"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"One general form of an equation is f ( x 1 , … , x n ) = c , {\\displaystyle f\\left(x_{1},\\dots ,x_{n}\\right)=c,} where f is a function, x1, ..., xn are the unknowns, and c is a constant.","segments":[{"text":"One general form of an equation is "},{"tex":"f\\left(x_{1},\\dots ,x_{n}\\right)=c,"},{"text":" where f is a function, x1, ..., xn are the unknowns, and c is a constant."}]},"unresolved":null},{"absence":null,"basis":"52b494d437465ab396a0365bccae882d57e3019a16b6d6d0e6bbd0bde21358cb","coverage":null,"id":"enwiki-537048-1325039164::In-text #e64baceb","item":"In-text #e64baceb","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.mem_preimage","end_line":140,"library":"mathlib","line":140,"location_key":"52b494d437465ab396a0365bccae882d57e3019a16b6d6d0e6bbd0bde21358cb","module":"Mathlib.Data.Set.Operations","note":"Mathlib writes the fiber over c as the preimage of the one-point set holding c, and lying in that one-point set is the equation f a = c in another encoding (PD10), so nothing beyond the passage's own content is being asserted.","pair_key":"a196eadf47429f391ec628aac4574481206b814318595b95a12d22d3f7efb3ba","path":"Mathlib/Data/Set/Operations.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.mem_preimage {α : Type u} {β : Type v} {f : α → β} {s : Set β} {a : α} : a ∈ f ⁻¹' s ↔ f a ∈ s"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"9c799024cf8ea2e0c585cf3d9196a750516dcf6150cb9338f2cb77e4fbd8aa44","prominence":"central","quote":{"exact":"Its solutions are the elements of the inverse image (fiber) f −"},"quote_capped":true,"section":["Overview"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"Its solutions are the elements of the inverse image (fiber) f − 1 ( c ) = { ( a 1 , … , a n ) ∈ D ∣ f ( a 1 , … , a n ) = c } , {\\displaystyle f^{-1}(c)={\\bigl \\{}(a_{1},\\dots ,a_{n})\\in D\\mid f\\left(a_{1},\\dots ,a_{n}\\right)=c{\\bigr \\}},} where D is the domain of the function f.","segments":[{"text":"Its solutions are the elements of the inverse image (fiber) "},{"tex":"f^{-1}(c)={\\bigl \\{}(a_{1},\\dots ,a_{n})\\in D\\mid f\\left(a_{1},\\dots ,a_{n}\\right)=c{\\bigr \\}},"},{"text":" where D is the domain of the function f."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"beca08fbab6a6e8cc5edefd78c65e16ce3fa050fcce5d4ef22a67af4330f6004"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #318ccc14","item":"In-text #318ccc14","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"ab5023576c4af560b2831d998b40de62fde78a519af0e250a69065969f8404a8","prominence":"supporting","quote":{"exact":"The set of solutions can be the empty set (there are no"},"quote_capped":true,"section":["Overview"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"The set of solutions can be the empty set (there are no solutions), a singleton (there is exactly one solution), finite, or infinite (there are infinitely many solutions).","segments":[{"text":"The set of solutions can be the empty set (there are no solutions), a singleton (there is exactly one solution), finite, or infinite (there are infinitely many solutions)."}]},"unresolved":null},{"absence":null,"basis":"3f0c9b809c847d5ab33526cf6a160e90bacd90d41f815f1fd52f5e573d9e771a","coverage":null,"id":"enwiki-537048-1325039164::In-text #66045a2b","item":"In-text #66045a2b","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"sub_eq_zero","end_line":754,"library":"mathlib","line":754,"location_key":"3f0c9b809c847d5ab33526cf6a160e90bacd90d41f815f1fd52f5e573d9e771a","module":"Mathlib.Algebra.Group.Basic","note":"The declaration is the two-way link between an equation and the form got by taking one side over to the other, stated for an arbitrary additive group rather than for this one equation.","pair_key":"14f520dbfdf33f757559568ce377553c89214c20f49df301255470bdba63b601","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_eq_zero {G : Type*} [AddGroup G] {a b : G} : a - b = 0 ↔ a = b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"5a9a02b9e1f9909fdd5f6dda78ee537c77b927e35d1f2be598eaa762007bf84c","prominence":"supporting","quote":{"exact":"For example, an equation such as 3 x + 2 y ="},"quote_capped":true,"section":["Overview"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"For example, an equation such as 3 x + 2 y = 21 z , {\\displaystyle 3x+2y=21z,} with unknowns x, y and z, can be put in the above form by subtracting 21z from both sides of the equation, to obtain 3 x + 2 y − 21 z = 0 {\\displaystyle 3x+2y-21z=0}","segments":[{"text":"For example, an equation such as "},{"tex":"3x+2y=21z,"},{"text":" with unknowns x, y and z, can be put in the above form by subtracting 21z from both sides of the equation, to obtain "},{"tex":"3x+2y-21z=0"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"f932b995fe6480ea72dc5ab9f4bf084def40e695bf3749d158b589cb5a34f2fb"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #831efcf6","item":"In-text #831efcf6","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"1d3b67f0377d5300ebd2fcef0e5eba49c0d7c5852d139be97173a7ec884fff52","prominence":"supporting","quote":{"exact":"In this particular case there is not just one solution, but an"},"quote_capped":true,"section":["Overview"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"In this particular case there is not just one solution, but an infinite set of solutions, which can be written using set builder notation as { ( x , y , z ) ∣ 3 x + 2 y − 21 z = 0 } . {\\displaystyle {\\bigl \\{}(x,y,z)\\mid 3x+2y-21z=0{\\bigr \\}}.}","segments":[{"text":"In this particular case there is not just one solution, but an infinite set of solutions, which can be written using set builder notation as "},{"tex":"{\\bigl \\{}(x,y,z)\\mid 3x+2y-21z=0{\\bigr \\}}."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"d1aa2a39398b89f6e06d535fcb3e0663598a1d6039ae5340689668d8b91b341c"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #23db3644","item":"In-text #23db3644","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"9cd7f52dcf084fd100302849fd29e691592397297afe98c05cf789ccdbd781e2","prominence":"supporting","quote":{"exact":"One particular solution is x = 0, y = 0, z ="},"quote_capped":true,"section":["Overview"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"One particular solution is x = 0, y = 0, z = 0.","segments":[{"text":"One particular solution is x = 0, y = 0, z = 0."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":5,"sha256":"9bdc9458d91d30a80ebf71a800715a7206967b9a79994255ddeab0fbd6a8a68a"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #e58c78fe","item":"In-text #e58c78fe","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"d768ea897fd23f8a0f9ff09fabe22ae8d5891d2830f942309e13762de121490f","prominence":"supporting","quote":{"exact":"Two other solutions are x = 3, y = 6, z ="},"quote_capped":true,"section":["Overview"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"Two other solutions are x = 3, y = 6, z = 1, and x = 8, y = 9, z = 2.","segments":[{"text":"Two other solutions are x = 3, y = 6, z = 1, and x = 8, y = 9, z = 2."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":5,"sha256":"e19e8e5a5b18ce489b45d561513e916a5c5c9b6f3487b8fc5232dffed2593c03"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #5e74eaf3","item":"In-text #5e74eaf3","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"coplanar_triple","end_line":905,"library":"mathlib","line":904,"location_key":"8daed90d3c631182154be7a6b379d3eec288c8f6b2f5f62564ebf5724bf5e862","module":"Mathlib.LinearAlgebra.AffineSpace.FiniteDimensional","note":"The declaration bounds the rank of the span of any three points by two; it hands over no two-dimensional affine subspace containing them.","pair_key":"b8fed1b99778a2269429aab93e1021c122cd5594bfd13064a90e50750e6d76d9","path":"Mathlib/LinearAlgebra/AffineSpace/FiniteDimensional.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem coplanar_triple (k : Type*) {V : Type*} {P : Type*} [DivisionRing k] [AddCommGroup V] [_root_.Module k V] [AddTorsor V P] (p₁ p₂ p₃ : P) : Coplanar k {p₁, p₂, p₃}"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"AffineIndependent.finrank_vectorSpan","end_line":176,"library":"mathlib","line":171,"location_key":"5be7715f79a6c2adb8091a0600ecffbee541b23b368ae46782bb4f0d7ad748ba","module":"Mathlib.LinearAlgebra.AffineSpace.FiniteDimensional","note":"It computes the rank of the span of affinely independent points; the article's claim about a plane through the points is a further step from that number.","pair_key":"2704d5de508256d447928580df1909cd31974904938038432d733cc6cbe81d45","path":"Mathlib/LinearAlgebra/AffineSpace/FiniteDimensional.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem AffineIndependent.finrank_vectorSpan {k : Type*} {V : Type*} {P : Type*} {ι : Type*} [DivisionRing k] [AddCommGroup V] [_root_.Module k V] [AddTorsor V P] [Fintype ι] {p : ι → P} : AffineIndependent k p → ∀ {n : ℕ}, Fintype.card ι = n + 1 → Module.finrank k ↥(vectorSpan k (Set.range p)) = n"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"f1909d6044de174926d4c25a484a241bbfd4826b54d1835d4555d0c4644b6aa1","prominence":"supporting","quote":{"exact":"There is a unique plane in three-dimensional space which passes through the"},"quote_capped":true,"section":["Overview"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"after":{"layer":", and this plane is the set of all points whose coordinates are solutions of the equation.","segments":[{"text":", and this plane is the set of all points whose coordinates are solutions of the equation."}]},"layer":"There is a unique plane in three-dimensional space which passes through the three points with these coordinates","segments":[{"text":"There is a unique plane in three-dimensional space which passes through the three points with these coordinates"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"e1d843e5b1552038dc03381e32383ede29bfb6bf7771ffd30dbcfa5898cbaf64"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #679e9922","item":"In-text #679e9922","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"a340c77d9375c329b6f8f61617e703947fad956759af67a536b8ecce34b847f0","prominence":"supporting","quote":{"exact":"this plane is the set of all points whose coordinates are solutions"},"quote_capped":true,"section":["Overview"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"before":{"layer":"There is a unique plane in three-dimensional space which passes through the three points with these coordinates, and ","segments":[{"text":"There is a unique plane in three-dimensional space which passes through the three points with these coordinates, and "}]},"layer":"this plane is the set of all points whose coordinates are solutions of the equation.","segments":[{"text":"this plane is the set of all points whose coordinates are solutions of the equation."}]},"unresolved":null},{"absence":null,"basis":"31e53784d47fb0918a12132e020bbac1af5e7177d6f3e804d4311420623a4a09","coverage":null,"id":"enwiki-537048-1325039164::In-text #4d8338d1","item":"In-text #4d8338d1","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MvPolynomial.zeroLocus","end_line":40,"library":"mathlib","line":39,"location_key":"31e53784d47fb0918a12132e020bbac1af5e7177d6f3e804d4311420623a4a09","module":"Mathlib.RingTheory.Nullstellensatz","note":"The library object is the article's notion restricted to systems of polynomial equations over a field, with no inequalities among them.","pair_key":"4fa23574ad301bc078adcbf019089b034c50c9b95272d8f9c3d912bc2ff61cdb","path":"Mathlib/RingTheory/Nullstellensatz.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def MvPolynomial.zeroLocus {k : Type*} (K : Type*) [Field k] [Field K] [Algebra k K] {σ : Type*} : Ideal (MvPolynomial σ k) → Set (σ → K)"},"statement":false},{"challenge":"survived","commit":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63","confidence":"medium","declaration":"MvPolynomial.ZariskiSpace.zeroLocus","end_line":90,"library":"ff-multivariate-polynomials","line":89,"location_key":"25b8b140c7bd3b0ac026938f2bfa00745531ec7115642cbbb3254cf18b7ec048","module":"MultivariatePolynomials.ZariskiTopology","note":"Same restriction as the Mathlib object, carried over a type synonym for the space of points, and again with no inequalities.","pair_key":"0c70d962c3955cf4876fa895e9ae36f06083988b418bb502933f82b33ce4978c","path":"MultivariatePolynomials/ZariskiTopology.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/FormalFrontier/multivariate-polynomials","signature":{"elided":false,"text":"def MvPolynomial.ZariskiSpace.zeroLocus {K : Type u} {σ : Type v} [Field K] : Ideal (MvPolynomial σ K) → Set (MvPolynomial.ZariskiSpace K σ)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"011235a0c241e1a16c8cbe33edeb1aeb1cf881b3f0326c80bdd7dd3b24751cb9","prominence":"central","quote":{"exact":"The solution set of a given set of equations or inequalities is"},"quote_capped":true,"section":["Solution sets"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"The solution set of a given set of equations or inequalities is the set of all its solutions, a solution being a tuple of values, one for each unknown, that satisfies all the equations or inequalities.","segments":[{"text":"The solution set of a given set of equations or inequalities is the set of all its solutions, a solution being a tuple of values, one for each unknown, that satisfies all the equations or inequalities."}]},"unresolved":null},{"absence":null,"basis":"8878ef66babddb8ae78342a1d4db8184adf1998842fb605687b3fd24f58500f1","coverage":null,"id":"enwiki-537048-1325039164::In-text #0e78037e","item":"In-text #0e78037e","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.eq_empty_iff_forall_notMem","end_line":461,"library":"mathlib","line":460,"location_key":"8878ef66babddb8ae78342a1d4db8184adf1998842fb605687b3fd24f58500f1","module":"Mathlib.Data.Set.Basic","note":"Stated for any set at all; belonging to the solution set means by definition that the tuple satisfies every equation and inequality of the system.","pair_key":"59c907fc60ea5f5acdb5f1185694aa48884101fd45a8b80549c6031074939e63","path":"Mathlib/Data/Set/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.eq_empty_iff_forall_notMem {α : Type u} {s : Set α} : s = ∅ ↔ ∀ (x : α), x ∉ s"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6f454d4ee3304652137a1b179ec815ad6ac8b69839eb49e9265c1855fb524836","prominence":"supporting","quote":{"exact":"If the solution set is empty, then there are no values of"},"quote_capped":true,"section":["Solution sets"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"If the solution set is empty, then there are no values of the unknowns that satisfy simultaneously all equations and inequalities.","segments":[{"text":"If the solution set is empty, then there are no values of the unknowns that satisfy simultaneously all equations and inequalities."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"55ccd99a7a1279975ef2be4510a9653ab13dde8ffa0e97fef6d4c3e0c0fabe9a"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #38257cd9","item":"In-text #38257cd9","kind":"definition","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Dioph","end_line":246,"library":"mathlib","line":245,"location_key":"e3d0753d20903f3bf7bb8351c8bfa2cd50a389acf0783b9f78c6db4eb97093bf","module":"Mathlib.NumberTheory.Dioph","note":"It says when a set of natural-number tuples is the projection of the solutions of a polynomial equation, a property of sets rather than a reading of an equation.","pair_key":"18200b0568a52f7c7fe99f8425252486a061af3d137caf9ba1aa59eeba8add11","path":"Mathlib/NumberTheory/Dioph.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Dioph {α : Type u} : Set (α → ℕ) → Prop"},"statement":true}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"863baf39fb3b35ccdfad36e324e1e2772875d5a366a4322bfd5539774cd6e2de","prominence":"supporting","quote":{"exact":"This equation can be viewed as a Diophantine equation, that is, an"},"quote_capped":true,"section":["Solution sets"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"This equation can be viewed as a Diophantine equation, that is, an equation for which only integer solutions are sought.","segments":[{"text":"This equation can be viewed as a Diophantine equation, that is, an equation for which only integer solutions are sought."}]},"unresolved":null},{"absence":null,"basis":"3e0b4a8e37fddbf60d57b5f95e357487a9c07be2049183e661d67c63784d3fdd","coverage":null,"id":"enwiki-537048-1325039164::In-text #4be1bc59","item":"In-text #4be1bc59","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Prime.not_isSquare","end_line":149,"library":"mathlib","line":148,"location_key":"3e0b4a8e37fddbf60d57b5f95e357487a9c07be2049183e661d67c63784d3fdd","module":"Mathlib.Algebra.Prime.Lemmas","note":"Lean writes the property of being a square where the article writes the equation with an unknown squared; the carrier here is the integers.","pair_key":"808fd1f22d06d8aceda648b9c4aa000323b5f2b364584fb3e2f40a2d3ad535f7","path":"Mathlib/Algebra/Prime/Lemmas.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Prime.not_isSquare {M : Type*} [CommMonoidWithZero M] [IsCancelMulZero M] {p : M} : Prime p → ¬IsSquare p"},"statement":false},{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"not_isSquare_intCast_of_squarefree_of_ne_one","end_line":99,"library":"tauceti","line":94,"location_key":"3cd1a5498bf57da1c2e8c34abcc776bbce46417baf572add5bba63ca8aebd527","module":"TauCeti.Algebra.Squarefree","note":"It denies that a squarefree integer is a square among the rationals, so the integer claim comes only by transporting along the cast.","pair_key":"80e296736035179e5ca771ad009a8944e74d17a849aa71fb00bea90e910ddd09","path":"TauCeti/Algebra/Squarefree.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem not_isSquare_intCast_of_squarefree_of_ne_one {n : ℤ} : Squarefree n → n ≠ 1 → ¬IsSquare ↑n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"beac4e87657fd375d5335e59f767fd4bd4e2f04956676b0030d1381c2db57109","prominence":"supporting","quote":{"exact":"In this case, the solution set is the empty set"},"quote_capped":false,"section":["Solution sets"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"after":{"layer":", since 2 is not the square of an integer.","segments":[{"text":", since 2 is not the square of an integer."}]},"layer":"In this case, the solution set is the empty set","segments":[{"text":"In this case, the solution set is the empty set"}]},"unresolved":null},{"absence":null,"basis":"06b12955aa15e33e0ff45d80f0963adc056461de888de19dfb992c5eda7ab794","coverage":null,"id":"enwiki-537048-1325039164::In-text #8489f391","item":"In-text #8489f391","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Prime.not_isSquare","end_line":149,"library":"mathlib","line":148,"location_key":"06b12955aa15e33e0ff45d80f0963adc056461de888de19dfb992c5eda7ab794","module":"Mathlib.Algebra.Prime.Lemmas","note":"The carrier is the integers here, and Lean's property of being a square is the article's being the square of some integer.","pair_key":"65f55fc8a872bef0bbbe808bfa67c15d7336e4cba710ec94042c513e875576a1","path":"Mathlib/Algebra/Prime/Lemmas.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Prime.not_isSquare {M : Type*} [CommMonoidWithZero M] [IsCancelMulZero M] {p : M} : Prime p → ¬IsSquare p"},"statement":false},{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"not_isSquare_intCast_of_squarefree_of_ne_one","end_line":99,"library":"tauceti","line":94,"location_key":"079bd049c2ccef8eca6c71ace496c11bc2b9c63ab3fba4c9fd3dc88f7fb52697","module":"TauCeti.Algebra.Squarefree","note":"Its conclusion lives in the rationals, so reaching the article's integer claim takes a lemma carrying squares along the cast.","pair_key":"bac5e635e00f8cd1b224c54079710fa2067ff91d7d57236592840b5e13bc0a66","path":"TauCeti/Algebra/Squarefree.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem not_isSquare_intCast_of_squarefree_of_ne_one {n : ℤ} : Squarefree n → n ≠ 1 → ¬IsSquare ↑n"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"irrational_sqrt_two","end_line":142,"library":"mathlib","line":141,"location_key":"c46c225fc1cb9160912450f082741442f09bf83b3a6a67b5afdb00b89215f64a","module":"Mathlib.NumberTheory.Real.Irrational","note":"It states that the real square root of 2 is irrational, a statement about reals rather than about integers being squares.","pair_key":"baaffbf8d91609be11ce680cca940d82a84e3185ef341488a6cb061de0257434","path":"Mathlib/NumberTheory/Real/Irrational.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem irrational_sqrt_two : Irrational √2"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"30055a190ecc7406b2f32e27d51a9a4ee60a239a0ce626ba9e3f46148b1e4896","prominence":"supporting","quote":{"exact":"2 is not the square of an integer."},"quote_capped":false,"section":["Solution sets"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"before":{"layer":"In this case, the solution set is the empty set, since ","segments":[{"text":"In this case, the solution set is the empty set, since "}]},"layer":"2 is not the square of an integer.","segments":[{"text":"2 is not the square of an integer."}]},"unresolved":null},{"absence":null,"basis":"8c20065759914b0d9cb2ae635ce52ac6f83e3ebba479b990f27e20fe97571610","coverage":null,"id":"enwiki-537048-1325039164::In-text #564e2166","item":"In-text #564e2166","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.sqrt_eq_iff_eq_sq","end_line":183,"library":"mathlib","line":182,"location_key":"8c20065759914b0d9cb2ae635ce52ac6f83e3ebba479b990f27e20fe97571610","module":"Mathlib.Analysis.Real.Sqrt","note":"The hypothesis of a nonnegative unknown restricts the equation to the half of the line where only one of the two roots lives, so the declaration gives that root and not the pair or its count.","pair_key":"420ca1202c228db483a7c4f58aa43af02c596024ab0ac80d262f84c15ded9741","path":"Mathlib/Analysis/Real/Sqrt.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.sqrt_eq_iff_eq_sq {x y : ℝ} : 0 ≤ x → 0 ≤ y → (√x = y ↔ x = y ^ 2)"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"sq_eq_sq_iff_eq_or_eq_neg","end_line":217,"library":"mathlib","line":216,"location_key":"f3a43f0f11fefef23c56fdcf36842f8d3c3b9cbb4976a30a8f21cf0eef6d1068","module":"Mathlib.Algebra.Ring.Commute","note":"It says only that two elements of a commutative domain with equal squares agree up to sign; turning that into the passage needs the named lemma that the square root of two squares to two, and the separate fact that this root is nonzero, so PD8 keeps the record related.","pair_key":"87a97a4cbaa2acad9d03719f4700b19e026e2add1bca177315d2793ecedcce29","path":"Mathlib/Algebra/Ring/Commute.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","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":"3dd48f64cad6b4f63aaddf074ce9396d1703971c76da4c38d536f608292cf68b","prominence":"supporting","quote":{"exact":"However, if one searches for real solutions, there are two solutions, √2"},"quote_capped":true,"section":["Solution sets"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"after":{"layer":"; in other words, the solution set is {√2, −√2}.","segments":[{"text":"; in other words, the solution set is {√2, −√2}."}]},"layer":"However, if one searches for real solutions, there are two solutions, √2 and –√2","segments":[{"text":"However, if one searches for real solutions, there are two solutions, √2 and –√2"}]},"unresolved":null},{"absence":null,"basis":"62758bfaa41db8b5baa8cf0222b52c8a4b0d51b10efecad0d474e6d9b91e5d16","coverage":null,"id":"enwiki-537048-1325039164::In-text #3cc3b5ac","item":"In-text #3cc3b5ac","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.sqrt_eq_iff_eq_sq","end_line":183,"library":"mathlib","line":182,"location_key":"62758bfaa41db8b5baa8cf0222b52c8a4b0d51b10efecad0d474e6d9b91e5d16","module":"Mathlib.Analysis.Real.Sqrt","note":"Restricted to nonnegative unknowns the declaration describes one member of the two-element set the passage writes down, and it says nothing about the negative member.","pair_key":"67dad85b57a81a73a220520ae39224211ce72522c7a726ce3d3954e30bb53a97","path":"Mathlib/Analysis/Real/Sqrt.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.sqrt_eq_iff_eq_sq {x y : ℝ} : 0 ≤ x → 0 ≤ y → (√x = y ↔ x = y ^ 2)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"sq_eq_sq_iff_eq_or_eq_neg","end_line":217,"library":"mathlib","line":216,"location_key":"ffe814ac9696e49a3d62c74bc85dfa56de63fe7c93220b2e12ab9d725e0fb1fa","module":"Mathlib.Algebra.Ring.Commute","note":"It describes the solutions of an equation whose right-hand side is already written as a square, so recovering the passage's set needs the named lemma that the square root of two squares to two, which PD8 does not allow as a bridge.","pair_key":"2a2d2570381c506294a5dbd62cf363011656289933b2dda7b9ee21a22eb03dfd","path":"Mathlib/Algebra/Ring/Commute.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","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":"36fd712d99963e031230de294689f4609eb4bf562ede00e3e056332495d4a1c6","prominence":"supporting","quote":{"exact":"in other words, the solution set is {√2, −√2}."},"quote_capped":false,"section":["Solution sets"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"before":{"layer":"However, if one searches for real solutions, there are two solutions, √2 and –√2; ","segments":[{"text":"However, if one searches for real solutions, there are two solutions, √2 and –√2; "}]},"layer":"in other words, the solution set is {√2, −√2}.","segments":[{"text":"in other words, the solution set is {√2, −√2}."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #5e8558bf","item":"In-text #5e8558bf","kind":"theorem","locations":[],"outcome":"unresolved","passage_ends_in_suffix":false,"passage_key":"8d1bd2849625287f5874cab0c8ace051267baa75b1d58ac4825a464b22998d23","prominence":"supporting","quote":{"exact":"When an equation contains several unknowns, and when one has several equations"},"quote_capped":true,"section":["Solution sets"],"status":null,"subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"When an equation contains several unknowns, and when one has several equations with more unknowns than equations, the solution set is often infinite.","segments":[{"text":"When an equation contains several unknowns, and when one has several equations with more unknowns than equations, the solution set is often infinite."}]},"unresolved":{"challenge":"sampled_out"}},{"absence":null,"basis":"31f0bbe0c33a9cda9cdcdc7dbbb2598b86e8ce9321fc73bf47254c06dfa261f1","coverage":null,"id":"enwiki-537048-1325039164::In-text #b795ddfe","item":"In-text #b795ddfe","kind":"definition","locations":[{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.kernelBasis","end_line":361,"library":"tauceti","line":359,"location_key":"31f0bbe0c33a9cda9cdcdc7dbbb2598b86e8ce9321fc73bf47254c06dfa261f1","module":"TauCeti.LinearAlgebra.Matrix.Echelon.KernelBasis","note":"The construction is given only for homogeneous linear systems over a field, where the passage speaks of the solution set of an arbitrary system, so it is this notion at special objects.","pair_key":"7246f18fbb7f7306445e0cf19aef1b8437230e0b734e8fd304cc0878036eb7f8","path":"TauCeti/LinearAlgebra/Matrix/Echelon/KernelBasis.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def TauCeti.kernelBasis {F : Type u} [Field F] [DecidableEq F] {m n : ℕ} : Matrix (Fin m) (Fin n) F → List (Fin n → F)"},"statement":false},{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.span_kernelBasis","end_line":398,"library":"tauceti","line":396,"location_key":"cbf4d718f9f7abcd8c2d0a881cc9551ef58b562120f402f3148e17c73a527395","module":"TauCeti.LinearAlgebra.Matrix.Echelon.KernelBasis","note":"It states the parametrizing property for homogeneous linear systems only, which is narrower than the arbitrary systems the passage's definition covers.","pair_key":"5fa23b70031b44935cc099e7196be3c74028f730371c25be292a870d7fa211bd","path":"TauCeti/LinearAlgebra/Matrix/Echelon/KernelBasis.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.span_kernelBasis {F : Type u} [Field F] [DecidableEq F] {m n : ℕ} (A : Matrix (Fin m) (Fin n) F) : Submodule.span F {v | v ∈ TauCeti.kernelBasis A} = A.mulVecLin.ker"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"478bc7d124473ab4cab0aef1d1dc4cf967a6ac3cf83bc4af97fe548f95060ad5","prominence":"supporting","quote":{"exact":"For representing them, a parametrization is often useful, which consists of expressing"},"quote_capped":true,"section":["Solution sets"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"For representing them, a parametrization is often useful, which consists of expressing the solutions in terms of some of the unknowns or auxiliary variables.","segments":[{"text":"For representing them, a parametrization is often useful, which consists of expressing the solutions in terms of some of the unknowns or auxiliary variables."}]},"unresolved":null},{"absence":null,"basis":"be6809df9ca0522387992272817599eb0ce9ede57786db8b74315dbdfa6c4cd0","coverage":null,"id":"enwiki-537048-1325039164::In-text #9fa2f85c","item":"In-text #9fa2f85c","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.span_kernelBasis","end_line":398,"library":"tauceti","line":396,"location_key":"be6809df9ca0522387992272817599eb0ce9ede57786db8b74315dbdfa6c4cd0","module":"TauCeti.LinearAlgebra.Matrix.Echelon.KernelBasis","note":"It proves existence under the stronger hypothesis that the system is homogeneous, a case the passage's linear systems include, and it also fixes the coefficients in a field.","pair_key":"4370e887bbf11ab7f2f00bf613186a593e844e1f6f1107adc4789469c07b71d8","path":"TauCeti/LinearAlgebra/Matrix/Echelon/KernelBasis.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.span_kernelBasis {F : Type u} [Field F] [DecidableEq F] {m n : ℕ} (A : Matrix (Fin m) (Fin n) F) : Submodule.span F {v | v ∈ TauCeti.kernelBasis A} = A.mulVecLin.ker"},"statement":false},{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.LinearAlgebra.Matrix.ReducedRowEchelonWanted.exists_isReducedRowEchelon_rowEquivalent","library":"atlas","line":571,"location_key":"01355157168828d1da71030fa101dee28efb2dbced9895957fa5f0a189d6cee2","module":"MathlibExt.LinearAlgebra.Matrix.ReducedRowEchelon","note":"It states that every matrix over a field is row equivalent to one in reduced row echelon form, the elimination step a parametrization is read off from, but by itself it produces no parametrization of the solution set.","pair_key":"ff40f74adf20326da4016fc4d1a5142478b8b34b7198997c2d56871fae1d99a2","path":"MathlibExt/LinearAlgebra/Matrix/ReducedRowEchelon.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.LinearAlgebra.Matrix.ReducedRowEchelonWanted.exists_isReducedRowEchelon_rowEquivalent {K : Type*} [Field K] {m : Type*} {n : Type*} [Fintype m] [DecidableEq m] [LinearOrder m] [Fintype n] [LinearOrder n] (A : Matrix m n K) : ∃ R P, R.IsReducedRowEchelon ∧ IsUnit P ∧ R = P * A"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"low","declaration":"Submodule.exists_basis_span_image_eq","end_line":51,"library":"tauceti","line":29,"location_key":"c5f503f8bc7dca60939638b2c2b2fd9ae4e904c2da6720303ab8a8a28a42965f","module":"TauCeti.LinearAlgebra.Basis.Submodule","note":"It gives a finite spanning family for any subspace of a finite-dimensional space, but reaching the passage needs the separate fact that a linear system's solution set is such a subspace or a coset of one.","pair_key":"363fc595007b13e4001f4b0b595fe1d814bbd77a59e96bb6aeb9326708a9deba","path":"TauCeti/LinearAlgebra/Basis/Submodule.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem Submodule.exists_basis_span_image_eq {k : Type*} {V : Type*} [Field k] [AddCommGroup V] [_root_.Module k V] [Module.Finite k V] (W : Submodule k V) : ∃ b s, Submodule.span k (⇑b '' ↑s) = W ∧ s.card = Module.finrank k ↥W"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b54b3f4f362ccd7906ef22418616c8016e7e494a4eeb1f2ef610205d20e6d324","prominence":"supporting","quote":{"exact":"This is always possible when all the equations are linear."},"quote_capped":false,"section":["Solution sets"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"This is always possible when all the equations are linear.","segments":[{"text":"This is always possible when all the equations are linear."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":4,"queries":5,"sha256":"7e622b8bce5f19f44815d0a43ba4019da5c0228e3453c68f8b5a663c3e4cce7d"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #a7ef8e4d","item":"In-text #a7ef8e4d","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.NumberTheory.DPRMWanted.dprm_theorem","library":"atlas","line":2201,"location_key":"8009f8f85ae7b81d5bf8d4884f73239b96ec9d9b4c125c0b05aee7e0a85b5203","module":"MathlibExt.NumberTheory.DPRM","note":"This is the 1970 equivalence between recursive enumerability and Diophantine definability that the passage dates, but on its own it asserts no impossibility: the unsolvability claim follows only together with a second theorem providing an enumerable set that no algorithm decides.","pair_key":"2bd24c820541bb9a168c83328ad5d228316952fba11d652b99a97e101c6dbe86","path":"MathlibExt/NumberTheory/DPRM.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.NumberTheory.DPRMWanted.dprm_theorem (S : Set ℕ) : (REPred fun n ↦ n ∈ S) ↔ Dioph {v | v () ∈ S}"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ComputablePred.halting_problem","end_line":65,"library":"mathlib","line":64,"location_key":"057172efa388ea250c089d9c0c4a56099c272567b6e786c5bda10e95a9784105","module":"Mathlib.Computability.Halting","note":"It is the impossibility result the passage's general claim echoes, but its subject is the halting of programs rather than any family of equations.","pair_key":"2f7e9ddb58bbda3fade6f7e47279db0cfe9ce3ecc5facd52201cea15dfb7bfc5","path":"Mathlib/Computability/Halting.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ComputablePred.halting_problem (n : ℕ) : ¬ComputablePred fun c ↦ (c.eval n).Dom"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"7a95d57ca99181ae9344121865de6c8deb8e0fcafc4e9eda573bc4b99bfd66fd","prominence":"central","quote":{"exact":"But this also reflects that, in general, no such method can exist:"},"quote_capped":true,"section":["Methods of solution"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"But this also reflects that, in general, no such method can exist: some problems are known to be unsolvable by an algorithm, such as Hilbert's tenth problem, which was proved unsolvable in 1970.","segments":[{"text":"But this also reflects that, in general, no such method can exist: some problems are known to be unsolvable by an algorithm, such as Hilbert's tenth problem, which was proved unsolvable in 1970."}]},"unresolved":null},{"absence":null,"basis":"291e9532ec4fd74eba03e11d838dab7ff38cbb729282fc5acd9611147bf85690","coverage":null,"id":"enwiki-537048-1325039164::In-text #5772a056","item":"In-text #5772a056","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.Algebra.AbelRuffiniWanted.abel_ruffini","library":"atlas","line":72,"location_key":"291e9532ec4fd74eba03e11d838dab7ff38cbb729282fc5acd9611147bf85690","module":"WantedExt.Algebra.AbelRuffiniWanted","note":"The theorem fixes the coefficients in the rationals and the roots in the complex numbers, where the passage names no coefficient field, so it is this claim at those objects; it also records the converse for higher degrees.","pair_key":"679a21175c14f7a58e3c68a04bfe1b0adc2fe03e05dd6485b85b0f3ebc377065","path":"WantedExt/Algebra/AbelRuffiniWanted.lean","proof_status":"wanted","rank":1,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.Algebra.AbelRuffiniWanted.abel_ruffini (n : ℕ) : 1 ≤ n → ((∀ (p : ℚ[X]), p.natDegree = n → ∀ (x : ℂ), (Polynomial.aeval x) p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"quadratic_eq_zero_iff","end_line":89,"library":"mathlib","line":85,"location_key":"a244443547380fdf442ef1fb9f4a0ca95cf8984068c54d689ef17b25d0ab3a64","module":"Mathlib.Algebra.QuadraticDiscriminant","note":"It covers the degree-two case alone, under the extra assumption that the discriminant is a square in the field, which the article's real equations with nonnegative discriminant satisfy.","pair_key":"d65f2ad11c53905f0d5a04a470079356b9eac6ff496aaf93840f78679a13d764","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 {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":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.isSolvable_gal_of_natDegree_le_four","end_line":116,"library":"tauceti","line":108,"location_key":"e1776d3ea7a36bf55e6546445a6321587f4ecae290c80ee36b6e8e05dab7e4be","module":"TauCeti.FieldTheory.GaloisGroups.Degree","note":"It proves the group-theoretic half, that the Galois group of a polynomial of degree at most four is solvable, over any field; turning that into solvability by radicals needs Galois's criterion as a second theorem.","pair_key":"4f8a1653694c7597c8821d6175c89e349964bbea9893998003b009973b24c711","path":"TauCeti/FieldTheory/GaloisGroups/Degree.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.isSolvable_gal_of_natDegree_le_four {F : Type u} [Field F] {p : F[X]} : p.natDegree ≤ 4 → Group.IsSolvable p.Gal"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.Algebra.SolvableByRadicalsWanted.Algebra.solvable_iff_solvableByRad","library":"atlas","line":75,"location_key":"dfb33fb75a38e4ba0358bcf17a835908e77934e4c9edc5d0b9019696728cda5e","module":"WantedExt.Algebra.SolvableByRadicalsWanted","note":"It is Galois's criterion itself, linking radical solvability to solvability of the Galois group, and says nothing on its own about degree at most four.","pair_key":"e1669a247065f355a98799838417017bb052b88e6f9c41dad2b7c6fae9dff0ea","path":"WantedExt/Algebra/SolvableByRadicalsWanted.lean","proof_status":"wanted","rank":4,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.Algebra.SolvableByRadicalsWanted.Algebra.solvable_iff_solvableByRad (F : Type*) [Field F] [CharZero F] (p : F[X]) : p ≠ 0 → ((∀ (x : AlgebraicClosure F), (Polynomial.aeval x) p = 0 → x ∈ solvableByRad F (AlgebraicClosure F)) ↔ Group.IsSolvable p.Gal)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"cffac1e9841677a320e7422f4a4fc630d464137170c06317dbac838d17aedde7","prominence":"central","quote":{"exact":"Polynomial equations of degree up to four can be solved exactly using"},"quote_capped":true,"section":["Methods of solution","Polynomial equations"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"Polynomial equations of degree up to four can be solved exactly using algebraic methods, of which the quadratic formula is the simplest example.","segments":[{"text":"Polynomial equations of degree up to four can be solved exactly using algebraic methods, of which the quadratic formula is the simplest example."}]},"unresolved":null},{"absence":null,"basis":"1d0220a022a2700145cc602a906ad621c9192498b057989492f48890089c1b47","coverage":null,"id":"enwiki-537048-1325039164::In-text #5e4eb16f","item":"In-text #5e4eb16f","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.Algebra.AbelRuffiniWanted.abel_ruffini","library":"atlas","line":72,"location_key":"1d0220a022a2700145cc602a906ad621c9192498b057989492f48890089c1b47","module":"WantedExt.Algebra.AbelRuffiniWanted","note":"It states the general half of the passage, that from degree five on algebraic solution formulas cease to work, and is stated for rational coefficients; it says nothing about numerical methods, about Bring radicals, or about the particular quintic the passage exhibits.","pair_key":"8e1b9f6c81f3e6922fe00a9c065a383d53699cf121573988ee0979f650a6ce7a","path":"WantedExt/Algebra/AbelRuffiniWanted.lean","proof_status":"wanted","rank":1,"relation":"hasPart","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.Algebra.AbelRuffiniWanted.abel_ruffini (n : ℕ) : 1 ≤ n → ((∀ (p : ℚ[X]), p.natDegree = n → ∀ (x : ℂ), (Polynomial.aeval x) p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4)"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"num_dvd_of_is_root","end_line":83,"library":"mathlib","line":68,"location_key":"a9a01fff687efef66e0d6f0e9a537c70f94ea01b43f21e7fc83247c4b5b61351","module":"Mathlib.RingTheory.Polynomial.RationalRoot","note":"This is half of the rational root theorem the passage names, constraining the numerator of a rational root by the constant coefficient, but it states nothing about the example being solvable algebraically.","pair_key":"11748d5024b686830df6670950410489bb4fd310386d62cd94532d3d1f078106","path":"Mathlib/RingTheory/Polynomial/RationalRoot.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem num_dvd_of_is_root {A : Type*} {K : Type*} [CommRing A] [IsDomain A] [UniqueFactorizationMonoid A] [Field K] [Algebra A K] [IsFractionRing A K] {p : A[X]} {r : K} : (Polynomial.aeval r) p = 0 → IsFractionRing.num A r ∣ p.coeff 0"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"den_dvd_of_is_root","end_line":109,"library":"mathlib","line":88,"location_key":"87b2502b74a6c6b60d91b48947102c8bb69768c7012898f050bdf2bf6affea37","module":"Mathlib.RingTheory.Polynomial.RationalRoot","note":"This is the other half of the rational root theorem, bounding the denominator of a rational root by the leading coefficient, and again it does not assert the passage's claim about the example.","pair_key":"d282479d6e283120bef9388c325df2910787bef9073b8c0f8d6e9ea2f820495d","path":"Mathlib/RingTheory/Polynomial/RationalRoot.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem den_dvd_of_is_root {A : Type*} {K : Type*} [CommRing A] [IsDomain A] [UniqueFactorizationMonoid A] [Field K] [Algebra A K] [IsFractionRing A K] {p : A[X]} {r : K} : (Polynomial.aeval r) p = 0 → ↑(IsFractionRing.den A r) ∣ p.leadingCoeff"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d42b4c1db79b234fe2d25885af5d2912157d2efa14a48ddf9e6e5de683746fb1","prominence":"supporting","quote":{"exact":"Polynomial equations with a degree of five or higher require in general"},"quote_capped":true,"section":["Methods of solution","Polynomial equations"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"after":{"layer":", and","segments":[{"text":", and"}]},"layer":"Polynomial equations with a degree of five or higher require in general numerical methods (see below) or special functions such as Bring radicals, although some specific cases may be solvable algebraically, for example 4 x 5 − x 3 − 3 = 0 {\\displaystyle 4x^{5}-x^{3}-3=0} (by using the rational root theorem)","segments":[{"text":"Polynomial equations with a degree of five or higher require in general numerical methods (see below) or special functions such as Bring radicals, although some specific cases may be solvable algebraically, for example "},{"tex":"4x^{5}-x^{3}-3=0"},{"text":" (by using the rational root theorem)"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"f1bb5c894afcedf2650afcb240811d77d5904486591a079dfd2e8d64695cb2b8"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #afc0425f","item":"In-text #afc0425f","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"c96a5946e21d4db756786de1ce4aa4f430356e583fbeb360dd8a960beaa8af91","prominence":"supporting","quote":{"exact":"x 6 − 5 x 3 + 6 = 0 , {\\displaystyle"},"quote_capped":true,"section":["Methods of solution","Polynomial equations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"before":{"layer":"(by using the rational root theorem), and ","lead_in":true,"segments":[{"text":"(by using the rational root theorem), and "}]},"layer":"x 6 − 5 x 3 + 6 = 0 , {\\displaystyle x^{6}-5x^{3}+6=0\\,,} (by using the substitution x = z1⁄3, which simplifies this to a quadratic equation in z).","segments":[{"tex":"x^{6}-5x^{3}+6=0\\,,"},{"text":" (by using the substitution x = z1⁄3, which simplifies this to a quadratic equation in z)."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"cf1c53321f547f0b0850c1b51b9c5b599bf7731dbbb7e7ec4af14041d75c2fde"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #293fa100","item":"In-text #293fa100","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"a734b19d90747ced34051beb6dc8d9183dec97aceeb2699eca33737fc329b3f5","prominence":"central","quote":{"exact":"In Diophantine equations the solutions are required to be integers."},"quote_capped":false,"section":["Methods of solution","Diophantine equations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"In Diophantine equations the solutions are required to be integers.","segments":[{"text":"In Diophantine equations the solutions are required to be integers."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"2cb879e5c9e39a630268ed2e6ca3455840230cea1667727424ff453fe23b55b4"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #8ed5bff7","item":"In-text #8ed5bff7","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"826eaf9153dc7cc37abf532de2be9195b8174db28cc1146a5dd2e30355856c40","prominence":"supporting","quote":{"exact":"For example, the polynomial equation 2 x 5 − 5 x 4"},"quote_capped":true,"section":["Methods of solution","Diophantine equations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"after":{"layer":", and so, viewed as a Diophantine equation, it has the unique solution x = 3.","segments":[{"text":", and so, viewed as a Diophantine equation, it has the unique solution x = 3."}]},"layer":"For example, the polynomial equation 2 x 5 − 5 x 4 − x 3 − 7 x 2 + 2 x + 3 = 0 {\\displaystyle 2x^{5}-5x^{4}-x^{3}-7x^{2}+2x+3=0\\,} has as rational solutions x = −⁠1/2⁠ and x = 3","segments":[{"text":"For example, the polynomial equation "},{"tex":"2x^{5}-5x^{4}-x^{3}-7x^{2}+2x+3=0\\,"},{"text":" has as rational solutions x = −⁠1/2⁠ and x = 3"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"a3cceecf593b315b381f8b6715d7f0624ee79ab3756cdb1b639576e7491d06c1"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #95478c73","item":"In-text #95478c73","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"5892c309e67b2d2638f34ffc802b424adc7d50b2dc739806099ca75303b74666","prominence":"supporting","quote":{"exact":"viewed as a Diophantine equation, it has the unique solution x ="},"quote_capped":true,"section":["Methods of solution","Diophantine equations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"before":{"layer":"has as rational solutions x = −⁠1/2⁠ and x = 3, and so, ","segments":[{"text":"has as rational solutions x = −⁠1/2⁠ and x = 3, and so, "}]},"layer":"viewed as a Diophantine equation, it has the unique solution x = 3.","segments":[{"text":"viewed as a Diophantine equation, it has the unique solution x = 3."}]},"unresolved":null},{"absence":null,"basis":"cdfc93629c51943dfb8e4553da1f053e64ac3562227ceb0dca8aa0657729650e","coverage":null,"id":"enwiki-537048-1325039164::In-text #f014771d","item":"In-text #f014771d","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv","end_line":75,"library":"mathlib","line":65,"location_key":"cdfc93629c51943dfb8e4553da1f053e64ac3562227ceb0dca8aa0657729650e","module":"Mathlib.Logic.Equiv.Defs","note":"Mathlib packages the map, the inverse map and the two inverse laws into a single structure where the passage writes h and its inverse side by side.","pair_key":"592f4a7399618c8c1fdba6b02e2904007ba2e35e59b737a17e5832ab7418cab1","path":"Mathlib/Logic/Equiv/Defs.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure Equiv : Sort u_1 → Sort u_2 → Sort (max (max 1 u_1) u_2)"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Function.LeftInverse","end_line":74,"library":"lean-core","line":73,"location_key":"d412edabebfdb0037d11e7c9e5dfaabd4f17f06569307bbdd8325288ac64fd27","module":"Init.Data.Function","note":"Lean writes the defining condition as a named relation between the two maps instead of the superscript notation, and by R-CHAIN the chain's end-to-end equation is what the cut asserts.","pair_key":"79c1cf9fdd9869101a0b0e6df3ff8acdbb794a488c10e1289af7a0302454e4c4","path":"src/Init/Data/Function.lean","proof_status":"definition","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Function.LeftInverse {α : Sort u_1} {β : Sort u_2} : (β → α) → (α → β) → Prop"},"statement":true},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Function.RightInverse","end_line":84,"library":"lean-core","line":83,"location_key":"678fda4b0e1071ba069d19e2b5af06fe33a512b15fbfdc2202c76aabd1aeac25","module":"Init.Data.Function","note":"It names the chain's middle identity, which the inventory's cut treats as a step rather than the asserted equation.","pair_key":"916602c37506f8071cd3fcf22e0ad314520f81120c4f4499086e55bcc66591c5","path":"src/Init/Data/Function.lean","proof_status":"definition","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Function.RightInverse {α : Sort u_1} {β : Sort u_2} : (β → α) → (α → β) → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"63a7672731ebf2a6f778bb1107ef01e1cccc154363394a104a0d785c4f1bfd11","prominence":"central","quote":{"exact":"Given a function h : A → B, the inverse function, denoted"},"quote_capped":true,"section":["Methods of solution","Inverse functions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"Given a function h : A → B, the inverse function, denoted h−1 and defined as h−1 : B → A, is a function such that h − 1 ( h ( x ) ) = h ( h − 1 ( x ) ) = x . {\\displaystyle h^{-1}{\\bigl (}h(x){\\bigr )}=h{\\bigl (}h^{-1}(x){\\bigr )}=x\\,.}","segments":[{"text":"Given a function h : A → B, the inverse function, denoted h−1 and defined as h−1 : B → A, is a function such that "},{"tex":"h^{-1}{\\bigl (}h(x){\\bigr )}=h{\\bigl (}h^{-1}(x){\\bigr )}=x\\,."}]},"unresolved":null},{"absence":null,"basis":"349c543f9ebf6a5432128c4978e6a45a0d5afe6af7d43b4e600f9550aca340cd","coverage":null,"id":"enwiki-537048-1325039164::In-text #f1fd69f1","item":"In-text #f1fd69f1","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.apply_eq_iff_eq_symm_apply","end_line":300,"library":"mathlib","line":299,"location_key":"349c543f9ebf6a5432128c4978e6a45a0d5afe6af7d43b4e600f9550aca340cd","module":"Mathlib.Logic.Equiv.Defs","note":"Lean states an equivalence between the two equations for a bundled map, where the passage draws the implication in one direction only.","pair_key":"897562f2104f02f3c0a1cfd0c743e116df1b1e18d142e5375ea4cc467f272d2d","path":"Mathlib/Logic/Equiv/Defs.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"deprecated_to":"Equiv.eq_symm_apply","elided":false,"text":"theorem Equiv.apply_eq_iff_eq_symm_apply {α : Sort u} {β : Sort v} {x : α} {y : β} (f : α ≃ β) : f x = y ↔ x = f.symm y"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Function.LeftInverse","end_line":74,"library":"lean-core","line":73,"location_key":"dbcfee2d0f0c906c8b09c86459f457f5fcd22dab84e0c0af20807bfea7484f66","module":"Init.Data.Function","note":"On its own it only records that the inverse undoes h; reaching the passage's conclusion still needs the hypothesis that h sends x to c.","pair_key":"169a3796f36d76fe7a9a3caf1b54a35a5c9bd44850530769f88184ce05a13287","path":"src/Init/Data/Function.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Function.LeftInverse {α : Sort u_1} {β : Sort u_2} : (β → α) → (α → β) → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"fa0a7d5e36648eff66c93654b90de640ce328e1e71cbf576be1f51e1fd980a08","prominence":"supporting","quote":{"exact":"Now, if we apply the inverse function to both sides of h(x)"},"quote_capped":true,"section":["Methods of solution","Inverse functions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"after":{"layer":" we have found the solution to the equation.","segments":[{"text":" we have found the solution to the equation."}]},"layer":"Now, if we apply the inverse function to both sides of h(x) = c, where c is a constant value in B, we obtain h − 1 ( h ( x ) ) = h − 1 ( c ) x = h − 1 ( c ) {\\displaystyle {\\begin{aligned}h^{-1}{\\bigl (}h(x){\\bigr )}&=h^{-1}(c)\\\\x&=h^{-1}(c)\\\\\\end{aligned}}} and","segments":[{"text":"Now, if we apply the inverse function to both sides of h(x) = c, where c is a constant value in B, we obtain "},{"tex":"\\begin{aligned}h^{-1}{\\bigl (}h(x){\\bigr )}&=h^{-1}(c)\\\\x&=h^{-1}(c)\\\\\\end{aligned}"},{"text":" and"}]},"unresolved":null},{"absence":null,"basis":"55279934f67454f448ebd7d0f4e66d117b311f69fc0a96d2ed99474af2b08c63","coverage":null,"id":"enwiki-537048-1325039164::In-text #b922d24f","item":"In-text #b922d24f","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Function.RightInverse.surjective","end_line":103,"library":"lean-core","line":102,"location_key":"55279934f67454f448ebd7d0f4e66d117b311f69fc0a96d2ed99474af2b08c63","module":"Init.Data.Function","note":"Lean phrases the conclusion as surjectivity of h, which unfolds to the existence of a solution of the equation for each constant in B.","pair_key":"0f7dc515e7031a63bea40af8218cfc583efb10ee4327aa4f3dbdc8cb33c56ea7","path":"src/Init/Data/Function.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Function.RightInverse.surjective {α : Sort u_1} {β : Sort u_2} {f : α → β} {g : β → α} : Function.RightInverse g f → Function.Surjective f"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Function.HasRightInverse.surjective","end_line":106,"library":"lean-core","line":105,"location_key":"78f0bc539a4077db67c56d18108dadde9a92fa36dcf274c60251b183b278d57c","module":"Init.Data.Function","note":"It takes the bare existence of a right inverse as its hypothesis and concludes that the map is onto.","pair_key":"2a881e0994ac9b3a6ce99c7e8e05ea36f77fb7df3929f99857dacc675b7c75e4","path":"src/Init/Data/Function.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Function.HasRightInverse.surjective {α : Sort u_1} {β : Sort u_2} {f : α → β} : Function.HasRightInverse f → Function.Surjective f"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a70ad3aa644c5663fdd4af853c079d0bc97db9f2f729a9710e40a860542ccb44","prominence":"supporting","quote":{"exact":"If just one solution will do, instead of the full solution set,"},"quote_capped":true,"section":["Methods of solution","Inverse functions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"If just one solution will do, instead of the full solution set, it is actually sufficient if only the functional identity h ( h − 1 ( x ) ) = x {\\displaystyle h\\left(h^{-1}(x)\\right)=x} holds.","segments":[{"text":"If just one solution will do, instead of the full solution set, it is actually sufficient if only the functional identity "},{"tex":"h\\left(h^{-1}(x)\\right)=x"},{"text":" holds."}]},"unresolved":null},{"absence":null,"basis":"d21b3fbd7801a2eaf23c70448295df9ba0fc09612e473f5f72dc0337c2687626","coverage":null,"id":"enwiki-537048-1325039164::In-text #43bb1667","item":"In-text #43bb1667","kind":"example","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"AddMonoidHom.fst_comp_inl","end_line":379,"library":"mathlib","line":379,"location_key":"d21b3fbd7801a2eaf23c70448295df9ba0fc09612e473f5f72dc0337c2687626","module":"Mathlib.Algebra.Group.Prod","note":"Lean states the identity for bundled additive maps over any two types carrying a zero, with the right-hand map sending x to the pair whose second entry is zero.","pair_key":"27338d2bec7dc1f51182686d07a9b401f324bb86be68420dcb24e251e044b62f","path":"Mathlib/Algebra/Group/Prod.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem AddMonoidHom.fst_comp_inl {M : Type*} {N : Type*} [AddZeroClass M] [AddZeroClass N] : (AddMonoidHom.fst M N).comp (AddMonoidHom.inl M N) = AddMonoidHom.id M"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Lean.Omega.Prod.fst_mk","end_line":225,"library":"lean-core","line":225,"location_key":"ad0bd0e8002b5547c896a141cd955a6a9d5b27fbcaebb8b230eb8856232d6c26","module":"Init.Omega.Int","note":"It is stated for arbitrary types and an arbitrary second entry, of which the passage's section at zero is one reading.","pair_key":"618cd46c960866853c3111d7877ec3a0a5240d5c842ef1f69f25899e94d4b26c","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.Prod.fst_mk {α : Type u_1} {x : α} {β : Type u_2} {y : β} : (x, y).fst = x"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Prod.fst_surjective","end_line":91,"library":"mathlib","line":90,"location_key":"0906ff34df7c557296ae05542b8cffdc2296ee97acab0ff4c2ba62fafebe9d92","module":"Mathlib.Data.Prod.Basic","note":"It records that the projection is onto without naming the passage's section, so it states something else than either conjunct.","pair_key":"f9e67979108a85c3488601dd120ec1841eb38acf8916cca08d4aa4eb93a1fae3","path":"Mathlib/Data/Prod/Basic.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Prod.fst_surjective {α : Type*} {β : Type*} [h : Nonempty β] : Function.Surjective Prod.fst"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Prod.fst_injective","end_line":97,"library":"mathlib","line":96,"location_key":"3bb2358f7974bc1a22979ca46d2c553aa1efc93457e20510acdebde1d9770679","module":"Mathlib.Data.Prod.Basic","note":"It states when the projection is one-to-one, under a hypothesis the passage's second factor fails, and so it does not bear on the absence of a post-inverse.","pair_key":"e877558039ee0093c4f23641cb76a181fc048e5e3b755950b0dd22e73ca1fa81","path":"Mathlib/Data/Prod/Basic.lean","proof_status":"proved","rank":4,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Prod.fst_injective {α : Type*} {β : Type*} [Subsingleton β] : Function.Injective Prod.fst"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"aab1bc1a166f986579c99daf071f888b2da051ac782261c2373a965167587d53","prominence":"supporting","quote":{"exact":"For example, the projection π1 : R2 → R defined by π1(x,"},"quote_capped":true,"section":["Methods of solution","Inverse functions"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"For example, the projection π1 : R2 → R defined by π1(x, y) = x has no post-inverse, but it has a pre-inverse π−11 defined by π−11(x) = (x, 0).","segments":[{"text":"For example, the projection π1 : R2 → R defined by π1(x, y) = x has no post-inverse, but it has a pre-inverse π−11 defined by π−11(x) = (x, 0)."}]},"unresolved":null},{"absence":null,"basis":"a21fd613d763c3fe5ba29ce0bd8a944088045a3b661e3297ed6fd2eb35d04488","coverage":null,"id":"enwiki-537048-1325039164::In-text #16b9472d","item":"In-text #16b9472d","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Lean.Omega.Prod.fst_mk","end_line":225,"library":"lean-core","line":225,"location_key":"a21fd613d763c3fe5ba29ce0bd8a944088045a3b661e3297ed6fd2eb35d04488","module":"Init.Omega.Int","note":"Lean states the projection equation for pairs of arbitrary types, while the passage reads it for pairs of real numbers.","pair_key":"02397bf9f655b0f8da30be2571fa768451bfa70b5d2662b893407ae738aa03f5","path":"src/Init/Omega/Int.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Lean.Omega.Prod.fst_mk {α : Type u_1} {x : α} {β : Type u_2} {y : β} : (x, y).fst = x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"226dd68190a5b02e4e8b5e82eb1b14bb98e3102122f9e0a21a3b9de0771a121f","prominence":"supporting","quote":{"exact":"Indeed, the equation π1(x, y) = c is solved by ( x"},"quote_capped":true,"section":["Methods of solution","Inverse functions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"Indeed, the equation π1(x, y) = c is solved by ( x , y ) = π 1 − 1 ( c ) = ( c , 0 ) . {\\displaystyle (x,y)=\\pi _{1}^{-1}(c)=(c,0).}","segments":[{"text":"Indeed, the equation π1(x, y) = c is solved by "},{"tex":"(x,y)=\\pi _{1}^{-1}(c)=(c,0)."}]},"unresolved":null},{"absence":null,"basis":"1a986043f45d9be04c3a7bb72820d05c22ca83492e34fd0e26c9156abca2a465","coverage":null,"id":"enwiki-537048-1325039164::In-text #be8ee6a6","item":"In-text #be8ee6a6","kind":"example","locations":[{"challenge":"sampled_out","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"Real.pow_nthRoot","end_line":88,"library":"formal-conjectures","line":79,"location_key":"1a986043f45d9be04c3a7bb72820d05c22ca83492e34fd0e26c9156abca2a465","module":"FormalConjecturesForMathlib.Analysis.SpecialFunctions.NthRoot","note":"This gives one of the two identities that make the root an inverse of the power map; the hypothesis restricts to nonnegative arguments unless n is odd.","pair_key":"21e689d13e778bdee54b207895eb3eab3b97d6e3f91ce7911d83473a5ee4c9fd","path":"FormalConjecturesForMathlib/Analysis/SpecialFunctions/NthRoot.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem Real.pow_nthRoot {n : ℕ} (r : ℝ) : n ≠ 0 ∧ 0 ≤ r ∨ Odd n → Real.nthRoot n r ^ n = r"},"statement":false},{"challenge":"sampled_out","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"Real.nthRoot_pow","end_line":99,"library":"formal-conjectures","line":90,"location_key":"20b25450c9d16bc374d5b4631c3b5d10563138b02019a485e8c00114ba3e5889","module":"FormalConjecturesForMathlib.Analysis.SpecialFunctions.NthRoot","note":"This gives the other of the two identities, under the same restriction on the argument or on the parity of n.","pair_key":"10cbc621dce975843ea932906c6d3ea2c822206479b1a07ac0181e69923110b6","path":"FormalConjecturesForMathlib/Analysis/SpecialFunctions/NthRoot.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem Real.nthRoot_pow {n : ℕ} (r : ℝ) : n ≠ 0 ∧ 0 ≤ r ∨ Odd n → Real.nthRoot n (r ^ n) = r"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.rpow_inv_natCast_pow","end_line":515,"library":"mathlib","line":513,"location_key":"546a8efe5f079fcceafc264ee4f5c28bf5d9fe98b6938981df4d0cba56ca0975","module":"Mathlib.Analysis.SpecialFunctions.Pow.Real","note":"Here the n-th root is spelled as the real exponent one over n rather than as a named root function.","pair_key":"ebb2cff1bb3040373ceb103f949020d36054ddba572588e55549d584864f8a4c","path":"Mathlib/Analysis/SpecialFunctions/Pow/Real.lean","proof_status":"proved","rank":3,"relation":"hasPart","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},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.pow_rpow_inv_natCast","end_line":511,"library":"mathlib","line":509,"location_key":"d872328ed82c90b7444c264a3699615b7bed6c4e9a301c9be1fbaabfa6854896","module":"Mathlib.Analysis.SpecialFunctions.Pow.Real","note":"Same encoding of the root as a real exponent, giving the left-inverse identity.","pair_key":"8696186f3b603ba6d360c4bdfb5044369b71a6bc86ecee9c36d7153a64c1651d","path":"Mathlib/Analysis/SpecialFunctions/Pow/Real.lean","proof_status":"proved","rank":4,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.pow_rpow_inv_natCast {x : ℝ} {n : ℕ} : 0 ≤ x → n ≠ 0 → (x ^ n) ^ (↑n)⁻¹ = x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2ba75cf68ec380e069ac3be1495a66b1199ee6ce469b7271f354023ed20d3ffc","prominence":"supporting","quote":{"exact":"Examples of inverse functions include the nth root (inverse of xn)"},"quote_capped":false,"section":["Methods of solution","Inverse functions"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"after":{"layer":"; the logarithm (inverse of ax); the inverse trigonometric functions; and Lambert's W function (inverse of xex).","segments":[{"text":"; the logarithm (inverse of ax); the inverse trigonometric functions; and Lambert's W function (inverse of xex)."}]},"layer":"Examples of inverse functions include the nth root (inverse of xn)","segments":[{"text":"Examples of inverse functions include the nth root (inverse of xn)"}]},"unresolved":null},{"absence":null,"basis":"09934ba1794c74c1cc36ca6f150f481a9b4d705c07b4e96f5685b513d40d5b14","coverage":null,"id":"enwiki-537048-1325039164::In-text #44659821","item":"In-text #44659821","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.logb_eq_iff_rpow_eq","end_line":158,"library":"mathlib","line":155,"location_key":"09934ba1794c74c1cc36ca6f150f481a9b4d705c07b4e96f5685b513d40d5b14","module":"Mathlib.Analysis.SpecialFunctions.Log.Base","note":"Lean writes the inverse relation as a pointwise equivalence between the base-a logarithm of y being x and a raised to x being y, for a positive base other than one and positive y.","pair_key":"f31f8abebc9494f30f0eb799db3137c26b13c64f81eb5713fa6a45f05ce86075","path":"Mathlib/Analysis/SpecialFunctions/Log/Base.lean","proof_status":"proved","rank":1,"relation":"closeMatch","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":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.logb_rpow","end_line":136,"library":"mathlib","line":134,"location_key":"dbf8c856eb014d3092f5856fa2adf413c1b36d8af2fdbeda6b706844a990f18a","module":"Mathlib.Analysis.SpecialFunctions.Log.Base","note":"One of the two composition identities only.","pair_key":"1a0e4c83c12bd58034f96d68425900e7ab073f4bfa1c964c5ff5f9ab2c90e09a","path":"Mathlib/Analysis/SpecialFunctions/Log/Base.lean","proof_status":"proved","rank":2,"relation":"hasPart","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},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.rpow_logb","end_line":149,"library":"mathlib","line":147,"location_key":"78161300f5106ff7454022bf37879c0a603fad36a33df3e6e15c2b6835106a85","module":"Mathlib.Analysis.SpecialFunctions.Log.Base","note":"The other composition identity, on the positive reals.","pair_key":"faa8b6ddc4cf7856e8fa079639dbc8d9006d7124a5f823b32c6636eecd5f07ea","path":"Mathlib/Analysis/SpecialFunctions/Log/Base.lean","proof_status":"proved","rank":3,"relation":"hasPart","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}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"04766210c4c587fc57375a600ef6d974652085ec5752575157a6b02640497237","prominence":"supporting","quote":{"exact":"the logarithm (inverse of ax)"},"quote_capped":false,"section":["Methods of solution","Inverse functions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"after":{"layer":"; the inverse trigonometric functions; and Lambert's W function (inverse of xex).","segments":[{"text":"; the inverse trigonometric functions; and Lambert's W function (inverse of xex)."}]},"before":{"layer":"Examples of inverse functions include the nth root (inverse of xn); ","segments":[{"text":"Examples of inverse functions include the nth root (inverse of xn); "}]},"layer":"the logarithm (inverse of ax)","segments":[{"text":"the logarithm (inverse of ax)"}]},"unresolved":null},{"absence":null,"basis":"72c3d905b167bdaf2e6f2deda8f3fa80b65a6616435a067b7721e6f838b855f8","coverage":null,"id":"enwiki-537048-1325039164::In-text #9296ea45","item":"In-text #9296ea45","kind":"example","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.arcsin_eq_iff_eq_sin","end_line":177,"library":"mathlib","line":174,"location_key":"72c3d905b167bdaf2e6f2deda8f3fa80b65a6616435a067b7721e6f838b855f8","module":"Mathlib.Analysis.SpecialFunctions.Trigonometric.Inverse","note":"This is the passage read at one member of the family, the sine and its inverse.","pair_key":"7131c19ca5f3667e6c0ff276a01ad51bde88a49e787e841d5099f1d6abfc60f6","path":"Mathlib/Analysis/SpecialFunctions/Trigonometric/Inverse.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.arcsin_eq_iff_eq_sin {x y : ℝ} : y ∈ Set.Ioo (-(π / 2)) (π / 2) → (Real.arcsin x = y ↔ x = Real.sin y)"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.tan_arctan","end_line":124,"library":"mathlib","line":123,"location_key":"b16cc2dcebc41a1156bd23c90e08a5fe8fdcb012b5a35ba473c95b6d467ed1cd","module":"Mathlib.Analysis.SpecialFunctions.Trigonometric.Arctan","note":"One composition identity for one member of the family.","pair_key":"8587c352379c6ff2a66a6d55e035faab20948cea7071e809f2bdf1297be0eb94","path":"Mathlib/Analysis/SpecialFunctions/Trigonometric/Arctan.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.tan_arctan (x : ℝ) : Real.tan (Real.arctan x) = x"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.arctan_tan","end_line":134,"library":"mathlib","line":133,"location_key":"452f6e3bc15a65069af86ee918853ad1ecc01fbdea38ece72320f8a81daff431","module":"Mathlib.Analysis.SpecialFunctions.Trigonometric.Arctan","note":"The other composition identity for the tangent.","pair_key":"3a9d9663d6a2c7d2e60b2673ab2f54ecab5040d187deeee0ac20245c15b60e40","path":"Mathlib/Analysis/SpecialFunctions/Trigonometric/Arctan.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.arctan_tan {x : ℝ} : -(π / 2) < x → x < π / 2 → Real.arctan (Real.tan x) = x"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.cos_arccos","end_line":295,"library":"mathlib","line":294,"location_key":"d53fc2bde2fdbeb467ef32682f909d04726d2eb15a3f656a0cd69140a5967ff9","module":"Mathlib.Analysis.SpecialFunctions.Trigonometric.Inverse","note":"One composition identity for the cosine.","pair_key":"cc375bb645678ebbb40591f651a66a3df86b338291cdb91f7dfbcd75ee8e1d97","path":"Mathlib/Analysis/SpecialFunctions/Trigonometric/Inverse.lean","proof_status":"proved","rank":4,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.cos_arccos {x : ℝ} : -1 ≤ x → x ≤ 1 → Real.cos (Real.arccos x) = x"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.arccos_cos","end_line":298,"library":"mathlib","line":297,"location_key":"51beec82ae8e0d1b44c57fda09e2b525c207baf0912db0fec767a51d140c35a0","module":"Mathlib.Analysis.SpecialFunctions.Trigonometric.Inverse","note":"The other composition identity for the cosine.","pair_key":"a7df4822a6ab39383bcfaeb7eab7375b50144506a8194b9531b4c7d4a6e3eb93","path":"Mathlib/Analysis/SpecialFunctions/Trigonometric/Inverse.lean","proof_status":"proved","rank":5,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.arccos_cos {x : ℝ} : 0 ≤ x → x ≤ π → Real.arccos (Real.cos x) = x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"011f4e2bb6e502115e2ede26d7cb97d83b7d09781d0767311025f9e011525f21","prominence":"supporting","quote":{"exact":"the inverse trigonometric functions; and"},"quote_capped":false,"section":["Methods of solution","Inverse functions"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"after":{"layer":" Lambert's W function (inverse of xex).","segments":[{"text":" Lambert's W function (inverse of xex)."}]},"before":{"layer":"Examples of inverse functions include the nth root (inverse of xn); the logarithm (inverse of ax); ","segments":[{"text":"Examples of inverse functions include the nth root (inverse of xn); the logarithm (inverse of ax); "}]},"layer":"the inverse trigonometric functions; and","segments":[{"text":"the inverse trigonometric functions; and"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"a57576f8b54eff6d3e04103709ca8faae9521047b10ed28095a1c9dfd25ca126"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #5ec072cb","item":"In-text #5ec072cb","kind":"example","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MetaMathlibExt.existsUnique_lambertMap_preimage","library":"atlas","line":49,"location_key":"868260990bd6718726e29a96e12e8030900f32513983a2f9ae30842b248963e1","module":"MathlibExt.Analysis.SpecialFunctions.LambertWFunction","note":"It says the map sending y to y times the exponential of y takes each value above minus one over e exactly once on the branch its subtype picks out; the universe names no function inverting that map.","pair_key":"215eb0bfc39b54d8e6751f1d00438e63faf027475c85a206c6f50f0f9bfaaec5","path":"MathlibExt/Analysis/SpecialFunctions/LambertWFunction.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MetaMathlibExt.existsUnique_lambertMap_preimage (x : ℝ) : -Real.exp (-1) < x → ∃! y, MetaMathlibExt.lambertMap ↑y = x"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"1e21fff72a78527ed9805520e1d9ac69da520ae8520e45d5f5e13a7d93ef31c9","prominence":"supporting","quote":{"exact":"Lambert's W function (inverse of xex)."},"quote_capped":false,"section":["Methods of solution","Inverse functions"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"before":{"layer":"Examples of inverse functions include the nth root (inverse of xn); the logarithm (inverse of ax); the inverse trigonometric functions; and ","segments":[{"text":"Examples of inverse functions include the nth root (inverse of xn); the logarithm (inverse of ax); the inverse trigonometric functions; and "}]},"layer":"Lambert's W function (inverse of xex).","segments":[{"text":"Lambert's W function (inverse of xex)."}]},"unresolved":null},{"absence":null,"basis":"169c3c3fd5922e63c6da206c89a2468497ae4fe085365b107fb001829d28bbf3","coverage":null,"id":"enwiki-537048-1325039164::In-text #82a279b9","item":"In-text #82a279b9","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_eq_zero","end_line":295,"library":"mathlib","line":293,"location_key":"169c3c3fd5922e63c6da206c89a2468497ae4fe085365b107fb001829d28bbf3","module":"Mathlib.Algebra.GroupWithZero.Defs","note":"Lean states the fact one value at a time, as an equivalence between the product vanishing and one of the two factors vanishing, where the passage packages it as an equality of solution sets.","pair_key":"e2d718bd06952c4ef54b103ce8472b2d82eeee1fd63571c8004c322ad4656bf4","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":"84c9014d06a2d1da236320dd72cf6db946d30a8c39063287e104af8d873b378b","prominence":"central","quote":{"exact":"If the left-hand side expression of an equation P = 0 can"},"quote_capped":true,"section":["Methods of solution","Factorization"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"If the left-hand side expression of an equation P = 0 can be factorized as P = QR, the solution set of the original solution consists of the union of the solution sets of the two equations Q = 0 and R = 0.","segments":[{"text":"If the left-hand side expression of an equation P = 0 can be factorized as P = QR, the solution set of the original solution consists of the union of the solution sets of the two equations Q = 0 and R = 0."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"6cab4e8dbd8b7ec3d4a662b8942a55f7e388c70df065bd5ddcbc3f76aeb5fc6e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-537048-1325039164::In-text #09e0c1df","item":"In-text #09e0c1df","kind":"example","locations":[{"challenge":"downgraded","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"low","declaration":"sub_sq","end_line":204,"library":"mathlib","line":203,"location_key":"58e48972bb20e5a6ec1ccdeb85725317f7bb6570b8eadd2bc2d069f885cc4848","module":"Mathlib.Algebra.Ring.Commute","note":"This states only the factorization step the passage performs on the numerator, not the passage's rewriting of the original equation.","pair_key":"20ecec0a5d00ab5748f82c802616f19850d29764c2d95e37e1439ba8b7cc0849","path":"Mathlib/Algebra/Ring/Commute.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem sub_sq {R : Type u} [CommRing R] (a b : R) : (a - b) ^ 2 = a ^ 2 - 2 * a * b + b ^ 2"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.tan_inv_eq_cot","end_line":652,"library":"mathlib","line":651,"location_key":"7bebcb63a19082fb2f8be0dc2bc811c1e90a100637000e3ece22201fab1b2519","module":"Mathlib.Analysis.Complex.Trigonometric","note":"It says the reciprocal of the tangent is the cotangent; turning that into the product identity the passage invokes needs a cancellation lemma and the tangent being nonzero, and at a multiple of a half turn both sides are zero.","pair_key":"e8209da4d3810666c57a833bd25f8f7a5e21132bc56eca09c401be5077824a12","path":"Mathlib/Analysis/Complex/Trigonometric.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.tan_inv_eq_cot (x : ℝ) : (Real.tan x)⁻¹ = Real.cot x"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"3037f1a0649222c332136861365279608859c35cd1ff1d96e0ebb107cbe8b31e","prominence":"supporting","quote":{"exact":"For example, the equation tan ⁡ x + cot ⁡ x ="},"quote_capped":true,"section":["Methods of solution","Factorization"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"For example, the equation tan ⁡ x + cot ⁡ x = 2 {\\displaystyle \\tan x+\\cot x=2} can be rewritten, using the identity tan x cot x = 1 as tan 2 ⁡ x − 2 tan ⁡ x + 1 tan ⁡ x = 0 , {\\displaystyle {\\frac {\\tan ^{2}x-2\\tan x+1}{\\tan x}}=0,} which can be factorized into ( tan ⁡ x − 1 ) 2 tan ⁡ x = 0. {\\displaystyle {\\frac {\\left(\\tan x-1\\right)^{2}}{\\tan x}}=0.}","segments":[{"text":"For example, the equation "},{"tex":"\\tan x+\\cot x=2"},{"text":" can be rewritten, using the identity tan x cot x = 1 as "},{"tex":"{\\frac {\\tan ^{2}x-2\\tan x+1}{\\tan x}}=0,"},{"text":" which can be factorized into "},{"tex":"{\\frac {\\left(\\tan x-1\\right)^{2}}{\\tan x}}=0."}]},"unresolved":null},{"absence":null,"basis":"0bb5c69e0323f4e3874963d4a73061c99bb830723e1713c8569bb9da6ac75d47","coverage":null,"id":"enwiki-537048-1325039164::In-text #b32e990a","item":"In-text #b32e990a","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.tan_pi_div_four","end_line":896,"library":"mathlib","line":893,"location_key":"0bb5c69e0323f4e3874963d4a73061c99bb830723e1713c8569bb9da6ac75d47","module":"Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic","note":"It is the conjunct at the single index zero, with no statement about the other indices or about exhaustiveness.","pair_key":"868a92045076e381c3bfa72f4c5d909f1fb54412b667bb6b86baabf205fa1546","path":"Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.tan_pi_div_four : Real.tan (π / 4) = 1"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.tan_add_int_mul_pi","end_line":977,"library":"mathlib","line":976,"location_key":"7906a83ce3661cae3a9f5425ba3f19ead17f69d8e21621b028a16956044c7962","module":"Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic","note":"It states that adding an integer multiple of a half turn leaves the tangent unchanged, which reaches the listed family of solutions only together with the value of the tangent at a quarter turn.","pair_key":"d317bb085d45fd4b280e0544988be08418a01a851c0a99eb73399160e1ca8e44","path":"Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.tan_add_int_mul_pi (x : ℝ) (n : ℤ) : Real.tan (x + ↑n * π) = Real.tan x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"99d5edcd6ef7d87cbdc53357c1571db5ff6389544a6b882f2a014586ff1550fc","prominence":"supporting","quote":{"exact":"The solutions are thus the solutions of the equation tan x ="},"quote_capped":true,"section":["Methods of solution","Factorization"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=537048&oldid=1325039164","text":{"layer":"The solutions are thus the solutions of the equation tan x = 1, and are thus the set x = π 4 + k π , k = 0 , ± 1 , ± 2 , … . {\\displaystyle x={\\tfrac {\\pi }{4}}+k\\pi ,\\quad k=0,\\pm 1,\\pm 2,\\ldots .}","segments":[{"text":"The solutions are thus the solutions of the equation tan x = 1, and are thus the set "},{"tex":"x={\\tfrac {\\pi }{4}}+k\\pi ,\\quad k=0,\\pm 1,\\pm 2,\\ldots ."}]},"unresolved":null}],"provenance":{"challenge":{"harvested":"2026-11-01T14:25:17Z","mode":"locate-challenge","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"chal-tierA-b1","sampling":{"absence_sample_rate":0.25,"sample_rate":0.2,"seed":0,"strong_sample_rate":0.5},"skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-11-01T03:19:32Z"},"inventory":{"harvested":"2026-10-30T20:00:47Z","mode":"locate-inventory","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"inv-tierA-b1r","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-10-30T07:23:03Z"},"locate":{"harvested":"2026-11-01T03:06:57Z","mode":"locate","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"loc-tierA-b1b","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-10-31T04:59:09Z"}},"reader":{"bytes":104908,"images":[{"author":"Jakob.scholbach","file":"Ellipse_in_coordinate_system_with_semi-axes_labelled.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":"Ralf Pfeifer","file":"NewtonIteration_Ani.gif","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0/","project":"commons"},{"author":"Tkgd2007","file":"Question_book-new.svg","licence":"Cc-by-sa-3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0/","project":"en"}],"marks":450,"passages":54,"sha256":"dae8b578db4c47e1e0d25a4dbf501fa27f1a32397ea139b1a188cd042adfa4e0","unplaced":["enwiki-537048-1325039164::In-text #6f4bb605","enwiki-537048-1325039164::In-text #5e8558bf"]},"record_set":"23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602","records_sha256":"c69a2f4ac011d75d338342f5b905bd65fc17c5a70492030641ebacaebb1ffbcb","revision":1325039164,"schema":"wikilean.articles.article/1","seal":{"created":"2026-11-01T14:25:17Z","schema":"cf-locate-recordset/2","set_id":"tierA-b1b","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","status_rule":3},"source":{"html_sha256":"dd7b91bc4f72133cf449184ae311551d16b8527a113d47a0808f3e1b81bfcb3c","layer_sha256":"d3ce11843669049c0d08a21f1f6ef0c58ef6b218d3d2fddba2701e519efcf0eb","renderer":"web-html/3"},"source_id":"enwiki-537048-1325039164","summary":{"by_library":{"atlas":{"complete":0,"incomplete":2,"locations":2,"passages":2,"related":4},"ff-multivariate-polynomials":{"complete":1,"incomplete":0,"locations":1,"passages":1,"related":0},"formal-conjectures":{"complete":2,"incomplete":0,"locations":2,"passages":1,"related":0},"lean-core":{"complete":5,"incomplete":0,"locations":5,"passages":4,"related":2},"mathlib":{"complete":30,"incomplete":0,"locations":30,"passages":22,"related":14},"tauceti":{"complete":3,"incomplete":0,"locations":3,"passages":2,"related":4}},"by_prominence":{"central":{"by_status":{"formalized":3,"not_formalized":5,"partial":4,"statement_only":0,"unresolved":0},"passages":12},"subject":{"by_status":{"formalized":0,"not_formalized":0,"partial":1,"statement_only":0,"unresolved":0},"passages":1},"supporting":{"by_status":{"formalized":8,"not_formalized":22,"partial":11,"statement_only":0,"unresolved":2},"passages":43}},"by_proof_status":{"definition":14,"proved":50,"wanted":3},"by_relation":{"broadMatch":9,"closeMatch":4,"hasPart":14,"narrowMatch":16,"relatedMatch":24},"by_status":{"formalized":11,"not_formalized":27,"partial":16,"statement_only":0,"unresolved":2},"locations":43,"passages":56,"related":24},"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":"Equation solving","universe":{"frozen":"2026-10-17","id":"u1","libraries":48,"sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"wikidata":"Q1879820"}
