{"assessment":{"class":"B","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":1830142,"passages":[{"absence":null,"basis":"757e1e626f3f4972788c866c7f693f1b04eaf88f737a3459e729fd6bab903c94","coverage":null,"id":"enwiki-1830142-1372610632::In-text #3aa7a473","item":"In-text #3aa7a473","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Function.Injective","end_line":54,"library":"lean-core","line":53,"location_key":"757e1e626f3f4972788c866c7f693f1b04eaf88f737a3459e729fd6bab903c94","module":"Init.Data.Function","note":null,"pair_key":"a57c4c9de7b3a4357871d032623e5ac45e0889b76f798b263e481e06536159bb","path":"src/Init/Data/Function.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Function.Injective {α : Sort u_1} {β : Sort u_2} : (α → β) → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d096deb2b93c95c8fe04fff78ea1d2913185613c22e1837bd51eaf1e315ed6ac","prominence":"central","quote":{"exact":"The function is injective, or one-to-one, if each element of the codomain"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"before":{"layer":"Given a function f : X → Y {\\displaystyle f\\colon X\\to Y} : ","lead_in":true,"segments":[{"text":"Given a function "},{"tex":"f\\colon X\\to Y"},{"text":" : "}]},"layer":"The function is injective, or one-to-one, if each element of the codomain is mapped to by at most one element of the domain, or equivalently, if distinct elements of the domain map to distinct elements in the codomain. An injective function is also called an injection.[1] Notationally: ∀ x , x ′ ∈ X , f ( x ) = f ( x ′ ) ⟹ x = x ′ , {\\displaystyle \\forall x,x'\\in X,f(x)=f(x')\\implies x=x',}","segments":[{"text":"The function is injective, or one-to-one, if each element of the codomain is mapped to by at most one element of the domain, or equivalently, if distinct elements of the domain map to distinct elements in the codomain. An injective function is also called an injection."},{"ref":"[1]"},{"text":" Notationally: "},{"tex":"\\forall x,x'\\in X,f(x)=f(x')\\implies x=x',"}]},"unresolved":null},{"absence":null,"basis":"2560b3158be4be6c28fb63d9da924a886626ae8db2515e2037cce72a2cf54819","coverage":null,"id":"enwiki-1830142-1372610632::In-text #f1cbefaa","item":"In-text #f1cbefaa","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"pairwise_ne_iff_injective","end_line":482,"library":"mathlib","line":481,"location_key":"2560b3158be4be6c28fb63d9da924a886626ae8db2515e2037cce72a2cf54819","module":"Mathlib.Data.Set.Pairwise.Basic","note":"Lean packs the contrapositive condition inside the `Pairwise` predicate, whose definition is the implication from i ≠ j to the relation, and states the equivalence with injectivity in that packed form.","pair_key":"4592406ad1bbff641675302c647ed7c5bbee14f57c11449b3a13301ef8990488","path":"Mathlib/Data/Set/Pairwise/Basic.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem pairwise_ne_iff_injective {α : Type*} {ι : Type*} {f : ι → α} : (Pairwise fun i j ↦ f i ≠ f j) ↔ Function.Injective f"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.injective_iff_pairwise_ne","end_line":47,"library":"mathlib","line":46,"location_key":"a449943ec8951325405e6496c414a29007e4a85a1f9b91f2c217ff0a9f74ff77","module":"Mathlib.Logic.Pairwise","note":"Lean writes the same equivalence in the other orientation, with the inequality relation transported along f by `Function.onFun` and wrapped in `Pairwise`.","pair_key":"8ff4e4195ff7ab9efb980ba752737a75db5f5e54e270496e68003ef95ba6ec55","path":"Mathlib/Logic/Pairwise.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.injective_iff_pairwise_ne {α : Type*} {ι : Type*} {f : ι → α} : Function.Injective f ↔ Pairwise (Function.onFun (fun x1 x2 ↦ x1 ≠ x2) f)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7fb0f568e308932e12a76fa0895f7abe2702cb9578a196a614eaec29be77669e","prominence":"supporting","quote":{"exact":"or, equivalently (using logical transposition), ∀ x , x ′ ∈ X"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"before":{"layer":"∀ x , x ′ ∈ X , f ( x ) = f ( x ′ ) ⟹ x = x ′ , {\\displaystyle \\forall x,x'\\in X,f(x)=f(x')\\implies x=x',} ","lead_in":true,"segments":[{"tex":"\\forall x,x'\\in X,f(x)=f(x')\\implies x=x',"},{"text":" "}]},"layer":"or, equivalently (using logical transposition), ∀ x , x ′ ∈ X , x ≠ x ′ ⟹ f ( x ) ≠ f ( x ′ ) . {\\displaystyle \\forall x,x'\\in X,x\\neq x'\\implies f(x)\\neq f(x').}","segments":[{"text":"or, equivalently (using logical transposition), "},{"tex":"\\forall x,x'\\in X,x\\neq x'\\implies f(x)\\neq f(x')."}]},"unresolved":null},{"absence":null,"basis":"9d2dbea71327bcfc964a394885168f8c84df9b010b50a80c891f9f43f742b753","coverage":null,"id":"enwiki-1830142-1372610632::In-text #ce688a91","item":"In-text #ce688a91","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Function.Surjective","end_line":63,"library":"lean-core","line":62,"location_key":"9d2dbea71327bcfc964a394885168f8c84df9b010b50a80c891f9f43f742b753","module":"Init.Data.Function","note":null,"pair_key":"907ad1347aa056f675bc806f88bcfac0ea727dce30a15435cd2163e5dfd77280","path":"src/Init/Data/Function.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Function.Surjective {α : Sort u_1} {β : Sort u_2} : (α → β) → Prop"},"statement":true},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.range_eq_univ","end_line":598,"library":"mathlib","line":597,"location_key":"d62751c0178a82d32921639ef365d94a0647813c4efcef2bf06fc44fa30b431f","module":"Mathlib.Data.Set.Image","note":"Lean records the image of f as `Set.range f` and the whole codomain as `Set.univ`, and states that their equality is the same condition as the predicate the passage defines.","pair_key":"5a8dec4091c10d50033ba3e6117c7c5c114ca4a96b9166ea92199a0d103a13d5","path":"Mathlib/Data/Set/Image.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.range_eq_univ {α : Type*} {ι : Sort*} {f : ι → α} : Set.range f = Set.univ ↔ Function.Surjective f"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b674a4ccc8c7e459cac4afbd86a7308f3c3e73d4a6700a589db425cb9e939320","prominence":"central","quote":{"exact":"The function is surjective, or onto, if each element of the codomain"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"before":{"layer":"∀ x , x ′ ∈ X , x ≠ x ′ ⟹ f ( x ) ≠ f ( x ′ ) . {\\displaystyle \\forall x,x'\\in X,x\\neq x'\\implies f(x)\\neq f(x').} [2][3][4] ","lead_in":true,"segments":[{"tex":"\\forall x,x'\\in X,x\\neq x'\\implies f(x)\\neq f(x')."},{"text":" "},{"ref":"[2][3][4]"},{"text":" "}]},"layer":"The function is surjective, or onto, if each element of the codomain is mapped to by at least one element of the domain; that is, if the image and the codomain of the function are equal. A surjective function is a surjection.[1] Notationally: ∀ y ∈ Y , ∃ x ∈ X , y = f ( x ) . {\\displaystyle \\forall y\\in Y,\\exists x\\in X,y=f(x).}","segments":[{"text":"The function is surjective, or onto, if each element of the codomain is mapped to by at least one element of the domain; that is, if the image and the codomain of the function are equal. A surjective function is a surjection."},{"ref":"[1]"},{"text":" Notationally: "},{"tex":"\\forall y\\in Y,\\exists x\\in X,y=f(x)."}]},"unresolved":null},{"absence":null,"basis":"eede0a063f0cf2fb3a0de09924e8b8158cc80daf5b58d98f1417f5c092f63791","coverage":null,"id":"enwiki-1830142-1372610632::In-text #d2f21f72","item":"In-text #d2f21f72","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.Bijective","end_line":164,"library":"mathlib","line":163,"location_key":"eede0a063f0cf2fb3a0de09924e8b8158cc80daf5b58d98f1417f5c092f63791","module":"Mathlib.Logic.Function.Defs","note":null,"pair_key":"be9c2d9bad8949300b87297b3e22aef7120d617f48342269b5326b817188a9de","path":"Mathlib/Logic/Function/Defs.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Function.Bijective {α : Sort u₁} {β : Sort u₂} : (α → β) → Prop"},"statement":true},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.bijective_iff_existsUnique","end_line":334,"library":"mathlib","line":332,"location_key":"d6aac50af7e5694e10349f04472ade2148af08b35171745956ec7b4f14e67263","module":"Mathlib.Logic.Function.Basic","note":"Lean unfolds the predicate into the passage's displayed condition, writing the equation with the value on the left of the equality sign rather than on the right.","pair_key":"3759084f35476c472885deeebe26b2d37a2c05ec012277cc6894d6820641c115","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.bijective_iff_existsUnique {α : Sort*} {β : Sort*} (f : α → β) : Function.Bijective f ↔ ∀ (b : β), ∃! a, f a = b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6c4cf895a949317b0fec61b3c070c05f48406c03c0d1096b19a6532b28590ab6","prominence":"central","quote":{"exact":"The function is bijective (one-to-one and onto, one-to-one correspondence, or invertible) if"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"before":{"layer":"∀ y ∈ Y , ∃ x ∈ X , y = f ( x ) . {\\displaystyle \\forall y\\in Y,\\exists x\\in X,y=f(x).} [2][3][4] ","lead_in":true,"segments":[{"tex":"\\forall y\\in Y,\\exists x\\in X,y=f(x)."},{"text":" "},{"ref":"[2][3][4]"},{"text":" "}]},"layer":"The function is bijective (one-to-one and onto, one-to-one correspondence, or invertible) if each element of the codomain is mapped to by exactly one element of the domain; that is, if the function is both injective and surjective. A bijective function is also called a bijection.[1][2][3][4] That is, combining the definitions of injective and surjective, ∀ y ∈ Y , ∃ ! x ∈ X , y = f ( x ) , {\\displaystyle \\forall y\\in Y,\\exists !x\\in X,y=f(x),}","segments":[{"text":"The function is bijective (one-to-one and onto, one-to-one correspondence, or invertible) if each element of the codomain is mapped to by exactly one element of the domain; that is, if the function is both injective and surjective. A bijective function is also called a bijection."},{"ref":"[1][2][3][4]"},{"text":" That is, combining the definitions of injective and surjective, "},{"tex":"\\forall y\\in Y,\\exists !x\\in X,y=f(x),"}]},"unresolved":null},{"absence":null,"basis":"576e117add857879373fd37057456029503aba6d4cc71d12fd4b07edf8b56f24","coverage":null,"id":"enwiki-1830142-1372610632::In-text #8adf4b2b","item":"In-text #8adf4b2b","kind":"notation","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ExistsUnique","end_line":22,"library":"mathlib","line":22,"location_key":"576e117add857879373fd37057456029503aba6d4cc71d12fd4b07edf8b56f24","module":"Mathlib.Basic.ExistsUnique","note":null,"pair_key":"fe536b92503fcc23be3915491151b85945001d29c3f85fd4681a8c57ce053a85","path":"Mathlib/Basic/ExistsUnique.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def ExistsUnique {α : Sort*} : (α → Prop) → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2777c215f9e25f29f9f4705a8284e75bf44185989395e46e6febb5584397f6ce","prominence":"supporting","quote":{"exact":"where ∃ ! x {\\displaystyle \\exists !x} means \"there exists exactly one"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"before":{"layer":"∀ y ∈ Y , ∃ ! x ∈ X , y = f ( x ) , {\\displaystyle \\forall y\\in Y,\\exists !x\\in X,y=f(x),} ","lead_in":true,"segments":[{"tex":"\\forall y\\in Y,\\exists !x\\in X,y=f(x),"},{"text":" "}]},"layer":"where ∃ ! x {\\displaystyle \\exists !x} means \"there exists exactly one x\".","segments":[{"text":"where "},{"tex":"\\exists !x"},{"text":" means \"there exists exactly one x\"."}]},"unresolved":null},{"absence":null,"basis":"5561a7387c9de90356150c30379a0613b8b3c0595e085b108a7092ce35929f5a","coverage":null,"id":"enwiki-1830142-1372610632::In-text #503d2f59","item":"In-text #503d2f59","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"existsUnique_eq","end_line":115,"library":"mathlib","line":114,"location_key":"5561a7387c9de90356150c30379a0613b8b3c0595e085b108a7092ce35929f5a","module":"Mathlib.Basic.ExistsUnique","note":null,"pair_key":"730febdf7e1a9821e59d01652b4051e02071cb70af721f04f10dc73acc30af50","path":"Mathlib/Basic/ExistsUnique.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem existsUnique_eq {α : Sort*} {a' : α} : ∃! a, a = a'"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2794bb1c9072bcdc37c6a4ea2f73c8399668066b50d48f4172e89176f8032bef","prominence":"supporting","quote":{"exact":"In any case (for any function), the following holds: ∀ x ∈"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"In any case (for any function), the following holds: ∀ x ∈ X , ∃ ! y ∈ Y , y = f ( x ) . {\\displaystyle \\forall x\\in X,\\exists !y\\in Y,y=f(x).}","segments":[{"text":"In any case (for any function), the following holds: "},{"tex":"\\forall x\\in X,\\exists !y\\in Y,y=f(x)."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"5577110869cb72d88f887a73727ebd1132c7d7c624762abc2269ade78124ccf3"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-1830142-1372610632::In-text #3199a468","item":"In-text #3199a468","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"1b429cdf80b7a80351e9cba19ba7208a9910a5adea35bb9d7e978ecbea6a2874","prominence":"supporting","quote":{"exact":"An injective function need not be surjective (not all elements of the"},"quote_capped":true,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"after":{"layer":", and a surjective function need not be injective (some images may be associated with more than one argument).","segments":[{"text":", and a surjective function need not be injective (some images may be associated with more than one argument)."}]},"layer":"An injective function need not be surjective (not all elements of the codomain may be associated with arguments)","segments":[{"text":"An injective function need not be surjective (not all elements of the codomain may be associated with arguments)"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"279f4258b8878df2b9412ffe89a0ae73e517bb912b95f4aaf311d4385f210bfe"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-1830142-1372610632::In-text #35e9ca42","item":"In-text #35e9ca42","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e92b0f811818e0a6ac5feecde93fcb6bf22a772a24301da229ed86a795a4cba1","prominence":"supporting","quote":{"exact":"a surjective function need not be injective (some images may be associated"},"quote_capped":true,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"before":{"layer":"An injective function need not be surjective (not all elements of the codomain may be associated with arguments), and ","segments":[{"text":"An injective function need not be surjective (not all elements of the codomain may be associated with arguments), and "}]},"layer":"a surjective function need not be injective (some images may be associated with more than one argument).","segments":[{"text":"a surjective function need not be injective (some images may be associated with more than one argument)."}]},"unresolved":null},{"absence":null,"basis":"6ad435686f67fa80ca67ffc51e02d3402fce0a771055f3f5693bbb7defda20fa","coverage":null,"id":"enwiki-1830142-1372610632::In-text #d5c91342","item":"In-text #d5c91342","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Function.Injective","end_line":54,"library":"lean-core","line":53,"location_key":"6ad435686f67fa80ca67ffc51e02d3402fce0a771055f3f5693bbb7defda20fa","module":"Init.Data.Function","note":"Lean encodes the counting condition as the implication from equal values to equal arguments, so the condition is written about pairs of arguments rather than about the preimages of a codomain element.","pair_key":"10d6856b07981ccc8e57d483a14db78dfa0fd8abbf562a91124df5dfc67b4fe6","path":"src/Init/Data/Function.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Function.Injective {α : Sort u_1} {β : Sort u_2} : (α → β) → Prop"},"statement":true},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Function.Injective.mem_range_iff_existsUnique","end_line":1135,"library":"mathlib","line":1133,"location_key":"8232c63b9cccc8dde8752e4798c7633f73a499f3ced7b4844d0ddac0d9abc2bd","module":"Mathlib.Data.Set.Image","note":"It starts from injectivity and characterises when a codomain element lies in the image by having exactly one preimage, so it uses the notion the passage defines instead of defining it.","pair_key":"2192cc03b3b8a2f8ce809caaa02ccb2edbc860a102c773c62221c459b2b1f367","path":"Mathlib/Data/Set/Image.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.Injective.mem_range_iff_existsUnique {α : Type*} {β : Type*} {f : α → β} : Function.Injective f → ∀ {b : β}, b ∈ Set.range f ↔ ∃! a, f a = b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"336b4cb1760adda099c9cbd4965f8dd33535c377bc00afcacf18726e268eb149","prominence":"central","quote":{"exact":"A function is injective (one-to-one) if each possible element of the codomain"},"quote_capped":true,"section":["Injection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"A function is injective (one-to-one) if each possible element of the codomain is mapped to by at most one argument.","segments":[{"text":"A function is injective (one-to-one) if each possible element of the codomain is mapped to by at most one argument."}]},"unresolved":null},{"absence":null,"basis":"9035a86cbeb1fe9da278dcb351804fb9b76d93361abd66c0eaa22af0d200bcc9","coverage":null,"id":"enwiki-1830142-1372610632::In-text #df210206","item":"In-text #df210206","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.injective_iff_pairwise_ne","end_line":47,"library":"mathlib","line":46,"location_key":"9035a86cbeb1fe9da278dcb351804fb9b76d93361abd66c0eaa22af0d200bcc9","module":"Mathlib.Logic.Pairwise","note":"Mathlib writes the distinctness condition by applying the Pairwise predicate through f, which unfolds to the quantified statement about two different arguments.","pair_key":"7d6d9edf798ba4769f59531c062a4e0063d62ff9009b12805c807cf3cc5a9350","path":"Mathlib/Logic/Pairwise.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.injective_iff_pairwise_ne {α : Type*} {ι : Type*} {f : ι → α} : Function.Injective f ↔ Pairwise (Function.onFun (fun x1 x2 ↦ x1 ≠ x2) f)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"pairwise_ne_iff_injective","end_line":482,"library":"mathlib","line":481,"location_key":"51eb4e487e2faa5f8625926f38597cc384042541945bcd7d8a652fb18ceea926","module":"Mathlib.Data.Set.Pairwise.Basic","note":"The same equivalence with the two sides in the other order, the distinctness condition being spelled out inside the Pairwise predicate.","pair_key":"81ff2eabafcd9c28564ea675b02e9bcce43d9a1abdd5cc5c7d5bcb1e6fcec329","path":"Mathlib/Data/Set/Pairwise/Basic.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem pairwise_ne_iff_injective {α : Type*} {ι : Type*} {f : ι → α} : (Pairwise fun i j ↦ f i ≠ f j) ↔ Function.Injective f"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Function.Injective.ne","end_line":125,"library":"lean-core","line":124,"location_key":"61855424276684c15bea92a00601e5c24a98a33bb72839c9654e1351aabb0e1a","module":"Init.Data.Function","note":"It gives only the direction from injectivity to distinct images, not the return direction the passage's equivalence also asserts.","pair_key":"6b28c249233435c25cc39dfbe0b9ecb1c70b9269c54044a8041cfc963e3815d1","path":"src/Init/Data/Function.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Function.Injective.ne {α : Sort u_1} {β : Sort u_2} {f : α → β} : Function.Injective f → ∀ {a₁ a₂ : α}, a₁ ≠ a₂ → f a₁ ≠ f a₂"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"281ecf3c44b6712ab69729e8fb36fd2160357c7bb533ce50b1d61e9063ef7631","prominence":"supporting","quote":{"exact":"Equivalently, a function is injective if it maps distinct arguments to distinct"},"quote_capped":true,"section":["Injection"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"Equivalently, a function is injective if it maps distinct arguments to distinct images.","segments":[{"text":"Equivalently, a function is injective if it maps distinct arguments to distinct images."}]},"unresolved":null},{"absence":null,"basis":"733538ea9d579ede17502d0faf5d9a9ee863e2b8238e37a195a04cd2cba4635d","coverage":null,"id":"enwiki-1830142-1372610632::In-text #f9b90a8b","item":"In-text #f9b90a8b","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Function.Injective","end_line":54,"library":"lean-core","line":53,"location_key":"733538ea9d579ede17502d0faf5d9a9ee863e2b8238e37a195a04cd2cba4635d","module":"Init.Data.Function","note":"The library definition is the displayed implication of the passage, with the two arguments quantified implicitly over the domain.","pair_key":"ed476a83ea3338cb6bee4b11863af16bc93eb5484c3128599476b0708f473185","path":"src/Init/Data/Function.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Function.Injective {α : Sort u_1} {β : Sort u_2} : (α → β) → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"798b6c2491dd717a35dff4d3b703d000ed2422c2bc47469a4e0590dc44c29d12","prominence":"central","quote":{"exact":"The function f : X → Y {\\displaystyle f\\colon X\\to Y} is","suffix":" i"},"quote_capped":true,"section":["Injection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"The function f : X → Y {\\displaystyle f\\colon X\\to Y} is injective, if for all x , x ′ ∈ X {\\displaystyle x,x'\\in X} , f ( x ) = f ( x ′ ) ⇒ x = x ′ . {\\displaystyle f(x)=f(x')\\Rightarrow x=x'.}","segments":[{"text":"The function "},{"tex":"f\\colon X\\to Y"},{"text":" is injective, if for all "},{"tex":"x,x'\\in X"},{"text":" , "},{"tex":"f(x)=f(x')\\Rightarrow x=x'."}]},"unresolved":null},{"absence":null,"basis":"d666f1711c25b97630df59669b88a2f2b5e1f08dd794e2c5271c9aa924aeea3a","coverage":null,"id":"enwiki-1830142-1372610632::In-text #77be67f1","item":"In-text #77be67f1","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Function.injective_iff_hasLeftInverse","end_line":559,"library":"mathlib","line":558,"location_key":"d666f1711c25b97630df59669b88a2f2b5e1f08dd794e2c5271c9aa924aeea3a","module":"Mathlib.Logic.Function.Basic","note":"The left inverse it quantifies over is defined on the whole of Y, and restricting such a map to the set of values of f yields the article's g; the empty-domain situation, which the article treats by its first alternative, is excluded by the instance argument.","pair_key":"9595c6ae34ddbe993b66758b7ec2e925890e6fb0e092e0370c0111fda6ccdeab","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.injective_iff_hasLeftInverse {α : Sort*} {β : Sort*} [Nonempty α] {f : α → β} : Function.Injective f ↔ Function.HasLeftInverse f"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.leftInverse_rangeFactorization_iff_injective","end_line":976,"library":"mathlib","line":973,"location_key":"4f2043370caa11d7fe3cec871dd802846ab3319ac08d211abe8d085238e0674f","module":"Mathlib.Data.Set.Image","note":"It names one chosen map on the image rather than quantifying over all of them, so the article's return direction, starting from an arbitrary g, is not what it delivers.","pair_key":"65ba3053c3c1442edd0c023d632a13a61d24911459f70a3368c0b46e7482774b","path":"Mathlib/Data/Set/Image.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.leftInverse_rangeFactorization_iff_injective {α : Type*} {β : Type*} (f : α → β) : Function.LeftInverse (Set.rangeSplitting f) (Set.rangeFactorization f) ↔ Function.Injective f"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Function.HasLeftInverse.injective","end_line":95,"library":"lean-core","line":94,"location_key":"dd97d62e60f013402be2fa317dcc3eec3b9acdcedd79a1e802df47dfb96f9b82","module":"Init.Data.Function","note":"It concludes injectivity from a left inverse defined on all of the codomain, whereas the article's g is only defined on the image, so its hypothesis is the heavier one.","pair_key":"a031c65270bc8ff298b7e2c7206a5ead4bf9e79150c38dd10a769cd2467c0e7a","path":"src/Init/Data/Function.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Function.HasLeftInverse.injective {α : Sort u_1} {β : Sort u_2} {f : α → β} : Function.HasLeftInverse f → Function.Injective f"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7ecd962eced59c3db7d7209a4f2ae2d89c1b388a41521e48f6ec58feb5d2e091","prominence":"central","quote":{"exact":"A function f : X → Y {\\displaystyle f\\colon X\\to Y} is","suffix":" i"},"quote_capped":true,"section":["Injection"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"before":{"layer":"The following are some facts related to injections: ","lead_in":true,"segments":[{"text":"The following are some facts related to injections: "}]},"layer":"A function f : X → Y {\\displaystyle f\\colon X\\to Y} is injective if and only if X {\\displaystyle X} is empty or f {\\displaystyle f} is left-invertible; that is, there is a function g : f ( X ) → X {\\displaystyle g\\colon f(X)\\to X} such that g ∘ f = {\\displaystyle g\\circ f=} identity function on X.","segments":[{"text":"A function "},{"tex":"f\\colon X\\to Y"},{"text":" is injective if and only if "},{"tex":"X"},{"text":" is empty or "},{"tex":"f"},{"text":" is left-invertible; that is, there is a function "},{"tex":"g\\colon f(X)\\to X"},{"text":" such that "},{"tex":"g\\circ f="},{"text":" identity function on X."}]},"unresolved":null},{"absence":null,"basis":"d4307ec599c9614da725a076c52509e378151532e85abaa582cc090b7612d2ad","coverage":null,"id":"enwiki-1830142-1372610632::In-text #9c836dd1","item":"In-text #9c836dd1","kind":"notation","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.range","end_line":172,"library":"mathlib","line":172,"location_key":"d4307ec599c9614da725a076c52509e378151532e85abaa582cc090b7612d2ad","module":"Mathlib.Data.Set.Operations","note":"Mathlib writes this set as the range of f where the article writes the function applied to its whole domain; both name the set of values of f inside Y.","pair_key":"96089b291852f92967c2d781e5090437f4093b2bb73387d27ab770adebfd54d0","path":"Mathlib/Data/Set/Operations.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Set.range {α : Type u} {ι : Sort*} : (ι → α) → Set α"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.image","end_line":262,"library":"mathlib","line":262,"location_key":"8cfaec59275c144e898f3c59bd3e7a9a5f41f1672b58c285f4fa07d9a1b6a61d","module":"Mathlib.Data.Set.Defs","note":"It is the image of a chosen subset of the domain, so it names the article's set only after that subset is identified with everything, which is a separate library lemma.","pair_key":"dd7d4fe0d8c42ac76a6f3a8f332dedad92ba35e430904eb17cb8f4e1351b224a","path":"Mathlib/Data/Set/Defs.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Set.image {α : Type u} {β : Type v} : (α → β) → Set α → Set β"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"65500850c8506e723886dd6243a74f84af710813fb436eccb5ec17d4a7e688fe","prominence":"supporting","quote":{"exact":"Here, f ( X ) {\\displaystyle f(X)} is the image of f"},"quote_capped":true,"section":["Injection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"before":{"layer":"A function f : X → Y {\\displaystyle f\\colon X\\to Y} is injective if and only if X {\\displaystyle X} is empty or f {\\displaystyle f} is left-invertible; that is, there is a function g : f ( X ) → X {\\displaystyle g\\colon f(X)\\to X} such that g ∘ f = {\\displaystyle g\\circ f=} identity function on X. ","segments":[{"text":"A function "},{"tex":"f\\colon X\\to Y"},{"text":" is injective if and only if "},{"tex":"X"},{"text":" is empty or "},{"tex":"f"},{"text":" is left-invertible; that is, there is a function "},{"tex":"g\\colon f(X)\\to X"},{"text":" such that "},{"tex":"g\\circ f="},{"text":" identity function on X. "}]},"layer":"Here, f ( X ) {\\displaystyle f(X)} is the image of f {\\displaystyle f} .","segments":[{"text":"Here, "},{"tex":"f(X)"},{"text":" is the image of "},{"tex":"f"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"99397bef02b82fcde20543d4a453c1ada9ccdd24d7225666a46cb08c4cd0ef93","coverage":null,"id":"enwiki-1830142-1372610632::In-text #c506b22b","item":"In-text #c506b22b","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.rangeFactorization_surjective","end_line":186,"library":"mathlib","line":185,"location_key":"99397bef02b82fcde20543d4a453c1ada9ccdd24d7225666a46cb08c4cd0ef93","module":"Mathlib.Data.Set.Operations","note":"The library's range factorization is f with its codomain replaced by the set of its values, and the lemma states that this map is onto.","pair_key":"b211390ef36893cc1a840d8b791e79a4c0a81642bf7038e6996c745d8daa4cc9","path":"Mathlib/Data/Set/Operations.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.rangeFactorization_surjective {α : Type u} {ι : Sort*} {f : ι → α} : Function.Surjective (Set.rangeFactorization f)"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.imageFactorization_surjective","end_line":544,"library":"mathlib","line":542,"location_key":"8f779fbcf81c26af1765272e36d9458b003e698d0f03dc7ccc064b1c8da1b12d","module":"Mathlib.Data.Set.Image","note":"It restricts both the domain to a chosen subset and the codomain to the image of that subset, so its map is not the article's function with only its codomain cut down.","pair_key":"f51ab5114d2f466d56e63975565cc1c40017d113c1ae71fe7e57cc65cc35ac84","path":"Mathlib/Data/Set/Image.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.imageFactorization_surjective {α : Type*} {β : Type*} {f : α → β} {s : Set α} : Function.Surjective (Set.imageFactorization f s)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c0058fb1d6fcc54f5215903a9de2bb8acce57da316f22b60851d61fafaa15c15","prominence":"supporting","quote":{"exact":"every function is surjective when its codomain is restricted to its image"},"quote_capped":false,"section":["Injection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"after":{"layer":", every injection induces a bijection onto its image.","segments":[{"text":", every injection induces a bijection onto its image."}]},"before":{"layer":"Since ","segments":[{"text":"Since "}]},"layer":"every function is surjective when its codomain is restricted to its image","segments":[{"text":"every function is surjective when its codomain is restricted to its image"}]},"unresolved":null},{"absence":null,"basis":"a906830b7b6803fc0351bdcfd67ddceb5d1f566301e3f4541ca2da88f4ac8068","coverage":null,"id":"enwiki-1830142-1372610632::In-text #195cb286","item":"In-text #195cb286","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.ofInjective","end_line":544,"library":"mathlib","line":543,"location_key":"a906830b7b6803fc0351bdcfd67ddceb5d1f566301e3f4541ca2da88f4ac8068","module":"Mathlib.Logic.Equiv.Set","note":"The equivalence carries its inverse map and the two round trip equations alongside the forward map, which together are the bijection itself.","pair_key":"8b98d6e1881b7cea972cf9ccd7f3a33a446849536fb305e253ec5a0dd51f6d3c","path":"Mathlib/Logic/Equiv/Set.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Equiv.ofInjective {α : Sort*} {β : Type*} (f : α → β) : Function.Injective f → α ≃ ↑(Set.range f)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.rangeFactorization_bijective","end_line":189,"library":"mathlib","line":188,"location_key":"93ce35ed5364dd69572ff7e70772691d373dc51caaf9b26ee3d33a854aa89a26","module":"Mathlib.Data.Set.Operations","note":"Mathlib proves the two way equivalence between injectivity of f and bijectivity of f with its codomain cut down to the set of its values.","pair_key":"5b8a5e2ea35e68319b5d98a0fe9be425db296681cb58d2a8e5015b00a655ae05","path":"Mathlib/Data/Set/Operations.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.rangeFactorization_bijective {α : Type u} {ι : Sort*} {f : ι → α} : Function.Bijective (Set.rangeFactorization f) ↔ Function.Injective f"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"56f8b3df48fd80c7ef92c8f41120ada890a35219d0fa4bddcb605903472e6552","prominence":"central","quote":{"exact":"every injection induces a bijection onto its image."},"quote_capped":false,"section":["Injection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"before":{"layer":"Since every function is surjective when its codomain is restricted to its image, ","segments":[{"text":"Since every function is surjective when its codomain is restricted to its image, "}]},"layer":"every injection induces a bijection onto its image.","segments":[{"text":"every injection induces a bijection onto its image."}]},"unresolved":null},{"absence":null,"basis":"8cb2b51a99bf71de75f4802d53b0822fb28987f8f5f4e8227a343efd74a0fc7a","coverage":null,"id":"enwiki-1830142-1372610632::In-text #1367866c","item":"In-text #1367866c","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Equiv.ofInjective_apply","end_line":542,"library":"mathlib","line":542,"location_key":"8cb2b51a99bf71de75f4802d53b0822fb28987f8f5f4e8227a343efd74a0fc7a","module":"Mathlib.Logic.Equiv.Set","note":"Mathlib records the factorisation argument by argument: the value of the canonical equivalence of X with the set of values of f, read back inside Y, is f at that argument, the second factor being the subtype coercion.","pair_key":"372b8f4f809194fe85d9a4f3df814087afd4a7aeb51eb42ca7425fed04ef50e8","path":"Mathlib/Logic/Equiv/Set.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Equiv.ofInjective_apply {α : Sort*} {β : Type*} (f : α → β) (hf : Function.Injective f) (a : α) : (Equiv.ofInjective f hf) a = ⟨f a, ⋯⟩"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.coe_comp_rangeFactorization","end_line":904,"library":"mathlib","line":904,"location_key":"3398ed51415f1c3e61534bff7ca4aa6f7c67baaf503ffe3876ce73e8de4882f8","module":"Mathlib.Data.Set.Image","note":"It holds for every function and says nothing about the first factor being a bijection, which the passage also asserts.","pair_key":"17b59d4b363a02acc7e1f014f7e94cf37ba96e8f096b88af24f6b03707655628","path":"Mathlib/Data/Set/Image.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.coe_comp_rangeFactorization {β : Type*} {ι : Sort*} (f : ι → β) : Subtype.val ∘ Set.rangeFactorization f = f"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.rangeFactorization_bijective","end_line":189,"library":"mathlib","line":188,"location_key":"d1b59a8f63c5be5de9948be43a9b0c54eba0359b16724457f038f90b75e6731c","module":"Mathlib.Data.Set.Operations","note":"It settles the nature of the first factor but states no equation identifying f with a composite.","pair_key":"ff1bb735d3a64709250352248031800ae87f7867cb8fbfa406e1c1c2839007da","path":"Mathlib/Data/Set/Operations.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.rangeFactorization_bijective {α : Type u} {ι : Sort*} {f : ι → α} : Function.Bijective (Set.rangeFactorization f) ↔ Function.Injective f"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6825b7c8f89d70180030c3e9aea1a9baa973850d44508abba51b12d41f97c6ae","prominence":"supporting","quote":{"exact":"More precisely, every injection f : X → Y {\\displaystyle f\\colon X\\to"},"quote_capped":true,"section":["Injection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"More precisely, every injection f : X → Y {\\displaystyle f\\colon X\\to Y} can be factored as a bijection followed by an inclusion as follows.","segments":[{"text":"More precisely, every injection "},{"tex":"f\\colon X\\to Y"},{"text":" can be factored as a bijection followed by an inclusion as follows."}]},"unresolved":null},{"absence":null,"basis":"2713a914c5d0a9c85c98da51127b6be161aa097ef200665683543c80eec97859","coverage":null,"id":"enwiki-1830142-1372610632::In-text #a045be74","item":"In-text #a045be74","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.coe_comp_rangeFactorization","end_line":904,"library":"mathlib","line":904,"location_key":"2713a914c5d0a9c85c98da51127b6be161aa097ef200665683543c80eec97859","module":"Mathlib.Data.Set.Image","note":"Lean proves the factorization for an arbitrary function, so it also covers maps that are not injective, which is real content beyond what the passage claims.","pair_key":"7724d68e2c9c15c2980ba6aff0570d2ed6ca410f1168c70b27369b562f482cf3","path":"Mathlib/Data/Set/Image.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.coe_comp_rangeFactorization {β : Type*} {ι : Sort*} (f : ι → β) : Subtype.val ∘ Set.rangeFactorization f = f"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.rangeFactorization_eq","end_line":897,"library":"mathlib","line":896,"location_key":"c96d86824db6d0b5f545b521635899049b68443f13a1106a63543b276e35a0b4","module":"Mathlib.Data.Set.Image","note":"This is the same identity recorded with the function left implicit, and like the previous card it holds for maps that are not injective as well.","pair_key":"d65a5df89329d20a73a810a7c88653ec97904aa9ab164093acf8825f7213054d","path":"Mathlib/Data/Set/Image.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.rangeFactorization_eq {β : Type*} {ι : Sort*} {f : ι → β} : Subtype.val ∘ Set.rangeFactorization f = f"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"22f10e6c868c6af80e4519909c68e49a379278be5b741e4c5885284b924ebe06","prominence":"supporting","quote":{"exact":"Let f R : X → f ( X ) {\\displaystyle f_{R}\\colon"},"quote_capped":true,"section":["Injection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"Let f R : X → f ( X ) {\\displaystyle f_{R}\\colon X\\rightarrow f(X)} be f {\\displaystyle f} with codomain restricted to its image, and let i : f ( X ) → Y {\\displaystyle i\\colon f(X)\\to Y} be the inclusion map from f ( X ) {\\displaystyle f(X)} into Y {\\displaystyle Y} . Then f = i ∘ f R {\\displaystyle f=i\\circ f_{R}} .","segments":[{"text":"Let "},{"tex":"f_{R}\\colon X\\rightarrow f(X)"},{"text":" be "},{"tex":"f"},{"text":" with codomain restricted to its image, and let "},{"tex":"i\\colon f(X)\\to Y"},{"text":" be the inclusion map from "},{"tex":"f(X)"},{"text":" into "},{"tex":"Y"},{"text":" . Then "},{"tex":"f=i\\circ f_{R}"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"a7a20c601168affae7823c27c0278b585566c3063dd43b888315bb962753ecf3","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"13ded06cfcdd54cd09095438860179870cbe5780864b7c94b19056fbcbae69e2","text":"a composite of two injective functions is itself injective"},{"id":"c2","part":"2f2acfac40585729bffb2106fe0f534d6e59c7c09da15e203d19abf74adc4964","text":"if the composite g ∘ f is injective, then f is injective"}],"parts":["13ded06cfcdd54cd09095438860179870cbe5780864b7c94b19056fbcbae69e2","2f2acfac40585729bffb2106fe0f534d6e59c7c09da15e203d19abf74adc4964"],"relation":"exactMatch","status":"formalized"},"id":"enwiki-1830142-1372610632::In-text #3b12d747","item":"In-text #3b12d747","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Function.Injective.comp","end_line":57,"library":"lean-core","line":56,"location_key":"13ded06cfcdd54cd09095438860179870cbe5780864b7c94b19056fbcbae69e2","module":"Init.Data.Function","note":"The declaration composes in the order the passage uses, with the second map applied after the first.","pair_key":"b0b5a8367c99214d93e99c8cc7e2201e2706ae272770fd820b234edd190e088c","path":"src/Init/Data/Function.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Function.Injective.comp {α : Sort u_1} {β : Sort u_2} {γ : Sort u_3} {g : β → γ} {f : α → β} : Function.Injective g → Function.Injective f → Function.Injective (g ∘ f)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.Injective.of_comp","end_line":206,"library":"mathlib","line":205,"location_key":"2f2acfac40585729bffb2106fe0f534d6e59c7c09da15e203d19abf74adc4964","module":"Mathlib.Logic.Function.Basic","note":"Lean names the inner map differently from the passage, which changes nothing about what is asserted.","pair_key":"3caf938a2300048e47f2c4f1dc4c1d3ff3b41d9b94f8618320bcfbfb3ab7279b","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.Injective.of_comp {α : Sort*} {β : Sort*} {γ : Sort*} {f : α → β} {g : γ → α} : Function.Injective (f ∘ g) → Function.Injective g"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"59ad02bc434e840651a668167a5a0a424d13f8d9931824487ac1dc6e6e6abed9","prominence":"central","quote":{"exact":"The composition of two injections is again an injection, but if g"},"quote_capped":true,"section":["Injection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"The composition of two injections is again an injection, but if g ∘ f {\\displaystyle g\\circ f} is injective, then it can only be concluded that f {\\displaystyle f} is injective (see figure).","segments":[{"text":"The composition of two injections is again an injection, but if "},{"tex":"g\\circ f"},{"text":" is injective, then it can only be concluded that "},{"tex":"f"},{"text":" is injective (see figure)."}]},"unresolved":null},{"absence":null,"basis":"22b4c1d98a40dcd4b418b8fd9b3c5e65cff7832f4b4b7c295d4a420fe206dcb0","coverage":null,"id":"enwiki-1830142-1372610632::In-text #ef628c28","item":"In-text #ef628c28","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.Embedding.injective","end_line":119,"library":"mathlib","line":118,"location_key":"22b4c1d98a40dcd4b418b8fd9b3c5e65cff7832f4b4b7c295d4a420fe206dcb0","module":"Mathlib.Logic.Embedding.Basic","note":"Lean packages an embedding as a map carried together with a proof about its behaviour on distinct arguments, and this declaration hands back that proof for the underlying function.","pair_key":"83355f6bb60bba089126049882a77419140b16ed24c64cead3aff48e928a8d49","path":"Mathlib/Logic/Embedding/Basic.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.Embedding.injective {α : Sort*} {β : Sort*} (f : α ↪ β) : Function.Injective ⇑f"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"RelEmbedding.injective","end_line":262,"library":"mathlib","line":261,"location_key":"d931a55cc0ec0963f379036a9bb05b7b43019517cd9f6f6e5bc3075f22f44f60","module":"Mathlib.Order.RelIso.Basic","note":"Relation embeddings are one family of embeddings, so this is the passage read at those particular objects.","pair_key":"75698bb70f0a05b4481d07a7d6ffbef88e0f5fb09a05828cac5ea4a6392dda94","path":"Mathlib/Order/RelIso/Basic.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem RelEmbedding.injective {α : Type*} {β : Type*} {r : α → α → Prop} {s : β → β → Prop} (f : r ↪r s) : Function.Injective ⇑f"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"8b73abe914453362b5be229d2675d995052ae741b80964dce43852d2d4203aa8","prominence":"supporting","quote":{"exact":"Every embedding is injective."},"quote_capped":false,"section":["Injection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"Every embedding is injective.","segments":[{"text":"Every embedding is injective."}]},"unresolved":null},{"absence":null,"basis":"7b466b377a89907ebd8ae3b075565266ee7f44859c14619fd2a70e7da850a282","coverage":null,"id":"enwiki-1830142-1372610632::In-text #abfeac4e","item":"In-text #abfeac4e","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Function.Surjective","end_line":63,"library":"lean-core","line":62,"location_key":"7b466b377a89907ebd8ae3b075565266ee7f44859c14619fd2a70e7da850a282","module":"Init.Data.Function","note":"Lean's predicate says each element of the codomain equals the value of the function at some element of the domain, which is the condition the passage names.","pair_key":"d2e559e9ac92e2c7b05012bddb922b8f0b55a56007196b3c472dc2e68961cd23","path":"src/Init/Data/Function.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Function.Surjective {α : Sort u_1} {β : Sort u_2} : (α → β) → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"62b31cddcb216a03593138b243bac3bd210a51fe4b4b9a9c060e030643fb1cb6","prominence":"central","quote":{"exact":"A function is surjective or onto if each element of the codomain"},"quote_capped":true,"section":["Surjection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"A function is surjective or onto if each element of the codomain is mapped to by at least one element of the domain.","segments":[{"text":"A function is surjective or onto if each element of the codomain is mapped to by at least one element of the domain."}]},"unresolved":null},{"absence":null,"basis":"128ba1baa85dd422d6a354e07387e348146c98916623106c56134c3a10d11fb8","coverage":null,"id":"enwiki-1830142-1372610632::In-text #38c8150c","item":"In-text #38c8150c","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Function.Surjective","end_line":63,"library":"lean-core","line":62,"location_key":"128ba1baa85dd422d6a354e07387e348146c98916623106c56134c3a10d11fb8","module":"Init.Data.Function","note":"Lean writes the condition as the existence of a domain element with the given value, rather than as the non-emptiness of the set of such elements.","pair_key":"1b09c27da5c90e0f79d9fe99e7d08081da4d211b6735407fe4d6e4874d408517","path":"src/Init/Data/Function.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Function.Surjective {α : Sort u_1} {β : Sort u_2} : (α → β) → Prop"},"statement":true},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.preimage_singleton_nonempty","end_line":885,"library":"mathlib","line":884,"location_key":"53eb5ce57b0a7bb298ca71cafa323557b59c71bc1e133e2c820132b993f76b49","module":"Mathlib.Data.Set.Image","note":"It equates non-emptiness of the fibre over a point with membership of that point in the image, so it reaches the passage's equivalence only together with the fact that the image fills the codomain.","pair_key":"f95468713eb5b5ba0ea9a51820dd361b1d8013b81a007422c4b088940887f72a","path":"Mathlib/Data/Set/Image.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.preimage_singleton_nonempty {α : Type*} {β : Type*} {f : α → β} {y : β} : (f ⁻¹' {y}).Nonempty ↔ y ∈ Set.range f"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7b1d2acc5ba07a7619cb00411f7b8569139eae546a9c98ba5c1e54a63f66b38b","prominence":"supporting","quote":{"exact":"In other words, each element of the codomain has a non-empty preimage."},"quote_capped":false,"section":["Surjection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"In other words, each element of the codomain has a non-empty preimage.","segments":[{"text":"In other words, each element of the codomain has a non-empty preimage."}]},"unresolved":null},{"absence":null,"basis":"9ca4bb4e1098d7c1b76a7b0c6a4339bf916448906b450153f3ec9010bf3dd0e2","coverage":null,"id":"enwiki-1830142-1372610632::In-text #3cbb6057","item":"In-text #3cbb6057","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.range_eq_univ","end_line":598,"library":"mathlib","line":597,"location_key":"9ca4bb4e1098d7c1b76a7b0c6a4339bf916448906b450153f3ec9010bf3dd0e2","module":"Mathlib.Data.Set.Image","note":"Lean writes the image as the range of the function and writes the whole codomain as the universal set of the codomain type.","pair_key":"727a24cbc36ab0e7620d9c17491c2e39dd616eb3f365bbd76555ed861c6c501f","path":"Mathlib/Data/Set/Image.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.range_eq_univ {α : Type*} {ι : Sort*} {f : ι → α} : Set.range f = Set.univ ↔ Function.Surjective f"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"1b14751489d31da4825b6b630877819484a29725537711336f689178c0899879","prominence":"supporting","quote":{"exact":"Equivalently, a function is surjective if its image is equal to its"},"quote_capped":true,"section":["Surjection"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"Equivalently, a function is surjective if its image is equal to its codomain.","segments":[{"text":"Equivalently, a function is surjective if its image is equal to its codomain."}]},"unresolved":null},{"absence":null,"basis":"bdd7dbc9dc9079002df5eb9fa3352d53a616cdafc06dddce4b62df60ac1e7cc4","coverage":null,"id":"enwiki-1830142-1372610632::In-text #657e27cb","item":"In-text #657e27cb","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Function.Surjective","end_line":63,"library":"lean-core","line":62,"location_key":"bdd7dbc9dc9079002df5eb9fa3352d53a616cdafc06dddce4b62df60ac1e7cc4","module":"Init.Data.Function","note":"Lean's predicate quantifies over the codomain and asserts an element of the domain with the prescribed value, matching the passage's formal clause.","pair_key":"21b56e84c1d2d5b85de2083ffeb86be5b89f9604afbab8fcc1293d778ad92547","path":"src/Init/Data/Function.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Function.Surjective {α : Sort u_1} {β : Sort u_2} : (α → β) → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"83818d877c500457de730d107df8c2817b1b184ca7f34f671d9d800b388c33c3","prominence":"central","quote":{"exact":"The function f : X → Y {\\displaystyle f\\colon X\\to Y} is","suffix":" s"},"quote_capped":true,"section":["Surjection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"The function f : X → Y {\\displaystyle f\\colon X\\to Y} is surjective, if for all y ∈ Y {\\displaystyle y\\in Y} , there is x ∈ X {\\displaystyle x\\in X} such that f ( x ) = y . {\\displaystyle f(x)=y.}","segments":[{"text":"The function "},{"tex":"f\\colon X\\to Y"},{"text":" is surjective, if for all "},{"tex":"y\\in Y"},{"text":" , there is "},{"tex":"x\\in X"},{"text":" such that "},{"tex":"f(x)=y."}]},"unresolved":null},{"absence":null,"basis":"2e66dbc9fabbfcab240c5d83c9d5eae7d13fcb100c6ff36e58cb4d98780dc911","coverage":null,"id":"enwiki-1830142-1372610632::In-text #772fc42c","item":"In-text #772fc42c","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.surjective_iff_hasRightInverse","end_line":589,"library":"mathlib","line":588,"location_key":"2e66dbc9fabbfcab240c5d83c9d5eae7d13fcb100c6ff36e58cb4d98780dc911","module":"Mathlib.Logic.Function.Basic","note":"Lean's right-inverse predicate is written pointwise, saying f sends the value of the candidate inverse at each element back to that element, where the passage writes an equation between the composite and the identity map.","pair_key":"c46ca19fa0d03f0a2a20fddf86c1a9613a3831c2b05ea6bb4a228d19c6667461","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.surjective_iff_hasRightInverse {α : Sort u} {β : Sort v} {f : α → β} : Function.Surjective f ↔ Function.HasRightInverse f"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7a3c5aefd4a0ee230316bdfb49b2ea56edb82364a4812faec2d5f1bb0ae30894","prominence":"central","quote":{"exact":"A function f : X → Y {\\displaystyle f\\colon X\\to Y} is","suffix":" s"},"quote_capped":true,"section":["Surjection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"before":{"layer":"The following are some facts related to surjections: ","lead_in":true,"segments":[{"text":"The following are some facts related to surjections: "}]},"layer":"A function f : X → Y {\\displaystyle f\\colon X\\to Y} is surjective if and only if it is right-invertible; that is, if and only if there is a function g : Y → X {\\displaystyle g\\colon Y\\to X} such that f ∘ g = {\\displaystyle f\\circ g=} identity function on Y {\\displaystyle Y} .","segments":[{"text":"A function "},{"tex":"f\\colon X\\to Y"},{"text":" is surjective if and only if it is right-invertible; that is, if and only if there is a function "},{"tex":"g\\colon Y\\to X"},{"text":" such that "},{"tex":"f\\circ g="},{"text":" identity function on "},{"tex":"Y"},{"text":" ."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"c342ebee2f79795588db44ab9ca7bb6698c08d9045cfc8a0fe914a8fe8116ce6"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-1830142-1372610632::In-text #55ed65eb","item":"In-text #55ed65eb","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.surjective_iff_hasRightInverse","end_line":589,"library":"mathlib","line":588,"location_key":"52303cfe3e33bcb5747ab48cdd18927c6ca131d84caffe2c6e8128eb8f4ab37b","module":"Mathlib.Logic.Function.Basic","note":"This is the splitting principle whose strength the passage measures, proved in a setting where choice is already available.","pair_key":"a07047772d65f8bfa2193125f4ca03130bca3fd3a1ae67ea8e2fcfc60e6d3cca","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.surjective_iff_hasRightInverse {α : Sort u} {β : Sort v} {f : α → β} : Function.Surjective f ↔ Function.HasRightInverse f"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Classical.axiomOfChoice","end_line":123,"library":"lean-core","line":122,"location_key":"d7137fea868d7deecbba047c13ff660f7a0df826c34c7d1602c2044c0f8701a1","module":"Init.Classical","note":"It is the choice principle itself, derived in Lean from the Classical.choice axiom.","pair_key":"3050467482bdac4036ff63e4e58b2f7a0ed1d1cda727d3fe1f73aed947b11728","path":"src/Init/Classical.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Classical.axiomOfChoice {α : Sort u} {β : α → Sort v} {r : (x : α) → β x → Prop} : (∀ (x : α), ∃ y, r x y) → ∃ f, ∀ (x : α), r x (f x)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"569b640b2e7dcbf8995d86f727aaf89f1977b0ea03505384ca540a3859a367a7","prominence":"supporting","quote":{"exact":"(This statement is equivalent to the axiom of choice.)"},"quote_capped":false,"section":["Surjection"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"(This statement is equivalent to the axiom of choice.)","segments":[{"text":"(This statement is equivalent to the axiom of choice.)"}]},"unresolved":null},{"absence":null,"basis":"88fbc267835def8ede9a5a8be35c197abb21f5bf96bc3b5dd181aaff9c58b5e2","coverage":null,"id":"enwiki-1830142-1372610632::In-text #50ebbf3d","item":"In-text #50ebbf3d","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Setoid.quotientKerEquivOfSurjective","end_line":400,"library":"mathlib","line":399,"location_key":"88fbc267835def8ede9a5a8be35c197abb21f5bf96bc3b5dd181aaff9c58b5e2","module":"Mathlib.Order.Setoid.Basic","note":"The relation quotiented by is Setoid.ker f, which relates two arguments precisely when f sends them to the same element.","pair_key":"1b3f7420724fa6b742e8c704cb04dd0cb3e3bb4ca050741421fbc3c18341ef82","path":"Mathlib/Order/Setoid/Basic.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Setoid.quotientKerEquivOfSurjective {α : Type*} {β : Type*} (f : α → β) : Function.Surjective f → Quotient (Setoid.ker f) ≃ β"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e53e6a4e04f227c10468d91c242237ecba67f486088924f92b7273b57106a9f1","prominence":"central","quote":{"exact":"By collapsing all arguments mapping to a given fixed image, every surjection"},"quote_capped":true,"section":["Surjection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"before":{"layer":"(This statement is equivalent to the axiom of choice.) ","lead_in":true,"segments":[{"text":"(This statement is equivalent to the axiom of choice.) "}]},"layer":"By collapsing all arguments mapping to a given fixed image, every surjection induces a bijection from a quotient set of its domain to its codomain.","segments":[{"text":"By collapsing all arguments mapping to a given fixed image, every surjection induces a bijection from a quotient set of its domain to its codomain."}]},"unresolved":null},{"absence":null,"basis":"e982d9c4a5f65e79919a5711b243c9178e11b8e95f02119befc23fcf76f1caf0","coverage":null,"id":"enwiki-1830142-1372610632::In-text #873a1648","item":"In-text #873a1648","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Setoid.ker","end_line":79,"library":"mathlib","line":78,"location_key":"e982d9c4a5f65e79919a5711b243c9178e11b8e95f02119befc23fcf76f1caf0","module":"Mathlib.Order.Setoid.Basic","note":"Lean packages the relation with its reflexivity, symmetry and transitivity proofs as a Setoid on the domain.","pair_key":"88a63bbf17e82ff5c6a98e0da7007e610b1773313009a5bb947dafdb5a6ed57e","path":"Mathlib/Order/Setoid/Basic.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Setoid.ker {α : Type*} {β : Type*} : (α → β) → Setoid α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Setoid.ker_def","end_line":91,"library":"mathlib","line":90,"location_key":"98dc4cf244a08f9d551b54df975dd285328bfba4b3bbdc83019f6bda06146e77","module":"Mathlib.Order.Setoid.Basic","note":"Lean writes out the defining condition of the kernel relation as an iff with the equation of the two values.","pair_key":"2d1872f82b839190a47029c5670a115c5a3ea39caae82c4ae154fcccb070abd6","path":"Mathlib/Order/Setoid/Basic.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Setoid.ker_def {α : Type*} {β : Type*} {f : α → β} {x y : α} : (Setoid.ker f) x y ↔ f x = f y"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"69cb696fbebcf172fd5ff5580559427f816405b5cbab10fad9a9f77dda61b275","prominence":"supporting","quote":{"exact":"More precisely, given a function f {\\displaystyle f} , define an equivalence"},"quote_capped":true,"section":["Surjection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"after":{"layer":" ; then the equivalence classes of this relation are the preimages under f {\\displaystyle f} of the elements of the image of f {\\displaystyle f} .","segments":[{"text":" ; then the equivalence classes of this relation are the preimages under "},{"tex":"f"},{"text":" of the elements of the image of "},{"tex":"f"},{"text":" ."}]},"layer":"More precisely, given a function f {\\displaystyle f} , define an equivalence relation on the domain of f {\\displaystyle f} , such that x and y are equivalent if and only if they have the same image under f {\\displaystyle f}","segments":[{"text":"More precisely, given a function "},{"tex":"f"},{"text":" , define an equivalence relation on the domain of "},{"tex":"f"},{"text":" , such that x and y are equivalent if and only if they have the same image under "},{"tex":"f"}]},"unresolved":null},{"absence":null,"basis":"d6f54e7b336dd44436f7ce5154b6980114d448d69f0f0f317edff920ede2413a","coverage":null,"id":"enwiki-1830142-1372610632::In-text #91eaf51f","item":"In-text #91eaf51f","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Setoid.ker_iff_mem_preimage","end_line":328,"library":"mathlib","line":327,"location_key":"d6f54e7b336dd44436f7ce5154b6980114d448d69f0f0f317edff920ede2413a","module":"Mathlib.Order.Setoid.Basic","note":"Mathlib writes the identification argument by argument, as membership in the preimage of a single value, where the passage equates the family of classes with the family of preimages.","pair_key":"a8c6bd8c1625788f62ac64675d337b0fbfc9c65d23a8c6b21faa0e98972218d2","path":"Mathlib/Order/Setoid/Basic.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Setoid.ker_iff_mem_preimage {α : Type*} {β : Type*} {f : α → β} {x y : α} : (Setoid.ker f) x y ↔ x ∈ f ⁻¹' {f y}"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Setoid.classes_ker_subset_fiber_set","end_line":71,"library":"mathlib","line":67,"location_key":"d9985e059238e4335ca2852a0ced476c1bcd94a73da77fe161f4004d27ae5763","module":"Mathlib.Order.Setoid.Partition","note":"It gives one inclusion between the class collection and the collection of level sets, and the collections it compares are not equal in the universe's setting.","pair_key":"10c4a27c0daeedb626160e7214df431d3f5025886eee818719deb742da6392f9","path":"Mathlib/Order/Setoid/Partition.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Setoid.classes_ker_subset_fiber_set {α : Type*} {β : Type*} (f : α → β) : (Setoid.ker f).classes ⊆ Set.range fun y ↦ {x | f x = y}"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Setoid.mem_classes","end_line":65,"library":"mathlib","line":64,"location_key":"31df10a12e73eecacc1bd6ace4f64cd0b5bff3ee126a102bb3fdff257a4ac811","module":"Mathlib.Order.Setoid.Partition","note":"Read at the kernel relation it shows one level set to be a class, with no statement about the whole collection.","pair_key":"0ccad71da2004a5de787559681c30c4766365a201a9da2c524baaa5d92b06cfd","path":"Mathlib/Order/Setoid/Partition.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Setoid.mem_classes {α : Type*} (r : Setoid α) (y : α) : {x | r x y} ∈ r.classes"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Function.Fiber.eq_fiber_image","end_line":39,"library":"mathlib","line":39,"location_key":"e97e1ce780a6c3f8d829f538b0eca5c111a3d2b10805951bfcb9e6f504a5db17","module":"Mathlib.Logic.Function.FiberPartition","note":"It unfolds the library's indexing type for the level-set partition rather than the classes of the kernel relation.","pair_key":"0b003d4d81622a745a1b516277babb643edc599ed39a0ae897f05959bcce0f25","path":"Mathlib/Logic/Function/FiberPartition.lean","proof_status":"proved","rank":4,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.Fiber.eq_fiber_image {Y : Type*} {Z : Type*} (f : Y → Z) (a : Function.Fiber f) : ↑a = f ⁻¹' {Function.Fiber.image f a}"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"9796a4dabfc8aa7e2d07f3ce8ed8d32d6896cd1a7ff7cf8d44aad7b4363a78a3","prominence":"supporting","quote":{"exact":"the equivalence classes of this relation are the preimages under f {\\displaystyle"},"quote_capped":true,"section":["Surjection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"before":{"layer":"More precisely, given a function f {\\displaystyle f} , define an equivalence relation on the domain of f {\\displaystyle f} , such that x and y are equivalent if and only if they have the same image under f {\\displaystyle f} ; then ","segments":[{"text":"More precisely, given a function "},{"tex":"f"},{"text":" , define an equivalence relation on the domain of "},{"tex":"f"},{"text":" , such that x and y are equivalent if and only if they have the same image under "},{"tex":"f"},{"text":" ; then "}]},"layer":"the equivalence classes of this relation are the preimages under f {\\displaystyle f} of the elements of the image of f {\\displaystyle f} .","segments":[{"text":"the equivalence classes of this relation are the preimages under "},{"tex":"f"},{"text":" of the elements of the image of "},{"tex":"f"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"50495e400d4d2b37df13e53a9cf56b3813aa5f059165ec0c35e3cc91de26dd63","coverage":null,"id":"enwiki-1830142-1372610632::In-text #9a34bde2","item":"In-text #9a34bde2","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Setoid.quotientKerEquivRange","end_line":383,"library":"mathlib","line":382,"location_key":"50495e400d4d2b37df13e53a9cf56b3813aa5f059165ec0c35e3cc91de26dd63","module":"Mathlib.Order.Setoid.Basic","note":"Lean writes the image of f as Set.range f, and its docstring calls this the first isomorphism theorem for sets.","pair_key":"f5d3d4d8db1ec0883ae738a735e1e16908b8f2bb177337257f199853c33a3f46","path":"Mathlib/Order/Setoid/Basic.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Setoid.quotientKerEquivRange {α : Type*} {β : Type*} (f : α → β) : Quotient (Setoid.ker f) ≃ ↑(Set.range f)"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Setoid.quotientKerEquivOfSurjective","end_line":400,"library":"mathlib","line":399,"location_key":"62add878bc693410e89c9463e949c4e27ef0b85843dc8e87fbf3bd1885adadda","module":"Mathlib.Order.Setoid.Basic","note":"This is the case the passage's closing remark names, where the image of f coincides with its codomain.","pair_key":"6ff3671a6f8a83c5f0dce056057687aac077dd2ddb0168bf2d3c60c7eee9cbe0","path":"Mathlib/Order/Setoid/Basic.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Setoid.quotientKerEquivOfSurjective {α : Type*} {β : Type*} (f : α → β) : Function.Surjective f → Quotient (Setoid.ker f) ≃ β"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"8cd2ae79ea69bd571187aa821f69e5912642fd4cc01893b63d9a400d82d97e0a","prominence":"supporting","quote":{"exact":"As all elements of any one of these equivalence classes are mapped"},"quote_capped":true,"section":["Surjection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"As all elements of any one of these equivalence classes are mapped by f {\\displaystyle f} on the same element of the codomain, this induces a bijection between the quotient set by this equivalence relation (the set of the equivalence classes) and the image of f {\\displaystyle f} (which is its codomain when f {\\displaystyle f} is surjective).","segments":[{"text":"As all elements of any one of these equivalence classes are mapped by "},{"tex":"f"},{"text":" on the same element of the codomain, this induces a bijection between the quotient set by this equivalence relation (the set of the equivalence classes) and the image of "},{"tex":"f"},{"text":" (which is its codomain when "},{"tex":"f"},{"text":" is surjective)."}]},"unresolved":null},{"absence":null,"basis":"f5640d662750afa2d62e480c02614210c330b9102e3af93162451a0fb51d45c9","coverage":null,"id":"enwiki-1830142-1372610632::In-text #3845e26d","item":"In-text #3845e26d","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Setoid.kerLift_mk","end_line":349,"library":"mathlib","line":348,"location_key":"f5640d662750afa2d62e480c02614210c330b9102e3af93162451a0fb51d45c9","module":"Mathlib.Order.Setoid.Basic","note":"Lean writes the second factor as the lift Setoid.kerLift f, the bare function that the induced equivalence on the kernel quotient carries, and states the factorisation at the class of each x.","pair_key":"f20cefd3403fcebd4a6271773d8a3104321f43f0be91c3e30bee2e57a65571b6","path":"Mathlib/Order/Setoid/Basic.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Setoid.kerLift_mk {α : Type*} {β : Type*} (f : α → β) (x : α) : Setoid.kerLift f ⟦x⟧ = f x"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Setoid.quotientKerEquivOfRightInverse_apply","end_line":387,"library":"mathlib","line":387,"location_key":"664851e1ce7864cd74863e95780ca7bf942ef0e6bf84c2ceb0ac02041a3b0c5f","module":"Mathlib.Order.Setoid.Basic","note":"It identifies the equivalence built from a chosen right inverse with the lift of f to the kernel quotient.","pair_key":"0fa4b0e22008c96e2af50f17f1d9683cdc090d74145756e5d146fa02f659a197","path":"Mathlib/Order/Setoid/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Setoid.quotientKerEquivOfRightInverse_apply {α : Type*} {β : Type*} (f : α → β) (g : β → α) (hf : Function.RightInverse g f) (a : Quotient (Setoid.ker f)) : (Setoid.quotientKerEquivOfRightInverse f g hf) a = Setoid.kerLift f a"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b0facd87d30c13892481e64ce0e38c4999dbdaba04b62c2c554692741a2b4a8b","prominence":"supporting","quote":{"exact":"f {\\displaystyle f} is the composition of the canonical projection from f"},"quote_capped":true,"section":["Surjection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"before":{"layer":"Moreover, ","segments":[{"text":"Moreover, "}]},"layer":"f {\\displaystyle f} is the composition of the canonical projection from f {\\displaystyle f} to the quotient set, and the bijection between the quotient set and the codomain of f {\\displaystyle f} .","segments":[{"tex":"f"},{"text":" is the composition of the canonical projection from "},{"tex":"f"},{"text":" to the quotient set, and the bijection between the quotient set and the codomain of "},{"tex":"f"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"8a2a3e1c0776e5033a5339ce751e3f00c57729f83c25f3e21e4fcf2dc8dfdaa8","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"df0ffa4e6ec42e37d09cb98815d426cf2b65ee3d0d583a70b44a534e4896e8fd","text":"a composite of two surjective functions is itself surjective"},{"id":"c2","part":"c5d258d7be9746c2f8d2cf5a7450bdb6831ecedbf84b4a181808f16deee48ddb","text":"if the composite g ∘ f is surjective, then g is surjective"}],"parts":["df0ffa4e6ec42e37d09cb98815d426cf2b65ee3d0d583a70b44a534e4896e8fd","c5d258d7be9746c2f8d2cf5a7450bdb6831ecedbf84b4a181808f16deee48ddb"],"relation":"exactMatch","status":"formalized"},"id":"enwiki-1830142-1372610632::In-text #217b6df3","item":"In-text #217b6df3","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Function.Surjective.comp","end_line":69,"library":"lean-core","line":65,"location_key":"df0ffa4e6ec42e37d09cb98815d426cf2b65ee3d0d583a70b44a534e4896e8fd","module":"Init.Data.Function","note":"Lean composes in the order outer after inner, the same order the article writes.","pair_key":"fe33a7c5b76e5b683cce7f81e290462abd1fd472ecb6804584fdd6e88003615a","path":"src/Init/Data/Function.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Function.Surjective.comp {α : Sort u_1} {β : Sort u_2} {γ : Sort u_3} {g : β → γ} {f : α → β} : Function.Surjective g → Function.Surjective f → Function.Surjective (g ∘ f)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.Surjective.of_comp","end_line":256,"library":"mathlib","line":254,"location_key":"c5d258d7be9746c2f8d2cf5a7450bdb6831ecedbf84b4a181808f16deee48ddb","module":"Mathlib.Logic.Function.Basic","note":"Lean names the outer map f and the inner one g, the reverse of the article's letters.","pair_key":"79f403e972a5c26a24d0bd89b769d21a4e6b31e16c02ba0b0681f1d676e58950","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.Surjective.of_comp {α : Sort*} {β : Sort*} {γ : Sort*} {f : α → β} {g : γ → α} : Function.Surjective (f ∘ g) → Function.Surjective f"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7b6e391efa09002cd32eb11de08fa414bdf3af83634fdcb1910a294e7676222e","prominence":"central","quote":{"exact":"The composition of two surjections is again a surjection, but if g"},"quote_capped":true,"section":["Surjection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"The composition of two surjections is again a surjection, but if g ∘ f {\\displaystyle g\\circ f} is surjective, then it can only be concluded that g {\\displaystyle g} is surjective (see figure).","segments":[{"text":"The composition of two surjections is again a surjection, but if "},{"tex":"g\\circ f"},{"text":" is surjective, then it can only be concluded that "},{"tex":"g"},{"text":" is surjective (see figure)."}]},"unresolved":null},{"absence":null,"basis":"af7c0384f2eb4dcb6d25f6143b5134165ed2df3519d96c92954ac118d7c1a942","coverage":null,"id":"enwiki-1830142-1372610632::In-text #812d7e1d","item":"In-text #812d7e1d","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.Bijective","end_line":164,"library":"mathlib","line":163,"location_key":"af7c0384f2eb4dcb6d25f6143b5134165ed2df3519d96c92954ac118d7c1a942","module":"Mathlib.Logic.Function.Defs","note":"Lean defines the predicate as the conjunction of injectivity and surjectivity, as its docstring records.","pair_key":"779838606cd6ae1150e931292894a3f175023567df09005e3960d0cbd4390d4a","path":"Mathlib/Logic/Function/Defs.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Function.Bijective {α : Sort u₁} {β : Sort u₂} : (α → β) → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"8cb25de59b1806f003718f7584be47959448104c0d126f08bb6e74862e922594","prominence":"central","quote":{"exact":"A function is bijective if it is both injective and surjective."},"quote_capped":false,"section":["Bijection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"A function is bijective if it is both injective and surjective.","segments":[{"text":"A function is bijective if it is both injective and surjective."}]},"unresolved":null},{"absence":null,"basis":"13d1328e2682cd99f6fa4669c05d31ed9e542ca6ba4f00ac8d666a7b58d83e9c","coverage":null,"id":"enwiki-1830142-1372610632::In-text #e433dc14","item":"In-text #e433dc14","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.bijective_iff_existsUnique","end_line":334,"library":"mathlib","line":332,"location_key":"13d1328e2682cd99f6fa4669c05d31ed9e542ca6ba4f00ac8d666a7b58d83e9c","module":"Mathlib.Logic.Function.Basic","note":null,"pair_key":"569cb226600d7d57f854113b467425fb28dcd92bc3189f980e7d003c64f3d0e0","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.bijective_iff_existsUnique {α : Sort*} {β : Sort*} (f : α → β) : Function.Bijective f ↔ ∀ (b : β), ∃! a, f a = b"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.Bijective.existsUnique","end_line":339,"library":"mathlib","line":337,"location_key":"1f0a0030a8a314302cdd7f5a330efd16c5babe6c2bc88ff8740bc5d145b2077b","module":"Mathlib.Logic.Function.Basic","note":"This gives only the implication from bijectivity to the unique-argument condition, not the equivalence the passage asserts.","pair_key":"1985bc7aaf58756486ab1f5f9f3f7ae3c12bd3fa0971a17f9888d7eedb79898b","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.Bijective.existsUnique {α : Sort*} {β : Sort*} {f : α → β} : Function.Bijective f → ∀ (b : β), ∃! a, f a = b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"fe1110e48d5a2bf0d1bbecdda715ec0262af7e61fe2a8b98dc525ecfe9593d96","prominence":"supporting","quote":{"exact":"A function is bijective if and only if every possible image is"},"quote_capped":true,"section":["Bijection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"A function is bijective if and only if every possible image is mapped to by exactly one argument.[1]","segments":[{"text":"A function is bijective if and only if every possible image is mapped to by exactly one argument."},{"ref":"[1]"}]},"unresolved":null},{"absence":null,"basis":"e978b0b2f1be450f1f45772d984b3b56a09e7e67e19f968eec0fb65b95f58195","coverage":null,"id":"enwiki-1830142-1372610632::In-text #527ef058","item":"In-text #527ef058","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.Bijective","end_line":164,"library":"mathlib","line":163,"location_key":"e978b0b2f1be450f1f45772d984b3b56a09e7e67e19f968eec0fb65b95f58195","module":"Mathlib.Logic.Function.Defs","note":"Mathlib writes the notion as injectivity together with surjectivity, which unfolds to the unique-existence condition the passage uses as its definiens.","pair_key":"d7f133f6dafee86129e9478af7763501ce12777fc930010c44e13d00ccefce70","path":"Mathlib/Logic/Function/Defs.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Function.Bijective {α : Sort u₁} {β : Sort u₂} : (α → β) → Prop"},"statement":true},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.bijective_iff_existsUnique","end_line":334,"library":"mathlib","line":332,"location_key":"052fec55eb23e359082e6d056090c1dbeace4938552bf7b8ef1db1a328f14a83","module":"Mathlib.Logic.Function.Basic","note":"It writes the library's bijectivity predicate in the unique-existence form the passage uses to define the word.","pair_key":"5b208abf7b0bee8742f10599642bc2316d57c900f957ea11fee69bc0177da24d","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.bijective_iff_existsUnique {α : Sort*} {β : Sort*} (f : α → β) : Function.Bijective f ↔ ∀ (b : β), ∃! a, f a = b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"be417c0fd3d509c54d2e4ca88b7fd616053bfa06559096fa659c3805785e7c1a","prominence":"central","quote":{"exact":"The function f : X → Y {\\displaystyle f\\colon X\\to Y} is","prefix":": "},"quote_capped":true,"section":["Bijection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"before":{"layer":"This equivalent condition is formally expressed as follows: ","lead_in":true,"segments":[{"text":"This equivalent condition is formally expressed as follows: "}]},"layer":"The function f : X → Y {\\displaystyle f\\colon X\\to Y} is bijective, if for all y ∈ Y {\\displaystyle y\\in Y} , there is a unique x ∈ X {\\displaystyle x\\in X} such that f ( x ) = y . {\\displaystyle f(x)=y.}","segments":[{"text":"The function "},{"tex":"f\\colon X\\to Y"},{"text":" is bijective, if for all "},{"tex":"y\\in Y"},{"text":" , there is a unique "},{"tex":"x\\in X"},{"text":" such that "},{"tex":"f(x)=y."}]},"unresolved":null},{"absence":null,"basis":"76f0e7f07cbd02ec9808ef5ebcef5e9c437bcb737771c41eca83311feb340736","coverage":null,"id":"enwiki-1830142-1372610632::In-text #d0cb7798","item":"In-text #d0cb7798","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.bijective_iff_has_inverse","end_line":593,"library":"mathlib","line":591,"location_key":"76f0e7f07cbd02ec9808ef5ebcef5e9c437bcb737771c41eca83311feb340736","module":"Mathlib.Logic.Function.Basic","note":"Mathlib spells the two inverse conditions pointwise, as LeftInverse and RightInverse of g against f, where the passage writes the composites equal to the identity maps.","pair_key":"c183706f1589e87e702645a4130c7b82cb03d5708037ea35949da51001d8d405","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.bijective_iff_has_inverse {α : Sort u} {β : Sort v} {f : α → β} : Function.Bijective f ↔ ∃ g, Function.LeftInverse g f ∧ Function.RightInverse g f"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"0a16c53e8f32ec28567f52f4e55c1aa082190510d4982f470bf7f8d4658e7a71","prominence":"central","quote":{"exact":"A function f : X → Y {\\displaystyle f\\colon X\\to Y} is","suffix":" b"},"quote_capped":true,"section":["Bijection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"before":{"layer":"The following are some facts related to bijections: ","lead_in":true,"segments":[{"text":"The following are some facts related to bijections: "}]},"layer":"A function f : X → Y {\\displaystyle f\\colon X\\to Y} is bijective if and only if it is invertible; that is, there is a function g : Y → X {\\displaystyle g\\colon Y\\to X} such that g ∘ f = {\\displaystyle g\\circ f=} identity function on X {\\displaystyle X} and f ∘ g = {\\displaystyle f\\circ g=} identity function on Y {\\displaystyle Y} .","segments":[{"text":"A function "},{"tex":"f\\colon X\\to Y"},{"text":" is bijective if and only if it is invertible; that is, there is a function "},{"tex":"g\\colon Y\\to X"},{"text":" such that "},{"tex":"g\\circ f="},{"text":" identity function on "},{"tex":"X"},{"text":" and "},{"tex":"f\\circ g="},{"text":" identity function on "},{"tex":"Y"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"b511ff22f60987422c8cd2060b6c4e2b038fd9fbe161af83da42a454ae3b5fa1","coverage":null,"id":"enwiki-1830142-1372610632::In-text #92aec6c4","item":"In-text #92aec6c4","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Equiv.apply_eq_iff_eq_symm_apply","end_line":300,"library":"mathlib","line":299,"location_key":"b511ff22f60987422c8cd2060b6c4e2b038fd9fbe161af83da42a454ae3b5fa1","module":"Mathlib.Logic.Equiv.Defs","note":"Mathlib carries the map and its two-sided inverse together in one equivalence and states that x is sent to y exactly when x is the inverse's value at y.","pair_key":"2e79b0528d4a48e9433fd4ba1441237ec974319a4837eaa2d5fe2e3b274bd75d","path":"Mathlib/Logic/Equiv/Defs.lean","proof_status":"proved","rank":1,"relation":"closeMatch","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":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.Bijective.existsUnique","end_line":339,"library":"mathlib","line":337,"location_key":"a754007fba9ac573632ceb709c31bb67e61e228f618fb73168ea4f61a8f490d7","module":"Mathlib.Logic.Function.Basic","note":"It supplies the unique preimage of each codomain element but says nothing about the inverse map's value there.","pair_key":"5a1e7234af3462d314a1b72509f574459e02d5444365735fe3f56ab791456176","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.Bijective.existsUnique {α : Sort*} {β : Sort*} {f : α → β} : Function.Bijective f → ∀ (b : β), ∃! a, f a = b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d226544944f2e707c2e1dc9476ea200eae91e49dcb7d4d2af2af990fba8dc1cd","prominence":"supporting","quote":{"exact":"This function maps each image to its unique preimage."},"quote_capped":false,"section":["Bijection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"This function maps each image to its unique preimage.","segments":[{"text":"This function maps each image to its unique preimage."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"c8fe304d8974f6808f8db16bae6a15e9320884f912ea4fe896718e35c10c768a","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"1ff594b2d198ca5dea6a006a0dbc7c57863d47ee885f96715fb6bde0a28c6d4e","text":"a composite of two bijections is itself a bijection"},{"id":"c2","part":"44f3a5b751569b41f07ea19e4a1d7d1b7d0d7d6e65f42a3640cf704fe6722e53","text":"if the composite g ∘ f is a bijection, then f is injective"},{"id":"c3","part":"1fa9d44dea121538daa993e761c170f9fe06cc26b688ec58a3c863e9753b59e0","text":"if the composite g ∘ f is a bijection, then g is surjective"}],"parts":["1ff594b2d198ca5dea6a006a0dbc7c57863d47ee885f96715fb6bde0a28c6d4e","44f3a5b751569b41f07ea19e4a1d7d1b7d0d7d6e65f42a3640cf704fe6722e53","1fa9d44dea121538daa993e761c170f9fe06cc26b688ec58a3c863e9753b59e0"],"relation":"broadMatch","status":"formalized"},"id":"enwiki-1830142-1372610632::In-text #454acbac","item":"In-text #454acbac","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.Bijective.comp","end_line":167,"library":"mathlib","line":166,"location_key":"1ff594b2d198ca5dea6a006a0dbc7c57863d47ee885f96715fb6bde0a28c6d4e","module":"Mathlib.Logic.Function.Defs","note":null,"pair_key":"845827ec2a83924df4fbae23241ab72a8b479fb870b25adcb92933fbfde55d8d","path":"Mathlib/Logic/Function/Defs.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.Bijective.comp {α : Sort u₁} {β : Sort u₂} {φ : Sort u₃} {g : β → φ} {f : α → β} : Function.Bijective g → Function.Bijective f → Function.Bijective (g ∘ f)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.Injective.of_comp","end_line":206,"library":"mathlib","line":205,"location_key":"44f3a5b751569b41f07ea19e4a1d7d1b7d0d7d6e65f42a3640cf704fe6722e53","module":"Mathlib.Logic.Function.Basic","note":"Mathlib assumes only that the composite is injective, so the passage's bijective composite qualifies after taking its injective half.","pair_key":"8ea8d42f90b49d3624f950dc604e65202fb36dee4d692eee705954c409645579","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.Injective.of_comp {α : Sort*} {β : Sort*} {γ : Sort*} {f : α → β} {g : γ → α} : Function.Injective (f ∘ g) → Function.Injective g"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.Surjective.of_comp","end_line":256,"library":"mathlib","line":254,"location_key":"1fa9d44dea121538daa993e761c170f9fe06cc26b688ec58a3c863e9753b59e0","module":"Mathlib.Logic.Function.Basic","note":"Mathlib assumes only that the composite is surjective, so the passage's bijective composite qualifies after taking its surjective half.","pair_key":"17c1c67ed01b54f22cdf205cac9812ccbb7911dd7048805285c99191d2937f30","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.Surjective.of_comp {α : Sort*} {β : Sort*} {γ : Sort*} {f : α → β} {g : γ → α} : Function.Surjective (f ∘ g) → Function.Surjective f"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"8657274d4e908218bce1c83f8185d323d0f4780fb2cccf6f7411468451bec658","prominence":"central","quote":{"exact":"The composition of two bijections is again a bijection, but if g"},"quote_capped":true,"section":["Bijection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"The composition of two bijections is again a bijection, but if g ∘ f {\\displaystyle g\\circ f} is a bijection, then it can only be concluded that f {\\displaystyle f} is injective and g {\\displaystyle g} is surjective (see the figure at right and the remarks above regarding injections and surjections).","segments":[{"text":"The composition of two bijections is again a bijection, but if "},{"tex":"g\\circ f"},{"text":" is a bijection, then it can only be concluded that "},{"tex":"f"},{"text":" is injective and "},{"tex":"g"},{"text":" is surjective (see the figure at right and the remarks above regarding injections and surjections)."}]},"unresolved":null},{"absence":null,"basis":"ae07b7042794e75e1d26c38cc5078e93d030ba07cb04bd4a4df636961ba1f8d8","coverage":null,"id":"enwiki-1830142-1372610632::In-text #d946d901","item":"In-text #d946d901","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm.permGroup","end_line":80,"library":"mathlib","line":72,"location_key":"ae07b7042794e75e1d26c38cc5078e93d030ba07cb04bd4a4df636961ba1f8d8","module":"Mathlib.Algebra.Group.End","note":"Mathlib carries each self-bijection together with its inverse as an equivalence and equips that type, which it calls the permutation group, with the group structure whose multiplication is composition.","pair_key":"a161b2ce7e8c899d2756ca2a08daf08866a89a9325f7b9f981c53795f1a1b247","path":"Mathlib/Algebra/Group/End.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Equiv.Perm.permGroup {α : Type*} : Group (Equiv.Perm α)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm.mul_def","end_line":113,"library":"mathlib","line":112,"location_key":"c8294be9452422bcb15bb19d3711872a58ef3259146709f176a4be40eddc26e0","module":"Mathlib.Algebra.Group.End","note":"It records that the multiplication of that group is composition, without asserting that the group structure exists.","pair_key":"e89a41af0891f1edc59caa56371f6bebb452b522ee98345e012834e7a2e63668","path":"Mathlib/Algebra/Group/End.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Equiv.Perm.mul_def {α : Type*} (f g : Equiv.Perm α) : f * g = Equiv.trans g f"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"bf3eaa949b30aff4a6d699b0fae406bf2e2536866f69b32f6d4d111d20c186c6","prominence":"central","quote":{"exact":"The bijections from a set to itself form a group under composition,"},"quote_capped":true,"section":["Bijection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"The bijections from a set to itself form a group under composition, called the symmetric group.","segments":[{"text":"The bijections from a set to itself form a group under composition, called the symmetric group."}]},"unresolved":null},{"absence":null,"basis":"c803c40624de90fda18ccbdc2a7b96055b8602b2a9a6b04a7ef3860e0b056f8e","coverage":null,"id":"enwiki-1830142-1372610632::In-text #dbb285ba","item":"In-text #dbb285ba","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Cardinal.eq","end_line":116,"library":"mathlib","line":115,"location_key":"c803c40624de90fda18ccbdc2a7b96055b8602b2a9a6b04a7ef3860e0b056f8e","module":"Mathlib.SetTheory.Cardinal.Defs","note":"Mathlib expresses the pairing as an inhabitant of the equivalence type between the two sets and unfolds equality of their cardinal numbers into the existence of such a pairing.","pair_key":"e2522244247a0e99da4cbb52572eccb2e689421dc5ad45e4bc48ab681f3cbada","path":"Mathlib/SetTheory/Cardinal/Defs.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.eq {α β : Type u} : Cardinal.mk α = Cardinal.mk β ↔ Nonempty (α ≃ β)"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv","end_line":75,"library":"mathlib","line":65,"location_key":"b035366bf5f37bd96d90f753f86c57780efd59a69e1655fad02488e40a77dc74","module":"Mathlib.Logic.Equiv.Defs","note":"It is the type of the pairings the passage's criterion appeals to, and does not itself say when two sets are equinumerous.","pair_key":"05a7f6cbb1710660326e62f1f92720df081cdd2fe14bb6f4b48f42b947727545","path":"Mathlib/Logic/Equiv/Defs.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","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}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"bf915069eed6a1f2bc412c324ee1c80491cdb3e6e571972616a306568cc91558","prominence":"supporting","quote":{"exact":"Suppose that one wants to define what it means for two sets"},"quote_capped":true,"section":["Bijection","Cardinality"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"Suppose that one wants to define what it means for two sets to \"have the same number of elements\". One way to do this is to say that two sets \"have the same number of elements\", if and only if all the elements of one set can be paired with the elements of the other, in such a way that each element is paired with exactly one element.","segments":[{"text":"Suppose that one wants to define what it means for two sets to \"have the same number of elements\". One way to do this is to say that two sets \"have the same number of elements\", if and only if all the elements of one set can be paired with the elements of the other, in such a way that each element is paired with exactly one element."}]},"unresolved":null},{"absence":null,"basis":"cabc2303478652bf07f285d8fc4a6b3e0c7deed9fed8c0655406f0d070a767ef","coverage":null,"id":"enwiki-1830142-1372610632::In-text #34177940","item":"In-text #34177940","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.eq","end_line":116,"library":"mathlib","line":115,"location_key":"cabc2303478652bf07f285d8fc4a6b3e0c7deed9fed8c0655406f0d070a767ef","module":"Mathlib.SetTheory.Cardinal.Defs","note":"Mathlib unfolds equality of the two cardinal numbers into the existence of a bijection carried together with its inverse as an equivalence.","pair_key":"0c534cc702858fa128f2c82002fd2fdffc4ad9cb688434755d2a92f8d18af348","path":"Mathlib/SetTheory/Cardinal/Defs.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.eq {α β : Type u} : Cardinal.mk α = Cardinal.mk β ↔ Nonempty (α ≃ β)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.mk","end_line":89,"library":"mathlib","line":88,"location_key":"655379099241a501408655e8a927594bbbbd71894b54da805a7412a55da93347","module":"Mathlib.SetTheory.Cardinal.Defs","note":"It is the operator assigning a set its cardinal number, and on its own it states no criterion for two sets to share one.","pair_key":"fda18b43319a3390cda7d5775cb8de9dce7da1f049e13ca4ed37e017fabce439","path":"Mathlib/SetTheory/Cardinal/Defs.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Cardinal.mk : Type u → Cardinal"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d2498ba281df74c321360fd2d767ff4fcc636d027117db167cdc8e8e0abbbee4","prominence":"central","quote":{"exact":"Accordingly, one can define two sets to \"have the same number of"},"quote_capped":true,"section":["Bijection","Cardinality"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"Accordingly, one can define two sets to \"have the same number of elements\"—if there is a bijection between them. In which case, the two sets are said to have the same cardinality.","segments":[{"text":"Accordingly, one can define two sets to \"have the same number of elements\"—if there is a bijection between them. In which case, the two sets are said to have the same cardinality."}]},"unresolved":null},{"absence":null,"basis":"3541a1052d3fe2dddb9f7c2c4c2340e095ff5d11434189c652ae1b168df1dc44","coverage":null,"id":"enwiki-1830142-1372610632::In-text #b0ebf575","item":"In-text #b0ebf575","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.le_def","end_line":104,"library":"mathlib","line":103,"location_key":"3541a1052d3fe2dddb9f7c2c4c2340e095ff5d11434189c652ae1b168df1dc44","module":"Mathlib.SetTheory.Cardinal.Order","note":"Mathlib measures size by the cardinal of a type and writes the injection as an element of the bundled embedding type X into Y.","pair_key":"3d69ece4339023075e4e4310749c77f7253eca74c400ec05068a0340c7e22dc3","path":"Mathlib/SetTheory/Cardinal/Order.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.le_def (α β : Type u) : Cardinal.mk α ≤ Cardinal.mk β ↔ Nonempty (α ↪ β)"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.Embedding.cardinal_le","end_line":110,"library":"mathlib","line":109,"location_key":"0e81b10398598071a739638fd4d1dc4e607e855221f289be116a0d5023ea4f68","module":"Mathlib.SetTheory.Cardinal.Order","note":"It runs from an embedding to the cardinal comparison, one way round, so it settles no equivalence by itself.","pair_key":"b15d4d307e6e74dc5a29f0dec639859e673999f52c8515d3f49a201691c3042d","path":"Mathlib/SetTheory/Cardinal/Order.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.Embedding.cardinal_le {α β : Type u} (f : α ↪ β) : Cardinal.mk α ≤ Cardinal.mk β"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"dbd20c70c09d94949bd23e57647d0f5e992ebdfdd596125532e31162e174de87","prominence":"supporting","quote":{"exact":"Likewise, one can say that set X {\\displaystyle X} \"has fewer than"},"quote_capped":true,"section":["Bijection","Cardinality"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"after":{"layer":" ; one can also say that set X {\\displaystyle X} \"has fewer than the number of elements\" in set Y {\\displaystyle Y} , if there is an injection from X {\\displaystyle X} to Y {\\displaystyle Y} , but not a bijection between X {\\displaystyle X} and Y {\\displaystyle Y} .","segments":[{"text":" ; one can also say that set "},{"tex":"X"},{"text":" \"has fewer than the number of elements\" in set "},{"tex":"Y"},{"text":" , if there is an injection from "},{"tex":"X"},{"text":" to "},{"tex":"Y"},{"text":" , but not a bijection between "},{"tex":"X"},{"text":" and "},{"tex":"Y"},{"text":" ."}]},"layer":"Likewise, one can say that set X {\\displaystyle X} \"has fewer than or the same number of elements\" as set Y {\\displaystyle Y} , if there is an injection from X {\\displaystyle X} to Y {\\displaystyle Y}","segments":[{"text":"Likewise, one can say that set "},{"tex":"X"},{"text":" \"has fewer than or the same number of elements\" as set "},{"tex":"Y"},{"text":" , if there is an injection from "},{"tex":"X"},{"text":" to "},{"tex":"Y"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"b86f945b35d2f3dbb9f06ef08a77e35af75314d7051c7de8cf63927061825ddd"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-1830142-1372610632::In-text #adf90a81","item":"In-text #adf90a81","kind":"definition","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.le_def","end_line":104,"library":"mathlib","line":103,"location_key":"5ecfb453b4adece9183193db075088dc07cc7e6ba9086ef4b6529b70a2f2f79b","module":"Mathlib.SetTheory.Cardinal.Order","note":"It characterises the comparison that allows equality of size, where the passage asks for the strict one.","pair_key":"a1d47c665de187f037fd3614a90e3da5fe31d835d28eb52db0fa4330e53dbfb5","path":"Mathlib/SetTheory/Cardinal/Order.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.le_def (α β : Type u) : Cardinal.mk α ≤ Cardinal.mk β ↔ Nonempty (α ↪ β)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.eq","end_line":116,"library":"mathlib","line":115,"location_key":"f66d8dad88320198b93182ed004c62ca16bd9f0c62175bda54e5b3d0875a389d","module":"Mathlib.SetTheory.Cardinal.Defs","note":"It characterises equality of cardinals by a bijection, which the passage's criterion asks to fail.","pair_key":"cbc5ce55a300a75631dc0896a20c2a1f2ca32ab8aca41556db0264cbcb66172f","path":"Mathlib/SetTheory/Cardinal/Defs.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.eq {α β : Type u} : Cardinal.mk α = Cardinal.mk β ↔ Nonempty (α ≃ β)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"df695a0875b72a80e774f6851be523e883eb3fa932dc6bd13036040e321d414e","prominence":"supporting","quote":{"exact":"one can also say that set X {\\displaystyle X} \"has fewer than"},"quote_capped":true,"section":["Bijection","Cardinality"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"before":{"layer":"Likewise, one can say that set X {\\displaystyle X} \"has fewer than or the same number of elements\" as set Y {\\displaystyle Y} , if there is an injection from X {\\displaystyle X} to Y {\\displaystyle Y} ; ","segments":[{"text":"Likewise, one can say that set "},{"tex":"X"},{"text":" \"has fewer than or the same number of elements\" as set "},{"tex":"Y"},{"text":" , if there is an injection from "},{"tex":"X"},{"text":" to "},{"tex":"Y"},{"text":" ; "}]},"layer":"one can also say that set X {\\displaystyle X} \"has fewer than the number of elements\" in set Y {\\displaystyle Y} , if there is an injection from X {\\displaystyle X} to Y {\\displaystyle Y} , but not a bijection between X {\\displaystyle X} and Y {\\displaystyle Y} .","segments":[{"text":"one can also say that set "},{"tex":"X"},{"text":" \"has fewer than the number of elements\" in set "},{"tex":"Y"},{"text":" , if there is an injection from "},{"tex":"X"},{"text":" to "},{"tex":"Y"},{"text":" , but not a bijection between "},{"tex":"X"},{"text":" and "},{"tex":"Y"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"cc5d540d9294b71699a62372f33469bd05526e2bde309b8937e93ac91f41f2f4","coverage":null,"id":"enwiki-1830142-1372610632::In-text #5b917ae8","item":"In-text #5b917ae8","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.bijective_id","end_line":170,"library":"mathlib","line":169,"location_key":"cc5d540d9294b71699a62372f33469bd05526e2bde309b8937e93ac91f41f2f4","module":"Mathlib.Logic.Function.Defs","note":"Mathlib proves it for every type at once, the empty one included, where the claim about the identity holds for want of elements to test.","pair_key":"c8b849b1765bd1cdecdd138a04b0fa6705003133af1ebdf095ee1a8bf70145e6","path":"Mathlib/Logic/Function/Defs.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.bijective_id {α : Sort u₁} : Function.Bijective id"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d2453b502174d640865df383d02389807dfaea890520c2a827f147f4b35c6a64","prominence":"supporting","quote":{"exact":"The identity function idX for every non-empty set X, and thus specifically"},"quote_capped":false,"section":["Examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"after":{"layer":" R → R : x ↦ x . {\\displaystyle \\mathbf {R} \\to \\mathbf {R} :x\\mapsto x.}","segments":[{"text":" "},{"tex":"\\mathbf {R} \\to \\mathbf {R} :x\\mapsto x."}]},"before":{"layer":"Injective and surjective (bijective) ","lead_in":true,"segments":[{"text":"Injective and surjective (bijective) "}]},"layer":"The identity function idX for every non-empty set X, and thus specifically","segments":[{"text":"The identity function idX for every non-empty set X, and thus specifically"}]},"unresolved":null},{"absence":null,"basis":"c0c0ba2d8a6ad3cf569f3b8245ccff9aaebdbb1996d0078b182047b444663b3f","coverage":null,"id":"enwiki-1830142-1372610632::In-text #218e30d5","item":"In-text #218e30d5","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.bijective_id","end_line":170,"library":"mathlib","line":169,"location_key":"c0c0ba2d8a6ad3cf569f3b8245ccff9aaebdbb1996d0078b182047b444663b3f","module":"Mathlib.Logic.Function.Defs","note":"Mathlib states it of the identity of an arbitrary type, and the real line is one such type.","pair_key":"72e1c30f850c52c8c87ed850569e1e29c58e30b07db2ae90685878370139b47a","path":"Mathlib/Logic/Function/Defs.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.bijective_id {α : Sort u₁} : Function.Bijective id"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"dfade46a8a80385738a8d4ffe59192ab7e36fee9fb554768a9769a83cd4689da","prominence":"supporting","quote":{"exact":"R → R : x ↦ x . {\\displaystyle \\mathbf {R} \\to"},"quote_capped":true,"section":["Examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"before":{"layer":"The identity function idX for every non-empty set X, and thus specifically ","segments":[{"text":"The identity function idX for every non-empty set X, and thus specifically "}]},"layer":"R → R : x ↦ x . {\\displaystyle \\mathbf {R} \\to \\mathbf {R} :x\\mapsto x.}","segments":[{"tex":"\\mathbf {R} \\to \\mathbf {R} :x\\mapsto x."}]},"unresolved":null},{"absence":null,"basis":"b70a61e61365fd8deef8b5a5d1bcb5449e809e01aa1959f42d5b9b04deabbd96","coverage":null,"id":"enwiki-1830142-1372610632::In-text #ed022cb4","item":"In-text #ed022cb4","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"NNReal.rpow_left_bijective","end_line":397,"library":"mathlib","line":396,"location_key":"b70a61e61365fd8deef8b5a5d1bcb5449e809e01aa1959f42d5b9b04deabbd96","module":"Mathlib.Analysis.SpecialFunctions.Pow.NNReal","note":"Mathlib proves it for every non-zero real exponent and over all nonnegative reals, so it covers 0 as well, where the square is 0.","pair_key":"679f5afc08e764355558fe17116769455a36f53f2b8e6b6238ee300ed2f5db7b","path":"Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem NNReal.rpow_left_bijective {x : ℝ} : x ≠ 0 → Function.Bijective fun y ↦ y ^ x"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"NNReal.sqrt","end_line":46,"library":"mathlib","line":45,"location_key":"d6fca32498fc001770e8bce2c671afe11e9dbd3617530467e63650ac3fb43246","module":"Mathlib.Analysis.Real.Sqrt","note":"It is the square root bundled as an isomorphism of the ordered nonnegative reals; reading its inverse as the squaring map takes a further lemma.","pair_key":"5fb08f024612d6ca99d23bc2e172ae497c96d6e63fb803be4f5905b9d9a9f0ca","path":"Mathlib/Analysis/Real/Sqrt.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def NNReal.sqrt : NNReal ≃o NNReal"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"272b72049c3dbdb6386e59a0db9aab965f02424b9303e11eb11da599f0ec0d22","prominence":"supporting","quote":{"exact":"R + → R + : x ↦ x 2 {\\displaystyle \\mathbf"},"quote_capped":true,"section":["Examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"after":{"layer":" R + → R + : x ↦ x . {\\displaystyle \\mathbf {R} ^{+}\\to \\mathbf {R} ^{+}:x\\mapsto {\\sqrt {x}}.}","segments":[{"text":" "},{"tex":"\\mathbf {R} ^{+}\\to \\mathbf {R} ^{+}:x\\mapsto {\\sqrt {x}}."}]},"before":{"layer":"The identity function idX for every non-empty set X, and thus specifically R → R : x ↦ x . {\\displaystyle \\mathbf {R} \\to \\mathbf {R} :x\\mapsto x.} ","lead_in":true,"segments":[{"text":"The identity function idX for every non-empty set X, and thus specifically "},{"tex":"\\mathbf {R} \\to \\mathbf {R} :x\\mapsto x."},{"text":" "}]},"layer":"R + → R + : x ↦ x 2 {\\displaystyle \\mathbf {R} ^{+}\\to \\mathbf {R} ^{+}:x\\mapsto x^{2}} , and thus also its inverse","segments":[{"tex":"\\mathbf {R} ^{+}\\to \\mathbf {R} ^{+}:x\\mapsto x^{2}"},{"text":" , and thus also its inverse"}]},"unresolved":null},{"absence":null,"basis":"94c7f4bbbe2891e8d9807a3d80795ea715f266af4cb5819133abfbfcf14142d8","coverage":null,"id":"enwiki-1830142-1372610632::In-text #850f0a2e","item":"In-text #850f0a2e","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"NNReal.sqrt","end_line":46,"library":"mathlib","line":45,"location_key":"94c7f4bbbe2891e8d9807a3d80795ea715f266af4cb5819133abfbfcf14142d8","module":"Mathlib.Analysis.Real.Sqrt","note":"Mathlib bundles the square root of the nonnegative reals as an isomorphism of ordered sets, carrying the order on top of the one-to-one correspondence, and it covers 0 beside the positive numbers.","pair_key":"32d773d1918465dd07daf2c2ef26530c24b3c0906770443afca01049e9261f85","path":"Mathlib/Analysis/Real/Sqrt.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def NNReal.sqrt : NNReal ≃o NNReal"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"NNReal.sq_sqrt","end_line":48,"library":"mathlib","line":48,"location_key":"ff090e5cbcd4c140b1057d795fd6f29a1c50631d797009fd2724ef83dabf3c47","module":"Mathlib.Analysis.Real.Sqrt","note":"It records that squaring undoes the root on the nonnegative reals, one half of the two maps being mutually inverse.","pair_key":"13d1e4d8b214d77fcd24f279acdb154c2e616ad51de63fc70b14eaaf862b827e","path":"Mathlib/Analysis/Real/Sqrt.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem NNReal.sq_sqrt (x : NNReal) : NNReal.sqrt x ^ 2 = x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"808b743241277c65d596f47739cc61c548bb740144fbe8050600d1f3ae370829","prominence":"supporting","quote":{"exact":"R + → R + : x ↦ x . {\\displaystyle \\mathbf"},"quote_capped":true,"section":["Examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"before":{"layer":"R + → R + : x ↦ x 2 {\\displaystyle \\mathbf {R} ^{+}\\to \\mathbf {R} ^{+}:x\\mapsto x^{2}} , and thus also its inverse ","segments":[{"tex":"\\mathbf {R} ^{+}\\to \\mathbf {R} ^{+}:x\\mapsto x^{2}"},{"text":" , and thus also its inverse "}]},"layer":"R + → R + : x ↦ x . {\\displaystyle \\mathbf {R} ^{+}\\to \\mathbf {R} ^{+}:x\\mapsto {\\sqrt {x}}.}","segments":[{"tex":"\\mathbf {R} ^{+}\\to \\mathbf {R} ^{+}:x\\mapsto {\\sqrt {x}}."}]},"unresolved":null},{"absence":null,"basis":"c1f390c9709a66bb3857036c53b107610dbb1fa666f8a7f93e7a2cd25a596476","coverage":null,"id":"enwiki-1830142-1372610632::In-text #9d214f9e","item":"In-text #9d214f9e","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.expOrderIso","end_line":309,"library":"mathlib","line":304,"location_key":"c1f390c9709a66bb3857036c53b107610dbb1fa666f8a7f93e7a2cd25a596476","module":"Mathlib.Analysis.SpecialFunctions.Exp","note":"Mathlib bundles the exponential as an isomorphism of ordered sets between the real line and the ray above 0, carrying the order besides the correspondence.","pair_key":"0fc89c32efd7da1ec77f84168bc0a43e7069b96bca071de0b4f343847fec0869","path":"Mathlib/Analysis/SpecialFunctions/Exp.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Real.expOrderIso : ℝ ≃o ↑(Set.Ioi 0)"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.expPartialHomeomorph","end_line":473,"library":"mathlib","line":461,"location_key":"d5aa2e9aeb263cd84c13cfdd53b3553e23323fe9d3f7aa4d1eb1e88a45680c78","module":"Mathlib.Analysis.SpecialFunctions.Log.Basic","note":"Mathlib bundles the exponential as a partial homeomorphism with the whole line as source and the positive reals as target, carrying continuity both ways besides the correspondence.","pair_key":"44604438f546ccb67abd478c673c22dd6a995a4e39904c1affbdd895b8b8cfd1","path":"Mathlib/Analysis/SpecialFunctions/Log/Basic.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Real.expPartialHomeomorph : OpenPartialHomeomorph ℝ ℝ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"17c9a86c4f7f37f9b86920c0198d14363b4a606b97a3e458380a16564af76629","prominence":"supporting","quote":{"exact":"The exponential function exp : R → R + : x ↦"},"quote_capped":true,"section":["Examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"after":{"layer":" the natural logarithm ln : R + → R : x ↦ ln ⁡ x . {\\displaystyle \\ln \\colon \\mathbf {R} ^{+}\\to \\mathbf {R} :x\\mapsto \\ln {x}.} Here, R + {\\displaystyle \\mathbf {R} ^{+}} denotes the positive real numbers.","segments":[{"text":" the natural logarithm "},{"tex":"\\ln \\colon \\mathbf {R} ^{+}\\to \\mathbf {R} :x\\mapsto \\ln {x}."},{"text":" Here, "},{"tex":"\\mathbf {R} ^{+}"},{"text":" denotes the positive real numbers."}]},"before":{"layer":"R + → R + : x ↦ x 2 {\\displaystyle \\mathbf {R} ^{+}\\to \\mathbf {R} ^{+}:x\\mapsto x^{2}} , and thus also its inverse R + → R + : x ↦ x . {\\displaystyle \\mathbf {R} ^{+}\\to \\mathbf {R} ^{+}:x\\mapsto {\\sqrt {x}}.} ","lead_in":true,"segments":[{"tex":"\\mathbf {R} ^{+}\\to \\mathbf {R} ^{+}:x\\mapsto x^{2}"},{"text":" , and thus also its inverse "},{"tex":"\\mathbf {R} ^{+}\\to \\mathbf {R} ^{+}:x\\mapsto {\\sqrt {x}}."},{"text":" "}]},"layer":"The exponential function exp : R → R + : x ↦ e x {\\displaystyle \\exp \\colon \\mathbf {R} \\to \\mathbf {R} ^{+}:x\\mapsto \\mathrm {e} ^{x}} (that is, the exponential function with its codomain restricted to its image), and thus also its inverse","segments":[{"text":"The exponential function "},{"tex":"\\exp \\colon \\mathbf {R} \\to \\mathbf {R} ^{+}:x\\mapsto \\mathrm {e} ^{x}"},{"text":" (that is, the exponential function with its codomain restricted to its image), and thus also its inverse"}]},"unresolved":null},{"absence":null,"basis":"c4da7a3be2c94911e42e5df06f4a70ada6b1e9d805608f92b2876f6f9d6a5d5b","coverage":null,"id":"enwiki-1830142-1372610632::In-text #f572f6bc","item":"In-text #f572f6bc","kind":"example","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.expPartialHomeomorph","end_line":473,"library":"mathlib","line":461,"location_key":"c4da7a3be2c94911e42e5df06f4a70ada6b1e9d805608f92b2876f6f9d6a5d5b","module":"Mathlib.Analysis.SpecialFunctions.Log.Basic","note":"Mathlib bundles the exponential as a partial homeomorphism between the whole line and the positive reals whose inverse map is Real.log, carrying continuity both ways besides the inverse correspondence.","pair_key":"578804e6949ffed5ca8eb5a65578fc3cc424ca623a3135cbe24b4e0a218ddb61","path":"Mathlib/Analysis/SpecialFunctions/Log/Basic.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Real.expPartialHomeomorph : OpenPartialHomeomorph ℝ ℝ"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.expPartialHomeomorph_symm_apply","end_line":461,"library":"mathlib","line":461,"location_key":"03e0a740ae9fc1d63f23ce49cade2e02bc8d3f58a07b1d3e18e65aa7e5567fa8","module":"Mathlib.Analysis.SpecialFunctions.Log.Basic","note":"It unfolds the inverse of the bundle to Real.log, a definitional reading of the term rather than a claim about the logarithm.","pair_key":"8178ab2ebb90fc3a3d821695067f61ce253e58f471ba0afcf96a096d2618ba8e","path":"Mathlib/Analysis/SpecialFunctions/Log/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.expPartialHomeomorph_symm_apply (x : ℝ) : ↑Real.expPartialHomeomorph.symm x = Real.log x"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.log_injOn_pos","end_line":258,"library":"mathlib","line":257,"location_key":"b6c2e6aa6e7ed777118e01934ae85692ad94d5c69264af4811665f1a53133681","module":"Mathlib.Analysis.SpecialFunctions.Log.Basic","note":"It gives injectivity of the logarithm on the positive reals and is silent on reaching every real.","pair_key":"95a033287ceba7478fb5f1a088a275a42d9715099ea7406e19c257475fee9a92","path":"Mathlib/Analysis/SpecialFunctions/Log/Basic.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.log_injOn_pos : Set.InjOn Real.log (Set.Ioi 0)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"533dc7769aebf61aaeffb7fb67dd354cc2a783d2af00c3933c79b2ca13ecf7f5","prominence":"supporting","quote":{"exact":"the natural logarithm ln : R + → R : x ↦"},"quote_capped":true,"section":["Examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"after":{"layer":" Here, R + {\\displaystyle \\mathbf {R} ^{+}} denotes the positive real numbers.","segments":[{"text":" Here, "},{"tex":"\\mathbf {R} ^{+}"},{"text":" denotes the positive real numbers."}]},"before":{"layer":"The exponential function exp : R → R + : x ↦ e x {\\displaystyle \\exp \\colon \\mathbf {R} \\to \\mathbf {R} ^{+}:x\\mapsto \\mathrm {e} ^{x}} (that is, the exponential function with its codomain restricted to its image), and thus also its inverse ","segments":[{"text":"The exponential function "},{"tex":"\\exp \\colon \\mathbf {R} \\to \\mathbf {R} ^{+}:x\\mapsto \\mathrm {e} ^{x}"},{"text":" (that is, the exponential function with its codomain restricted to its image), and thus also its inverse "}]},"layer":"the natural logarithm ln : R + → R : x ↦ ln ⁡ x . {\\displaystyle \\ln \\colon \\mathbf {R} ^{+}\\to \\mathbf {R} :x\\mapsto \\ln {x}.}","segments":[{"text":"the natural logarithm "},{"tex":"\\ln \\colon \\mathbf {R} ^{+}\\to \\mathbf {R} :x\\mapsto \\ln {x}."}]},"unresolved":null},{"absence":null,"basis":"816ac684406e861e07b0329d98552a788b8edb98fdc818fea23c2ceb45a3fcc9","coverage":null,"id":"enwiki-1830142-1372610632::In-text #9e9df845","item":"In-text #9e9df845","kind":"notation","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.Ioi","end_line":37,"library":"mathlib","line":37,"location_key":"816ac684406e861e07b0329d98552a788b8edb98fdc818fea23c2ceb45a3fcc9","module":"Mathlib.Order.Interval.Set.Defs","note":"Lean defines the half-open unbounded interval for any preorder and any endpoint.","pair_key":"e0b03661d47750eaf984777a9a817e09b9f4175984114fff125a90ad796a5a15","path":"Mathlib/Order/Interval/Set/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Set.Ioi {α : Type*} [Preorder α] : α → Set α"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"NNReal","end_line":60,"library":"mathlib","line":60,"location_key":"f270ece32f9d4d1696b7c80b7b8858477f53835d27c6f03ca9605ccfbd2044d0","module":"Mathlib.Basic.NNReal.Defs","note":"This is the type of reals that are at least zero, so it also holds zero and is not the set the notation names.","pair_key":"5c7cc3ba62e5a5ac8ee729095943da1634a9b63be05ada1e47ec23e661ca8161","path":"Mathlib/Basic/NNReal/Defs.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def NNReal : Type"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f8c5f5b3cdebd9ba59ea26f81ee2d8267132d5fac06fd3ab14f2b6ee94b2bd5e","prominence":"supporting","quote":{"exact":"Here, R + {\\displaystyle \\mathbf {R} ^{+}} denotes the positive real numbers."},"quote_capped":false,"section":["Examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"before":{"layer":"exp : R → R + : x ↦ e x {\\displaystyle \\exp \\colon \\mathbf {R} \\to \\mathbf {R} ^{+}:x\\mapsto \\mathrm {e} ^{x}} (that is, the exponential function with its codomain restricted to its image), and thus also its inverse the natural logarithm ln : R + → R : x ↦ ln ⁡ x . {\\displaystyle \\ln \\colon \\mathbf {R} ^{+}\\to \\mathbf {R} :x\\mapsto \\ln {x}.} ","segments":[{"tex":"\\exp \\colon \\mathbf {R} \\to \\mathbf {R} ^{+}:x\\mapsto \\mathrm {e} ^{x}"},{"text":" (that is, the exponential function with its codomain restricted to its image), and thus also its inverse the natural logarithm "},{"tex":"\\ln \\colon \\mathbf {R} ^{+}\\to \\mathbf {R} :x\\mapsto \\ln {x}."},{"text":" "}],"trimmed":true},"layer":"Here, R + {\\displaystyle \\mathbf {R} ^{+}} denotes the positive real numbers.","segments":[{"text":"Here, "},{"tex":"\\mathbf {R} ^{+}"},{"text":" denotes the positive real numbers."}]},"unresolved":null},{"absence":null,"basis":"1b408cb8ccaee0a9dce6ee5f547a989f6c9a87b83871f42a17aa6827a82313f0","coverage":null,"id":"enwiki-1830142-1372610632::In-text #05bb1e86","item":"In-text #05bb1e86","kind":"example","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Odd.pow_injective","end_line":212,"library":"mathlib","line":211,"location_key":"1b408cb8ccaee0a9dce6ee5f547a989f6c9a87b83871f42a17aa6827a82313f0","module":"Mathlib.Algebra.Order.Ring.Basic","note":"It states injectivity of the power map and says nothing about every real being hit.","pair_key":"a744c4c8fe1139fd7005302779eb662ab5d9eebcd4feffee7ed6401e3c5364c8","path":"Mathlib/Algebra/Order/Ring/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Odd.pow_injective {R : Type*} [Semiring R] [LinearOrder R] [IsStrictOrderedRing R] [ExistsAddOfLE R] {n : ℕ} : Odd n → Function.Injective fun x ↦ x ^ n"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"IsRealClosed.exists_eq_pow_of_odd","end_line":84,"library":"mathlib","line":82,"location_key":"870d1a952c643513ad8fbc9c637723169ef7dadd2c1567f1152060eb1525308f","module":"Mathlib.FieldTheory.IsRealClosed.Basic","note":"It states that every element is an odd power and says nothing about uniqueness of the root.","pair_key":"4314e97850d4833a515ed5c7b1e59bb073de13a4dd909a3080b47fc373574f36","path":"Mathlib/FieldTheory/IsRealClosed/Basic.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem IsRealClosed.exists_eq_pow_of_odd {R : Type u} [Field R] [IsRealClosed R] (x : R) {n : ℕ} : Odd n → ∃ r, x = r ^ n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"aa75b27c47ddaa8974cfe138c4e4a5353086bc6c6f587526047ae10051d2fb80","prominence":"supporting","quote":{"exact":"R → R : x ↦ x 3 {\\displaystyle \\mathbf {R} \\to"},"quote_capped":true,"section":["Examples"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"R → R : x ↦ x 3 {\\displaystyle \\mathbf {R} \\to \\mathbf {R} :x\\mapsto x^{3}}","segments":[{"tex":"\\mathbf {R} \\to \\mathbf {R} :x\\mapsto x^{3}"}]},"unresolved":null},{"absence":null,"basis":"7d8b21d1ef716901fbf345454f59b7d7e37a907e30de7620cbd05c202ea1a902","coverage":null,"id":"enwiki-1830142-1372610632::In-text #c8eea116","item":"In-text #c8eea116","kind":"example","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.exp_injective","end_line":321,"library":"mathlib","line":320,"location_key":"7d8b21d1ef716901fbf345454f59b7d7e37a907e30de7620cbd05c202ea1a902","module":"Mathlib.Analysis.Complex.Exponential","note":"It states injectivity and leaves the failure of surjectivity unsaid.","pair_key":"fe193e599a03411d4ab9bd657505ad74f45efa7a17c869b419f26cd30963b378","path":"Mathlib/Analysis/Complex/Exponential.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.exp_injective : Function.Injective Real.exp"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.range_exp","end_line":321,"library":"mathlib","line":320,"location_key":"d222d8fcd8ee71a9a4ae9a12e32d774f986c7c3237b4f09b56f63f726e09e55c","module":"Mathlib.Analysis.SpecialFunctions.Exp","note":"It pins the image of the exponential and leaves injectivity unsaid.","pair_key":"2e74ccc29c22b20361035d7901c5a280cd840536844187973b4d860278f8a8f2","path":"Mathlib/Analysis/SpecialFunctions/Exp.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.range_exp : Set.range Real.exp = Set.Ioi 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"30de9e4194c25242a4ecc6ab3bf58d7b2f662210e1ef8a65c5d8dd8daa958979","prominence":"supporting","quote":{"exact":"The exponential function exp : R → R : x ↦ e"},"quote_capped":true,"section":["Examples"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"before":{"layer":"Injective and non-surjective ","lead_in":true,"segments":[{"text":"Injective and non-surjective "}]},"layer":"The exponential function exp : R → R : x ↦ e x . {\\displaystyle \\exp \\colon \\mathbf {R} \\to \\mathbf {R} :x\\mapsto \\mathrm {e} ^{x}.}","segments":[{"text":"The exponential function "},{"tex":"\\exp \\colon \\mathbf {R} \\to \\mathbf {R} :x\\mapsto \\mathrm {e} ^{x}."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"74047e720b7a5bf2ed95cbd90a7d934174a92175e034b736facb108404a08f2a"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-1830142-1372610632::In-text #d7d69a1f","item":"In-text #d7d69a1f","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"d1ee9fb6083a79336000c5a942a8d33462e1368f1d2c01ce60013b95ef42b8a5","prominence":"supporting","quote":{"exact":"R → R : x ↦ ( x − 1 ) x"},"quote_capped":true,"section":["Examples"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"before":{"layer":"Non-injective and surjective ","lead_in":true,"segments":[{"text":"Non-injective and surjective "}]},"layer":"R → R : x ↦ ( x − 1 ) x ( x + 1 ) = x 3 − x . {\\displaystyle \\mathbf {R} \\to \\mathbf {R} :x\\mapsto (x-1)x(x+1)=x^{3}-x.}","segments":[{"tex":"\\mathbf {R} \\to \\mathbf {R} :x\\mapsto (x-1)x(x+1)=x^{3}-x."}]},"unresolved":null},{"absence":null,"basis":"487e562abb75ade8ad628f84fd29e4a9fb31fef90e0190c9da8b9640902502b1","coverage":null,"id":"enwiki-1830142-1372610632::In-text #901d665e","item":"In-text #901d665e","kind":"example","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.range_sin","end_line":641,"library":"mathlib","line":640,"location_key":"487e562abb75ade8ad628f84fd29e4a9fb31fef90e0190c9da8b9640902502b1","module":"Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic","note":"Equality of image and codomain is the passage's own reading of surjective; the lemma leaves the failure of injectivity unsaid.","pair_key":"3aeae874645a60c8f30e1d074aafbde30148a0a263cc056f7a9ffa89e9a78b70","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.range_sin : Set.range Real.sin = Set.Icc (-1) 1"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.bijOn_sin","end_line":630,"library":"mathlib","line":629,"location_key":"1af4c5bf7304f816c592c650c95c1f508e096aaa31a27df149ed31e6af613dcd","module":"Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic","note":"It is about sine cut down to a quarter-turn window, where it is one-to-one, so it is a statement about another domain than the passage's.","pair_key":"634b84e5035c362b7125fbd0268f97b7fadab0c18c1097524b13dc4db8cc8a1d","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.bijOn_sin : Set.BijOn Real.sin (Set.Icc (-(π / 2)) (π / 2)) (Set.Icc (-1) 1)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"8d54a0fd472ab686da78638f92fd753d78ed6101ccd9bd6aa8cd5dad3545076b","prominence":"supporting","quote":{"exact":"R → [ − 1 , 1 ] : x ↦ sin"},"quote_capped":true,"section":["Examples"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"before":{"layer":"R → R : x ↦ ( x − 1 ) x ( x + 1 ) = x 3 − x . {\\displaystyle \\mathbf {R} \\to \\mathbf {R} :x\\mapsto (x-1)x(x+1)=x^{3}-x.} ","lead_in":true,"segments":[{"tex":"\\mathbf {R} \\to \\mathbf {R} :x\\mapsto (x-1)x(x+1)=x^{3}-x."},{"text":" "}]},"layer":"R → [ − 1 , 1 ] : x ↦ sin ⁡ ( x ) . {\\displaystyle \\mathbf {R} \\to [-1,1]:x\\mapsto \\sin(x).}","segments":[{"tex":"\\mathbf {R} \\to [-1,1]:x\\mapsto \\sin(x)."}]},"unresolved":null},{"absence":null,"basis":"99045085b12d43c15a402fde3d46cf3996aa46406d5b49312b3ee5207b3cb856","coverage":null,"id":"enwiki-1830142-1372610632::In-text #f9588cac","item":"In-text #f9588cac","kind":"example","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.range_sin","end_line":641,"library":"mathlib","line":640,"location_key":"99045085b12d43c15a402fde3d46cf3996aa46406d5b49312b3ee5207b3cb856","module":"Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic","note":"It pins the image of sine and leaves the failure of injectivity unsaid.","pair_key":"dde38209c504b14e175fc1c1227a37e892bd69aeb3cf97f2a3af8a87b442d0b9","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.range_sin : Set.range Real.sin = Set.Icc (-1) 1"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.sin_eq_sin_iff","end_line":310,"library":"mathlib","line":308,"location_key":"e4868d293f113e138101dc5028c42dd91959f59378e1472263b9626820e49d8b","module":"Mathlib.Analysis.SpecialFunctions.Trigonometric.Complex","note":"It characterises when two sine values agree, but turning that into a repeated value needs the separate fact that the half-turn constant is nonzero.","pair_key":"372df364d33e11680a9bf9ed605b73eb60f6f57eee36306a8ae3626653bfa4b0","path":"Mathlib/Analysis/SpecialFunctions/Trigonometric/Complex.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.sin_eq_sin_iff {x y : ℝ} : Real.sin x = Real.sin y ↔ ∃ k, y = 2 * ↑k * π + x ∨ y = (2 * ↑k + 1) * π - x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"81c83abf1e6735e2ef568e8025b9b64d9363c002ca487bcc799f86a763b1e061","prominence":"supporting","quote":{"exact":"R → R : x ↦ sin ⁡ ( x ) ."},"quote_capped":true,"section":["Examples"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"before":{"layer":"Non-injective and non-surjective ","lead_in":true,"segments":[{"text":"Non-injective and non-surjective "}]},"layer":"R → R : x ↦ sin ⁡ ( x ) . {\\displaystyle \\mathbf {R} \\to \\mathbf {R} :x\\mapsto \\sin(x).}","segments":[{"tex":"\\mathbf {R} \\to \\mathbf {R} :x\\mapsto \\sin(x)."}]},"unresolved":null},{"absence":null,"basis":"f406188aa9e54022aa4a3df1b4cd2d3c0bf598889173db75721c0ca87f5558b5","coverage":null,"id":"enwiki-1830142-1372610632::In-text #1710c704","item":"In-text #1710c704","kind":"example","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"pow_two_nonneg","end_line":628,"library":"mathlib","line":628,"location_key":"f406188aa9e54022aa4a3df1b4cd2d3c0bf598889173db75721c0ca87f5558b5","module":"Mathlib.Algebra.Order.Ring.Unbundled.Basic","note":"It bounds the values of squaring and leaves repeated values unsaid.","pair_key":"81ce67f63c5a862c060b8c0c28a8bdccde9475cfb094dad1e775b1defe61ff88","path":"Mathlib/Algebra/Order/Ring/Unbundled/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem pow_two_nonneg {R : Type u} [Semiring R] [LinearOrder R] [ExistsAddOfLE R] [PosMulMono R] [AddLeftMono R] (a : R) : 0 ≤ a ^ 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":"69fd98339718781f94119891705030f389cc76f8bcaf3f4b3aaab98ba5b44f95","module":"Mathlib.Algebra.Ring.Commute","note":"It characterises equal squares and says nothing about which reals are values.","pair_key":"bc9fbe3e669a616d18b0f7b8d9415ffdd29ee57125a9838a0d71c69e19575e2c","path":"Mathlib/Algebra/Ring/Commute.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem sq_eq_sq_iff_eq_or_eq_neg {R : Type u} [CommRing R] [NoZeroDivisors R] {a b : R} : a ^ 2 = b ^ 2 ↔ a = b ∨ a = -b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2ce52481b625a69872d75b85b389d84386d5a91f7d26c57c079bc10ae2993348","prominence":"supporting","quote":{"exact":"R → R : x ↦ x 2 {\\displaystyle \\mathbf {R} \\to"},"quote_capped":true,"section":["Examples"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"before":{"layer":"R → R : x ↦ sin ⁡ ( x ) . {\\displaystyle \\mathbf {R} \\to \\mathbf {R} :x\\mapsto \\sin(x).} ","lead_in":true,"segments":[{"tex":"\\mathbf {R} \\to \\mathbf {R} :x\\mapsto \\sin(x)."},{"text":" "}]},"layer":"R → R : x ↦ x 2 {\\displaystyle \\mathbf {R} \\to \\mathbf {R} :x\\mapsto x^{2}}","segments":[{"tex":"\\mathbf {R} \\to \\mathbf {R} :x\\mapsto x^{2}"}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"cee6d46ea6ef50c3f1a8d7a82157ed65a88e2440879976bac328a5c5debed668","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"4d27be4287360025dc53beb6fa530cab795bbdc9b81120e72fb4745549f44013","text":"a subset of the domain is contained in the preimage of its own image under f"},{"id":"c2","part":"86a6e86ccc78beb2fba883c0f2b3a5d7116c1ec81c89e2a32da46f491594cfaf","text":"the image under f of the preimage of a subset of the codomain is contained in that subset"}],"parts":["4d27be4287360025dc53beb6fa530cab795bbdc9b81120e72fb4745549f44013","86a6e86ccc78beb2fba883c0f2b3a5d7116c1ec81c89e2a32da46f491594cfaf"],"relation":"exactMatch","status":"formalized"},"id":"enwiki-1830142-1372610632::In-text #a363e88e","item":"In-text #a363e88e","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.subset_preimage_image","end_line":419,"library":"mathlib","line":418,"location_key":"4d27be4287360025dc53beb6fa530cab795bbdc9b81120e72fb4745549f44013","module":"Mathlib.Data.Set.Image","note":"Lean writes the image and the preimage with its own set notation.","pair_key":"086d489a087c6e49149d4110205249a53cb6f8210d8cd0e25cbd6e0e75906aba","path":"Mathlib/Data/Set/Image.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.subset_preimage_image {α : Type*} {β : Type*} (f : α → β) (s : Set α) : s ⊆ f ⁻¹' f '' s"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.image_preimage_subset","end_line":416,"library":"mathlib","line":415,"location_key":"86a6e86ccc78beb2fba883c0f2b3a5d7116c1ec81c89e2a32da46f491594cfaf","module":"Mathlib.Data.Set.Image","note":"Lean writes the image and the preimage with its own set notation.","pair_key":"16f49a6841a74bb9fc121a9096c02120b95c475153e37208a7f142111dd97394","path":"Mathlib/Data/Set/Image.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.image_preimage_subset {α : Type*} {β : Type*} (f : α → β) (s : Set β) : f '' f ⁻¹' s ⊆ s"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"4eb98613d8cfdbbe0206c595c6c7285be99766995822d148176c36ded5296bbb","prominence":"central","quote":{"exact":"For every function f {\\displaystyle f} , let X {\\displaystyle X} be"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"For every function f {\\displaystyle f} , let X {\\displaystyle X} be a subset of the domain and Y {\\displaystyle Y} a subset of the codomain. One has always X ⊂ f − 1 ( f ( X ) ) {\\displaystyle X\\subset f^{-1}(f(X))} and f ( f − 1 ( Y ) ) ⊂ Y {\\displaystyle f(f^{-1}(Y))\\subset Y} , where f ( X ) {\\displaystyle f(X)} is the image of X {\\displaystyle X} and f − 1 ( Y ) {\\displaystyle f^{-1}(Y)} is the preimage of Y {\\displaystyle Y} under f {\\displaystyle f} .","segments":[{"text":"For every function "},{"tex":"f"},{"text":" , let "},{"tex":"X"},{"text":" be a subset of the domain and "},{"tex":"Y"},{"text":" a subset of the codomain. One has always "},{"tex":"X\\subset f^{-1}(f(X))"},{"text":" and "},{"tex":"f(f^{-1}(Y))\\subset Y"},{"text":" , where "},{"tex":"f(X)"},{"text":" is the image of "},{"tex":"X"},{"text":" and "},{"tex":"f^{-1}(Y)"},{"text":" is the preimage of "},{"tex":"Y"},{"text":" under "},{"tex":"f"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"dbe12845c096c0d273a4c8f1ceb931315484a0a970ed5abea016be29fb359374","coverage":null,"id":"enwiki-1830142-1372610632::In-text #87d2d5ef","item":"In-text #87d2d5ef","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.preimage_image_eq","end_line":426,"library":"mathlib","line":425,"location_key":"dbe12845c096c0d273a4c8f1ceb931315484a0a970ed5abea016be29fb359374","module":"Mathlib.Data.Set.Image","note":"Mathlib writes the equality with the preimage of the image on the left, which is the same assertion.","pair_key":"245494cbaed245e0261780ee34a6e15f33f071063298042c1c6ec455e3bfb353","path":"Mathlib/Data/Set/Image.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.preimage_image_eq {α : Type*} {β : Type*} {f : α → β} (s : Set α) : Function.Injective f → f ⁻¹' f '' s = s"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.Injective.preimage_image","end_line":1095,"library":"mathlib","line":1094,"location_key":"28f26be61cf9c715f0b433c5e08bb7eea1644a2aec8a64676a8f170b249abe9d","module":"Mathlib.Data.Set.Image","note":"This is the same equality offered for use after an injectivity proof, with the set argument given last.","pair_key":"56941e50bdaeb2bf11fedc0e160f3c017da6dbf5088bf32dc371cdb80c194d40","path":"Mathlib/Data/Set/Image.lean","proof_status":"proved","rank":2,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.Injective.preimage_image {α : Type*} {β : Type*} {f : α → β} : Function.Injective f → ∀ (s : Set α), f ⁻¹' f '' s = s"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7d68e96923d7e0ceb36e7d1d7c6d3419ac2b9d88d8766c9e4555c34f68a97868","prominence":"supporting","quote":{"exact":"If f {\\displaystyle f} is injective, then X = f − 1"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"after":{"layer":" , and if f {\\displaystyle f} is surjective, then f ( f − 1 ( Y ) ) = Y {\\displaystyle f(f^{-1}(Y))=Y} .","segments":[{"text":" , and if "},{"tex":"f"},{"text":" is surjective, then "},{"tex":"f(f^{-1}(Y))=Y"},{"text":" ."}]},"layer":"If f {\\displaystyle f} is injective, then X = f − 1 ( f ( X ) ) {\\displaystyle X=f^{-1}(f(X))}","segments":[{"text":"If "},{"tex":"f"},{"text":" is injective, then "},{"tex":"X=f^{-1}(f(X))"}]},"unresolved":null},{"absence":null,"basis":"926d663a5b86df1083d502b0e70cf7a31b621b9b47e6f4eff188a6914c12d5c4","coverage":null,"id":"enwiki-1830142-1372610632::In-text #287d5d06","item":"In-text #287d5d06","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.image_preimage_eq","end_line":432,"library":"mathlib","line":429,"location_key":"926d663a5b86df1083d502b0e70cf7a31b621b9b47e6f4eff188a6914c12d5c4","module":"Mathlib.Data.Set.Image","note":"Mathlib states the equality with the image of the preimage on the left, as the passage does.","pair_key":"ed005648a1ca910ae0740bb7ec249180a6dc936a2ebda81313e6c054cb36a7fe","path":"Mathlib/Data/Set/Image.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.image_preimage_eq {α : Type*} {β : Type*} {f : α → β} (s : Set β) : Function.Surjective f → f '' f ⁻¹' s = s"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.Surjective.image_preimage","end_line":1105,"library":"mathlib","line":1104,"location_key":"331cf46d8a57b7fe32a9d4b5945fa12a2ecf98f151d594be8ca1ff934aeb8384","module":"Mathlib.Data.Set.Image","note":"This is the same equality packaged for use after a surjectivity proof, with the set argument last.","pair_key":"d24a4f1c46026741c374c36d8288c48fa712151054a38646b9a72049cc02c28b","path":"Mathlib/Data/Set/Image.lean","proof_status":"proved","rank":2,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.Surjective.image_preimage {α : Type*} {β : Type*} {f : α → β} : Function.Surjective f → ∀ (s : Set β), f '' f ⁻¹' s = s"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"75f4473b5a23138dfc348582c0162fe4ad33e2b6ee8041666e8bb61ad93b4b61","prominence":"supporting","quote":{"exact":"if f {\\displaystyle f} is surjective, then f ( f − 1"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"before":{"layer":"If f {\\displaystyle f} is injective, then X = f − 1 ( f ( X ) ) {\\displaystyle X=f^{-1}(f(X))} , and ","segments":[{"text":"If "},{"tex":"f"},{"text":" is injective, then "},{"tex":"X=f^{-1}(f(X))"},{"text":" , and "}]},"layer":"if f {\\displaystyle f} is surjective, then f ( f − 1 ( Y ) ) = Y {\\displaystyle f(f^{-1}(Y))=Y} .","segments":[{"text":"if "},{"tex":"f"},{"text":" is surjective, then "},{"tex":"f(f^{-1}(Y))=Y"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"f01be9922418b196ba3ee942754f82f6d889e2870f27d3ad844d058f46012093","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"357c9788573eddd93cd7e8eb12d6f6a75bd3afd5f5ee2b01a307d9c9a7fc4685","text":"for a function h from X to Y, the map taking x to h(x) is a surjection from X onto the image h(X)"},{"id":"c2","part":"847c8d5193ede3aa61ad11aaf5940b1ba5ef02627639c8c85f9b70501f63d659","text":"for a function h from X to Y, the map taking y to itself is an injection from the image h(X) into Y"}],"parts":["357c9788573eddd93cd7e8eb12d6f6a75bd3afd5f5ee2b01a307d9c9a7fc4685","847c8d5193ede3aa61ad11aaf5940b1ba5ef02627639c8c85f9b70501f63d659"],"relation":"broadMatch","status":"formalized"},"id":"enwiki-1830142-1372610632::In-text #4421afc0","item":"In-text #4421afc0","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.rangeFactorization_surjective","end_line":186,"library":"mathlib","line":185,"location_key":"357c9788573eddd93cd7e8eb12d6f6a75bd3afd5f5ee2b01a307d9c9a7fc4685","module":"Mathlib.Data.Set.Operations","note":"Mathlib carries the image of h as a subtype of Y, so the map records each value together with a proof that it lies in the image.","pair_key":"96af82ab1419c87f2ead93743067e1e0629be271080c7b8007a2b4917574c5bb","path":"Mathlib/Data/Set/Operations.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.rangeFactorization_surjective {α : Type u} {ι : Sort*} {f : ι → α} : Function.Surjective (Set.rangeFactorization f)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Subtype.val_injective","end_line":82,"library":"mathlib","line":81,"location_key":"847c8d5193ede3aa61ad11aaf5940b1ba5ef02627639c8c85f9b70501f63d659","module":"Mathlib.Data.Subtype","note":"Mathlib proves injectivity of the projection for an arbitrary subtype of Y, and the image of h is one instance of that.","pair_key":"f85111648029cb9e96d68c6abf01ada8cde6899fab483cbff03670c302a92001","path":"Mathlib/Data/Subtype.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Subtype.val_injective {α : Sort*} {p : α → Prop} : Function.Injective Subtype.val"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"CategoryTheory.functorialSurjectiveInjectiveFactorizationData","end_line":137,"library":"mathlib","line":119,"location_key":"25771243cc93f1e477e1bc4a73451f15832d39387c0d1ec3c9afe4efead229d6","module":"Mathlib.CategoryTheory.MorphismProperty.Concrete","note":"It supplies, for maps of types, some factorization through a surjection and then an injection, chosen functorially, rather than the passage's two named maps built from the image.","pair_key":"7513a3cd29d5179ced8085325a841779670ce97a1ef819936e806c3d6c1f55fd","path":"Mathlib/CategoryTheory/MorphismProperty/Concrete.lean","proof_status":"definition","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def CategoryTheory.functorialSurjectiveInjectiveFactorizationData : CategoryTheory.ConcreteCategory.FunctorialSurjectiveInjectiveFactorizationData (Type u)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"75611141772ed9fa46ea03e66d0d4d85b0619f1de58391c7ccbbd207423b8e7e","prominence":"central","quote":{"exact":"For every function h : X → Y {\\displaystyle h:X\\to Y} ,"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"For every function h : X → Y {\\displaystyle h:X\\to Y} , one can define a surjection H : X → h ( X ) : x ↦ h ( x ) {\\displaystyle H:X\\to h(X):x\\mapsto h(x)} and an injection I : h ( X ) → Y : y ↦ y {\\displaystyle I:h(X)\\to Y:y\\mapsto y} .","segments":[{"text":"For every function "},{"tex":"h:X\\to Y"},{"text":" , one can define a surjection "},{"tex":"H:X\\to h(X):x\\mapsto h(x)"},{"text":" and an injection "},{"tex":"I:h(X)\\to Y:y\\mapsto y"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"829d43e56a1b4b7bdb6387b5ef2225b94615ba8f95ba646f5e323b9c138e6157","coverage":null,"id":"enwiki-1830142-1372610632::In-text #98130521","item":"In-text #98130521","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.coe_comp_rangeFactorization","end_line":904,"library":"mathlib","line":904,"location_key":"829d43e56a1b4b7bdb6387b5ef2225b94615ba8f95ba646f5e323b9c138e6157","module":"Mathlib.Data.Set.Image","note":"Mathlib keeps the image of h as a subtype of Y and writes the inclusion as the subtype projection, composing it with the factorization of h through that subtype.","pair_key":"d44fac9129af4fcdab87792526b079db104f7540e7104cb5581ec8e3addeda91","path":"Mathlib/Data/Set/Image.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.coe_comp_rangeFactorization {β : Type*} {ι : Sort*} (f : ι → β) : Subtype.val ∘ Set.rangeFactorization f = f"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.rangeFactorization_eq","end_line":897,"library":"mathlib","line":896,"location_key":"c2915eba5695ea8e8f2dd8aa136b4f5f2e4773415a868d26cfdd11eb72715436","module":"Mathlib.Data.Set.Image","note":"This is the same composite equality with the function left implicit, again writing the image of h as a subtype of Y.","pair_key":"a91f113ddf26828eeea026091fac93eb5477c45f73a0d1f0aad354c0238b7216","path":"Mathlib/Data/Set/Image.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.rangeFactorization_eq {β : Type*} {ι : Sort*} {f : ι → β} : Subtype.val ∘ Set.rangeFactorization f = f"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d20b7ebad804650cd0467f90e4e6abac3c62d586b9d3b141d080883ac633e3c6","prominence":"supporting","quote":{"exact":"It follows that ⁠ h = I ∘ H {\\displaystyle h=I\\circ H}"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"It follows that ⁠ h = I ∘ H {\\displaystyle h=I\\circ H} ⁠.","segments":[{"text":"It follows that ⁠ "},{"tex":"h=I\\circ H"},{"text":" ⁠."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":5,"sha256":"2d7f11cee55dc59a46f3322ea633f871c54f2a1969d80d50ed5222ea36d0b958"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-1830142-1372610632::In-text #9776444e","item":"In-text #9776444e","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"CategoryTheory.Limits.IsImage.isoExt","end_line":229,"library":"mathlib","line":224,"location_key":"12176a419cfdabb7fc34f5ba1ae8a6cebb995d0188f07a2b795486eb8855c577","module":"Mathlib.CategoryTheory.Limits.Shapes.Images","note":"It compares two factorizations that are each equipped with the universal property of an image and produces an isomorphism between them, where the passage starts from a bare surjection followed by an injection and claims a unique bijection with two stated identities.","pair_key":"72f5e4197ca1d69ad8f480051a7bacc32f169a79d65330bbeb62e14edc21273c","path":"Mathlib/CategoryTheory/Limits/Shapes/Images.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def CategoryTheory.Limits.IsImage.isoExt {C : Type u} [CategoryTheory.Category C] {X Y : C} {f : X ⟶ Y} {F F' : CategoryTheory.Limits.MonoFactorisation f} : CategoryTheory.Limits.IsImage F → CategoryTheory.Limits.IsImage F' → (F.I ≅ F'.I)"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"CategoryTheory.Limits.image.isoStrongEpiMono","end_line":986,"library":"mathlib","line":983,"location_key":"e009b47002205789a59cb00d13e2e254cc99b818647daf060ff21e63f796d108","module":"Mathlib.CategoryTheory.Limits.Shapes.Images","note":"It builds an isomorphism from the middle object of a strong epi followed by mono factorization to the image object, and it asserts neither the uniqueness of that isomorphism nor the passage's two identities.","pair_key":"15a0ab4367a3958263e82393f73bb7b526ffe29b4f9c28330dcead947370b02e","path":"Mathlib/CategoryTheory/Limits/Shapes/Images.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def CategoryTheory.Limits.image.isoStrongEpiMono {C : Type u} [CategoryTheory.Category C] [CategoryTheory.Limits.HasStrongEpiMonoFactorisations C] {X Y : C} {f : X ⟶ Y} {I' : C} (e : X ⟶ I') (m : I' ⟶ Y) : CategoryTheory.CategoryStruct.comp e m = f → [CategoryTheory.StrongEpi e] → [CategoryTheory.Mono m] → I' ≅ CategoryTheory.Limits.image f"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"58d684fbaff31998494c840ed6c455937b40e4e0f9a6a84f0a19955045edf64e","prominence":"supporting","quote":{"exact":"This decomposition as the composition of a surjection and an injection is"},"quote_capped":true,"section":["Properties"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"This decomposition as the composition of a surjection and an injection is unique up to an isomorphism, in the sense that, given such a decomposition, there is a unique bijection φ : h ( X ) → H ( X ) {\\displaystyle \\varphi :h(X)\\to H(X)} such that H ( x ) = φ ( h ( x ) ) {\\displaystyle H(x)=\\varphi (h(x))} and I ( φ ( h ( x ) ) ) = h ( x ) {\\displaystyle I(\\varphi (h(x)))=h(x)} for every x ∈ X . {\\displaystyle x\\in X.}","segments":[{"text":"This decomposition as the composition of a surjection and an injection is unique up to an isomorphism, in the sense that, given such a decomposition, there is a unique bijection "},{"tex":"\\varphi :h(X)\\to H(X)"},{"text":" such that "},{"tex":"H(x)=\\varphi (h(x))"},{"text":" and "},{"tex":"I(\\varphi (h(x)))=h(x)"},{"text":" for every "},{"tex":"x\\in X."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"27c09b3a066ad1cf620510a2c2bebfa899006255d160bae19b4eaea568c05228","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"2bc3829244a1eca779ddfe4e8bb9ddcdb706a053f98c7694378914b97aa1f8cb","text":"in the category of sets, the monomorphisms are exactly the injective functions"},{"id":"c2","part":"cb15bafc64413647d378a0c22116dbcf1b8d4ede202d9e26836713d3452fd110","text":"in the category of sets, the epimorphisms are exactly the surjective functions"},{"id":"c3","part":"16aff284c180aed14eb2d62d03118980ccfed4a9a87633b7c66da58db0bfab93","text":"in the category of sets, the isomorphisms are exactly the bijective functions"}],"parts":["2bc3829244a1eca779ddfe4e8bb9ddcdb706a053f98c7694378914b97aa1f8cb","cb15bafc64413647d378a0c22116dbcf1b8d4ede202d9e26836713d3452fd110","16aff284c180aed14eb2d62d03118980ccfed4a9a87633b7c66da58db0bfab93"],"relation":"closeMatch","status":"formalized"},"id":"enwiki-1830142-1372610632::In-text #f6758cb8","item":"In-text #f6758cb8","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"CategoryTheory.mono_iff_injective","end_line":326,"library":"mathlib","line":325,"location_key":"2bc3829244a1eca779ddfe4e8bb9ddcdb706a053f98c7694378914b97aa1f8cb","module":"Mathlib.CategoryTheory.Types.Basic","note":"Mathlib wraps a morphism of its category of types around the underlying function and coerces it back in the statement.","pair_key":"5fdfb8f335e3b44df47c5a41e4086feb846d7cc7ffe679c2e459f69a0a5701e3","path":"Mathlib/CategoryTheory/Types/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem CategoryTheory.mono_iff_injective {X Y : Type u} (f : X ⟶ Y) : CategoryTheory.Mono f ↔ Function.Injective ⇑(CategoryTheory.ConcreteCategory.hom f)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"CategoryTheory.epi_iff_surjective","end_line":352,"library":"mathlib","line":351,"location_key":"cb15bafc64413647d378a0c22116dbcf1b8d4ede202d9e26836713d3452fd110","module":"Mathlib.CategoryTheory.Types.Basic","note":"Mathlib wraps a morphism of its category of types around the underlying function and coerces it back in the statement.","pair_key":"025a562980ea0764a1c22379efaaa00c155ae317ca01e3bcfe5de6ac976053d8","path":"Mathlib/CategoryTheory/Types/Basic.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem CategoryTheory.epi_iff_surjective {X Y : Type u} (f : X ⟶ Y) : CategoryTheory.Epi f ↔ Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom f)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"CategoryTheory.isIso_iff_bijective","end_line":426,"library":"mathlib","line":424,"location_key":"16aff284c180aed14eb2d62d03118980ccfed4a9a87633b7c66da58db0bfab93","module":"Mathlib.CategoryTheory.Types.Basic","note":"Mathlib wraps a morphism of its category of types around the underlying function and coerces it back in the statement.","pair_key":"2c5717efdc56766b83de7ef338bff94850c832c5671f8e9679d8b8aa866ea123","path":"Mathlib/CategoryTheory/Types/Basic.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem CategoryTheory.isIso_iff_bijective {X Y : Type u} (f : X ⟶ Y) : CategoryTheory.IsIso f ↔ Function.Bijective ⇑(CategoryTheory.ConcreteCategory.hom f)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"99e7500eddbfc27cedbdb291904479a7658da7b05f28930e6b4fec62c3f1051b","prominence":"central","quote":{"exact":"In the category of sets, injections, surjections, and bijections correspond precisely to"},"quote_capped":true,"section":["Category theory"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1830142&oldid=1372610632","text":{"layer":"In the category of sets, injections, surjections, and bijections correspond precisely to monomorphisms, epimorphisms, and isomorphisms, respectively.","segments":[{"text":"In the category of sets, injections, surjections, and bijections correspond precisely to monomorphisms, epimorphisms, and isomorphisms, respectively."}]},"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":133506,"images":[{"author":"Schapel","file":"Bijection.svg","licence":"Public domain","licence_url":null,"project":"commons"},{"author":null,"file":"Bijective_composition.svg","licence":"Public domain","licence_url":null,"project":"commons"},{"author":null,"file":"Injection.svg","licence":"Public domain","licence_url":null,"project":"commons"},{"author":null,"file":"Injective_composition.svg","licence":"Public domain","licence_url":null,"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":null,"file":"Surjection.svg","licence":"Public domain","licence_url":null,"project":"commons"},{"author":null,"file":"Surjective_composition.svg","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"Original: Schapel; vectorized by Samuel Mediani","file":"Total_function_2.svg","licence":"Public domain","licence_url":null,"project":"commons"}],"marks":371,"passages":62,"sha256":"f8eebe8232234491403f1f0a3c48a78ba9e4991a3168166cc09e4c0018cc0dfa","unplaced":[]},"record_set":"23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602","records_sha256":"5b37355b24ca5b15eb1d7d81ce6cb1f26f1115c5b907cb462dd70a6f491bc734","revision":1372610632,"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":"02b9d2d1203f6941ed25cb182bf4a5ab157a4e3936ae64338164210d62ff2638","layer_sha256":"c5db59fc0500346e2447a558d5f0189b4c700431d3feaddae4493f6d70d3d12a","renderer":"web-html/3"},"source_id":"enwiki-1830142-1372610632","summary":{"by_library":{"lean-core":{"complete":10,"incomplete":0,"locations":10,"passages":10,"related":2},"mathlib":{"complete":75,"incomplete":0,"locations":75,"passages":50,"related":27}},"by_prominence":{"central":{"by_status":{"formalized":20,"not_formalized":0,"partial":2,"statement_only":0,"unresolved":0},"passages":22},"subject":{"by_status":{"formalized":0,"not_formalized":0,"partial":0,"statement_only":0,"unresolved":0},"passages":0},"supporting":{"by_status":{"formalized":25,"not_formalized":6,"partial":9,"statement_only":0,"unresolved":0},"passages":40}},"by_proof_status":{"definition":31,"proved":83},"by_relation":{"broadMatch":12,"closeMatch":26,"exactMatch":18,"hasPart":26,"narrowMatch":3,"relatedMatch":29},"by_status":{"formalized":45,"not_formalized":6,"partial":11,"statement_only":0,"unresolved":0},"locations":85,"passages":62,"related":29},"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":"Bijection, injection and surjection","universe":{"frozen":"2026-10-17","id":"u1","libraries":48,"sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"wikidata":"Q4907197"}
