{"assessment":{"class":"C","importance":"high"},"audit":{"blind":true,"ended":"2026-11-03T02:10:43.537Z","figures":[{"ci95":[0.4891,0.9935],"drawn":36,"id":"primary","label":"Strong links (exact, close or broad match) on supporting passages that have exactly the right relation","n_eff":5.1,"population":1029,"share":0.9234,"weights":"relation and library"},{"ci95":[0.3979,0.9202],"drawn":48,"id":"S2","label":"Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation","n_eff":8.1,"population":1740,"share":0.734,"weights":"relation and library"},{"ci95":[0.7268,0.9357],"drawn":44,"id":"CS","label":"Central and subject passages whose formalization status is right","n_eff":42.0,"population":1905,"share":0.8615,"weights":"recorded status"},{"ci95":[0.2519,0.8658],"drawn":12,"id":"S3","label":"'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it)","n_eff":6.1,"population":1236,"share":0.5957,"weights":"article"}],"independent":false,"items":224,"models":[{"model":"claude-opus-5-5","model_name":"Claude Opus 5.5"}],"operator":"jack","run_id":"tierA-batch1-audit","started":"2026-11-02T21:10:01.351Z"},"campaign":"run:loc-tierA-b1b+chal-tierA-b1","licence":{"mapping":"CC0-1.0","text":"CC-BY-SA-4.0"},"pageid":24634,"passages":[{"absence":null,"basis":"09bc63f02ae29b217c7d53a139374631d18b7057948b3d03c7f9f07cbdbb0aea","coverage":null,"id":"enwiki-24634-1352727744::In-text #6a4ccd41","item":"In-text #6a4ccd41","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Subgroup.toGroup","end_line":556,"library":"mathlib","line":555,"location_key":"09bc63f02ae29b217c7d53a139374631d18b7057948b3d03c7f9f07cbdbb0aea","module":"Mathlib.Algebra.Group.Subgroup.Defs","note":"Lean's product on Equiv.Perm M is composition of the two maps, so the structure inherited by H multiplies by composing permutations; the declaration is written for an arbitrary ambient group, where the passage fixes the permutations of M.","pair_key":"72cd5aa93390a3c8b400753e8018755cb8630a8e59ec62aa00055f08bdb74497","path":"Mathlib/Algebra/Group/Subgroup/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Subgroup.toGroup {G : Type*} [Group G] (H : Subgroup G) : Group ↥H"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm.permGroup","end_line":80,"library":"mathlib","line":72,"location_key":"0072f929d7ce90097da87ca8f68528f53854d22e9019fd851f740f39c941271e","module":"Mathlib.Algebra.Group.End","note":"This is the passage's notion at the largest group of permutations of M rather than at an arbitrary one.","pair_key":"11c82cda0ba0331263e9cb58e4f6a448005047e91e5fced4dd8c685bb8ab8fd0","path":"Mathlib/Algebra/Group/End.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","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":"medium","declaration":"Equiv.Perm.mul_def","end_line":113,"library":"mathlib","line":112,"location_key":"9bb344631791c810fe915ea1d4725b8bd31ff8620c40d1193581f3aeb498e47f","module":"Mathlib.Algebra.Group.End","note":null,"pair_key":"371a39a08e3879386ac529ccb1f656f69a5ddf57fc9cd3411b5ccd12e6d28a29","path":"Mathlib/Algebra/Group/End.lean","proof_status":"proved","rank":3,"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":"7d1076a705b444d4b84ccef9e38c12b0af7a9a0d9e005363f548748691abece6","prominence":"subject","quote":{"exact":"In mathematics, a permutation group is a group G whose elements are"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"In mathematics, a permutation group is a group G whose elements are permutations of a given set M and whose group operation is the composition of permutations in G (which are thought of as bijective functions from the set M to itself).","segments":[{"text":"In mathematics, a permutation group is a group G whose elements are permutations of a given set M and whose group operation is the composition of permutations in G (which are thought of as bijective functions from the set M to itself)."}]},"unresolved":null},{"absence":null,"basis":"cb67863e190d047c870666301f55c945723f57ce44a59fed45d5a5116352f985","coverage":null,"id":"enwiki-24634-1352727744::In-text #b9759d70","item":"In-text #b9759d70","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm.permGroup","end_line":80,"library":"mathlib","line":72,"location_key":"cb67863e190d047c870666301f55c945723f57ce44a59fed45d5a5116352f985","module":"Mathlib.Algebra.Group.End","note":"Lean writes this group as Equiv.Perm M, each member a self-equivalence that carries its inverse map alongside, which is the bijection itself.","pair_key":"8fe7f072dbf628cb623ac26a9002d0f3dd10335d749bbfe824b4b4864b27e0f2","path":"Mathlib/Algebra/Group/End.lean","proof_status":"definition","rank":1,"relation":"exactMatch","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","end_line":95,"library":"mathlib","line":94,"location_key":"0faaa1acadb12116a11ba85e37d52f8193bf2d7fe19b270ce53a795df6913e91","module":"Mathlib.Logic.Equiv.Defs","note":null,"pair_key":"3a5e83c73bf74e0fe8a45195ae2c6a57da9b13c59f8c857229d4a25d24180f10","path":"Mathlib/Logic/Equiv/Defs.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"abbrev Equiv.Perm : Sort u_1 → Sort (max 1 u_1)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"54b3fb9e81c6c2b045dd98113f90e4a2801120f47246753178941d1405148dd8","prominence":"central","quote":{"exact":"The group of all permutations of a set M is the symmetric"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"The group of all permutations of a set M is the symmetric group of M, often written as Sym(M).[1]","segments":[{"text":"The group of all permutations of a set M is the symmetric group of M, often written as Sym(M)."},{"ref":"[1]"}]},"unresolved":null},{"absence":null,"basis":"85c771db579679f4794a55a5206e7bce240f59ef67bb625a97d1067943bbdf45","coverage":null,"id":"enwiki-24634-1352727744::In-text #afd1ea5d","item":"In-text #afd1ea5d","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Subgroup","end_line":298,"library":"mathlib","line":296,"location_key":"85c771db579679f4794a55a5206e7bce240f59ef67bb625a97d1067943bbdf45","module":"Mathlib.Algebra.Group.Subgroup.Defs","note":"Lean keeps no separate notion for a permutation group: one is a term of Subgroup applied to Equiv.Perm M, and the structure is written for any ambient group.","pair_key":"76f2f68f8c0fb597211c87d05e5aa4fb2e0d202bbd063ec0cf5cee36e3367ac4","path":"Mathlib/Algebra/Group/Subgroup/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure Subgroup (G : Type*) [Group G]"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm.permGroup","end_line":80,"library":"mathlib","line":72,"location_key":"9005ee18b19ed74e4805458f55edd3b9306b85f0ae3fdc6d69dbfe2b14cdb891","module":"Mathlib.Algebra.Group.End","note":null,"pair_key":"43f350bfde9ae3cba435a8b11ca090a8d8035143c868d669fe14a712f743384e","path":"Mathlib/Algebra/Group/End.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Equiv.Perm.permGroup {α : Type*} : Group (Equiv.Perm α)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"0c68a9da90dd85ee381aaee80e61bf4ef87a287d9f30ee26fa19e8813956aed3","prominence":"central","quote":{"exact":"The term permutation group thus means a subgroup of the symmetric group."},"quote_capped":false,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"The term permutation group thus means a subgroup of the symmetric group.","segments":[{"text":"The term permutation group thus means a subgroup of the symmetric group."}]},"unresolved":null},{"absence":null,"basis":"3a8ea0abcae898400f1d14f0bcb979afdb743b8b143fa32892b2689358d9943a","coverage":null,"id":"enwiki-24634-1352727744::In-text #6accc66b","item":"In-text #6accc66b","kind":"notation","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Equiv.Perm.permGroup","end_line":80,"library":"mathlib","line":72,"location_key":"3a8ea0abcae898400f1d14f0bcb979afdb743b8b143fa32892b2689358d9943a","module":"Mathlib.Algebra.Group.End","note":"Lean names this group Equiv.Perm (Fin n), with Fin n the n letters indexed by the naturals below n, and the declaration is written for an arbitrary type of points; the passage's symbol and spoken name are the article's way of writing that same group.","pair_key":"d453110d473a3f278436e6ead5b4fd30bfc6ef1b7486d5d288d36ba5c982e8b5","path":"Mathlib/Algebra/Group/End.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Equiv.Perm.permGroup {α : Type*} : Group (Equiv.Perm α)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"94e896f0ff28f946d0c060689d7e879038cb4cb81b8b8ba41bedb57f2abf738c","prominence":"supporting","quote":{"exact":"If M = {1, 2, ..., n} then Sym(M) is usually denoted"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"If M = {1, 2, ..., n} then Sym(M) is usually denoted by Sn, and may be called the symmetric group on n letters.","segments":[{"text":"If M = {1, 2, ..., n} then Sym(M) is usually denoted by Sn, and may be called the symmetric group on n letters."}]},"unresolved":null},{"absence":null,"basis":"d0423ecc95eb1cc4de028a7a0d5b9c273005f478506a7aaa69969a26d1e05933","coverage":null,"id":"enwiki-24634-1352727744::In-text #fe46d7bc","item":"In-text #fe46d7bc","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm.subgroupOfMulAction","end_line":74,"library":"mathlib","line":72,"location_key":"d0423ecc95eb1cc4de028a7a0d5b9c273005f478506a7aaa69969a26d1e05933","module":"Mathlib.GroupTheory.Perm.Subgroup","note":"Lean states the result for an arbitrary faithful action; the regular action of a group on itself is the case the passage makes, and the image is a subgroup of the permutations of that set.","pair_key":"5438a1c6033dc88c766a5f050c360edb52121ba25c81cfca1b89e3600786abf1","path":"Mathlib/GroupTheory/Perm/Subgroup.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Equiv.Perm.subgroupOfMulAction (G : Type*) (H : Type*) [Group G] [MulAction G H] [FaithfulSMul G H] : G ≃* ↥(MulAction.toPermHom G H).range"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"Equiv.permutationRepresentation_injective","end_line":87,"library":"tauceti","line":85,"location_key":"6fe7ce88ce14f035dfbc7ec3f2818d67fb4756f562ccaefbba42360d1a3c1d1d","module":"TauCeti.Algebra.GroupAction.PermutationRepresentation","note":null,"pair_key":"ee7b85caf67c021dbdcf1f5791f1fd8dc21bcaf8676dc7633736b5d6242906a8","path":"TauCeti/Algebra/GroupAction/PermutationRepresentation.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem Equiv.permutationRepresentation_injective {G : Type*} {α : Type*} [Group G] [MulAction G α] {n : ℕ} [FaithfulSMul G α] (e : α ≃ Fin n) : Function.Injective ⇑e.permutationRepresentation"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7881df5d5ce2de6832c7ee59d00649e5ae891a48664f006bf1ba161fc4fda156","prominence":"central","quote":{"exact":"By Cayley's theorem, every group is isomorphic to some permutation group."},"quote_capped":false,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"By Cayley's theorem, every group is isomorphic to some permutation group.","segments":[{"text":"By Cayley's theorem, every group is isomorphic to some permutation group."}]},"unresolved":null},{"absence":null,"basis":"2ebc68355783bcc939d76e510486e59c453283acbbe86747eafff4e75381f4e4","coverage":null,"id":"enwiki-24634-1352727744::In-text #ff8c27e7","item":"In-text #ff8c27e7","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Subgroup.instMulActionSubtypeMem","end_line":32,"library":"mathlib","line":32,"location_key":"2ebc68355783bcc939d76e510486e59c453283acbbe86747eafff4e75381f4e4","module":"Mathlib.Algebra.Group.Subgroup.Actions","note":"Lean reaches this instance from the tautological action of the permutations of M on M, so a member of the permutation group acts on a point by applying the permutation to it; the instance is written for any ambient group and any set it acts on.","pair_key":"3830182825e3321358599bf3cc1cec59de39ca8f8bfe896c82425bd3687321cd","path":"Mathlib/Algebra/Group/Subgroup/Actions.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Subgroup.instMulActionSubtypeMem {G : Type*} {α : Type*} [Group G] [MulAction G α] {S : Subgroup G} : MulAction (↥S) α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm.applyMulAction","end_line":87,"library":"mathlib","line":84,"location_key":"c6890350ee2aae9861ff99805343b57db68f530eb6118a4e725e98438eb37280","module":"Mathlib.Algebra.Group.Action.End","note":"This is the passage's notion at the largest permutation group of M; for a smaller one Lean restricts this action.","pair_key":"e346c86bf4e09b408c5f5b7f981fc8f510704ad2286f262a8d0587536cb2283d","path":"Mathlib/Algebra/Group/Action/End.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Equiv.Perm.applyMulAction (α : Type*) : MulAction (Equiv.Perm α) α"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"863144748cb0de77cb3f1a77a0e4b5e1db8ff8f688dd32fc7c918d232bfcd3e3","prominence":"central","quote":{"exact":"The way in which the elements of a permutation group permute the"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"The way in which the elements of a permutation group permute the elements of the set is called its group action.","segments":[{"text":"The way in which the elements of a permutation group permute the elements of the set is called its group action."}]},"unresolved":null},{"absence":null,"basis":"ab9c37a3bdf53613f79c19c5b8b2108668e5cf0f961518b45f92fd2757e06d80","coverage":null,"id":"enwiki-24634-1352727744::In-text #6e14ef76","item":"In-text #6e14ef76","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Subgroup","end_line":298,"library":"mathlib","line":296,"location_key":"ab9c37a3bdf53613f79c19c5b8b2108668e5cf0f961518b45f92fd2757e06d80","module":"Mathlib.Algebra.Group.Subgroup.Defs","note":"Lean writes a permutation group as a term of Subgroup applied to Equiv.Perm M, whose members live in the type of bijections of M; the structure itself is written for any ambient group.","pair_key":"92d288c741f470349eaeda9c9029952768d53972d6ab9f3d3b28a7583207afff","path":"Mathlib/Algebra/Group/Subgroup/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure Subgroup (G : Type*) [Group G]"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm","end_line":95,"library":"mathlib","line":94,"location_key":"f033937e0cb97c1b6725446e8bfe2e5735904fde5c63cb7fdfd8713bdd313e77","module":"Mathlib.Logic.Equiv.Defs","note":null,"pair_key":"d5db7c37e692c8d128ca5a2d7f8d9257fb5cf133f0fa2014dc9f9158db2b6bd5","path":"Mathlib/Logic/Equiv/Defs.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"abbrev Equiv.Perm : Sort u_1 → Sort (max 1 u_1)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"0348d2c3f914d97fc96a88eb4f927e575c49634a11669efa3c10e6c5c43daefe","prominence":"central","quote":{"exact":"A permutation group is a subgroup of a symmetric group; that is,"},"quote_capped":true,"section":["Basic properties and terminology"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"A permutation group is a subgroup of a symmetric group; that is, its elements are permutations of a given set.","segments":[{"text":"A permutation group is a subgroup of a symmetric group; that is, its elements are permutations of a given set."}]},"unresolved":null},{"absence":null,"basis":"71ed2e09b420a834d144a6c77d8eb9a6e218c8b4c04c236ad2ff191916ee5177","coverage":{"basis":false,"bundle_key":"fd505daebd295f1c9c7f554a1bb78b5a11cd9208d38e432c78dc7e84d24d7be8","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"94e5571fcbceac7768287ecfd91acfebc927d4d3f2113d3b0a770d0f2f5cbb96","text":"the subset is closed under composing permutations"},{"id":"c2","part":"554fb069e16217820800504b4081eda631dabedc40f34d2ae7fc38ae1e518a9e","text":"the subset contains the identity permutation"},{"id":"c3","part":"cfb15d4016b398f106f8db726c7e04f5e2208bb8040bc8692fa16ef3620c3c09","text":"the subset contains the inverse of each element it contains"}],"parts":["94e5571fcbceac7768287ecfd91acfebc927d4d3f2113d3b0a770d0f2f5cbb96","554fb069e16217820800504b4081eda631dabedc40f34d2ae7fc38ae1e518a9e","cfb15d4016b398f106f8db726c7e04f5e2208bb8040bc8692fa16ef3620c3c09"],"relation":"broadMatch","status":"formalized"},"id":"enwiki-24634-1352727744::In-text #3cb5228b","item":"In-text #3cb5228b","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Subgroup","end_line":298,"library":"mathlib","line":296,"location_key":"71ed2e09b420a834d144a6c77d8eb9a6e218c8b4c04c236ad2ff191916ee5177","module":"Mathlib.Algebra.Group.Subgroup.Defs","note":"The structure carries a carrier subset together with the three conditions, and Lean's unit and product on Equiv.Perm M are the identity permutation and composition; it is written for any ambient group.","pair_key":"630b5aec4807f1741da0eefe9a9f770ea722deaafd3423d23b20b3b10ab967bf","path":"Mathlib/Algebra/Group/Subgroup/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure Subgroup (G : Type*) [Group G]"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Subgroup.mul_mem","end_line":442,"library":"mathlib","line":441,"location_key":"94e5571fcbceac7768287ecfd91acfebc927d4d3f2113d3b0a770d0f2f5cbb96","module":"Mathlib.Algebra.Group.Subgroup.Defs","note":"Stated for a subgroup of any group; at the permutations of M the product is composition of the two maps.","pair_key":"2f09265cfbd20e60949e661ff6411471299dab1ac68b3e8972d7257963533289","path":"Mathlib/Algebra/Group/Subgroup/Defs.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Subgroup.mul_mem {G : Type*} [Group G] (H : Subgroup G) {x y : G} : x ∈ H → y ∈ H → x * y ∈ H"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Subgroup.one_mem","end_line":437,"library":"mathlib","line":436,"location_key":"554fb069e16217820800504b4081eda631dabedc40f34d2ae7fc38ae1e518a9e","module":"Mathlib.Algebra.Group.Subgroup.Defs","note":"Stated for a subgroup of any group; the unit of Equiv.Perm M is the identity permutation.","pair_key":"b4b6f05490ac15aa27273079bcf444ac86d6da66b7162e719b89ebe47fa4d486","path":"Mathlib/Algebra/Group/Subgroup/Defs.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Subgroup.one_mem {G : Type*} [Group G] (H : Subgroup G) : 1 ∈ H"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Subgroup.inv_mem","end_line":447,"library":"mathlib","line":446,"location_key":"cfb15d4016b398f106f8db726c7e04f5e2208bb8040bc8692fa16ef3620c3c09","module":"Mathlib.Algebra.Group.Subgroup.Defs","note":"Stated for a subgroup of any group; the inverse in Equiv.Perm M is the inverse bijection.","pair_key":"4bb9d49df7ab551f3fb42e8b67d3f1d871036ba4d36091c44b505215225114df","path":"Mathlib/Algebra/Group/Subgroup/Defs.lean","proof_status":"proved","rank":4,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Subgroup.inv_mem {G : Type*} [Group G] (H : Subgroup G) {x : G} : x ∈ H → x⁻¹ ∈ H"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"27af78d0738d1fb23babe5be2e06db2d9119062a8b506329c3990b47c4058273","prominence":"supporting","quote":{"exact":"It is thus a subset of a symmetric group that is closed"},"quote_capped":true,"section":["Basic properties and terminology"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"It is thus a subset of a symmetric group that is closed under composition of permutations, contains the identity permutation, and contains the inverse permutation of each of its elements.[2]","segments":[{"text":"It is thus a subset of a symmetric group that is closed under composition of permutations, contains the identity permutation, and contains the inverse permutation of each of its elements."},{"ref":"[2]"}]},"unresolved":null},{"absence":null,"basis":"6f43860580903eaa1016c025da072d9443eaecd0ca2056b4f4e1273399e6c5e7","coverage":null,"id":"enwiki-24634-1352727744::In-text #b3ef7b51","item":"In-text #b3ef7b51","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"subgroupOfIdempotent","end_line":1335,"library":"mathlib","line":1329,"location_key":"6f43860580903eaa1016c025da072d9443eaecd0ca2056b4f4e1273399e6c5e7","module":"Mathlib.GroupTheory.OrderOfElement","note":"It gives the substantive direction, from closure of the subset to subgroup, and it asks both that the ambient permutation group be finite and that the product set be equal to the subset rather than contained in it.","pair_key":"e918085ccd215910fa1ed1ca3ae393f2d71a6157ab2beac00158e3fd44141683","path":"Mathlib/GroupTheory/OrderOfElement.lean","proof_status":"definition","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def subgroupOfIdempotent {G : Type*} [Group G] [Finite G] (S : Set G) : S.Nonempty → S * S = S → Subgroup G"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Subgroup.mul_mem","end_line":442,"library":"mathlib","line":441,"location_key":"54ead3a9f51e1552fd4a252a81e3b6fb48cd8dbce27bb1da58feb96b7e802ce8","module":"Mathlib.Algebra.Group.Subgroup.Defs","note":"It records that a subgroup is closed under the group operation, the easy direction of the passage, but it only unfolds what Lean's subgroup structure already carries.","pair_key":"223a1a260c894f342128d3070e343e529522e6fc0808c0dca56dff3f9f01f543","path":"Mathlib/Algebra/Group/Subgroup/Defs.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Subgroup.mul_mem {G : Type*} [Group G] (H : Subgroup G) {x y : G} : x ∈ H → y ∈ H → x * y ∈ H"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"bafc236e3d9919a014b5126e2dfea23c1c3d92ce056ff4ffe204495287a31cd0","prominence":"central","quote":{"exact":"A general property of finite groups implies that a finite nonempty subset"},"quote_capped":true,"section":["Basic properties and terminology"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"A general property of finite groups implies that a finite nonempty subset of a symmetric group is a permutation group if and only if it is closed under permutation composition.","segments":[{"text":"A general property of finite groups implies that a finite nonempty subset of a symmetric group is a permutation group if and only if it is closed under permutation composition."}]},"unresolved":null},{"absence":null,"basis":"3de49dd4272c217180d672ab2d295b8842d9c7b5a9d68b0c7a68d9973ba37c3f","coverage":null,"id":"enwiki-24634-1352727744::In-text #927b287c","item":"In-text #927b287c","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Fintype.card","end_line":41,"library":"mathlib","line":40,"location_key":"3de49dd4272c217180d672ab2d295b8842d9c7b5a9d68b0c7a68d9973ba37c3f","module":"Mathlib.Data.Fintype.Card","note":"Lean counts the elements of any finite type; the passage attaches that count, taken at the set a permutation group acts on, to the group as its degree.","pair_key":"d5da4c207f24897716fa6e62f43b53191f29a7b321eee7599f855f153e2f6bb9","path":"Mathlib/Data/Fintype/Card.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Fintype.card (α : Type*) [Fintype α] : ℕ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"low","declaration":"Nat.card","end_line":40,"library":"mathlib","line":39,"location_key":"60e64b9162bf1a3d56e17f31750b3b1683a3931e474bd02095028187b76168fb","module":"Mathlib.SetTheory.Cardinal.Finite","note":"This is Lean's cardinality of an arbitrary type as a natural number, with the value zero on infinite types, which the passage's finite setting leaves aside.","pair_key":"48a40f64000d8df4d01630fa6c9cc324017feb3ff597884edabfce8899caa198","path":"Mathlib/SetTheory/Cardinal/Finite.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.card : Type* → ℕ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"701731d401a897bd0680c28d41522d497edd8ba2042871e92b67e20f84fb2673","prominence":"central","quote":{"exact":"The degree of a group of permutations of a finite set is"},"quote_capped":true,"section":["Basic properties and terminology"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"The degree of a group of permutations of a finite set is the number of elements in the set.","segments":[{"text":"The degree of a group of permutations of a finite set is the number of elements in the set."}]},"unresolved":null},{"absence":null,"basis":"6a811d517c9b70d7c5bcbeb5bd610420023fff22ad515b69d4ad88f3a5769661","coverage":null,"id":"enwiki-24634-1352727744::In-text #c6a1d2a7","item":"In-text #c6a1d2a7","kind":"definition","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.card","end_line":40,"library":"mathlib","line":39,"location_key":"6a811d517c9b70d7c5bcbeb5bd610420023fff22ad515b69d4ad88f3a5769661","module":"Mathlib.SetTheory.Cardinal.Finite","note":"This is Lean's standard count of the elements of a type, and it is the quantity Mathlib treats as the order of a group, with the value zero reserved for a group with infinitely many elements.","pair_key":"f85f4be09d39a1ec2689f4e88f46f48cb6d68b2e5ff381a7239c54aaed5e9335","path":"Mathlib/SetTheory/Cardinal/Finite.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.card : Type* → ℕ"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"low","declaration":"Cardinal.mk","end_line":89,"library":"mathlib","line":88,"location_key":"4cd0065a0564f92d95309054fa19e4c9214ee3cbca71021a3a9d15f9d6c294be","module":"Mathlib.SetTheory.Cardinal.Defs","note":"Lean's cardinal of a type gives the count of elements for an infinite group too, which matches the passage's wording about a group of any kind.","pair_key":"8a98b4f0f2544757a63d843b44e0720f1dd731453627bb7630337fc1273c5f97","path":"Mathlib/SetTheory/Cardinal/Defs.lean","proof_status":"definition","rank":2,"relation":"broadMatch","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":"85ebcee46a9c1bf6a41a744a81ec5acd02d9157c460367b65c66aec3961c4b15","prominence":"supporting","quote":{"exact":"The order of a group (of any type) is the number of"},"quote_capped":true,"section":["Basic properties and terminology"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"The order of a group (of any type) is the number of elements (cardinality) in the group.","segments":[{"text":"The order of a group (of any type) is the number of elements (cardinality) in the group."}]},"unresolved":null},{"absence":null,"basis":"f931bc7c5a21d1f8efed795ceca29a909ed63f07f906b9b770ebb7667e9965f8","coverage":null,"id":"enwiki-24634-1352727744::In-text #0d728dd7","item":"In-text #0d728dd7","kind":"theorem","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.card_dvd_natCard_and_natCard_dvd_factorial_of_isPretransitive","end_line":73,"library":"tauceti","line":68,"location_key":"f931bc7c5a21d1f8efed795ceca29a909ed63f07f906b9b770ebb7667e9965f8","module":"TauCeti.GroupTheory.Perm.Recognition","note":"It reaches the passage's divisibility only for a permutation group that acts transitively on the points, a case the passage covers among others, and it also records that the number of points divides the order.","pair_key":"d7ec5cf01e5e734f3b01339a5dddc15ceb9ca9fed83868e8acce7b74a8ce10ab","path":"TauCeti/GroupTheory/Perm/Recognition.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.card_dvd_natCard_and_natCard_dvd_factorial_of_isPretransitive {α : Type*} [Fintype α] (G : Subgroup (Equiv.Perm α)) [MulAction.IsPretransitive (↥G) α] [Nonempty α] : Fintype.card α ∣ Nat.card ↥G ∧ Nat.card ↥G ∣ (Fintype.card α).factorial"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Subgroup.card_subgroup_dvd_card","end_line":70,"library":"mathlib","line":69,"location_key":"795a477c260e441fd6df3efed605d730c056125f7591a3bf64bb45c26ace1b0b","module":"Mathlib.GroupTheory.Coset.Card","note":"Lagrange's theorem gives that the order of the permutation group divides the order of the whole symmetric group, and turning that order into the factorial needs the separate count of the permutations.","pair_key":"cc180eeb675ff4190d34138a305f2db252b8bf3496462358fb7ac8d3dd815365","path":"Mathlib/GroupTheory/Coset/Card.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Subgroup.card_subgroup_dvd_card {α : Type*} [Group α] (s : Subgroup α) : Nat.card ↥s ∣ Nat.card α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.card_perm","end_line":40,"library":"mathlib","line":37,"location_key":"ed2c9f4a1d0c248b028c2d84d8bae66c56574a6ac6d4073f0ef4f2313c4c8d78","module":"Mathlib.Data.Finite.Perm","note":"It supplies the other half, the count of the permutations of a finite set, but on its own it says nothing about a subgroup.","pair_key":"3fa698f38a2c71b9976c8d874edc218ce9ba66b2f85266005fd30908aad3a34a","path":"Mathlib/Data/Finite/Perm.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.card_perm {α : Type*} [Finite α] : Nat.card (Equiv.Perm α) = (Nat.card α).factorial"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"877f3e48c7e0aaac0572cc02580be62b902f2662cd7322e9519edb30e8cba79f","prominence":"central","quote":{"exact":"By Lagrange's theorem, the order of any finite permutation group of degree"},"quote_capped":true,"section":["Basic properties and terminology"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"By Lagrange's theorem, the order of any finite permutation group of degree n must divide n!","segments":[{"text":"By Lagrange's theorem, the order of any finite permutation group of degree n must divide n!"}]},"unresolved":null},{"absence":null,"basis":"a3ecc4670cd0d8d15982dd9422e2ce350872a0325ef42ccd5084e412c71e3f05","coverage":null,"id":"enwiki-24634-1352727744::In-text #72011786","item":"In-text #72011786","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.card_perm","end_line":40,"library":"mathlib","line":37,"location_key":"a3ecc4670cd0d8d15982dd9422e2ce350872a0325ef42ccd5084e412c71e3f05","module":"Mathlib.Data.Finite.Perm","note":"Lean writes the order of the group of permutations of a finite set as the factorial of the number of elements of that set.","pair_key":"ff413ba860edcfd8ae192fae7516ae1fca65196e41ff3a8f836a061ab730ecf0","path":"Mathlib/Data/Finite/Perm.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.card_perm {α : Type*} [Finite α] : Nat.card (Equiv.Perm α) = (Nat.card α).factorial"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Fintype.card_perm","end_line":157,"library":"mathlib","line":156,"location_key":"950a2509371f1759f2d7464eacc11504f2296c3d0b375520e8a2f69bb6f16afa","module":"Mathlib.Data.Fintype.Perm","note":"This is the same count written with Lean's Fintype cardinality, which needs decidable equality on the letters for the enumeration.","pair_key":"4dda9f085638b77d468b6bf8bf0ce605ce59575a415047bbc726eddac99dbb83","path":"Mathlib/Data/Fintype/Perm.lean","proof_status":"proved","rank":2,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Fintype.card_perm {α : Type*} [DecidableEq α] [Fintype α] : Fintype.card (Equiv.Perm α) = (Fintype.card α).factorial"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"fca1a90c098fb274f5c8eb66514bddc290ec4687fe42ce93204b4b51d7626313","prominence":"supporting","quote":{"exact":"n-factorial is the order of the symmetric group Sn."},"quote_capped":false,"section":["Basic properties and terminology"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"before":{"layer":"By Lagrange's theorem, the order of any finite permutation group of degree n must divide n! since ","segments":[{"text":"By Lagrange's theorem, the order of any finite permutation group of degree n must divide n! since "}]},"layer":"n-factorial is the order of the symmetric group Sn.","segments":[{"text":"n-factorial is the order of the symmetric group Sn."}]},"unresolved":null},{"absence":null,"basis":"8b213fc6a05ac3b0c362cb35accb9a83199fa69a5fc0e154a2a9901cbc858ade","coverage":null,"id":"enwiki-24634-1352727744::In-text #16dbe95b","item":"In-text #16dbe95b","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm","end_line":95,"library":"mathlib","line":94,"location_key":"8b213fc6a05ac3b0c362cb35accb9a83199fa69a5fc0e154a2a9901cbc858ade","module":"Mathlib.Logic.Equiv.Defs","note":"Lean's permutation type packages each self-map of M with its inverse map and the two round-trip identities, which is how it records a one-to-one onto self-map.","pair_key":"63ca67cea2e2eabec721bdf4cbf053a2d302cecd6a8edf6bd5183970821b748e","path":"Mathlib/Logic/Equiv/Defs.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"abbrev Equiv.Perm : Sort u_1 → Sort (max 1 u_1)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.bijective","end_line":181,"library":"mathlib","line":181,"location_key":"6b51e2532160c23621b378bb7777432663d39a7674f7cc4d8cf78a7b3bc7c1ae","module":"Mathlib.Logic.Equiv.Defs","note":"The declaration is stated for an equivalence between two sorts, and the passage is the case where both are the same set.","pair_key":"93770218e2a9a29621af4da0fb44e480672a80d74aadb35cd13750678c98a2fe","path":"Mathlib/Logic/Equiv/Defs.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Equiv.bijective {α : Sort u} {β : Sort v} (e : α ≃ β) : Function.Bijective ⇑e"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"8ddcf7fb4b08f205e51dd8f96f1bf496fd0f074e05a90296cc5818fa078d6dbe","prominence":"supporting","quote":{"exact":"permutations are bijections of a set"},"quote_capped":false,"section":["Notation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"after":{"layer":", they can be represented by Cauchy's two-line notation.","segments":[{"text":", they can be represented by Cauchy's two-line notation."}]},"before":{"layer":"Since ","segments":[{"text":"Since "}]},"layer":"permutations are bijections of a set","segments":[{"text":"permutations are bijections of a set"}]},"unresolved":null},{"absence":null,"basis":"0e063f896fe30fc88c659e77c399f7b31c1bda4b07b3c88cf4d60f4f99bc464e","coverage":null,"id":"enwiki-24634-1352727744::In-text #414a0cc3","item":"In-text #414a0cc3","kind":"notation","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"low","declaration":"TauCeti.permutationWordEquiv","end_line":45,"library":"tauceti","line":26,"location_key":"0e063f896fe30fc88c659e77c399f7b31c1bda4b07b3c88cf4d60f4f99bc464e","module":"TauCeti.GroupTheory.Perm.List","note":"The library writes the notation in its one-line form, for the points of a finite initial segment taken in their natural order, so the upper line of the passage's display is left implicit.","pair_key":"b470105ce3804870f630b35f975dcfccd3bebd4f960fd2120e24904edec15b37","path":"TauCeti/GroupTheory/Perm/List.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def TauCeti.permutationWordEquiv (n : ℕ) : Equiv.Perm (Fin n) ≃ { w // w.Perm (List.finRange n) }"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.permutationWordEquiv_apply_coe","end_line":52,"library":"tauceti","line":49,"location_key":"e8de04aa3f822b9b380ae2cac0fefa053e4ba80e556651da40455a8f2afb27ff","module":"TauCeti.GroupTheory.Perm.List","note":"It unfolds the representation, giving the row attached to a permutation as the list of its values, and so restates what the preceding construction means.","pair_key":"6a234e3ff9ab15879a44c19f18f77c0f92d0c4d424659a38375a316d581aa105","path":"TauCeti/GroupTheory/Perm/List.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.permutationWordEquiv_apply_coe (n : ℕ) (σ : Equiv.Perm (Fin n)) : ↑((TauCeti.permutationWordEquiv n) σ) = List.ofFn ⇑σ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"ef3c5e9004b98e1d57c957224b8da6023dafecfbdc286f232e066ffb825c6579","prominence":"central","quote":{"exact":"they can be represented by Cauchy's two-line notation.[4]"},"quote_capped":false,"section":["Notation"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"before":{"layer":"Since permutations are bijections of a set, ","segments":[{"text":"Since permutations are bijections of a set, "}]},"layer":"they can be represented by Cauchy's two-line notation.[4]","segments":[{"text":"they can be represented by Cauchy's two-line notation."},{"ref":"[4]"}]},"unresolved":null},{"absence":null,"basis":"c9086ef2e8ace5a0b7cbae9df7844a5caf41bc178604ad3aa8123d446c2cbb2d","coverage":null,"id":"enwiki-24634-1352727744::In-text #8d9ba96f","item":"In-text #8d9ba96f","kind":"notation","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"low","declaration":"TauCeti.permutationWordEquiv_apply_coe","end_line":52,"library":"tauceti","line":49,"location_key":"c9086ef2e8ace5a0b7cbae9df7844a5caf41bc178604ad3aa8123d446c2cbb2d","module":"TauCeti.GroupTheory.Perm.List","note":"The library states the content of the lower line only, for the points of a finite initial segment in their natural order, so the upper line of the passage's display is carried by that fixed order rather than written out.","pair_key":"a4c05d568550187c65dd020dda8a92be99494ca2d26004bad489a2c33e607175","path":"TauCeti/GroupTheory/Perm/List.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.permutationWordEquiv_apply_coe (n : ℕ) (σ : Equiv.Perm (Fin n)) : ↑((TauCeti.permutationWordEquiv n) σ) = List.ofFn ⇑σ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a433a66848f0826b0cad7dea315b0001fb8f1db2801f28be215b7d0bf42dfc6f","prominence":"supporting","quote":{"exact":"This notation lists each of the elements of M in the first"},"quote_capped":true,"section":["Notation"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"This notation lists each of the elements of M in the first row, and for each element, its image under the permutation below it in the second row.","segments":[{"text":"This notation lists each of the elements of M in the first row, and for each element, its image under the permutation below it in the second row."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"80dd24158e41f772524c03409331c077ece37cc0ab36fd2acf157412d4a78abb"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-24634-1352727744::In-text #2b78cc99","item":"In-text #2b78cc99","kind":"notation","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.permutationWordEquiv","end_line":45,"library":"tauceti","line":26,"location_key":"13f82dfa776dabceac805b7cb61fbd57067adc0175bb023876b107e32fc3175d","module":"TauCeti.GroupTheory.Perm.List","note":"It records a permutation of Fin n as the word of its images, which its docstring calls one-line notation.","pair_key":"650212d15ac25b3dd93791c8f182134738e50de4a93da8849154349370bda157","path":"TauCeti/GroupTheory/Perm/List.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def TauCeti.permutationWordEquiv (n : ℕ) : Equiv.Perm (Fin n) ≃ { w // w.Perm (List.finRange n) }"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"ee14dd78f0fcb48d2d197b5a1160b5840d75ce95b3537b97b05a44726a7f942e","prominence":"central","quote":{"exact":"If σ {\\displaystyle \\sigma } is a permutation of the set M"},"quote_capped":true,"section":["Notation"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"If σ {\\displaystyle \\sigma } is a permutation of the set M = { x 1 , x 2 , … , x n } {\\displaystyle M=\\{x_{1},x_{2},\\ldots ,x_{n}\\}} then, σ = ( x 1 x 2 x 3 ⋯ x n σ ( x 1 ) σ ( x 2 ) σ ( x 3 ) ⋯ σ ( x n ) ) . {\\displaystyle \\sigma ={\\begin{pmatrix}x_{1}&x_{2}&x_{3}&\\cdots &x_{n}\\\\\\sigma (x_{1})&\\sigma (x_{2})&\\sigma (x_{3})&\\cdots &\\sigma (x_{n})\\end{pmatrix}}.}","segments":[{"text":"If "},{"tex":"\\sigma"},{"text":" is a permutation of the set "},{"tex":"M=\\{x_{1},x_{2},\\ldots ,x_{n}\\}"},{"text":" then, "},{"tex":"\\sigma ={\\begin{pmatrix}x_{1}&x_{2}&x_{3}&\\cdots &x_{n}\\\\\\sigma (x_{1})&\\sigma (x_{2})&\\sigma (x_{3})&\\cdots &\\sigma (x_{n})\\end{pmatrix}}."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"6dd83e085d12e3b94fd661e50e9c1c49baf95e32717c0a2aaf96a26026d7f352"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-24634-1352727744::In-text #ca5493cc","item":"In-text #ca5493cc","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"784b11151b5071338afd2a94f99476bc5854320d37f5f93b55b2a2a6db9114fa","prominence":"supporting","quote":{"exact":"For instance, a particular permutation of the set {1, 2, 3, 4,"},"quote_capped":true,"section":["Notation"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"For instance, a particular permutation of the set {1, 2, 3, 4, 5} can be written as σ = ( 1 2 3 4 5 2 5 4 3 1 ) ; {\\displaystyle \\sigma ={\\begin{pmatrix}1&2&3&4&5\\\\2&5&4&3&1\\end{pmatrix}};} this means that σ satisfies σ(1) = 2, σ(2) = 5, σ(3) = 4, σ(4) = 3, and σ(5) = 1.","segments":[{"text":"For instance, a particular permutation of the set {1, 2, 3, 4, 5} can be written as "},{"tex":"\\sigma ={\\begin{pmatrix}1&2&3&4&5\\\\2&5&4&3&1\\end{pmatrix}};"},{"text":" this means that σ satisfies σ(1) = 2, σ(2) = 5, σ(3) = 4, σ(4) = 3, and σ(5) = 1."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"ab80e1712dc0f39478e2bef3bb316df66c39cebbd715e451f96d57da55621629"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-24634-1352727744::In-text #c5f2f934","item":"In-text #c5f2f934","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"List.formPerm_rotate","end_line":232,"library":"mathlib","line":225,"location_key":"d9b8d639d901ff0d4baf5ea0298989436515b3a5e7c9a074bbc4a47f2b98db61","module":"Mathlib.GroupTheory.Perm.List","note":"It says that rotating the list of a cycle leaves the permutation it denotes unchanged.","pair_key":"8887507bb2089f94b127f6d1a9ed5a681820f845298a02c3efdce00dd26e1190","path":"Mathlib/GroupTheory/Perm/List.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem List.formPerm_rotate {α : Type*} [DecidableEq α] (l : List α) : l.Nodup → ∀ (n : ℕ), (l.rotate n).formPerm = l.formPerm"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"785d2797109833d50980bb169e03057a4e8d48a890ae47239db1628ca5249500","prominence":"supporting","quote":{"exact":"The elements of M need not appear in any special order in"},"quote_capped":true,"section":["Notation"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"after":{"layer":", so the same permutation could also be written as","segments":[{"text":", so the same permutation could also be written as"}]},"layer":"The elements of M need not appear in any special order in the first row","segments":[{"text":"The elements of M need not appear in any special order in the first row"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"e1915c569ec3eac173b357a0e438f6404d3e47a94c55e7a93111983d5594842a"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-24634-1352727744::In-text #14990a50","item":"In-text #14990a50","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"a2d9fbb555a7ae64c9fbe73913fa07248177ac4cc7bb4453596640c2bd73ee66","prominence":"supporting","quote":{"exact":"the same permutation could also be written as σ = ( 3"},"quote_capped":true,"section":["Notation"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"before":{"layer":"The elements of M need not appear in any special order in the first row, so ","segments":[{"text":"The elements of M need not appear in any special order in the first row, so "}]},"layer":"the same permutation could also be written as σ = ( 3 2 5 1 4 4 5 1 2 3 ) . {\\displaystyle \\sigma ={\\begin{pmatrix}3&2&5&1&4\\\\4&5&1&2&3\\end{pmatrix}}.}","segments":[{"text":"the same permutation could also be written as "},{"tex":"\\sigma ={\\begin{pmatrix}3&2&5&1&4\\\\4&5&1&2&3\\end{pmatrix}}."}]},"unresolved":null},{"absence":null,"basis":"31c8821711aadfa6946db88e6ad23453810386278db7b3c81d27c4db7aabe0ca","coverage":null,"id":"enwiki-24634-1352727744::In-text #a355be85","item":"In-text #a355be85","kind":"notation","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"List.formPerm","end_line":51,"library":"mathlib","line":50,"location_key":"31c8821711aadfa6946db88e6ad23453810386278db7b3c81d27c4db7aabe0ca","module":"Mathlib.GroupTheory.Perm.List","note":"Lean turns a list into the permutation carrying each listed element to the next and wrapping round at the end, over an arbitrary carrier type and an arbitrary list.","pair_key":"d32ceba3151fba9810a84ff4eae984d3180a4292c551d5e8830a95745cad3bdb","path":"Mathlib/GroupTheory/Perm/List.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def List.formPerm {α : Type*} [DecidableEq α] : List α → Equiv.Perm α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cycle.formPerm","end_line":133,"library":"mathlib","line":127,"location_key":"c63fdc6ddd843809ac37932f906e6a960e1ecafb8d81155f162f3f64a51f2bd1","module":"Mathlib.GroupTheory.Perm.Cycle.Concrete","note":"Lean reads a cycle, a list taken up to rotation, as the permutation moving each of its entries to the next, for an arbitrary carrier type.","pair_key":"ef7983faa2f883f53d99d2e11265a09ecaddc57c88837582807a98de92040db6","path":"Mathlib/GroupTheory/Perm/Cycle/Concrete.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Cycle.formPerm {α : Type*} [DecidableEq α] (s : Cycle α) : s.Nodup → Equiv.Perm α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"List.formPerm_apply_of_notMem","end_line":105,"library":"mathlib","line":104,"location_key":"60b61cc3bd51e72e15c6b83423390fafffa23a00457a0b88e17bf26239e133a3","module":"Mathlib.GroupTheory.Perm.List","note":"It states that an element absent from the list is fixed by the permutation the list denotes.","pair_key":"254bb74b7540d3fccfee499d04f5d77c99b4dab2ddc3e8e38596cff661c7dd05","path":"Mathlib/GroupTheory/Perm/List.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem List.formPerm_apply_of_notMem {α : Type*} [DecidableEq α] {l : List α} {x : α} : x ∉ l → l.formPerm x = x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7e857b0db112e1f927a02a5fe193e8bf2abbc5d16b7b862a162dd29ac2d8fb1b","prominence":"central","quote":{"exact":"Permutations are also often written in cycle notation (cyclic form)[5] so that"},"quote_capped":true,"section":["Notation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"after":{"layer":" since 3 is left unchanged; if the objects are denoted by single letters or digits, commas and spaces can also be dispensed with, and we have a notation such as (124).","segments":[{"text":" since 3 is left unchanged; if the objects are denoted by single letters or digits, commas and spaces can also be dispensed with, and we have a notation such as (124)."}]},"layer":"Permutations are also often written in cycle notation (cyclic form)[5] so that given the set M = {1, 2, 3, 4}, a permutation g of M with g(1) = 2, g(2) = 4, g(4) = 1 and g(3) = 3 will be written as (1, 2, 4)(3), or more commonly, (1, 2, 4)","segments":[{"text":"Permutations are also often written in cycle notation (cyclic form)"},{"ref":"[5]"},{"text":" so that given the set M = {1, 2, 3, 4}, a permutation g of M with g(1) = 2, g(2) = 4, g(4) = 1 and g(3) = 3 will be written as (1, 2, 4)(3), or more commonly, (1, 2, 4)"}]},"unresolved":null},{"absence":null,"basis":null,"coverage":null,"id":"enwiki-24634-1352727744::In-text #dcefcbe3","item":"In-text #dcefcbe3","kind":"notation","locations":[],"outcome":"unresolved","passage_ends_in_suffix":false,"passage_key":"2896cf32c8299debc67719723365ec7e198f0cb83c61c6750e86b7d58f945742","prominence":"supporting","quote":{"exact":"if the objects are denoted by single letters or digits, commas and"},"quote_capped":true,"section":["Notation"],"status":null,"subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"before":{"layer":"Permutations are also often written in cycle notation (cyclic form)[5] so that given the set M = {1, 2, 3, 4}, a permutation g of M with g(1) = 2, g(2) = 4, g(4) = 1 and g(3) = 3 will be written as (1, 2, 4)(3), or more commonly, (1, 2, 4) since 3 is left unchanged; ","segments":[{"text":"Permutations are also often written in cycle notation (cyclic form)"},{"ref":"[5]"},{"text":" so that given the set M = {1, 2, 3, 4}, a permutation g of M with g(1) = 2, g(2) = 4, g(4) = 1 and g(3) = 3 will be written as (1, 2, 4)(3), or more commonly, (1, 2, 4) since 3 is left unchanged; "}]},"layer":"if the objects are denoted by single letters or digits, commas and spaces can also be dispensed with, and we have a notation such as (124).","segments":[{"text":"if the objects are denoted by single letters or digits, commas and spaces can also be dispensed with, and we have a notation such as (124)."}]},"unresolved":{"challenge":"survived"}},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"bd2a4449e5842083acaec62849f589951fee662345ddc1b7e53eada8dbe09c0d"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-24634-1352727744::In-text #93001799","item":"In-text #93001799","kind":"example","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"List.formPerm","end_line":51,"library":"mathlib","line":50,"location_key":"31520b518a2e14a0a9d7e10029db723916457566ee96f306dc6aaf7871b76bca","module":"Mathlib.GroupTheory.Perm.List","note":"It fixes what each of the two cycles denotes but asserts no equality between a given permutation and their product.","pair_key":"01edc2ead13fe386174cd46f384bae96b18039d0a79617ef80ad952865a21233","path":"Mathlib/GroupTheory/Perm/List.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def List.formPerm {α : Type*} [DecidableEq α] : List α → Equiv.Perm α"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm.cycleFactors","end_line":462,"library":"mathlib","line":460,"location_key":"4179014e5ce592cd6efdb9bfc1421c04571c73973b404e77f2ec2f1c800cbcc3","module":"Mathlib.GroupTheory.Perm.Cycle.Factors","note":"It produces for each permutation of a finite ordered carrier some list of pairwise disjoint cycles with that product.","pair_key":"671920e47db76491c36ccbf976b4028021d16ad9d259d14fa6278b0f692520ad","path":"Mathlib/GroupTheory/Perm/Cycle/Factors.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Equiv.Perm.cycleFactors {α : Type*} [Fintype α] [LinearOrder α] (f : Equiv.Perm α) : { l // l.prod = f ∧ (∀ g ∈ l, g.IsCycle) ∧ List.Pairwise Equiv.Perm.Disjoint l }"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"928336db064176329db2ad2269df0ebf4ff122ed6391eb1f0d0f890b6692a29e","prominence":"supporting","quote":{"exact":"The permutation written above in 2-line notation would be written in cycle"},"quote_capped":true,"section":["Notation"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"The permutation written above in 2-line notation would be written in cycle notation as σ = ( 125 ) ( 34 ) . {\\displaystyle \\sigma =(125)(34).}","segments":[{"text":"The permutation written above in 2-line notation would be written in cycle notation as "},{"tex":"\\sigma =(125)(34)."}]},"unresolved":null},{"absence":null,"basis":"4147ee815439ada52bc7e2416da5e00156289229f85deea7c225cb5b4d42aed1","coverage":null,"id":"enwiki-24634-1352727744::In-text #f5bc0a11","item":"In-text #f5bc0a11","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm.instMul","end_line":67,"library":"mathlib","line":67,"location_key":"4147ee815439ada52bc7e2416da5e00156289229f85deea7c225cb5b4d42aed1","module":"Mathlib.Algebra.Group.End","note":"This is the multiplication Lean puts on the permutations of a set, and Equiv.Perm.mul_def and Equiv.Perm.mul_apply fix its value as composition in the passage's order.","pair_key":"d0b68bb6def375f99cb444e9932e00e7df93ad884af281b4b804177b51dcd0bf","path":"Mathlib/Algebra/Group/End.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Equiv.Perm.instMul {α : Type*} : Mul (Equiv.Perm α)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm.mul_apply","end_line":102,"library":"mathlib","line":101,"location_key":"e39d4c0f1b67f10b3fc7580bf4456defc5db8d6aa32f8906c7fce31c8049b477","module":"Mathlib.Algebra.Group.End","note":"Lean states the value of the product at an arbitrary element, unfolding the product to the successive application of the two factors.","pair_key":"586274e45348c30d8b421e824ba59a2d6ea3ec4963027930b34ec95e3f7d046f","path":"Mathlib/Algebra/Group/End.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Equiv.Perm.mul_apply {α : Type*} (f g : Equiv.Perm α) (x : α) : (f * g) x = f (g x)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm.mul_def","end_line":113,"library":"mathlib","line":112,"location_key":"9fdd44f28ff1c558d0a8aac330939f616c092ec517a84f74f1cf3df8f366fba2","module":"Mathlib.Algebra.Group.End","note":"Lean unfolds the product of two permutations to the bundled composite in which the right factor acts first.","pair_key":"4c36ccfb5ceee2e80dc457541df39f60f916006476fe8bdf9045c09ede268bb4","path":"Mathlib/Algebra/Group/End.lean","proof_status":"proved","rank":3,"relation":"closeMatch","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":"cb612a3947a469aa75f0276a09642b30ab50ed23d2ba68754dad2636f06ab15d","prominence":"central","quote":{"exact":"The product of two permutations is defined as their composition as functions,"},"quote_capped":true,"section":["Composition of permutations–the group product"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"The product of two permutations is defined as their composition as functions, so σ ⋅ π {\\displaystyle \\sigma \\cdot \\pi } is the function that maps any element x of the set to σ ( π ( x ) ) {\\displaystyle \\sigma (\\pi (x))} .","segments":[{"text":"The product of two permutations is defined as their composition as functions, so "},{"tex":"\\sigma \\cdot \\pi"},{"text":" is the function that maps any element x of the set to "},{"tex":"\\sigma (\\pi (x))"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"17f6bb8fc72b23bb34a787ec03586c91944923ae0c3ca5690e3fd2c6f2c0b3d3","coverage":null,"id":"enwiki-24634-1352727744::In-text #fa35b522","item":"In-text #fa35b522","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Equiv.trans_apply","end_line":245,"library":"mathlib","line":244,"location_key":"17f6bb8fc72b23bb34a787ec03586c91944923ae0c3ca5690e3fd2c6f2c0b3d3","module":"Mathlib.Logic.Equiv.Defs","note":"Lean writes the left-acting product as Equiv.trans and application as ordinary function application, and it allows the three sorts to be distinct.","pair_key":"ad277afeffe62ff259af92ab3291679470d920ac21ed740af5258f525516c042","path":"Mathlib/Logic/Equiv/Defs.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Equiv.trans_apply {α : Sort u} {β : Sort v} {γ : Sort w} (f : α ≃ β) (g : β ≃ γ) (a : α) : (f.trans g) a = g (f a)"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm.mul_apply","end_line":102,"library":"mathlib","line":101,"location_key":"72e44676112c921a1b24bd3ba23d9a8f61c7e9255e70484641b5a504cf93bcb5","module":"Mathlib.Algebra.Group.End","note":"This is the rule for the other convention, where the rightmost factor acts first, so the factors stand in the opposite order to the superscript product.","pair_key":"b689b7bcc1d839af35801a278bf9410569b675b8a8d2eeeffa1725e7b51fea56","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_apply {α : Type*} (f g : Equiv.Perm α) (x : α) : (f * g) x = f (g x)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b8892cee3d2b8938b1e09dcb93b4699277289e5a5d44c35ab87abb4e0d2c45c6","prominence":"supporting","quote":{"exact":"With this convention, the product is given by x σ ⋅ π"},"quote_capped":true,"section":["Composition of permutations–the group product"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"With this convention, the product is given by x σ ⋅ π = ( x σ ) π {\\displaystyle x^{\\sigma \\cdot \\pi }=(x^{\\sigma })^{\\pi }} .[8] [9] [10]","segments":[{"text":"With this convention, the product is given by "},{"tex":"x^{\\sigma \\cdot \\pi }=(x^{\\sigma })^{\\pi }"},{"text":" ."},{"ref":"[8] [9] [10]"}]},"unresolved":null},{"absence":null,"basis":"f18bec6ebd80fc900652ceea5297c3b0bb9e9503d8de23c20657dca12e415901","coverage":null,"id":"enwiki-24634-1352727744::In-text #7a160237","item":"In-text #7a160237","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.Bijective.comp","end_line":167,"library":"mathlib","line":166,"location_key":"f18bec6ebd80fc900652ceea5297c3b0bb9e9503d8de23c20657dca12e415901","module":"Mathlib.Logic.Function.Defs","note":"Lean writes the composite with the circle operator and names the three sorts, which composability already requires.","pair_key":"fbfacf0b96cdf661c7b808796daafffc104ff7089b899f455695b8cdf4b2530f","path":"Mathlib/Logic/Function/Defs.lean","proof_status":"proved","rank":1,"relation":"exactMatch","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":"medium","declaration":"Equiv.trans","end_line":161,"library":"mathlib","line":160,"location_key":"8c785fb871af83d750fcb4974cd668a0d42924ebd7d80af077824945553bbb86","module":"Mathlib.Logic.Equiv.Defs","note":"Lean packages each bijection with its inverse and the two round-trip proofs, and builds the composite in the same packaged form.","pair_key":"89388f524db7e22b9aeb2fb8c3198501cc2196cd9f8442008f176aaef0f761bb","path":"Mathlib/Logic/Equiv/Defs.lean","proof_status":"definition","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Equiv.trans {α : Sort u} {β : Sort v} {γ : Sort w} : α ≃ β → β ≃ γ → α ≃ γ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"ab8cfe8837dc1ebd9edaf018072ae589cb78cb08d3ee911832911e334807b54d","prominence":"supporting","quote":{"exact":"the composition of two bijections always gives another bijection"},"quote_capped":false,"section":["Composition of permutations–the group product"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"after":{"layer":", the product of two permutations is again a permutation.","segments":[{"text":", the product of two permutations is again a permutation."}]},"before":{"layer":"Since ","segments":[{"text":"Since "}]},"layer":"the composition of two bijections always gives another bijection","segments":[{"text":"the composition of two bijections always gives another bijection"}]},"unresolved":null},{"absence":null,"basis":"fee518c9360683f3318856f3e47beeddf20d2605ac70b3da7301f3d0a2e03fd2","coverage":null,"id":"enwiki-24634-1352727744::In-text #d570f619","item":"In-text #d570f619","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.trans","end_line":161,"library":"mathlib","line":160,"location_key":"fee518c9360683f3318856f3e47beeddf20d2605ac70b3da7301f3d0a2e03fd2","module":"Mathlib.Logic.Equiv.Defs","note":"Lean defines composition for equivalences between three possibly different types, and permutations of one set are the case the passage uses.","pair_key":"a1b679ae28af5a72bd2315becb7ccf272ee89c9630b4f2a1741ab9a204994479","path":"Mathlib/Logic/Equiv/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Equiv.trans {α : Sort u} {β : Sort v} {γ : Sort w} : α ≃ β → β ≃ γ → α ≃ γ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.Bijective.comp","end_line":167,"library":"mathlib","line":166,"location_key":"ff347132366a8e39a3cd47b0d8302ff76502c3d6efb2ffe0fd11d0a8af5eb8f4","module":"Mathlib.Logic.Function.Defs","note":"The lemma speaks of maps between three sorts; the passage uses the case where all three are the set M.","pair_key":"5144906246a2f0ee5f52269e1e3e022db6f58ef3f75a9da897b7c002f3c495eb","path":"Mathlib/Logic/Function/Defs.lean","proof_status":"proved","rank":2,"relation":"broadMatch","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}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"68768f1c42210a421654706c59de6f60a329280b137b2a59c3c7cb3dc1fa127e","prominence":"central","quote":{"exact":"the product of two permutations is again a permutation."},"quote_capped":false,"section":["Composition of permutations–the group product"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"before":{"layer":"Since the composition of two bijections always gives another bijection, ","segments":[{"text":"Since the composition of two bijections always gives another bijection, "}]},"layer":"the product of two permutations is again a permutation.","segments":[{"text":"the product of two permutations is again a permutation."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"0a975be25340b01cc64ec60823bfc920baa1dff36c6162328b0f8b2b704b71b6"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-24634-1352727744::In-text #c1adb86e","item":"In-text #c1adb86e","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"17eaa2690deba79e45e435c8106796cdebd9bc9632d0db0e966567ac9716d614","prominence":"supporting","quote":{"exact":"the product QP is: Q P = ( 1 2 3 4"},"quote_capped":true,"section":["Composition of permutations–the group product"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"before":{"layer":"P = ( 1 2 3 4 5 2 4 1 3 5 ) and Q = ( 1 2 3 4 5 5 4 3 2 1 ) , {\\displaystyle P={\\begin{pmatrix}1&2&3&4&5\\\\2&4&1&3&5\\end{pmatrix}}\\quad {\\text{ and }}\\quad Q={\\begin{pmatrix}1&2&3&4&5\\\\5&4&3&2&1\\end{pmatrix}},} ","lead_in":true,"segments":[{"tex":"P={\\begin{pmatrix}1&2&3&4&5\\\\2&4&1&3&5\\end{pmatrix}}\\quad {\\text{ and }}\\quad Q={\\begin{pmatrix}1&2&3&4&5\\\\5&4&3&2&1\\end{pmatrix}},"},{"text":" "}]},"layer":"the product QP is: Q P = ( 1 2 3 4 5 5 4 3 2 1 ) ( 1 2 3 4 5 2 4 1 3 5 ) = ( 2 4 1 3 5 4 2 5 3 1 ) ( 1 2 3 4 5 2 4 1 3 5 ) = ( 1 2 3 4 5 4 2 5 3 1 ) . {\\displaystyle QP={\\begin{pmatrix}1&2&3&4&5\\\\5&4&3&2&1\\end{pmatrix}}{\\begin{pmatrix}1&2&3&4&5\\\\2&4&1&3&5\\end{pmatrix}}={\\begin{pmatrix}2&4&1&3&5\\\\4&2&5&3&1\\end{pmatrix}}{\\begin{pmatrix}1&2&3&4&5\\\\2&4&1&3&5\\end{pmatrix}}={\\begin{pmatrix}1&2&3&4&5\\\\4&2&5&3&1\\end{pmatrix}}.}","segments":[{"text":"the product QP is: "},{"tex":"QP={\\begin{pmatrix}1&2&3&4&5\\\\5&4&3&2&1\\end{pmatrix}}{\\begin{pmatrix}1&2&3&4&5\\\\2&4&1&3&5\\end{pmatrix}}={\\begin{pmatrix}2&4&1&3&5\\\\4&2&5&3&1\\end{pmatrix}}{\\begin{pmatrix}1&2&3&4&5\\\\2&4&1&3&5\\end{pmatrix}}={\\begin{pmatrix}1&2&3&4&5\\\\4&2&5&3&1\\end{pmatrix}}."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"0f5dc801bf0cc59918f079ab6aeb9bcea731f4be96ccc5e76604006c6f8578bf"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-24634-1352727744::In-text #17bde53c","item":"In-text #17bde53c","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"c2f0452873781e5c131e422de966555bdda76accb12000f1c2e7debce4d07c6d","prominence":"supporting","quote":{"exact":"Thus, the above product would be given by: Q ⋅ P ="},"quote_capped":true,"section":["Composition of permutations–the group product"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"Thus, the above product would be given by: Q ⋅ P = ( 15 ) ( 24 ) ⋅ ( 1243 ) = ( 1435 ) . {\\displaystyle Q\\cdot P=(15)(24)\\cdot (1243)=(1435).}","segments":[{"text":"Thus, the above product would be given by: "},{"tex":"Q\\cdot P=(15)(24)\\cdot (1243)=(1435)."}]},"unresolved":null},{"absence":null,"basis":"c704d9ccf9ea07f553b3aa7bc7b79c17020aac5bc1efe8e8f38e8e7868fb09a5","coverage":null,"id":"enwiki-24634-1352727744::In-text #d03b6fd5","item":"In-text #d03b6fd5","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.comp_assoc","end_line":29,"library":"mathlib","line":28,"location_key":"c704d9ccf9ea07f553b3aa7bc7b79c17020aac5bc1efe8e8f38e8e7868fb09a5","module":"Mathlib.Logic.Function.Defs","note":"Lean writes composition with the circle operator and names the four sorts the three maps run between.","pair_key":"e991a6b01e5250c522e0ceab3587dd94fa16e510b033bd9b21e5981275a1e725","path":"Mathlib/Logic/Function/Defs.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.comp_assoc {α : Sort u₁} {β : Sort u₂} {φ : Sort u₃} {δ : Sort u₄} (f : φ → δ) (g : β → φ) (h : α → β) : (f ∘ g) ∘ h = f ∘ g ∘ h"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a81541d69c907b66c473e4b8c749747591efaa12213eb88647fc26cce1cc924f","prominence":"supporting","quote":{"exact":"function composition is associative"},"quote_capped":false,"section":["Composition of permutations–the group product"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"after":{"layer":", so is the product operation on permutations: ( σ ⋅ π ) ⋅ ρ = σ ⋅ ( π ⋅ ρ ) {\\displaystyle (\\sigma \\cdot \\pi )\\cdot \\rho =\\sigma \\cdot (\\pi \\cdot \\rho )} .","segments":[{"text":", so is the product operation on permutations: "},{"tex":"(\\sigma \\cdot \\pi )\\cdot \\rho =\\sigma \\cdot (\\pi \\cdot \\rho )"},{"text":" ."}]},"before":{"layer":"Since ","segments":[{"text":"Since "}]},"layer":"function composition is associative","segments":[{"text":"function composition is associative"}]},"unresolved":null},{"absence":null,"basis":"7a0fd27ec908de794f6403b9f24fae4316e95fc9b3ffe1b9a934d1e65cd03758","coverage":null,"id":"enwiki-24634-1352727744::In-text #8b340273","item":"In-text #8b340273","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm.permGroup","end_line":80,"library":"mathlib","line":72,"location_key":"7a0fd27ec908de794f6403b9f24fae4316e95fc9b3ffe1b9a934d1e65cd03758","module":"Mathlib.Algebra.Group.End","note":"The instance also supplies the unit and inverses, which this passage does not assert.","pair_key":"d0f042028ae71cbdb4207879836c814735f12150094bc47312d0dd7544bf3de7","path":"Mathlib/Algebra/Group/End.lean","proof_status":"definition","rank":1,"relation":"broadMatch","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.trans_assoc","end_line":318,"library":"mathlib","line":317,"location_key":"7dc1ed485093c7e4c3ddaf0bffabb3f5f87426c0082b56834d6c681a3e211c8d","module":"Mathlib.Logic.Equiv.Defs","note":"Lean states it for equivalences between four possibly different types and in the left-to-right composition order.","pair_key":"fb8f93dfdeca6a4220eac0434384052aae93b52b9b512cd97bf797c53edd260f","path":"Mathlib/Logic/Equiv/Defs.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Equiv.trans_assoc {α : Sort u} {β : Sort v} {γ : Sort w} {δ : Sort*} (ab : α ≃ β) (bc : β ≃ γ) (cd : γ ≃ δ) : (ab.trans bc).trans cd = ab.trans (bc.trans cd)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_assoc","end_line":162,"library":"mathlib","line":161,"location_key":"2e65acb89d29e568918703c007b6c1e343c0bf998e39066ff129b90b3f603788","module":"Mathlib.Algebra.Group.Semigroup","note":"The lemma is stated for an arbitrary semigroup, and permutations of a set form one under composition.","pair_key":"a68492bf0e16ba1e734b823e9ae34b588243117977e8761e94557a38d473f8eb","path":"Mathlib/Algebra/Group/Semigroup.lean","proof_status":"proved","rank":3,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_assoc {G : Type*} [Semigroup G] (a b c : G) : a * b * c = a * (b * c)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"432a1d7bb3b8d273fccbcbaba636cb27039ed2b93afe0127dc8a61109df71a60","prominence":"central","quote":{"exact":"so is the product operation on permutations: ( σ ⋅ π )"},"quote_capped":true,"section":["Composition of permutations–the group product"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"before":{"layer":"Since function composition is associative, ","segments":[{"text":"Since function composition is associative, "}]},"layer":"so is the product operation on permutations: ( σ ⋅ π ) ⋅ ρ = σ ⋅ ( π ⋅ ρ ) {\\displaystyle (\\sigma \\cdot \\pi )\\cdot \\rho =\\sigma \\cdot (\\pi \\cdot \\rho )} .","segments":[{"text":"so is the product operation on permutations: "},{"tex":"(\\sigma \\cdot \\pi )\\cdot \\rho =\\sigma \\cdot (\\pi \\cdot \\rho )"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"8ca78e89caa4c78d278788a20361efa12e90c65706e5f36f2c02b751ed498f66","coverage":null,"id":"enwiki-24634-1352727744::In-text #0ffebe22","item":"In-text #0ffebe22","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm.permGroup","end_line":80,"library":"mathlib","line":72,"location_key":"8ca78e89caa4c78d278788a20361efa12e90c65706e5f36f2c02b751ed498f66","module":"Mathlib.Algebra.Group.End","note":"The instance also supplies associativity and inverses, which this passage does not assert.","pair_key":"bbdf476e7eda8c60ace5bcc30b1159b9b59ec3240197b89a4cb98894c10b3a52","path":"Mathlib/Algebra/Group/End.lean","proof_status":"definition","rank":1,"relation":"broadMatch","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.refl_trans","end_line":311,"library":"mathlib","line":311,"location_key":"ae41ff820b0ec4b99270259bdb5c948ddc6985c6c0f72e73112e07b3c00bc40c","module":"Mathlib.Logic.Equiv.Defs","note":"Lean states it for equivalences between two types, and it gives only the one side of neutrality.","pair_key":"80a6c6759fcd30cd1fb4bd648840a2f036cbb879f862d6e3122489d7f28f1de4","path":"Mathlib/Logic/Equiv/Defs.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Equiv.refl_trans {α : Sort u} {β : Sort v} (e : α ≃ β) : (Equiv.refl α).trans e = e"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.trans_refl","end_line":307,"library":"mathlib","line":307,"location_key":"91a939d45a4d85863398e2a702454ec1420f715babea736ceb7f93570b628bc1","module":"Mathlib.Logic.Equiv.Defs","note":"Lean states it for equivalences between two types, and it gives only the other side of neutrality.","pair_key":"4aff4a5edb14e9738e1fb2d2b2ff1b30d1dcfee1d3074262c003103041b24cbb","path":"Mathlib/Logic/Equiv/Defs.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Equiv.trans_refl {α : Sort u} {β : Sort v} (e : α ≃ β) : e.trans (Equiv.refl β) = e"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm.one_apply","end_line":105,"library":"mathlib","line":104,"location_key":"19feecd17d791ea7052d47bb26a69d382dc29aad45bf0e24f99115facca2a123","module":"Mathlib.Algebra.Group.End","note":"It unfolds how the unit of the permutation group acts on a point, without saying that it is neutral for the product.","pair_key":"3c6fd52e8d0056c5be25e3f9ab96d3ba13fc58fbc2a8d763434ecb5a0bc7b4ea","path":"Mathlib/Algebra/Group/End.lean","proof_status":"proved","rank":4,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Equiv.Perm.one_apply {α : Type*} (x : α) : 1 x = x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7774fd1ca10e3b75a17f22e94f2e431c6a9ae42ebb41eadd917b13e9bd558fd2","prominence":"central","quote":{"exact":"The identity permutation, which maps every element of the set to itself,"},"quote_capped":true,"section":["Neutral element and inverses"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"The identity permutation, which maps every element of the set to itself, is the neutral element for this product.","segments":[{"text":"The identity permutation, which maps every element of the set to itself, is the neutral element for this product."}]},"unresolved":null},{"absence":null,"basis":"da34c04ed2f528affb821b1beeb6ad43bfb9d91e34e4e56d519056c5aacf7482","coverage":null,"id":"enwiki-24634-1352727744::In-text #68f23a18","item":"In-text #68f23a18","kind":"notation","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Equiv.Perm.one_apply","end_line":105,"library":"mathlib","line":104,"location_key":"61b0d97a96784493097e80d1c0458f1518c8ee3872c4e093cbc9142212ee8b3b","module":"Mathlib.Algebra.Group.End","note":"Mathlib records the identity permutation by its value at each point, over an arbitrary type, where the article lays the same values out as two rows of an array.","pair_key":"424a108c31556463ceeb6bdde1772a24cf4a2f28ac55ec678b825b3136d53c20","path":"Mathlib/Algebra/Group/End.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Equiv.Perm.one_apply {α : Type*} (x : α) : 1 x = x"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"low","declaration":"Equiv.refl","end_line":138,"library":"mathlib","line":138,"location_key":"da34c04ed2f528affb821b1beeb6ad43bfb9d91e34e4e56d519056c5aacf7482","module":"Mathlib.Logic.Equiv.Defs","note":"Mathlib builds the identity equivalence of any type; this is the object whose array the article displays.","pair_key":"bd078def1e64e73b6076d9ae1ba8dc42d893e0274b7f6458a7ad5190b9d5f475","path":"Mathlib/Logic/Equiv/Defs.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Equiv.refl (α : Sort*) : α ≃ α"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"4e608ec06923b22877267328db1fa41224df2ee0e027af1a61d4679bf120caa9","prominence":"supporting","quote":{"exact":"In two-line notation, the identity is ( 1 2 3 ⋯ n"},"quote_capped":true,"section":["Neutral element and inverses"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"In two-line notation, the identity is ( 1 2 3 ⋯ n 1 2 3 ⋯ n ) . {\\displaystyle {\\begin{pmatrix}1&2&3&\\cdots &n\\\\1&2&3&\\cdots &n\\end{pmatrix}}.}","segments":[{"text":"In two-line notation, the identity is "},{"tex":"{\\begin{pmatrix}1&2&3&\\cdots &n\\\\1&2&3&\\cdots &n\\end{pmatrix}}."}]},"unresolved":null},{"absence":null,"basis":"ad616769c5971fec70f2da987c4854d611e39031eb2b6a947e776c757f01a436","coverage":null,"id":"enwiki-24634-1352727744::In-text #76049150","item":"In-text #76049150","kind":"notation","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Cycle.formPerm_subsingleton","end_line":147,"library":"mathlib","line":140,"location_key":"ad616769c5971fec70f2da987c4854d611e39031eb2b6a947e776c757f01a436","module":"Mathlib.GroupTheory.Perm.Cycle.Concrete","note":"Mathlib reads a cycle of at most one entry as the identity permutation; the long product of one-entry cycles has no single lemma of its own.","pair_key":"c97b5e2676b768e723c802b50d49a70013d68bfb3362ccdfe115ad591c71a14a","path":"Mathlib/GroupTheory/Perm/Cycle/Concrete.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cycle.formPerm_subsingleton {α : Type*} [DecidableEq α] (s : Cycle α) (h : s.Subsingleton) : s.formPerm ⋯ = 1"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"List.formPerm_nil","end_line":55,"library":"mathlib","line":54,"location_key":"0acdb90f58ab71029d41efd015d618f1c0f4bb99b5909db7e8aac1c344349084","module":"Mathlib.GroupTheory.Perm.List","note":"Mathlib spells the cycle by the list of its entries and reads the empty one as the identity permutation.","pair_key":"a9cf4fd8d29361e9ac79da849323ebcc6c3452992121398b23a8d5934395a2eb","path":"Mathlib/GroupTheory/Perm/List.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem List.formPerm_nil {α : Type*} [DecidableEq α] : [].formPerm = 1"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"094ac7c3fdee65f87e465e656c4398553aefda19fc4bea3ce1673ff90cbca8cb","prominence":"supporting","quote":{"exact":"In cycle notation, e = (1)(2)(3)...(n) which by convention is also denoted"},"quote_capped":true,"section":["Neutral element and inverses"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"In cycle notation, e = (1)(2)(3)...(n) which by convention is also denoted by just (1) or even ().","segments":[{"text":"In cycle notation, e = (1)(2)(3)...(n) which by convention is also denoted by just (1) or even ()."}]},"unresolved":null},{"absence":null,"basis":"ac0d7f1e969d63e6a9dbc9bbc499a465e399a5e86e128b356bd17844ee08b90d","coverage":null,"id":"enwiki-24634-1352727744::In-text #eefb7307","item":"In-text #eefb7307","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.bijective_iff_has_inverse","end_line":593,"library":"mathlib","line":591,"location_key":"ac0d7f1e969d63e6a9dbc9bbc499a465e399a5e86e128b356bd17844ee08b90d","module":"Mathlib.Logic.Function.Basic","note":"Mathlib proves the equivalence in both directions, and the article's claim is its left-to-right reading.","pair_key":"a90617169eb9e32eeaa63b06df976e605541469877b921078456ba46beeec788","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","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},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Equiv.ofBijective","end_line":823,"library":"mathlib","line":819,"location_key":"c30f0c591df44e6c1ba116f7fc231e6990a7eb3aa0dfd370c349e7c516e9e9bc","module":"Mathlib.Logic.Equiv.Defs","note":"Mathlib packages a bijective map as an equivalence, which carries the backward map together with both cancellation laws.","pair_key":"321a6221e1b0dd7134d89ee033b749aa1da1c3dffbb914cee7e71c51bd282343","path":"Mathlib/Logic/Equiv/Defs.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Equiv.ofBijective {α : Sort u} {β : Sort v} (f : α → β) : Function.Bijective f → α ≃ β"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"159e9953a6cf3bac959b547e0d6676a02aec5bacda4a1e5b92dfb6c32312a885","prominence":"supporting","quote":{"exact":"bijections have inverses"},"quote_capped":false,"section":["Neutral element and inverses"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"after":{"layer":", so do permutations, and the inverse σ−1 of σ is again a permutation.","segments":[{"text":", so do permutations, and the inverse σ−1 of σ is again a permutation."}]},"before":{"layer":"Since ","segments":[{"text":"Since "}]},"layer":"bijections have inverses","segments":[{"text":"bijections have inverses"}]},"unresolved":null},{"absence":null,"basis":"20e97011f093847443e57e26083f767239e4d6ac353509a95f86bfd5e0c08164","coverage":null,"id":"enwiki-24634-1352727744::In-text #3f52da88","item":"In-text #3f52da88","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm.permGroup","end_line":80,"library":"mathlib","line":72,"location_key":"20e97011f093847443e57e26083f767239e4d6ac353509a95f86bfd5e0c08164","module":"Mathlib.Algebra.Group.End","note":"Mathlib records the permutations of a type as a group, whose inversion operation supplies each permutation's inverse alongside the group laws.","pair_key":"f72eca09074d36051364d7c44b53df2aef91614cb98b388c58d2547a6c47223b","path":"Mathlib/Algebra/Group/End.lean","proof_status":"definition","rank":1,"relation":"broadMatch","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":"medium","declaration":"Equiv.symm","end_line":144,"library":"mathlib","line":144,"location_key":"9dd6a834814ceb25ec54879a3b2663ffaf275c8b3c9481bbf715ae107db76e62","module":"Mathlib.Logic.Equiv.Defs","note":"Mathlib defines inversion for an equivalence between two sorts; permutations are the case where the two sorts are one set.","pair_key":"0dd518193c9b69a571745eb0bd5aac2a70d3e3dc75b7d778977c2783ab0ad023","path":"Mathlib/Logic/Equiv/Defs.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Equiv.symm {α : Sort u} {β : Sort v} : α ≃ β → β ≃ α"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2d2f48e0b0c35687d0c6925975d452cb8e191e51c5e53712c58a2fba56259b4f","prominence":"supporting","quote":{"exact":"so do permutations"},"quote_capped":false,"section":["Neutral element and inverses"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"after":{"layer":", and the inverse σ−1 of σ is again a permutation.","segments":[{"text":", and the inverse σ−1 of σ is again a permutation."}]},"before":{"layer":"Since bijections have inverses, ","segments":[{"text":"Since bijections have inverses, "}]},"layer":"so do permutations","segments":[{"text":"so do permutations"}]},"unresolved":null},{"absence":null,"basis":"cbb0973e8c2e4dc785090752aa0637babe2dc98ee7b07afb0bb31b05b6d8d8df","coverage":null,"id":"enwiki-24634-1352727744::In-text #c8a1f3d1","item":"In-text #c8a1f3d1","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm.permGroup","end_line":80,"library":"mathlib","line":72,"location_key":"cbb0973e8c2e4dc785090752aa0637babe2dc98ee7b07afb0bb31b05b6d8d8df","module":"Mathlib.Algebra.Group.End","note":"Mathlib makes the permutations of a type into a group, so inversion lands back in the permutations of that same type, along with the group laws.","pair_key":"c291c907b93f199282440ae9943e4d768fe567a0ba084c6005860e53ea74c736","path":"Mathlib/Algebra/Group/End.lean","proof_status":"definition","rank":1,"relation":"broadMatch","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.symm","end_line":144,"library":"mathlib","line":144,"location_key":"02b6eb7d19346d1222b6d42861d4ec5df2e1eb08bbf8fd48b897105279989cd1","module":"Mathlib.Logic.Equiv.Defs","note":"Mathlib defines inversion for an equivalence between two sorts, and its type already says where the inverse lives.","pair_key":"df23799df4f21fcf8ea84635ed25f867ab0f33bce0dd09a139480c72482c711c","path":"Mathlib/Logic/Equiv/Defs.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Equiv.symm {α : Sort u} {β : Sort v} : α ≃ β → β ≃ α"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"5735473244cf43ed197c38661a8d633591d0cb81662e961aeb3c1823208fd280","prominence":"central","quote":{"exact":"the inverse σ−1 of σ is again a permutation."},"quote_capped":false,"section":["Neutral element and inverses"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"before":{"layer":"Since bijections have inverses, so do permutations, and ","segments":[{"text":"Since bijections have inverses, so do permutations, and "}]},"layer":"the inverse σ−1 of σ is again a permutation.","segments":[{"text":"the inverse σ−1 of σ is again a permutation."}]},"unresolved":null},{"absence":null,"basis":"3a345702e1c6b6871bb8de172a17688e3742b206d970ec9cd1cae5b378a05e0c","coverage":null,"id":"enwiki-24634-1352727744::In-text #9e53c636","item":"In-text #9e53c636","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm.inv_eq_iff_eq","end_line":134,"library":"mathlib","line":133,"location_key":"3a345702e1c6b6871bb8de172a17688e3742b206d970ec9cd1cae5b378a05e0c","module":"Mathlib.Algebra.Group.End","note":"Mathlib writes each equation with the applied term on the left and the bare point on the right; the two sides of the equivalence are the article's, written that way round.","pair_key":"41a6acbbe87e4a217d78502566101c2165953d12b4e9b089320b516e370861f2","path":"Mathlib/Algebra/Group/End.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Equiv.Perm.inv_eq_iff_eq {α : Type*} {f : Equiv.Perm α} {x y : α} : f⁻¹ x = y ↔ x = f y"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm.eq_inv_iff_eq","end_line":131,"library":"mathlib","line":130,"location_key":"00d4caa4729608f4963e9116cecbb1ff21d6f863b497b8dd1a9ff30917a0c408","module":"Mathlib.Algebra.Group.End","note":"This is Mathlib's companion statement, with the equation of the left-hand side turned round.","pair_key":"a2efbe190499a98b86aa8bc7fd70a89cb86993c6bc0d5aaf654dcfbbf6544e42","path":"Mathlib/Algebra/Group/End.lean","proof_status":"proved","rank":2,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Equiv.Perm.eq_inv_iff_eq {α : Type*} {f : Equiv.Perm α} {x y : α} : x = f⁻¹ y ↔ f x = y"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Equiv.apply_eq_iff_eq_symm_apply","end_line":300,"library":"mathlib","line":299,"location_key":"9ee2848886373efcd06ee54a089b91a2920219753e2e4f8a9b5b7890c91694f3","module":"Mathlib.Logic.Equiv.Defs","note":"Mathlib states the rule for an equivalence between two sorts, of which a permutation is the one-set case.","pair_key":"5ceb81c34cc794fbe9ccd30de555c88a21c011dced17228b3727d5c7be5a5f94","path":"Mathlib/Logic/Equiv/Defs.lean","proof_status":"proved","rank":3,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"deprecated_to":"Equiv.eq_symm_apply","elided":false,"text":"theorem Equiv.apply_eq_iff_eq_symm_apply {α : Sort u} {β : Sort v} {x : α} {y : β} (f : α ≃ β) : f x = y ↔ x = f.symm y"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f5e7ed18ceddf3b08366c01e15f6693a341fc173a4a77fa9aeafb449eec11e1a","prominence":"supporting","quote":{"exact":"Explicitly, whenever σ(x)=y one also has σ−1(y)=x."},"quote_capped":false,"section":["Neutral element and inverses"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"Explicitly, whenever σ(x)=y one also has σ−1(y)=x.","segments":[{"text":"Explicitly, whenever σ(x)=y one also has σ−1(y)=x."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"8f66a3a7444fd4d11fec81d3d6fb88c759e71fa0b3e5d211ab20141b62228965"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-24634-1352727744::In-text #5337f1d6","item":"In-text #5337f1d6","kind":"example","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Equiv.Perm.inv_eq_iff_eq","end_line":134,"library":"mathlib","line":133,"location_key":"93a5c856f4eab4e9f298f628b8d29a100baed54acd7b1424bdf5d97a987e3df5","module":"Mathlib.Algebra.Group.End","note":"This is the pointwise rule by which each value of an inverse is read off, but the five-element permutation the article writes out is defined nowhere in the universe, and assembling its inverse from the rule needs that definition and extensionality, not decidable arithmetic alone (PD8).","pair_key":"16b1c781a01b244d1e31d5cdb3a5efb02a5bc8281faa165166d44158d343c03d","path":"Mathlib/Algebra/Group/End.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Equiv.Perm.inv_eq_iff_eq {α : Type*} {f : Equiv.Perm α} {x y : α} : f⁻¹ x = y ↔ x = f y"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"cc114313c913dc6e5235b80f46d44a002ad9cb7b6158b6585b6c1a92c3bb7ac6","prominence":"supporting","quote":{"exact":"For instance ( 1 2 3 4 5 2 5 4 3"},"quote_capped":true,"section":["Neutral element and inverses"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"For instance ( 1 2 3 4 5 2 5 4 3 1 ) − 1 = ( 2 5 4 3 1 1 2 3 4 5 ) = ( 1 2 3 4 5 5 1 4 3 2 ) . {\\displaystyle {\\begin{pmatrix}1&2&3&4&5\\\\2&5&4&3&1\\end{pmatrix}}^{-1}={\\begin{pmatrix}2&5&4&3&1\\\\1&2&3&4&5\\end{pmatrix}}={\\begin{pmatrix}1&2&3&4&5\\\\5&1&4&3&2\\end{pmatrix}}.}","segments":[{"text":"For instance "},{"tex":"{\\begin{pmatrix}1&2&3&4&5\\\\2&5&4&3&1\\end{pmatrix}}^{-1}={\\begin{pmatrix}2&5&4&3&1\\\\1&2&3&4&5\\end{pmatrix}}={\\begin{pmatrix}1&2&3&4&5\\\\5&1&4&3&2\\end{pmatrix}}."}]},"unresolved":null},{"absence":null,"basis":"aa36e4124348083d671bd82a49fe65955ef5b08654491ee3d10b4f0df9651dbb","coverage":null,"id":"enwiki-24634-1352727744::In-text #cd7cfd1b","item":"In-text #cd7cfd1b","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cycle.formPerm_reverse","end_line":176,"library":"mathlib","line":173,"location_key":"aa36e4124348083d671bd82a49fe65955ef5b08654491ee3d10b4f0df9651dbb","module":"Mathlib.GroupTheory.Perm.Cycle.Concrete","note":"Mathlib reads a cycle with distinct entries as a permutation and equates the turned-round cycle's permutation with the inverse of the original's.","pair_key":"9063e6e0bdbe8f51e805d2ddb7e25f01e0c9b6b6d567a55b3d0fe8b9082a05fa","path":"Mathlib/GroupTheory/Perm/Cycle/Concrete.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cycle.formPerm_reverse {α : Type*} [DecidableEq α] (s : Cycle α) (h : s.Nodup) : s.reverse.formPerm ⋯ = (s.formPerm h)⁻¹"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"List.formPerm_reverse","end_line":250,"library":"mathlib","line":246,"location_key":"bc72abdcde6ef159cafe89afd38601573eda725e241e71ebdc7f4247fbe61492","module":"Mathlib.GroupTheory.Perm.List","note":"Mathlib states the rule for every list of labels, reaching beyond the lists with distinct entries that spell cycles.","pair_key":"613d6d162b54fe71e81d9b110e2a3e1a6a96a3085eaf14f45b1cd4ec18ca83e6","path":"Mathlib/GroupTheory/Perm/List.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem List.formPerm_reverse {α : Type*} [DecidableEq α] (l : List α) : l.reverse.formPerm = l.formPerm⁻¹"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Equiv.swap_inv","end_line":526,"library":"mathlib","line":525,"location_key":"20e0a2da501af7e8d898dbd903f40705d6cda3893426485cad57955cce915c77","module":"Mathlib.Algebra.Group.End","note":"A cycle of length two turned round is itself, and this lemma is the article's rule at that length.","pair_key":"6abfa9c749cc9f032f3d28be3e923f88fb99ae503edc3a3ae8896acfd3dc7ab1","path":"Mathlib/Algebra/Group/End.lean","proof_status":"proved","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Equiv.swap_inv {α : Type*} [DecidableEq α] (x y : α) : (Equiv.swap x y)⁻¹ = Equiv.swap x y"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"9d5663901bb623bb9969b6d1a06d52a0597d9dbfa030cf19842ff27f55dd03e2","prominence":"central","quote":{"exact":"To obtain the inverse of a single cycle, we reverse the order"},"quote_capped":true,"section":["Neutral element and inverses"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"To obtain the inverse of a single cycle, we reverse the order of its elements.","segments":[{"text":"To obtain the inverse of a single cycle, we reverse the order of its elements."}]},"unresolved":null},{"absence":null,"basis":"a8a09ea68853efb6d67b61e319a3e3a3a70389b20fe175bde9f2d3a95273ab0d","coverage":null,"id":"enwiki-24634-1352727744::In-text #507ea21a","item":"In-text #507ea21a","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cycle.formPerm_reverse","end_line":176,"library":"mathlib","line":173,"location_key":"a8a09ea68853efb6d67b61e319a3e3a3a70389b20fe175bde9f2d3a95273ab0d","module":"Mathlib.GroupTheory.Perm.Cycle.Concrete","note":"Mathlib's cycles are taken up to rotation, so the backwards reading of the example's cycle and the spelling that starts at 1 are one and the same object here.","pair_key":"c06b7d02d4fd5c598b7bc18930e544382ba4cdf43a8fd45ab74efedaf65b9853","path":"Mathlib/GroupTheory/Perm/Cycle/Concrete.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cycle.formPerm_reverse {α : Type*} [DecidableEq α] (s : Cycle α) (h : s.Nodup) : s.reverse.formPerm ⋯ = (s.formPerm h)⁻¹"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"List.formPerm_reverse","end_line":250,"library":"mathlib","line":246,"location_key":"5f08060ac2241c17aab1a7fe48424d71c47ab7fb138098ab4569bfbcf3520815","module":"Mathlib.GroupTheory.Perm.List","note":"Stated for lists rather than for cycles, so the reversed cycle comes out spelled from its last entry.","pair_key":"c8806a713c2d54d68ecd67f5a349b68f2ae257ce7b235ee495a42d3cf1ed0788","path":"Mathlib/GroupTheory/Perm/List.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem List.formPerm_reverse {α : Type*} [DecidableEq α] (l : List α) : l.reverse.formPerm = l.formPerm⁻¹"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"3667bdb8a689627aef5d71bba3c90cefed181f3f10dfffe71a7e7b8f25058fa8","prominence":"supporting","quote":{"exact":"Thus, ( 125 ) − 1 = ( 521 ) = ("},"quote_capped":true,"section":["Neutral element and inverses"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"Thus, ( 125 ) − 1 = ( 521 ) = ( 152 ) . {\\displaystyle (125)^{-1}=(521)=(152).}","segments":[{"text":"Thus, "},{"tex":"(125)^{-1}=(521)=(152)."}]},"unresolved":null},{"absence":null,"basis":"9ba44f912e8e8f9e6f9759d144a848e5d570f6127e4b60df43d494ffc6b231d3","coverage":null,"id":"enwiki-24634-1352727744::In-text #da917496","item":"In-text #da917496","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"List.prod_inv_reverse","end_line":314,"library":"mathlib","line":312,"location_key":"9ba44f912e8e8f9e6f9759d144a848e5d570f6127e4b60df43d494ffc6b231d3","module":"Mathlib.Algebra.BigOperators.Group.List.Basic","note":"Written for a list of elements of an arbitrary group, of which the permutations of the article's set are one.","pair_key":"258b8af521b0b25665bea81cf90dd5c426bad967fb094821aca1c7b84d7834cf","path":"Mathlib/Algebra/BigOperators/Group/List/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem List.prod_inv_reverse {G : Type*} [Group G] (L : List G) : L.prod⁻¹ = (List.map (fun x ↦ x⁻¹) L).reverse.prod"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"mul_inv_rev","end_line":328,"library":"mathlib","line":327,"location_key":"630e29dccecd1575957621a531e4bd4f60935d93050b15941abb96d66db77e27","module":"Mathlib.Algebra.Group.DivInvMonoid","note":"The two-factor instance of the recipe the sentence gives for a list of cycles of any length.","pair_key":"1d7d1ef322faf3188351fe10bfe7c05af8d702a503465648c939e7473d8dae5b","path":"Mathlib/Algebra/Group/DivInvMonoid.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_inv_rev {G : Type*} [DivisionMonoid G] (a b : G) : (a * b)⁻¹ = b⁻¹ * a⁻¹"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e4be0e0908e96dda3527be13f6603770c1e2985c2d5c5154bb85acc08b3bd7d9","prominence":"central","quote":{"exact":"To obtain the inverse of a product of cycles, we first reverse"},"quote_capped":true,"section":["Neutral element and inverses"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"To obtain the inverse of a product of cycles, we first reverse the order of the cycles, and then we take the inverse of each as above.","segments":[{"text":"To obtain the inverse of a product of cycles, we first reverse the order of the cycles, and then we take the inverse of each as above."}]},"unresolved":null},{"absence":null,"basis":"9b7f2f178cf188093b66f4ad7808c6b3beb7937a71235efb1048388611853c50","coverage":null,"id":"enwiki-24634-1352727744::In-text #72e141d9","item":"In-text #72e141d9","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"mul_inv_rev","end_line":328,"library":"mathlib","line":327,"location_key":"9b7f2f178cf188093b66f4ad7808c6b3beb7937a71235efb1048388611853c50","module":"Mathlib.Algebra.Group.DivInvMonoid","note":"Written for any two elements of a group, which the example's two cycles are once the ambient permutation group is fixed.","pair_key":"95a01a807f7c1207c3fd2aa9fc36706d33708e94ccd842e7bbeb12952451129f","path":"Mathlib/Algebra/Group/DivInvMonoid.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_inv_rev {G : Type*} [DivisionMonoid G] (a b : G) : (a * b)⁻¹ = b⁻¹ * a⁻¹"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cycle.formPerm_reverse","end_line":176,"library":"mathlib","line":173,"location_key":"241bf4c3b493de55f42e4975bc74d096914a1bb972c732fc2ee3e70bff8ff66c","module":"Mathlib.GroupTheory.Perm.Cycle.Concrete","note":"Covers the inversion of the three-element factor; the reordering of the two factors comes from the product rule instead.","pair_key":"b7d1da26b62391e7a141d0e7da6a278c114fa41dc3dc47a39a8517ca2dfa01c2","path":"Mathlib/GroupTheory/Perm/Cycle/Concrete.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cycle.formPerm_reverse {α : Type*} [DecidableEq α] (s : Cycle α) (h : s.Nodup) : s.reverse.formPerm ⋯ = (s.formPerm h)⁻¹"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c8b21f5957c5c692d87fefb6054178a7b19b59b94299690fb48a135196f705d0","prominence":"supporting","quote":{"exact":"Thus, [ ( 125 ) ( 34 ) ] − 1 ="},"quote_capped":true,"section":["Neutral element and inverses"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"Thus, [ ( 125 ) ( 34 ) ] − 1 = ( 34 ) − 1 ( 125 ) − 1 = ( 43 ) ( 521 ) = ( 34 ) ( 152 ) . {\\displaystyle [(125)(34)]^{-1}=(34)^{-1}(125)^{-1}=(43)(521)=(34)(152).}","segments":[{"text":"Thus, "},{"tex":"[(125)(34)]^{-1}=(34)^{-1}(125)^{-1}=(43)(521)=(34)(152)."}]},"unresolved":null},{"absence":null,"basis":"46a38df83f4e2d02f2b593c1c3da8adea9f62b9a7f95a53a8150c001bfa813a0","coverage":null,"id":"enwiki-24634-1352727744::In-text #58167500","item":"In-text #58167500","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm.permGroup","end_line":80,"library":"mathlib","line":72,"location_key":"46a38df83f4e2d02f2b593c1c3da8adea9f62b9a7f95a53a8150c001bfa813a0","module":"Mathlib.Algebra.Group.End","note":"Mathlib multiplies permutations by composing them with the right-hand factor acting first, the convention the article adopts, and the unit of the structure is the identity permutation.","pair_key":"f20252903218d3c8d99f35a72b2d83bc33ee23aae8ee4690943e2f441e409a6e","path":"Mathlib/Algebra/Group/End.lean","proof_status":"definition","rank":1,"relation":"exactMatch","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":"medium","declaration":"Equiv.Perm","end_line":95,"library":"mathlib","line":94,"location_key":"80679e31e231924444ada60c1f63df2f303c76c4305cc2606f6fa1ca6d1dff21","module":"Mathlib.Logic.Equiv.Defs","note":"Names the type of bijections of a set to itself, the carrier the sentence speaks of, while leaving the group structure to a separate declaration.","pair_key":"759cca0ed685a120657fb509c2e420994b7848d04b30255277bc05c3ecfe1abb","path":"Mathlib/Logic/Equiv/Defs.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"abbrev Equiv.Perm : Sort u_1 → Sort (max 1 u_1)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a4e66ce43b1682dd2b3669d1b3df33440d4fac68e44735292044cfed45bd223b","prominence":"central","quote":{"exact":"Having an associative product, an identity element, and inverses for all its"},"quote_capped":true,"section":["Neutral element and inverses"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"Having an associative product, an identity element, and inverses for all its elements, makes the set of all permutations of M into a group, Sym(M); a permutation group.","segments":[{"text":"Having an associative product, an identity element, and inverses for all its elements, makes the set of all permutations of M into a group, Sym(M); a permutation group."}]},"unresolved":null},{"absence":null,"basis":"18a2ce1acf3aace97ca31c191f85a2d559dd97b4074d65776a6bc7872bceb948","coverage":null,"id":"enwiki-24634-1352727744::In-text #d8e17846","item":"In-text #d8e17846","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm.one_apply","end_line":105,"library":"mathlib","line":104,"location_key":"18a2ce1acf3aace97ca31c191f85a2d559dd97b4074d65776a6bc7872bceb948","module":"Mathlib.Algebra.Group.End","note":"Written for the unit of the permutations of any type; the article writes that unit in cycle notation as a product of one-point cycles.","pair_key":"08c0c4661ce866afbceb326c4a8b63561713901f24aeab421aa86b6e4b897bcb","path":"Mathlib/Algebra/Group/End.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Equiv.Perm.one_apply {α : Type*} (x : α) : 1 x = x"},"statement":false},{"challenge":"downgraded","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"List.formPerm_singleton","end_line":59,"library":"mathlib","line":58,"location_key":"7c69ddf2150861a3520200c6ce904ca2a87c65f0657e69ed2101d3112af990ef","module":"Mathlib.GroupTheory.Perm.List","note":"Accounts for the collapse of the one-point cycles in the article's notation, not for the behaviour of the resulting permutation at each point.","pair_key":"ce7974d9deb2023bb947a58a9e89bdcc106b9489077439959c4f19d4d18fe75d","path":"Mathlib/GroupTheory/Perm/List.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem List.formPerm_singleton {α : Type*} [DecidableEq α] (x : α) : [x].formPerm = 1"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"91ac9d378757b49319378d2a1402700f3c21e73213ab67cdb6bf81a6e14829e1","prominence":"supporting","quote":{"exact":"e = (1)(2)(3)(4) = (1) This is the identity, the trivial permutation"},"quote_capped":true,"section":["Examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"before":{"layer":"Consider the following set G1 of permutations of the set M = {1, 2, 3, 4}: ","lead_in":true,"segments":[{"text":"Consider the following set G1 of permutations of the set M = {1, 2, 3, 4}: "}]},"layer":"e = (1)(2)(3)(4) = (1) This is the identity, the trivial permutation which fixes each element.","segments":[{"text":"e = (1)(2)(3)(4) = (1) This is the identity, the trivial permutation which fixes each element."}]},"unresolved":null},{"absence":null,"basis":"a418b50d14010bf7b1fe61bc2d3ce8690e836a5b01ffb1fe15bac29e4d1004a2","coverage":null,"id":"enwiki-24634-1352727744::In-text #b13e704a","item":"In-text #b13e704a","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.swap_apply_def","end_line":649,"library":"mathlib","line":648,"location_key":"a418b50d14010bf7b1fe61bc2d3ce8690e836a5b01ffb1fe15bac29e4d1004a2","module":"Mathlib.Logic.Equiv.Basic","note":"Gives the value of a transposition at every point as a two-way case split, so the untouched points fall out of its last branch.","pair_key":"be602e7136161d766cd84ceeead669181ab9cfb1fd6fba6c2a8f1d194e082bc4","path":"Mathlib/Logic/Equiv/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Equiv.swap_apply_def {α : Sort*} [DecidableEq α] (a b x : α) : (Equiv.swap a b) x = if x = a then b else if x = b then a else x"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"List.formPerm_pair","end_line":67,"library":"mathlib","line":66,"location_key":"8dfbe1bdaa1768e467f5cb16a5c46b46cd684a6b58862332f6d5e1ff7e310ee6","module":"Mathlib.GroupTheory.Perm.List","note":"Identifies the article's cycle notation with Mathlib's transposition, without saying what either does at the remaining points.","pair_key":"aeb67fc811d089890d4ca5799b06d5bb2dae566a5e2bf91e97b405f005a9f419","path":"Mathlib/GroupTheory/Perm/List.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem List.formPerm_pair {α : Type*} [DecidableEq α] (x y : α) : [x, y].formPerm = Equiv.swap x y"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.swap_apply_of_ne_of_ne","end_line":660,"library":"mathlib","line":659,"location_key":"5aedae08b5b3402b8763112980c4b8575dd53efe789c5de5ed427b74a1672930","module":"Mathlib.Logic.Equiv.Basic","note":"Covers the fixing of the two untouched points and says nothing about the exchange itself.","pair_key":"d034f0e7c2e2357d55ee795b8ef197f8dfb4979a1f7de86186669e41ea466dc5","path":"Mathlib/Logic/Equiv/Basic.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Equiv.swap_apply_of_ne_of_ne {α : Sort*} [DecidableEq α] {a b x : α} : x ≠ a → x ≠ b → (Equiv.swap a b) x = x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"787f91467f6962e11f8c2dd089def74079629ab6af3a3e2dadab5553d3ce56f1","prominence":"supporting","quote":{"exact":"a = (1 2)(3)(4) = (1 2) This permutation interchanges 1 and"},"quote_capped":true,"section":["Examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"a = (1 2)(3)(4) = (1 2) This permutation interchanges 1 and 2, and fixes 3 and 4.","segments":[{"text":"a = (1 2)(3)(4) = (1 2) This permutation interchanges 1 and 2, and fixes 3 and 4."}]},"unresolved":null},{"absence":null,"basis":"3619ce4866a68bcd4d5a3e3e2ee117a4d7bbc63afddfd09073402b9084fc951d","coverage":null,"id":"enwiki-24634-1352727744::In-text #3bc86126","item":"In-text #3bc86126","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.swap_apply_def","end_line":649,"library":"mathlib","line":648,"location_key":"3619ce4866a68bcd4d5a3e3e2ee117a4d7bbc63afddfd09073402b9084fc951d","module":"Mathlib.Logic.Equiv.Basic","note":"Gives the value of a transposition at every point as a two-way case split, so the untouched points fall out of its last branch.","pair_key":"59f8ee359d9a7a6f1c8cb0fe74c0d82c181604e17550fdb58e6cb11c0d6dbc8f","path":"Mathlib/Logic/Equiv/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Equiv.swap_apply_def {α : Sort*} [DecidableEq α] (a b x : α) : (Equiv.swap a b) x = if x = a then b else if x = b then a else x"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"List.formPerm_pair","end_line":67,"library":"mathlib","line":66,"location_key":"3b3ebe88767eb5bf00029f3a57f04943ba08b6b6a2c7d85b62db6c335ea53bd8","module":"Mathlib.GroupTheory.Perm.List","note":"Identifies the article's cycle notation with Mathlib's transposition, without saying what either does at the remaining points.","pair_key":"82bfaec44b7dffa2de0d2b3dd0e1360e1b54bd80c4ea6582158ea6438df2cfed","path":"Mathlib/GroupTheory/Perm/List.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem List.formPerm_pair {α : Type*} [DecidableEq α] (x y : α) : [x, y].formPerm = Equiv.swap x y"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.swap_apply_of_ne_of_ne","end_line":660,"library":"mathlib","line":659,"location_key":"3e441e692678a1923b5a88fbd906863bdb08d8cc4ccf4f4794fa6ff27f7efd89","module":"Mathlib.Logic.Equiv.Basic","note":"Covers the fixing of the two untouched points and says nothing about the exchange itself.","pair_key":"0340b0d6d8fb6a7d3b6f77239865ddeadfbeca67c71cc1b51cf41aca434c110b","path":"Mathlib/Logic/Equiv/Basic.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Equiv.swap_apply_of_ne_of_ne {α : Sort*} [DecidableEq α] {a b x : α} : x ≠ a → x ≠ b → (Equiv.swap a b) x = x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"9d10a88b405ced5c6b7b976dc6830271fa7a16c9b448a25c5eeede6997987092","prominence":"supporting","quote":{"exact":"b = (1)(2)(3 4) = (3 4) Like the previous one, but"},"quote_capped":true,"section":["Examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"b = (1)(2)(3 4) = (3 4) Like the previous one, but exchanging 3 and 4, and fixing the others.","segments":[{"text":"b = (1)(2)(3 4) = (3 4) Like the previous one, but exchanging 3 and 4, and fixing the others."}]},"unresolved":null},{"absence":null,"basis":"1524950d490ada928c623e0d9f3de8723b4ca929ef5af4fce883258634563100","coverage":null,"id":"enwiki-24634-1352727744::In-text #b93468cb","item":"In-text #b93468cb","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Equiv.Perm.mul_apply","end_line":102,"library":"mathlib","line":101,"location_key":"1524950d490ada928c623e0d9f3de8723b4ca929ef5af4fce883258634563100","module":"Mathlib.Algebra.Group.End","note":"States how a product of permutations acts at a point; with the example's two transpositions as the factors it yields the behaviour the sentence attributes to ab.","pair_key":"5ed784f6ecbe74345dc520e475363ba6bce29fc3df8af97f64be5922fc19aba5","path":"Mathlib/Algebra/Group/End.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Equiv.Perm.mul_apply {α : Type*} (f g : Equiv.Perm α) (x : α) : (f * g) x = f (g x)"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Equiv.swap_apply_def","end_line":649,"library":"mathlib","line":648,"location_key":"cea59c176de5c14d9bf3d5b1596589d44666d6b5ffa50ad227da0f518cce7afd","module":"Mathlib.Logic.Equiv.Basic","note":"Gives the behaviour of each of the two factors on its own, whereas the sentence speaks of the single permutation their product is.","pair_key":"5565662d964cf2cbddc5d842c68405258c2d277e9136ef428b11a21607058af0","path":"Mathlib/Logic/Equiv/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Equiv.swap_apply_def {α : Sort*} [DecidableEq α] (a b x : α) : (Equiv.swap a b) x = if x = a then b else if x = b then a else x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"37a5decc6021c381117bde09f20d9c0692e2a04a44222f27497a018c32fc9f39","prominence":"supporting","quote":{"exact":"ab = (1 2)(3 4) This permutation, which is the composition of"},"quote_capped":true,"section":["Examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"ab = (1 2)(3 4) This permutation, which is the composition of the previous two, exchanges simultaneously 1 with 2, and 3 with 4.","segments":[{"text":"ab = (1 2)(3 4) This permutation, which is the composition of the previous two, exchanges simultaneously 1 with 2, and 3 with 4."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"70b40524ef193f7137adb45a09ea327fd1397602807065fb365696771e8fb2de"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-24634-1352727744::In-text #03621331","item":"In-text #03621331","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"8dbeb2043044af99b401989887e6dd56829862fe35eaf5212606a4811172848c","prominence":"central","quote":{"exact":"G1 forms a group"},"quote_capped":false,"section":["Examples"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"after":{"layer":", since aa = bb = e, ba = ab, and abab = e.","segments":[{"text":", since aa = bb = e, ba = ab, and abab = e."}]},"layer":"G1 forms a group","segments":[{"text":"G1 forms a group"}]},"unresolved":null},{"absence":null,"basis":"328b3f64c93754dc2d1498d38d701b8c9cdb0f2ee3e07d45cc78ffc06dd17d83","coverage":null,"id":"enwiki-24634-1352727744::In-text #df860486","item":"In-text #df860486","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.swap_mul_self","end_line":530,"library":"mathlib","line":529,"location_key":"328b3f64c93754dc2d1498d38d701b8c9cdb0f2ee3e07d45cc78ffc06dd17d83","module":"Mathlib.Algebra.Group.End","note":"The declaration is stated for an arbitrary transposition of any type with decidable equality.","pair_key":"27b307a9c12e86c038456ce777f7497f0088fc7437469d8552793f8ee3e818a4","path":"Mathlib/Algebra/Group/End.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Equiv.swap_mul_self {α : Type*} [DecidableEq α] (i j : α) : Equiv.swap i j * Equiv.swap i j = 1"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Equiv.Perm.Disjoint.commute","end_line":71,"library":"mathlib","line":63,"location_key":"01f9eb02a4e4688df76669a571719c7c5867ffc5446bc7dd0ce5b4c1fb936f18","module":"Mathlib.GroupTheory.Perm.Support","note":"The hypothesis is checked point by point over the four labels, so no further result is needed.","pair_key":"55824cfccd80516405f28c58267f83b2eacc8b7c859fc2cdaaba1a13f409bea8","path":"Mathlib/GroupTheory/Perm/Support.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Equiv.Perm.Disjoint.commute {α : Type*} {f g : Equiv.Perm α} : f.Disjoint g → Commute f g"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"9f80d22b1c3d8bd49f205da21225006357a3c26385522c6b0371ecaa76be6720","prominence":"supporting","quote":{"exact":"aa = bb = e, ba = ab, and abab = e."},"quote_capped":false,"section":["Examples"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"before":{"layer":"G1 forms a group, since ","segments":[{"text":"G1 forms a group, since "}]},"layer":"aa = bb = e, ba = ab, and abab = e.","segments":[{"text":"aa = bb = e, ba = ab, and abab = e."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":4,"queries":4,"sha256":"8becb6f2586926fd749688018813316af2ea21cf2fd5c072d8ea3b72a7e0058c"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-24634-1352727744::In-text #e1c29fc2","item":"In-text #e1c29fc2","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"de3fa769c0e19f22fb13efb8ff3a8198c987d14fe5c18a12fc89e3b9ec5ec610","prominence":"central","quote":{"exact":"This permutation group is, as an abstract group, the Klein group V4."},"quote_capped":false,"section":["Examples"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"This permutation group is, as an abstract group, the Klein group V4.","segments":[{"text":"This permutation group is, as an abstract group, the Klein group V4."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"63124b5f2141ab679f69acdf0f675a9e287e8675a96b0169ce7faef783b5d9dc"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-24634-1352727744::In-text #1f33b0af","item":"In-text #1f33b0af","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"12faec4efce97826f61f78eb464d71580280212f9cc993744949ed6e5ab59112","prominence":"supporting","quote":{"exact":"As another example consider the group of symmetries of a square. Let"},"quote_capped":true,"section":["Examples"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"As another example consider the group of symmetries of a square. Let the vertices of a square be labeled 1, 2, 3 and 4 (counterclockwise around the square starting with 1 in the top left corner). The symmetries are determined by the images of the vertices, that can, in turn, be described by permutations.","segments":[{"text":"As another example consider the group of symmetries of a square. Let the vertices of a square be labeled 1, 2, 3 and 4 (counterclockwise around the square starting with 1 in the top left corner). The symmetries are determined by the images of the vertices, that can, in turn, be described by permutations."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"15000d3cf5ddb8a37328c660bc20148fa111331edd54d8e113b579cd57f0b3df"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-24634-1352727744::In-text #b24fe724","item":"In-text #b24fe724","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e279eaef19d793df0a68b2f756d4d30bd06a8f1a4b8f1149d4f3088613e7a62f","prominence":"supporting","quote":{"exact":"The rotation by 90° (counterclockwise) about the center of the square is"},"quote_capped":true,"section":["Examples"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"The rotation by 90° (counterclockwise) about the center of the square is described by the permutation (1234).","segments":[{"text":"The rotation by 90° (counterclockwise) about the center of the square is described by the permutation (1234)."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"3008dd220fd6e8987649156a48ba5c24d07e1b2d5e60c6a427d8a01d668c1501"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-24634-1352727744::In-text #bc5a49a7","item":"In-text #bc5a49a7","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"8c2318cd39d076bb389dce5e7613e5be0c16c51169d945ee832ae4ffb7e6ccb5","prominence":"supporting","quote":{"exact":"The 180° and 270° rotations are given by (13)(24) and (1432), respectively."},"quote_capped":false,"section":["Examples"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"The 180° and 270° rotations are given by (13)(24) and (1432), respectively.","segments":[{"text":"The 180° and 270° rotations are given by (13)(24) and (1432), respectively."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"635ceb5f23ae2e3ad64492c1a559b85174cafeb5108bc2fb68676562bb681a6a"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-24634-1352727744::In-text #3f4ac13d","item":"In-text #3f4ac13d","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"5c0427cd74c83bf8ce4a2ed0a1f09d4243b47e3d649d409251d74f8717b356f8","prominence":"supporting","quote":{"exact":"The reflection about the horizontal line through the center is given by"},"quote_capped":true,"section":["Examples"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"The reflection about the horizontal line through the center is given by (12)(34) and the corresponding vertical line reflection is (14)(23).","segments":[{"text":"The reflection about the horizontal line through the center is given by (12)(34) and the corresponding vertical line reflection is (14)(23)."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"97d7bad2a1e6b1595115dc18e2091fef6c743ed77b02c351bb4cd6fd6f554d3e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-24634-1352727744::In-text #027a4f05","item":"In-text #027a4f05","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e9e45ea532ba2fdeb6cef2c86b2abdd4f418d8c9ed5822d0fa0fba47ccf04607","prominence":"supporting","quote":{"exact":"The reflection about the 1,3−diagonal line is (24) and reflection about the"},"quote_capped":true,"section":["Examples"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"The reflection about the 1,3−diagonal line is (24) and reflection about the 2,4−diagonal is (13).","segments":[{"text":"The reflection about the 1,3−diagonal line is (24) and reflection about the 2,4−diagonal is (13)."}]},"unresolved":null},{"absence":null,"basis":"58338406b5be3ab760e21004f473f2a89c44c58a9545f17a43af5aa2d5e26650","coverage":null,"id":"enwiki-24634-1352727744::In-text #78e8d5f0","item":"In-text #78e8d5f0","kind":"theorem","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.mem_referenceSubgroup_four_two_iff","end_line":228,"library":"tauceti","line":205,"location_key":"58338406b5be3ab760e21004f473f2a89c44c58a9545f17a43af5aa2d5e26650","module":"TauCeti.GroupTheory.Perm.TransitiveGroupLabel.Basic","note":"Lean numbers the vertices from zero where the article numbers them from one, and the criterion says a permutation belongs exactly when it commutes with the half turn, which pins the membership of the group elementwise.","pair_key":"fe04c6e2551c61a4b83fe04941b3476eb525a10b8fa391e3b8bfdff6c6823cd9","path":"TauCeti/GroupTheory/Perm/TransitiveGroupLabel/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.mem_referenceSubgroup_four_two_iff {σ : Equiv.Perm (Fin 4)} : σ ∈ TauCeti.referenceSubgroup 4 ⟨2, TauCeti.referenceSubgroup_four_two._proof_1⟩ ↔ ∀ (i : Fin 4), σ (i + 2) = σ i + 2"},"statement":false},{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.natCard_referenceSubgroup_four_two","end_line":220,"library":"tauceti","line":216,"location_key":"1e89cd38dbfe3777041c6d20793ab75ee5efd7eefdd2c7ec19ceba7082496bd3","module":"TauCeti.GroupTheory.Perm.TransitiveGroupLabel.Classification","note":"It counts the symmetries of the square as eight but names none of them, so on its own it does not say which permutation completes the list.","pair_key":"a58040a00d1f81f09f3da30bb625846e2de27ae5ac59eb1cda31e83c54458619","path":"TauCeti/GroupTheory/Perm/TransitiveGroupLabel/Classification.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.natCard_referenceSubgroup_four_two : Nat.card ↥(TauCeti.referenceSubgroup 4 ⟨2, TauCeti.natCard_referenceSubgroup_four_two._proof_1⟩) = 8"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"830ea7a08f94264a9e38856e53cd019b2e7303f661f36dd2fead3985864a194f","prominence":"supporting","quote":{"exact":"The only remaining symmetry is the identity (1)(2)(3)(4)."},"quote_capped":false,"section":["Examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"The only remaining symmetry is the identity (1)(2)(3)(4).","segments":[{"text":"The only remaining symmetry is the identity (1)(2)(3)(4)."}]},"unresolved":null},{"absence":null,"basis":"118c7488df63c5eaa0bdfc8fe097c50c93e1d589f02e642f6880368d503d425a","coverage":null,"id":"enwiki-24634-1352727744::In-text #4d6b2881","item":"In-text #4d6b2881","kind":"theorem","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.referenceSubgroupFourTwoMulEquivDihedralGroup","end_line":85,"library":"tauceti","line":41,"location_key":"118c7488df63c5eaa0bdfc8fe097c50c93e1d589f02e642f6880368d503d425a","module":"TauCeti.GroupTheory.Perm.TransitiveGroupLabel.Dihedral","note":"The library indexes the dihedral family by the number of corners of the polygon, so its DihedralGroup 4 is the eight-element group the article names by its order, and a companion lemma sends the quarter turn to a rotation of that family.","pair_key":"746a8693891927d64b1cfc82343504e50a81427ea63fc40f09491aafa3d9ee42","path":"TauCeti/GroupTheory/Perm/TransitiveGroupLabel/Dihedral.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def TauCeti.referenceSubgroupFourTwoMulEquivDihedralGroup : ↥(TauCeti.referenceSubgroup 4 ⟨2, TauCeti.referenceSubgroupFourTwoMulEquivDihedralGroup._proof_1⟩) ≃* DihedralGroup 4"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"DihedralGroup.nat_card","end_line":162,"library":"mathlib","line":159,"location_key":"70c1c6a72df56ad7e55f7b0731cdf5ce2b5704661a955d3807345531bd8116c6","module":"Mathlib.GroupTheory.SpecificGroups.Dihedral","note":"It gives the size of the dihedral family as twice the index, which is what makes the target group here the one of order eight, but it asserts nothing about the square.","pair_key":"e0fa1999f5fc6874758e611c57df66aa1ffc0087652b1c52e305b5d72a9c1557","path":"Mathlib/GroupTheory/SpecificGroups/Dihedral.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem DihedralGroup.nat_card {n : ℕ} : Nat.card (DihedralGroup n) = 2 * n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"cfa79800dde52405d141e7764e7ac7eef248150a03b41eb2aaad840a6d21972e","prominence":"central","quote":{"exact":"This permutation group is known, as an abstract group, as the dihedral"},"quote_capped":true,"section":["Examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"This permutation group is known, as an abstract group, as the dihedral group of order 8.","segments":[{"text":"This permutation group is known, as an abstract group, as the dihedral group of order 8."}]},"unresolved":null},{"absence":null,"basis":"7b979ffd1b2f529a09abb865d3061aa0bcb272a16318fa1bb2ed7b13c140edb9","coverage":null,"id":"enwiki-24634-1352727744::In-text #4f0f7e41","item":"In-text #4f0f7e41","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"MulAction","end_line":135,"library":"mathlib","line":133,"location_key":"7b979ffd1b2f529a09abb865d3061aa0bcb272a16318fa1bb2ed7b13c140edb9","module":"Mathlib.Algebra.Group.Action.Defs","note":"Lean carries the action as a curried scalar multiplication bundled together with its two axioms, and it allows the acting structure to be a monoid and the acted-on type to be empty, where the article fixes a group and a nonempty set.","pair_key":"4919704b1151ae509fc6d301638e1e1dcf5eccd0e73e533b8f71d28697e2b008","path":"Mathlib/Algebra/Group/Action/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class MulAction (α : Type u_9) : Type u_10 → [Monoid α] → Type (max u_10 u_9)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"03536fad0c78c839a06f6e0d699a7385211120220da79ecae756d4ba32235275","prominence":"central","quote":{"exact":"Let G be a group and M a nonempty set. An action"},"quote_capped":true,"section":["Group actions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"Let G be a group and M a nonempty set. An action of G on M is a function f: G × M → M such that","segments":[{"text":"Let G be a group and M a nonempty set. An action of G on M is a function f: G × M → M such that"}]},"unresolved":null},{"absence":null,"basis":"ce07ce162ac33d7452d2b5246c13cd82aa5b7ccb541da5481e4862e7f424b868","coverage":{"basis":false,"bundle_key":"e22610a36e1f84ca1f93cf5de9127d5349ada81d292583294647d5d077f6d2c6","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"d6d76e239fa59778f4a41e14b512042a5eef142539ef43c66658934078f7c742","text":"the identity element of the group leaves every point of the set where it is"},{"id":"c2","part":"fe3f936a128d55de487aeaf79537a903559a30eab15a9d8cf7979c1ddb973c54","text":"acting by h and then by g is the same as acting by the product gh"}],"parts":["d6d76e239fa59778f4a41e14b512042a5eef142539ef43c66658934078f7c742","fe3f936a128d55de487aeaf79537a903559a30eab15a9d8cf7979c1ddb973c54"],"relation":"broadMatch","status":"formalized"},"id":"enwiki-24634-1352727744::In-text #892f081d","item":"In-text #892f081d","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MulAction","end_line":135,"library":"mathlib","line":133,"location_key":"ce07ce162ac33d7452d2b5246c13cd82aa5b7ccb541da5481e4862e7f424b868","module":"Mathlib.Algebra.Group.Action.Defs","note":"The class states the two conditions for a monoid acting on an arbitrary type, where the article imposes them on a group acting on a nonempty set, and it bundles the map in curried form with its proofs.","pair_key":"9b76726066109586f16ec3f6afb2ae9c103566f8f88d3f011161916f760ac30a","path":"Mathlib/Algebra/Group/Action/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class MulAction (α : Type u_9) : Type u_10 → [Monoid α] → Type (max u_10 u_9)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"one_smul","end_line":416,"library":"mathlib","line":416,"location_key":"d6d76e239fa59778f4a41e14b512042a5eef142539ef43c66658934078f7c742","module":"Mathlib.Algebra.Group.Action.Defs","note":"The equation is stated for a monoid acting on an arbitrary type, which covers a group acting on a nonempty set.","pair_key":"1c9d35f920be0662ec258589df3c7ffc32f16dcac75e760055bc529cb6b40bf3","path":"Mathlib/Algebra/Group/Action/Defs.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem one_smul (M : Type*) {α : Type*} [Monoid M] [MulAction M α] (b : α) : 1 • b = b"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"smul_smul","end_line":411,"library":"mathlib","line":411,"location_key":"fe3f936a128d55de487aeaf79537a903559a30eab15a9d8cf7979c1ddb973c54","module":"Mathlib.Algebra.Group.Action.Defs","note":"The equation is stated for a monoid acting on an arbitrary type and is written with the iterated action on the left.","pair_key":"2a6567df4ecb28ad16d38b30f40d2c48d76a48202c070c07d131acebb0450b3d","path":"Mathlib/Algebra/Group/Action/Defs.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem smul_smul {M : Type*} {α : Type*} [Monoid M] [MulAction M α] (a₁ a₂ : M) (b : α) : a₁ • a₂ • b = (a₁ * a₂) • b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"703d11ef048fd33d55430c5812e9bb8a8c409c54208f88e49b64235d8e40774c","prominence":"central","quote":{"exact":"f(1, x) = x, for all x in M (1 is the"},"quote_capped":true,"section":["Group actions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"before":{"layer":"An action of G on M is a function f: G × M → M such that ","lead_in":true,"segments":[{"text":"An action of G on M is a function f: G × M → M such that "}]},"layer":"f(1, x) = x, for all x in M (1 is the identity (neutral) element of the group G), and f(g, f(h, x)) = f(gh, x), for all g,h in G and all x in M.","segments":[{"text":"f(1, x) = x, for all x in M (1 is the identity (neutral) element of the group G), and f(g, f(h, x)) = f(gh, x), for all g,h in G and all x in M."}]},"unresolved":null},{"absence":null,"basis":"0aa656723e477235db660ecbb1732b10b76eb3c5d09631a86f1f9c6fbc777e6d","coverage":null,"id":"enwiki-24634-1352727744::In-text #c8ff9548","item":"In-text #c8ff9548","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"MulAction.toPermHom","end_line":187,"library":"mathlib","line":184,"location_key":"0aa656723e477235db660ecbb1732b10b76eb3c5d09631a86f1f9c6fbc777e6d","module":"Mathlib.Algebra.Group.Action.End","note":"It builds the homomorphism out of an action but does not state the converse passage from a homomorphism back to an action, so it gives one direction of the stated equivalence.","pair_key":"4effd53f1d486a809eb7b7591233a78630e9f79636ca27191570a241f8b21744","path":"Mathlib/Algebra/Group/Action/End.lean","proof_status":"definition","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def MulAction.toPermHom (G : Type*) (α : Type*) [Group G] [MulAction G α] : G →* Equiv.Perm α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MulAction.compHom","end_line":50,"library":"mathlib","line":47,"location_key":"78e5bef03534fb1fb884d1ab9f8d8a4b41f8dba91274a10b177fe7f69352e485","module":"Mathlib.Algebra.Group.Action.Hom","note":"It turns a homomorphism into an action by composing with an existing action, here the action of the permutations of M on M, and says nothing about the other direction.","pair_key":"87d36cefb97ff5c7ee5f6a15c1c40e94173d4838699256ad9066ba5d085addf4","path":"Mathlib/Algebra/Group/Action/Hom.lean","proof_status":"definition","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"abbrev MulAction.compHom {M : Type*} {N : Type*} (α : Type*) [Monoid M] [MulAction M α] [Monoid N] : (N →* M) → MulAction N α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"MulAction.compHom_smul_def","end_line":62,"library":"mathlib","line":59,"location_key":"9dda4fd15667ed009880959e8771164417f0c1e4e43925e83f79898ae2372a45","module":"Mathlib.Algebra.Group.Action.Hom","note":"It records how the action built from a homomorphism acts, which supports the converse direction without itself asserting the equivalence.","pair_key":"97d20a17c719fe0abf645747e46fe11486ed8ccf116dff9a7f4086d30b906501","path":"Mathlib/Algebra/Group/Action/Hom.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem MulAction.compHom_smul_def {E : Type*} {F : Type*} {G : Type*} [Monoid E] [Monoid F] [MulAction F G] (f : E →* F) (a : E) (x : G) : a • x = f a • x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"ee3d28e23c512f80c8ae344edb289fcc53ff181f2fff7617662cafd3e339ab26","prominence":"central","quote":{"exact":"This pair of conditions can also be expressed as saying that the"},"quote_capped":true,"section":["Group actions"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"This pair of conditions can also be expressed as saying that the action induces a group homomorphism from G into Sym(M).[12]","segments":[{"text":"This pair of conditions can also be expressed as saying that the action induces a group homomorphism from G into Sym(M)."},{"ref":"[12]"}]},"unresolved":null},{"absence":null,"basis":"07d455c981b7c1f5c761a99fda7ae0b517a1eef2ddbe15c5a9bf454b184ef02a","coverage":null,"id":"enwiki-24634-1352727744::In-text #9bf3d316","item":"In-text #9bf3d316","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MonoidHom","end_line":367,"library":"mathlib","line":366,"location_key":"07d455c981b7c1f5c761a99fda7ae0b517a1eef2ddbe15c5a9bf454b184ef02a","module":"Mathlib.Algebra.Group.Hom.Defs","note":"Lean has one type of homomorphism for monoids and groups alike, defined over arbitrary source and target, where the article fixes the source to be a group and the target to be the permutations of a set.","pair_key":"42e1ffdd5cd234a7ac9d7638d5bdfcefd95c875d8c9c246cb392fcd59728e0b3","path":"Mathlib/Algebra/Group/Hom/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure MonoidHom (M : Type*) (N : Type*) [MulOne M] [MulOne N]"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"Equiv.permutationRepresentation","end_line":72,"library":"tauceti","line":71,"location_key":"dd969f95312a6f66a2efc244f6c9ec21ddd4cfc2cdd1bf7cbd1f247ba24b2217","module":"TauCeti.Algebra.GroupAction.PermutationRepresentation","note":"It names the notion the sentence defines but only constructs it for a finite point set read through a listing and only from an action, rather than for an arbitrary homomorphism.","pair_key":"153d9886aaa2ccb11459498ff4065f2f71ca328de888783049f541feeedfec0b","path":"TauCeti/Algebra/GroupAction/PermutationRepresentation.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def Equiv.permutationRepresentation {G : Type*} {α : Type*} [Group G] [MulAction G α] {n : ℕ} : α ≃ Fin n → G →* Equiv.Perm (Fin n)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"MulAction.toPermHom","end_line":187,"library":"mathlib","line":184,"location_key":"22fda1ded516303b7eeb1fc618c9fab53df12e42185b75c0288da6ae66c44fee","module":"Mathlib.Algebra.Group.Action.End","note":"It produces one homomorphism of the kind the sentence names, but it defines a construction from an action rather than the notion itself.","pair_key":"763f069b9b9e2ffba4a61a5f0454f1c2196d8653cea121a8e04f1b379e0cae53","path":"Mathlib/Algebra/Group/Action/End.lean","proof_status":"definition","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def MulAction.toPermHom (G : Type*) (α : Type*) [Group G] [MulAction G α] : G →* Equiv.Perm α"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"4184ff417bef29467b5538c034f6f027491a51862b09ca7306a938160c873de2","prominence":"central","quote":{"exact":"Any such homomorphism is called a (permutation) representation of G on M."},"quote_capped":false,"section":["Group actions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"Any such homomorphism is called a (permutation) representation of G on M.","segments":[{"text":"Any such homomorphism is called a (permutation) representation of G on M."}]},"unresolved":null},{"absence":null,"basis":"ebd9a0480d67f9e51400f9d34a16ccb07e85dd4a521a5cd997c4715a95b3b709","coverage":null,"id":"enwiki-24634-1352727744::In-text #ee9e88dd","item":"In-text #ee9e88dd","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Subgroup.instMulActionSubtypeMem","end_line":32,"library":"mathlib","line":32,"location_key":"ebd9a0480d67f9e51400f9d34a16ccb07e85dd4a521a5cd997c4715a95b3b709","module":"Mathlib.Algebra.Group.Subgroup.Actions","note":"This is the instance Lean's resolution reaches for a subgroup of the permutations of M, sitting on top of the tautological action of all permutations on M, and it is stated for a subgroup of an arbitrary acting group.","pair_key":"e09e5027e6bcb59cab9ae2f2a3c84d99d2cc3d559de6394f97c55cca95a6f3d3","path":"Mathlib/Algebra/Group/Subgroup/Actions.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Subgroup.instMulActionSubtypeMem {G : Type*} {α : Type*} [Group G] [MulAction G α] {S : Subgroup G} : MulAction (↥S) α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm.applyMulAction","end_line":87,"library":"mathlib","line":84,"location_key":"39d7d4d832ec81f2cff601d29519276d743475da2d6673ac2d013cdcb9ffe7fc","module":"Mathlib.Algebra.Group.Action.End","note":"It supplies the natural action for the largest permutation group only; the action of a smaller permutation group is obtained from it by restriction.","pair_key":"4e29cabea2c4464e81c49dc7231ab1899ed842946b15bbd534936d0545bc1d03","path":"Mathlib/Algebra/Group/Action/End.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Equiv.Perm.applyMulAction (α : Type*) : MulAction (Equiv.Perm α) α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm.smul_def","end_line":90,"library":"mathlib","line":90,"location_key":"f2dedf307db86def75b1f8c1f1585adf2a00bc699226e7e0efb7e3f4ebeb7a67","module":"Mathlib.Algebra.Group.Action.End","note":"It states the defining formula of that action for the full group of permutations rather than for an arbitrary permutation group.","pair_key":"29efc31dc6c6df7eb1884908946aa584869f2c9e0f9cf654deb2d82b8e200bfe","path":"Mathlib/Algebra/Group/Action/End.lean","proof_status":"proved","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Equiv.Perm.smul_def {α : Type*} (f : Equiv.Perm α) (a : α) : f • a = f a"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"80e23dd74f94af0773994dd1088f22fc5bde0f180c51605b17ec074afce45b65","prominence":"central","quote":{"exact":"For any permutation group, the action that sends (g, x) → g(x)"},"quote_capped":true,"section":["Group actions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"For any permutation group, the action that sends (g, x) → g(x) is called the natural action of G on M.","segments":[{"text":"For any permutation group, the action that sends (g, x) → g(x) is called the natural action of G on M."}]},"unresolved":null},{"absence":null,"basis":"3be27bd61c996d6e88719cf8d10dbe7a0bc54fe243d4079143b7458fba2cb1a6","coverage":null,"id":"enwiki-24634-1352727744::In-text #814b03f8","item":"In-text #814b03f8","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Subgroup.instMulActionSubtypeMem","end_line":32,"library":"mathlib","line":32,"location_key":"3be27bd61c996d6e88719cf8d10dbe7a0bc54fe243d4079143b7458fba2cb1a6","module":"Mathlib.Algebra.Group.Subgroup.Actions","note":"In the library the symmetries of the square are a subgroup of the permutations of the four vertices, so the action spoken of in the example is the restricted one this instance provides, with no further identification required.","pair_key":"2b6656799fe93cd55f37cf37b8f7d8596feda778650b39ca78ecc15a2bf0a20e","path":"Mathlib/Algebra/Group/Subgroup/Actions.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Subgroup.instMulActionSubtypeMem {G : Type*} {α : Type*} [Group G] [MulAction G α] {S : Subgroup G} : MulAction (↥S) α"},"statement":false},{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.referenceSubgroup_four_two","end_line":200,"library":"tauceti","line":197,"location_key":"e66c1a809b91434ad560c9fa484a3d329dfee3676c4e3513e536d9653d1868ab","module":"TauCeti.GroupTheory.Perm.TransitiveGroupLabel.Basic","note":"It identifies the square's symmetry group as the subgroup of permutations of the four vertices generated by the quarter turn and a diagonal swap, but it says nothing about an action.","pair_key":"cd6584772710511e8f7518e9a46d07e3ad528c67118e6ec518c606710a966234","path":"TauCeti/GroupTheory/Perm/TransitiveGroupLabel/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.referenceSubgroup_four_two : TauCeti.referenceSubgroup 4 ⟨2, TauCeti.referenceSubgroup_four_two._proof_1⟩ = Subgroup.closure {finRotate 4, Equiv.swap 0 2}"},"statement":false},{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.TransitiveGroupLabel.isPretransitive","end_line":396,"library":"tauceti","line":379,"location_key":"e28a1e79f974631205da797e5bc1d311908f199494db7dec4acf570b1d3e6437","module":"TauCeti.GroupTheory.Perm.TransitiveGroupLabel.Basic","note":"It states transitivity of the action of a labelled permutation subgroup on the points, using the same restricted action, so it is a theorem about that action rather than the example's identification.","pair_key":"6fa4bb5c1dc99a148a940ba1eeb2665b0208f26f3b95b35ec7bba18e49a2371f","path":"TauCeti/GroupTheory/Perm/TransitiveGroupLabel/Basic.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.TransitiveGroupLabel.isPretransitive {n : ℕ} {j : TauCeti.TransitiveGroupIndex n} {G : Subgroup (Equiv.Perm (Fin n))} : TauCeti.TransitiveGroupLabel j G → MulAction.IsPretransitive (↥G) (Fin n)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7c3bd78869549806304d97a8c79363dcfe8921dfda4f1e2270ad6a8be357e2e2","prominence":"supporting","quote":{"exact":"In the example of the symmetry group of the square, the group's"},"quote_capped":true,"section":["Group actions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"In the example of the symmetry group of the square, the group's action on the set of vertices is the natural action.","segments":[{"text":"In the example of the symmetry group of the square, the group's action on the set of vertices is the natural action."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"b65040485544ad0e2ebafa997ef11bfe38cc0109ad0461429bb50d3c8b2e838a"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-24634-1352727744::In-text #3ee139ed","item":"In-text #3ee139ed","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"91fd7ec9739a3cd423606ecf1ad89333bcae5e3606d8644cd3de7ce1a30dfa46","prominence":"supporting","quote":{"exact":"However, this group also induces an action on the set of four"},"quote_capped":true,"section":["Group actions"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"However, this group also induces an action on the set of four triangles in the square, which are: t1 = 234, t2 = 134, t3 = 124 and t4 = 123.","segments":[{"text":"However, this group also induces an action on the set of four triangles in the square, which are: t1 = 234, t2 = 134, t3 = 124 and t4 = 123."}]},"unresolved":null},{"absence":null,"basis":"12400adce8d8768bd6fce3c1d9ca7c165d62c908227eaabe112ad3fdb7217bcf","coverage":null,"id":"enwiki-24634-1352727744::In-text #d0388620","item":"In-text #d0388620","kind":"theorem","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.mem_referenceSubgroup_four_two_iff","end_line":228,"library":"tauceti","line":205,"location_key":"12400adce8d8768bd6fce3c1d9ca7c165d62c908227eaabe112ad3fdb7217bcf","module":"TauCeti.GroupTheory.Perm.TransitiveGroupLabel.Basic","note":"Lean writes the pairing of opposite vertices as commuting with the shift by two, and gives both directions of the membership criterion, which is more than the passage asks for.","pair_key":"87512e2e382a968ee56150dc67d9b4f5d996d5c6d87e703ebcfcfa64b703b08d","path":"TauCeti/GroupTheory/Perm/TransitiveGroupLabel/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.mem_referenceSubgroup_four_two_iff {σ : Equiv.Perm (Fin 4)} : σ ∈ TauCeti.referenceSubgroup 4 ⟨2, TauCeti.referenceSubgroup_four_two._proof_1⟩ ↔ ∀ (i : Fin 4), σ (i + 2) = σ i + 2"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"85e043cdf0cbef66f716dbc22c943ed8a5a2122a6161a73dfa5c0f1c69fc2a3c","prominence":"supporting","quote":{"exact":"It also acts on the two diagonals: d1 = 13 and d2"},"quote_capped":true,"section":["Group actions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"It also acts on the two diagonals: d1 = 13 and d2 = 24.","segments":[{"text":"It also acts on the two diagonals: d1 = 13 and d2 = 24."}]},"unresolved":null},{"absence":null,"basis":"746af94d032dfaf2dbcbb516f948bc5ac3f380a79c4408588d701aeaccdaf74a","coverage":null,"id":"enwiki-24634-1352727744::In-text #183b2ca6","item":"In-text #183b2ca6","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"MulAction.IsPretransitive","end_line":62,"library":"mathlib","line":60,"location_key":"746af94d032dfaf2dbcbb516f948bc5ac3f380a79c4408588d701aeaccdaf74a","module":"Mathlib.Algebra.Group.Action.Pretransitive","note":"Lean states the condition for an arbitrary scalar action, which is more general than a group acting on a set, and it leaves the carrier possibly empty just as the passage's condition does.","pair_key":"d6443147b68eba0c4214924d842b32e06ae61156f7205fcab3232d1533f959e6","path":"Mathlib/Algebra/Group/Action/Pretransitive.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class MulAction.IsPretransitive (M : Type*) (α : Type*) [SMul M α] : Prop"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"29671da3d09b64cbbee89bc6590f197d7ae2de94c4c6f8b09c4c47a4911aa716","prominence":"central","quote":{"exact":"The action of a group G on a set M is said"},"quote_capped":true,"section":["Transitive actions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"The action of a group G on a set M is said to be transitive if, for every two elements s, t of M, there is some group element g such that g(s) = t.","segments":[{"text":"The action of a group G on a set M is said to be transitive if, for every two elements s, t of M, there is some group element g such that g(s) = t."}]},"unresolved":null},{"absence":null,"basis":"73018ee5052b9e8301491cefbab7836ed56852338dd542a851fb3bdf745caa8a","coverage":null,"id":"enwiki-24634-1352727744::In-text #2d607a5e","item":"In-text #2d607a5e","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"MulAction.isPretransitive_iff_orbit_eq_univ","end_line":59,"library":"mathlib","line":54,"location_key":"73018ee5052b9e8301491cefbab7836ed56852338dd542a851fb3bdf745caa8a","module":"Mathlib.GroupTheory.GroupAction.Transitive","note":"Lean encodes 'M is one orbit' as the orbit of an arbitrarily chosen point filling the whole carrier.","pair_key":"eb1b7564e6d938e4f7ca6ecf03c4b59cea0805aedd4c77728b50bbd880e0a039","path":"Mathlib/GroupTheory/GroupAction/Transitive.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem MulAction.isPretransitive_iff_orbit_eq_univ {G : Type*} {X : Type*} [Group G] [MulAction G X] (a : X) : MulAction.IsPretransitive G X ↔ MulAction.orbit G a = Set.univ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"0fca2984626b6e9c3337d388e2d384387f742b0912e6966f1cb1b79f8a9e57f7","prominence":"central","quote":{"exact":"Equivalently, the set M forms a single orbit under the action of"},"quote_capped":true,"section":["Transitive actions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"Equivalently, the set M forms a single orbit under the action of G.[13]","segments":[{"text":"Equivalently, the set M forms a single orbit under the action of G."},{"ref":"[13]"}]},"unresolved":null},{"absence":null,"basis":"7af503bdef88b6bbb601d06a13571a5a014de276921b71febc3bae056c6f0487","coverage":null,"id":"enwiki-24634-1352727744::In-text #d4d320e8","item":"In-text #d4d320e8","kind":"example","locations":[{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.isPretransitive_referenceSubgroup","end_line":344,"library":"tauceti","line":315,"location_key":"7af503bdef88b6bbb601d06a13571a5a014de276921b71febc3bae056c6f0487","module":"TauCeti.GroupTheory.Perm.TransitiveGroupLabel.Basic","note":"Lean proves this for every reference subgroup of degree at most five, the square's symmetry group being the one labelled 4T3.","pair_key":"06773f642467f1909ab25cda361ff6d7f1b36254fdce5f3aaac3ecfce7fe8849","path":"TauCeti/GroupTheory/Perm/TransitiveGroupLabel/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.isPretransitive_referenceSubgroup (n : ℕ) (j : TauCeti.TransitiveGroupIndex n) : MulAction.IsPretransitive (↥(TauCeti.referenceSubgroup n j)) (Fin n)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d6f80c875db64aac17671301d33db77de7b34d1679eb4787ebe63a9952b2a54a","prominence":"supporting","quote":{"exact":"Of the examples above, the group {e, (1 2), (3 4), (1"},"quote_capped":true,"section":["Transitive actions"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"before":{"layer":"Equivalently, the set M forms a single orbit under the action of G.[13] ","segments":[{"text":"Equivalently, the set M forms a single orbit under the action of G."},{"ref":"[13]"},{"text":" "}]},"layer":"Of the examples above, the group {e, (1 2), (3 4), (1 2)(3 4)} of permutations of {1, 2, 3, 4} is not transitive (no group element takes 1 to 3) but the group of symmetries of a square is transitive on the vertices.","segments":[{"text":"Of the examples above, the group {e, (1 2), (3 4), (1 2)(3 4)} of permutations of {1, 2, 3, 4} is not transitive (no group element takes 1 to 3) but the group of symmetries of a square is transitive on the vertices."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"444d0acd6b0628d5c3a629247b77f3cd1a5cd03ddc6df0f2e594a6a7b4e31b53"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-24634-1352727744::In-text #2cf8fc60","item":"In-text #2cf8fc60","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"7c9ddb63eab5d35bc9872f3b4db7c17c0c3aca02ac4522eacc0a5f66748df6e8","prominence":"central","quote":{"exact":"A permutation group G acting transitively on a non-empty finite set M"},"quote_capped":true,"section":["Transitive actions","Primitive actions"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"A permutation group G acting transitively on a non-empty finite set M is imprimitive if there is some nontrivial set partition of M that is preserved by the action of G, where \"nontrivial\" means that the partition isn't the partition into singleton sets nor the partition with only one part.","segments":[{"text":"A permutation group G acting transitively on a non-empty finite set M is imprimitive if there is some nontrivial set partition of M that is preserved by the action of G, where \"nontrivial\" means that the partition isn't the partition into singleton sets nor the partition with only one part."}]},"unresolved":null},{"absence":null,"basis":"f9f6c4ad855989507759d57ee664f7862e23e75da51f2bc88e1345d54f50554e","coverage":null,"id":"enwiki-24634-1352727744::In-text #3e014e39","item":"In-text #3e014e39","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"MulAction.IsPreprimitive","end_line":95,"library":"mathlib","line":92,"location_key":"f9f6c4ad855989507759d57ee664f7862e23e75da51f2bc88e1345d54f50554e","module":"Mathlib.GroupTheory.GroupAction.Primitive","note":"Lean defines this for an arbitrary scalar action rather than for a permutation group, which is more general, and records the condition through blocks, a block being a cell of an invariant partition.","pair_key":"0c156dafd0067a87b56a0b31be39a6ac60e80b36c2d584c4e021e6660062a446","path":"Mathlib/GroupTheory/GroupAction/Primitive.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class MulAction.IsPreprimitive (G : Type*) (X : Type*) [SMul G X] : Prop"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"4a953cb32fe9a203c7a8cf8dc8e0b4ed4f7a1bb4cf25b9073f1ff7e29f38383f","prominence":"central","quote":{"exact":"Otherwise, if G is transitive but does not preserve any nontrivial partition"},"quote_capped":true,"section":["Transitive actions","Primitive actions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"Otherwise, if G is transitive but does not preserve any nontrivial partition of M, the group G is primitive.","segments":[{"text":"Otherwise, if G is transitive but does not preserve any nontrivial partition of M, the group G is primitive."}]},"unresolved":null},{"absence":null,"basis":"a4b628a0b7e5d4ddecdc41b3a4416e2df21a18ee26db63fcade33d770ecf04fe","coverage":null,"id":"enwiki-24634-1352727744::In-text #966fb101","item":"In-text #966fb101","kind":"theorem","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.mem_referenceSubgroup_four_two_iff","end_line":228,"library":"tauceti","line":205,"location_key":"a4b628a0b7e5d4ddecdc41b3a4416e2df21a18ee26db63fcade33d770ecf04fe","module":"TauCeti.GroupTheory.Perm.TransitiveGroupLabel.Basic","note":"Lean writes the pairing of opposite vertices as commuting with the shift by two and proves both directions of the membership criterion, which is more than the passage claims.","pair_key":"a6a3a4946a1d7cea8a74ce53950f80a187d17625cb22498eda5e32a52dfcaa67","path":"TauCeti/GroupTheory/Perm/TransitiveGroupLabel/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.mem_referenceSubgroup_four_two_iff {σ : Equiv.Perm (Fin 4)} : σ ∈ TauCeti.referenceSubgroup 4 ⟨2, TauCeti.referenceSubgroup_four_two._proof_1⟩ ↔ ∀ (i : Fin 4), σ (i + 2) = σ i + 2"},"statement":false},{"challenge":"downgraded","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.not_isPreprimitive_referenceSubgroup_four_two","end_line":68,"library":"tauceti","line":65,"location_key":"09085f5056f06e87b3ed059f1a0a2503ce77b3ee797babcdead6ab693f6db2a0","module":"TauCeti.GroupTheory.Perm.TransitiveGroupLabel.Primitive","note":"Lean names the square's symmetry group as the reference subgroup labelled 4T3 of the permutations of four points and records the article's property as the failure of its primitivity class, whose blocks are the cells of an invariant partition.","pair_key":"69d26b4775a54c398a0065a1c9cfb7da0d64e16eb19befdd5b6aa6a895e9c955","path":"TauCeti/GroupTheory/Perm/TransitiveGroupLabel/Primitive.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.not_isPreprimitive_referenceSubgroup_four_two : ¬MulAction.IsPreprimitive (↥(TauCeti.referenceSubgroup 4 ⟨2, TauCeti.not_isPreprimitive_referenceSubgroup_four_two._proof_1⟩)) (Fin 4)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"22089d58f3af9f364cf2d95593025c0c94a3104fab4efeaec2811005a77eb8ff","prominence":"supporting","quote":{"exact":"For example, the group of symmetries of a square is imprimitive on"},"quote_capped":true,"section":["Transitive actions","Primitive actions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"For example, the group of symmetries of a square is imprimitive on the vertices: if they are numbered 1, 2, 3, 4 in cyclic order, then the partition {{1, 3}, {2, 4}} into opposite pairs is preserved by every group element.","segments":[{"text":"For example, the group of symmetries of a square is imprimitive on the vertices: if they are numbered 1, 2, 3, 4 in cyclic order, then the partition {{1, 3}, {2, 4}} into opposite pairs is preserved by every group element."}]},"unresolved":null},{"absence":null,"basis":"b7e26ce4a1d634b40e2bd6c455ffbb81119bd8d6d1556095f143899f8ced00b8","coverage":null,"id":"enwiki-24634-1352727744::In-text #edfe34eb","item":"In-text #edfe34eb","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm.instIsPreprimitive","end_line":528,"library":"mathlib","line":527,"location_key":"b7e26ce4a1d634b40e2bd6c455ffbb81119bd8d6d1556095f143899f8ced00b8","module":"Mathlib.GroupTheory.GroupAction.MultipleTransitivity","note":"Lean phrases primitivity as a pretransitive action whose only blocks are the trivial ones, which is the block form of the article's condition that no nontrivial partition of M is preserved; the instance also covers infinite M, where the article defines primitivity only for a finite nonempty set.","pair_key":"7fafde8758676f7139bdd4fde0bd2b351dde628f951417430a57a309a6a17b54","path":"Mathlib/GroupTheory/GroupAction/MultipleTransitivity.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Equiv.Perm.instIsPreprimitive {α : Type*} : MulAction.IsPreprimitive (Equiv.Perm α) α"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c1acd41735a98469a42954090d6242b4fef6298572f80d27187cb02bc27f2059","prominence":"central","quote":{"exact":"On the other hand, the full symmetric group on a set M"},"quote_capped":true,"section":["Transitive actions","Primitive actions"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"On the other hand, the full symmetric group on a set M is always primitive.","segments":[{"text":"On the other hand, the full symmetric group on a set M is always primitive."}]},"unresolved":null},{"absence":null,"basis":"7e90ff88aa13576446c6bb509703bfe6d18e000fc78a1a206a6cddd2667272f9","coverage":null,"id":"enwiki-24634-1352727744::In-text #1918d5f3","item":"In-text #1918d5f3","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Monoid.toMulAction","end_line":470,"library":"mathlib","line":467,"location_key":"7e90ff88aa13576446c6bb509703bfe6d18e000fc78a1a206a6cddd2667272f9","module":"Mathlib.Algebra.Group.Action.Defs","note":"Lean registers this for any monoid; at the passage's group it supplies the self-action by multiplication, one of the actions of G on its own underlying set that the passage announces.","pair_key":"ed0d739b13a5dd6337adc58ecef074c7091f43c034004567024ebaf5ecc8dec7","path":"Mathlib/Algebra/Group/Action/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Monoid.toMulAction (M : Type*) [Monoid M] : MulAction M M"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b336df7afab29fc08ea20fbf21a06ecd1926763cd628c20b213e6799efd2657a","prominence":"supporting","quote":{"exact":"Any group G can act on itself (the elements of the group"},"quote_capped":true,"section":["Cayley's theorem"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"Any group G can act on itself (the elements of the group being thought of as the set M) in many ways.","segments":[{"text":"Any group G can act on itself (the elements of the group being thought of as the set M) in many ways."}]},"unresolved":null},{"absence":null,"basis":"55f5cdcb0fc5fa36e6b7cc3bd706536a97d37cb4523deddb7330331aabe2ebdc","coverage":null,"id":"enwiki-24634-1352727744::In-text #007a9b66","item":"In-text #007a9b66","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Group.instTorsor","end_line":88,"library":"mathlib","line":85,"location_key":"55f5cdcb0fc5fa36e6b7cc3bd706536a97d37cb4523deddb7330331aabe2ebdc","module":"Mathlib.Algebra.Torsor.Defs","note":"Lean records a free and transitive action as a torsor structure, which carries the division operation of the action alongside the action itself; here the acting group and the acted-on set are both G, acting by multiplication.","pair_key":"8401917ebc888353a3b0f312df8abc3445333290b156eaf3d64ab6a0326e7a7b","path":"Mathlib/Algebra/Torsor/Defs.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Group.instTorsor (G : Type*) [Group G] : Torsor G G"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Monoid.toMulAction","end_line":470,"library":"mathlib","line":467,"location_key":"8bc61230944bfb5ee1b59d11ab7469a080e3c6a342a770680fec62f504ebbe23","module":"Mathlib.Algebra.Group.Action.Defs","note":"Lean's own docstring names this the regular action of a monoid on itself by left multiplication, so it is the object the passage defines, registered for any monoid.","pair_key":"8dcff12e2d829224e10b5850ca65db1fceb9ed807146c3e195322ff3a03bcc52","path":"Mathlib/Algebra/Group/Action/Defs.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Monoid.toMulAction (M : Type*) [Monoid M] : MulAction M M"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"MulAction.Regular.isPretransitive","end_line":83,"library":"mathlib","line":82,"location_key":"232b6af528e7eeb1a7073436bf132fb5fc84cd87e31ddaa05ca750e20b6ccc0e","module":"Mathlib.Algebra.Group.Action.Pretransitive","note":"It states transitivity of the left regular action only, and says nothing about the freeness that regularity also requires.","pair_key":"7db7754f696d14dcc0e7f8c04514d55e5aa3fab8770a0afe1049a729d1051d62","path":"Mathlib/Algebra/Group/Action/Pretransitive.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance MulAction.Regular.isPretransitive {G : Type*} [Group G] : MulAction.IsPretransitive G G"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"cac3e5968fe88de4b712f6462646e4e718865e465d5671dfc8d2084404b83364","prominence":"central","quote":{"exact":"In particular, there is a regular action given by (left) multiplication in"},"quote_capped":true,"section":["Cayley's theorem"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"In particular, there is a regular action given by (left) multiplication in the group.","segments":[{"text":"In particular, there is a regular action given by (left) multiplication in the group."}]},"unresolved":null},{"absence":null,"basis":"a74b4150c05881be923ab0d74c7f912a9b3a372ede2a012794954a9630c09ce1","coverage":null,"id":"enwiki-24634-1352727744::In-text #00d34457","item":"In-text #00d34457","kind":"definition","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"smul_eq_mul","end_line":72,"library":"mathlib","line":72,"location_key":"b0a6eaf42a62edd666fec2585b761a4152bd01b58755a8332a30799205282477","module":"Mathlib.Algebra.Group.Action.Defs","note":"Lean writes the regular action with the scalar dot, and this lemma unfolds g • x to the group product g * x, which is the passage's f(g, x) = gx.","pair_key":"740e1c308fbb81309bf2674f21a6cbab6bcc4f9ee5b6baca7d256a7b5a23982a","path":"Mathlib/Algebra/Group/Action/Defs.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem smul_eq_mul {α : Type*} [Mul α] (a b : α) : a • b = a * b"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Monoid.toMulAction","end_line":470,"library":"mathlib","line":467,"location_key":"a74b4150c05881be923ab0d74c7f912a9b3a372ede2a012794954a9630c09ce1","module":"Mathlib.Algebra.Group.Action.Defs","note":"This is the action the passage is describing, defined in Lean for any monoid with the scalar product given by the multiplication.","pair_key":"cf6d284d740449007352f36776f19877b9ef6ae5a0eca11177e9e65e166425a2","path":"Mathlib/Algebra/Group/Action/Defs.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Monoid.toMulAction (M : Type*) [Monoid M] : MulAction M M"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"634d782b067edfe81341ced00e64258e83f7ff2a76235e8b03624856a29c5ce8","prominence":"supporting","quote":{"exact":"That is, f(g, x) = gx for all g and x in"},"quote_capped":true,"section":["Cayley's theorem"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"That is, f(g, x) = gx for all g and x in G.","segments":[{"text":"That is, f(g, x) = gx for all g and x in G."}]},"unresolved":null},{"absence":null,"basis":"68cb977200fcd6c20632a01fdc43fe38f02bad0458cbe57e050097f92f389c50","coverage":null,"id":"enwiki-24634-1352727744::In-text #269f72ee","item":"In-text #269f72ee","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Group.mulLeft_bijective","end_line":116,"library":"mathlib","line":115,"location_key":"68cb977200fcd6c20632a01fdc43fe38f02bad0458cbe57e050097f92f389c50","module":"Mathlib.Algebra.Group.Units.Equiv","note":"A bijection of G onto itself is a permutation of the set of elements of G, which is the second half of the passage's sentence.","pair_key":"fbc4151c683f50a4ade4854e1f2febcd9f1125ccc19104cfbe28ec43827a09da","path":"Mathlib/Algebra/Group/Units/Equiv.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Group.mulLeft_bijective {G : Type*} [Group G] (a : G) : Function.Bijective fun x ↦ a * x"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.mulLeft","end_line":98,"library":"mathlib","line":97,"location_key":"41bc1691d45b77e70bad1692165e8dabb57871a6992860c27fa4ea6c6d031163","module":"Mathlib.Algebra.Group.Units.Equiv","note":"Lean delivers the bijection as a permutation of G bundled with its inverse map and the two round-trip proofs, which is packaging of the same bijection; its docstring says left multiplication in a group is a permutation of the underlying type.","pair_key":"263a81e0955a0119623544c385b933867811d8439d5d24cdb7ab08cae343c9bb","path":"Mathlib/Algebra/Group/Units/Equiv.lean","proof_status":"definition","rank":2,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Equiv.mulLeft {G : Type*} [Group G] : G → Equiv.Perm G"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"9cc5c3df12a540c5c1eb1dc5cedd771c8b93be6c4e31fe949aa02734d20f56b2","prominence":"central","quote":{"exact":"For each fixed g, the function fg(x) = gx is a bijection"},"quote_capped":true,"section":["Cayley's theorem"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"before":{"layer":"That is, f(g, x) = gx for all g and x in G. ","segments":[{"text":"That is, f(g, x) = gx for all g and x in G. "}]},"layer":"For each fixed g, the function fg(x) = gx is a bijection on G and therefore a permutation of the set of elements of G.","segments":[{"text":"For each fixed g, the function fg(x) = gx is a bijection on G and therefore a permutation of the set of elements of G."}]},"unresolved":null},{"absence":null,"basis":"c6268c53b55eb2fa814b7d162b7f298fc57598217efc7934fa382896fed9577c","coverage":null,"id":"enwiki-24634-1352727744::In-text #6420c980","item":"In-text #6420c980","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.mulLeft","end_line":98,"library":"mathlib","line":97,"location_key":"c6268c53b55eb2fa814b7d162b7f298fc57598217efc7934fa382896fed9577c","module":"Mathlib.Algebra.Group.Units.Equiv","note":"Lean's map takes an element of G and returns a permutation of G, the bijection x ↦ gx bundled with its inverse; its docstring says left multiplication in a group is a permutation of the underlying type.","pair_key":"862288ba62909d920e0d3eaf2b197db381b901d9fbddd3e6d7a68cee41dab38f","path":"Mathlib/Algebra/Group/Units/Equiv.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Equiv.mulLeft {G : Type*} [Group G] : G → Equiv.Perm G"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"MulAction.toPermHom","end_line":187,"library":"mathlib","line":184,"location_key":"011b267285ead4252cae58ee6a6f15ca1be89ead80382a305a24d344b6451908","module":"Mathlib.Algebra.Group.Action.End","note":"Lean's map is defined for an arbitrary action and asserts in addition that the assignment is a monoid homomorphism, which is structure beyond what the passage claims here.","pair_key":"2b635633efda355bc436d3aef6fc498e33a58ec03f3ac75c0ca43562ba2a22cd","path":"Mathlib/Algebra/Group/Action/End.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def MulAction.toPermHom (G : Type*) (α : Type*) [Group G] [MulAction G α] : G →* Equiv.Perm α"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"41ad54e9e952b5d696277c565a920c6412da1de8082b9c043555b566118e4bc7","prominence":"supporting","quote":{"exact":"Each element of G can be thought of as a permutation in"},"quote_capped":true,"section":["Cayley's theorem"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"after":{"layer":" and so G is isomorphic to a permutation group; this is the content of Cayley's theorem.","segments":[{"text":" and so G is isomorphic to a permutation group; this is the content of Cayley's theorem."}]},"before":{"layer":"That is, f(g, x) = gx for all g and x in G. For each fixed g, the function fg(x) = gx is a bijection on G and therefore a permutation of the set of elements of G. ","segments":[{"text":"That is, f(g, x) = gx for all g and x in G. For each fixed g, the function fg(x) = gx is a bijection on G and therefore a permutation of the set of elements of G. "}]},"layer":"Each element of G can be thought of as a permutation in this way","segments":[{"text":"Each element of G can be thought of as a permutation in this way"}]},"unresolved":null},{"absence":null,"basis":"512bd0cf60319e313ddfaca4124eac463da21d6a32be76869f917a8d0505e046","coverage":null,"id":"enwiki-24634-1352727744::In-text #d66bbb6b","item":"In-text #d66bbb6b","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Equiv.Perm.subgroupOfMulAction","end_line":74,"library":"mathlib","line":72,"location_key":"512bd0cf60319e313ddfaca4124eac463da21d6a32be76869f917a8d0505e046","module":"Mathlib.GroupTheory.Perm.Subgroup","note":"Lean states Cayley's theorem for an arbitrary faithful action of G, and its docstring records that taking the acted-on set to be G recovers the usual statement; the image is a subgroup of the symmetric group of G, that is, a permutation group.","pair_key":"dd4b820a7139a441b618f0d75dab7f63e275cafd18dde673587cf482e7c9cf21","path":"Mathlib/GroupTheory/Perm/Subgroup.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Equiv.Perm.subgroupOfMulAction (G : Type*) (H : Type*) [Group G] [MulAction G H] [FaithfulSMul G H] : G ≃* ↥(MulAction.toPermHom G H).range"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"Equiv.permutationRepresentation_injective","end_line":87,"library":"tauceti","line":85,"location_key":"6adc8c446ecb77924cf2da0ec9d734bad9afe94d9c018cd262c69bdc5d99de2f","module":"TauCeti.Algebra.GroupAction.PermutationRepresentation","note":"It gives injectivity of the representation only; turning that into an isomorphism of G with its image needs a further theorem, and it also forces a finite numbering the passage does not impose.","pair_key":"cad51e413fc252aacd2d29f12ca09604c0bb2abdeda74164a5fc1e4de1dc2015","path":"TauCeti/Algebra/GroupAction/PermutationRepresentation.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem Equiv.permutationRepresentation_injective {G : Type*} {α : Type*} [Group G] [MulAction G α] {n : ℕ} [FaithfulSMul G α] (e : α ≃ Fin n) : Function.Injective ⇑e.permutationRepresentation"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"43443f652dd677fd0e73dad23cc6910d80f0391aa36b407edb3c69bef584b581","prominence":"central","quote":{"exact":"G is isomorphic to a permutation group"},"quote_capped":false,"section":["Cayley's theorem"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"after":{"layer":"; this is the content of Cayley's theorem.","segments":[{"text":"; this is the content of Cayley's theorem."}]},"before":{"layer":"That is, f(g, x) = gx for all g and x in G. For each fixed g, the function fg(x) = gx is a bijection on G and therefore a permutation of the set of elements of G. Each element of G can be thought of as a permutation in this way and so ","segments":[{"text":"That is, f(g, x) = gx for all g and x in G. For each fixed g, the function fg(x) = gx is a bijection on G and therefore a permutation of the set of elements of G. Each element of G can be thought of as a permutation in this way and so "}]},"layer":"G is isomorphic to a permutation group","segments":[{"text":"G is isomorphic to a permutation group"}]},"unresolved":null},{"absence":null,"basis":"64652a52a77a73447806aaac695529bef6ce52805c93f91f31b84a0161aa4764","coverage":null,"id":"enwiki-24634-1352727744::In-text #5032cfe7","item":"In-text #5032cfe7","kind":"example","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"MulAction.toPerm_one","end_line":196,"library":"mathlib","line":194,"location_key":"64652a52a77a73447806aaac695529bef6ce52805c93f91f31b84a0161aa4764","module":"Mathlib.Algebra.Group.Action.End","note":"Lean states this for every group action; at the passage's action of G1 on itself it is the line for the identity element.","pair_key":"ea1f3c85cd271349d57819bbdd2474f55470cef4f8d05736da0320f2f8c67b60","path":"Mathlib/Algebra/Group/Action/End.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem MulAction.toPerm_one (G : Type*) (α : Type*) [Group G] [MulAction G α] : MulAction.toPerm 1 = 1"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"IsKleinFour.eq_mul_of_ne_all","end_line":129,"library":"mathlib","line":124,"location_key":"e3bb1a88afe008f2d8ccbfa599f6391786a37a6d07afa5dcb305fe8f8c2eb6d4","module":"Mathlib.GroupTheory.SpecificGroups.KleinFour","note":"It pins down the products among a, b and c but says nothing about the exchange of the identity with the multiplier, so it states only a part of each of those three lines.","pair_key":"5246a5170b2efd951997283dd5e7a54658edd3505d20be1e3dfb5e114156a9c4","path":"Mathlib/GroupTheory/SpecificGroups/KleinFour.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem IsKleinFour.eq_mul_of_ne_all {G : Type*} [Group G] [IsKleinFour G] {x y z : G} : x ≠ 1 → y ≠ 1 → x ≠ y → z ≠ 1 → z ≠ x → z ≠ y → z = x * y"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"IsKleinFour.mul_self","end_line":112,"library":"mathlib","line":111,"location_key":"f03e10e8636d161928cf2e8c9d686169c8b6b018c2cf99679c55d14cc8ebccf5","module":"Mathlib.GroupTheory.SpecificGroups.KleinFour","note":"It gives x·x = e, one half of the exchange of the identity with the multiplier, and reaches any of the three lines only together with the unit law.","pair_key":"6b1fc1aa64ec2e233a752badface5f82ed090ec61fa2108e0e2f27cd20434a9f","path":"Mathlib/GroupTheory/SpecificGroups/KleinFour.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem IsKleinFour.mul_self {G : Type*} [Group G] [IsKleinFour G] (x : G) : x * x = 1"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2da0ca40dc6baab9a91607ed29bc996172919b9ae286ee17f6798dfd52904573","prominence":"supporting","quote":{"exact":"For example, consider the group G1 acting on the set {1, 2,"},"quote_capped":true,"section":["Cayley's theorem"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"For example, consider the group G1 acting on the set {1, 2, 3, 4} given above. Let the elements of this group be denoted by e, a, b and c = ab = ba. The action of G1 on itself described in Cayley's theorem gives the following permutation representation: fe ↦ (e)(a)(b)(c) fa ↦ (ea)(bc) fb ↦ (eb)(ac) fc ↦ (ec)(ab).","segments":[{"text":"For example, consider the group G1 acting on the set {1, 2, 3, 4} given above. Let the elements of this group be denoted by e, a, b and c = ab = ba. The action of G1 on itself described in Cayley's theorem gives the following permutation representation: fe ↦ (e)(a)(b)(c) fa ↦ (ea)(bc) fb ↦ (eb)(ac) fc ↦ (ec)(ab)."}]},"unresolved":null},{"absence":null,"basis":"7540b5ce789f8df9a3d68076d1679c28d9eb3ed680d22b290b02f52db1b4b2a9","coverage":null,"id":"enwiki-24634-1352727744::In-text #53c6f5bd","item":"In-text #53c6f5bd","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Action.mkIso","end_line":161,"library":"mathlib","line":154,"location_key":"7540b5ce789f8df9a3d68076d1679c28d9eb3ed680d22b290b02f52db1b4b2a9","module":"Mathlib.CategoryTheory.Action.Basic","note":"The library carries no notion that lets the two acting groups differ by an isomorphism, so this covers only the case of one group acting on both sets.","pair_key":"83afebda6fb20d244ea1e4e028ab7c03f2925aa11a91e61b0f9e2770b2c400e2","path":"Mathlib/CategoryTheory/Action/Basic.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Action.mkIso {V : Type*} [CategoryTheory.Category V] {G : Type*} [Monoid G] {M N : Action V G} (f : M.V ≅ N.V) : autoParam (∀ (g : G), CategoryTheory.CategoryStruct.comp (M.ρ g).asHom f.hom = CategoryTheory.CategoryStruct.comp f.hom (N.ρ g).asHom) Action.mkIso._auto_1 → (M ≅ N)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"MulActionHom","end_line":88,"library":"mathlib","line":84,"location_key":"5bde3f078fc86a731c4ce85b27787fcfc9873c5b8c999d83c50a0604625eef4e","module":"Mathlib.GroupTheory.GroupAction.Hom","note":"It bundles a map satisfying the compatibility equation, but it requires neither that the map be a bijection nor that the map between the acting monoids be an isomorphism of groups.","pair_key":"3510a38c5df493dd136a7242dd910963217008b224a8028b1615b9bc7a8fd975","path":"Mathlib/GroupTheory/GroupAction/Hom.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure MulActionHom {M : Type*} {N : Type*} : (M → N) → (X : Type u_5) → [SMul M X] → (Y : Type u_6) → [SMul N Y] → Type (max u_5 u_6)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6d4de1e9c77334c19a4ccc9438e0c1c0925be6164622dad5e2c0e24433c79456","prominence":"central","quote":{"exact":"If G and H are two permutation groups on sets X and"},"quote_capped":true,"section":["Isomorphisms of permutation groups"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"If G and H are two permutation groups on sets X and Y with actions f1 and f2 respectively, then we say that G and H are permutation isomorphic (or isomorphic as permutation groups) if there exists a bijective map λ : X → Y and a group isomorphism ψ : G → H such that","segments":[{"text":"If G and H are two permutation groups on sets X and Y with actions f1 and f2 respectively, then we say that G and H are permutation isomorphic (or isomorphic as permutation groups) if there exists a bijective map λ : X → Y and a group isomorphism ψ : G → H such that"}]},"unresolved":null},{"absence":null,"basis":"bd2eabf64d992301acd7c5d5c6866443eec77a93cdeaa4903ddd3d2035b61853","coverage":null,"id":"enwiki-24634-1352727744::In-text #41799430","item":"In-text #41799430","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"MulActionHom","end_line":88,"library":"mathlib","line":84,"location_key":"bd2eabf64d992301acd7c5d5c6866443eec77a93cdeaa4903ddd3d2035b61853","module":"Mathlib.GroupTheory.GroupAction.Hom","note":"The library states the requirement for an arbitrary map between the two acting monoids, which covers the article's case where that map is an isomorphism of groups.","pair_key":"a8ed2cb3cd777ebd19937d6edaa86210ed68e2c4e07615cb748c046c3efbd157","path":"Mathlib/GroupTheory/GroupAction/Hom.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure MulActionHom {M : Type*} {N : Type*} : (M → N) → (X : Type u_5) → [SMul M X] → (Y : Type u_6) → [SMul N Y] → Type (max u_5 u_6)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MulActionSemiHomClass","end_line":129,"library":"mathlib","line":125,"location_key":"81b732ec724240ebc71e3f1f903bae564685384c85a5e646e9831eb1511c4876","module":"Mathlib.GroupTheory.GroupAction.Hom","note":"This is the predicate form of the same requirement, stated for any type of morphisms carrying it.","pair_key":"2ca2e7d062b03a004430508776a894be37714fb691bd81d39ae3a69b8b30894e","path":"Mathlib/GroupTheory/GroupAction/Hom.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class MulActionSemiHomClass (F : Type*) {M : outParam (Type*)} {N : outParam (Type*)} : outParam (M → N) → (X : outParam (Type*)) → (Y : outParam (Type*)) → [SMul M X] → [SMul N Y] → [FunLike F X Y] → Prop"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"MulActionHom.map_smul","end_line":195,"library":"mathlib","line":194,"location_key":"229f425cc76272bd7c656cc3a6d301fcbe301f23385d7c7eac38c0c523f6385b","module":"Mathlib.GroupTheory.GroupAction.Hom","note":"It fixes the transporting map to be the identity, so it covers only the sub-case where the two groups are the same.","pair_key":"c11307914dccc987d08c4b749b73f980fed1af08a2d1e30600732d2f4b15a8aa","path":"Mathlib/GroupTheory/GroupAction/Hom.lean","proof_status":"proved","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem MulActionHom.map_smul {M' : Type*} {X : Type*} [SMul M' X] {Y : Type*} [SMul M' Y] (f : X →ₑ[id] Y) (m : M') (x : X) : f (m • x) = m • f x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"031a3aaa714b3cd92f3d5bce99f9290f70247a99ddea87cf48591b25853b1068","prominence":"supporting","quote":{"exact":"λ(f1(g, x)) = f2(ψ(g), λ(x)) for all g in G and x"},"quote_capped":true,"section":["Isomorphisms of permutation groups"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"before":{"layer":"If G and H are two permutation groups on sets X and Y with actions f1 and f2 respectively, then we say that G and H are permutation isomorphic (or isomorphic as permutation groups) if there exists a bijective map λ : X → Y and a group isomorphism ψ : G → H such that ","lead_in":true,"segments":[{"text":"If G and H are two permutation groups on sets X and Y with actions f1 and f2 respectively, then we say that G and H are permutation isomorphic (or isomorphic as permutation groups) if there exists a bijective map λ : X → Y and a group isomorphism ψ : G → H such that "}]},"layer":"λ(f1(g, x)) = f2(ψ(g), λ(x)) for all g in G and x in X.","segments":[{"text":"λ(f1(g, x)) = f2(ψ(g), λ(x)) for all g in G and x in X."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"328946b5296b4c2e227d87677386a6cc4b0c176f0215d0806cc4f3bb9265872e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-24634-1352727744::In-text #382cd829","item":"In-text #382cd829","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"ff2d2f142f9d4eae466e6e9e8bba3cbfc62e475705b0019b6baaa7ad9c00acb8","prominence":"central","quote":{"exact":"If X = Y this is equivalent to G and H being"},"quote_capped":true,"section":["Isomorphisms of permutation groups"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"If X = Y this is equivalent to G and H being conjugate as subgroups of Sym(X).[15]","segments":[{"text":"If X = Y this is equivalent to G and H being conjugate as subgroups of Sym(X)."},{"ref":"[15]"}]},"unresolved":null},{"absence":null,"basis":"78c165739f2b7ecf5d8a6a1d41cc6a5cd1657cb87a75481632cce8ca9c5f11ff","coverage":null,"id":"enwiki-24634-1352727744::In-text #21211c53","item":"In-text #21211c53","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Action.mkIso","end_line":161,"library":"mathlib","line":154,"location_key":"78c165739f2b7ecf5d8a6a1d41cc6a5cd1657cb87a75481632cce8ca9c5f11ff","module":"Mathlib.CategoryTheory.Action.Basic","note":"The library states this for an arbitrary ambient category, so it also covers linear representations, while at types it is the article's notion.","pair_key":"eeed11cb5cb6743ef34b070e6fb725a78926f7de5b36b62fd05043320e8fec6e","path":"Mathlib/CategoryTheory/Action/Basic.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Action.mkIso {V : Type*} [CategoryTheory.Category V] {G : Type*} [Monoid G] {M N : Action V G} (f : M.V ≅ N.V) : autoParam (∀ (g : G), CategoryTheory.CategoryStruct.comp (M.ρ g).asHom f.hom = CategoryTheory.CategoryStruct.comp f.hom (N.ρ g).asHom) Action.mkIso._auto_1 → (M ≅ N)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"MulActionHom.map_smul","end_line":195,"library":"mathlib","line":194,"location_key":"7f675266cae3686f4333bd94d2579b1db968ff04cf41d3f3446fc6656a784530","module":"Mathlib.GroupTheory.GroupAction.Hom","note":"It records the compatibility equation for a map that is not required to be a bijection, so it does not carry the sameness of the two actions.","pair_key":"6d09a03899867bb9eb541b7d4b7e3dfd941b8e6cb677d376f802a894f4146e60","path":"Mathlib/GroupTheory/GroupAction/Hom.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem MulActionHom.map_smul {M' : Type*} {X : Type*} [SMul M' X] {Y : Type*} [SMul M' Y] (f : X →ₑ[id] Y) (m : M') (x : X) : f (m • x) = m • f x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2e242847d4df7069168dfdc2157f261cca0b1fa6569fea95ae30876a7288fcc5","prominence":"central","quote":{"exact":"The special case where G = H and ψ is the identity"},"quote_capped":true,"section":["Isomorphisms of permutation groups"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"The special case where G = H and ψ is the identity map gives rise to the concept of equivalent actions of a group.","segments":[{"text":"The special case where G = H and ψ is the identity map gives rise to the concept of equivalent actions of a group."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"abe1b7ba1fc9baf16e0ba9a75c989dbe37d86d28a839204fca839dab9e0d7f37"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-24634-1352727744::In-text #1209344a","item":"In-text #1209344a","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"7b9014b3c2acd15585d889a40d8c88521cb34b152358e7e76057663e55f3d075","prominence":"supporting","quote":{"exact":"In the example of the symmetries of a square given above, the"},"quote_capped":true,"section":["Isomorphisms of permutation groups"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"In the example of the symmetries of a square given above, the natural action on the set {1,2,3,4} is equivalent to the action on the triangles.","segments":[{"text":"In the example of the symmetries of a square given above, the natural action on the set {1,2,3,4} is equivalent to the action on the triangles."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"9a783f438db2724ccdea8efb78a9126601af24228f1e6cbe6ac6d0e364bba311"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-24634-1352727744::In-text #b97ffe4b","item":"In-text #b97ffe4b","kind":"construction","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"bca8d975b19932e65102f9746b3ce2caac9f774e4ab59501936476712bb3e3a1","prominence":"supporting","quote":{"exact":"The bijection λ between the sets is given by i ↦ ti."},"quote_capped":false,"section":["Isomorphisms of permutation groups"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"The bijection λ between the sets is given by i ↦ ti.","segments":[{"text":"The bijection λ between the sets is given by i ↦ ti."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"df02de76ab7c8b5f4d8b2f59ea4a28633115d7675a5b4e7033ef0145d74a724e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-24634-1352727744::In-text #9f9b34f8","item":"In-text #9f9b34f8","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"6e65601cf99624deaf996d78578739aeaf4323a5b860d95cfcb2366069bde86d","prominence":"supporting","quote":{"exact":"The natural action of group G1 above and its action on itself"},"quote_capped":true,"section":["Isomorphisms of permutation groups"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"The natural action of group G1 above and its action on itself (via left multiplication) are not equivalent as the natural action has fixed points and the second action does not.","segments":[{"text":"The natural action of group G1 above and its action on itself (via left multiplication) are not equivalent as the natural action has fixed points and the second action does not."}]},"unresolved":null},{"absence":null,"basis":"46d16d8e82842626b36cdf8584c22d9be493fc3c520b0855ad1a696593a1a5e9","coverage":null,"id":"enwiki-24634-1352727744::In-text #f2887cb5","item":"In-text #f2887cb5","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Pi.mulAction","end_line":100,"library":"mathlib","line":98,"location_key":"46d16d8e82842626b36cdf8584c22d9be493fc3c520b0855ad1a696593a1a5e9","module":"Mathlib.Algebra.Group.Action.Pi","note":"The library builds the action on an arbitrary indexed product of possibly different factors, which covers the n-fold product of one set.","pair_key":"51074df929b54d5914d47e2a58dbb07a03e15ade5618d947d0d4210d553abc2c","path":"Mathlib/Algebra/Group/Action/Pi.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Pi.mulAction {ι : Type*} {α : ι → Type*} (M : Type*) {m : Monoid M} [(i : ι) → MulAction M (α i)] : MulAction M ((i : ι) → α i)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Pi.smul_apply","end_line":134,"library":"mathlib","line":134,"location_key":"40363f06e2a6381856833329f0cd57318f87c3a68011d9e79fee81b5ce3b051a","module":"Mathlib.Algebra.Notation.Pi.Defs","note":"This gives the defining formula of the product action for an arbitrary index type and family of factors.","pair_key":"a54b531538c8b6d40354c7070ec299b333fdc356e6ebdbab5c39083259c21aa5","path":"Mathlib/Algebra/Notation/Pi/Defs.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Pi.smul_apply {ι : Type*} {α : Type*} {M : ι → Type*} [(i : ι) → SMul α (M i)] (a : α) (f : (i : ι) → M i) (i : ι) : (a • f) i = a • f i"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Action.diagonal","end_line":100,"library":"mathlib","line":99,"location_key":"2e3d05e637f24cb0e897451bc768005533b477f023a2eacad01b08226d66c9a9","module":"Mathlib.CategoryTheory.Action.Concrete","note":"It fixes the factor to be the group itself, so it covers only that instance of the construction.","pair_key":"dc847c39eed2cca537419c047af845a86a3108ec92a99a437e715029b6b87b5b","path":"Mathlib/CategoryTheory/Action/Concrete.lean","proof_status":"definition","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"abbrev Action.diagonal (G : Type u) [Monoid G] : ℕ → Action (Type u) G"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"440b7951f4cf2581bf87df18c7f4ccd44ea470efd98b15a88d63940debed9949","prominence":"central","quote":{"exact":"When a group G acts on a set S, the action may"},"quote_capped":true,"section":["Oligomorphic groups"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"When a group G acts on a set S, the action may be extended naturally to the Cartesian product Sn of S, consisting of n-tuples of elements of S: the action of an element g on the n-tuple (s1, ..., sn) is given by","segments":[{"text":"When a group G acts on a set S, the action may be extended naturally to the Cartesian product Sn of S, consisting of n-tuples of elements of S: the action of an element g on the n-tuple (s1, ..., sn) is given by"}]},"unresolved":null},{"absence":null,"basis":"3e201050e710ee36b4f0b5cffc8f16ab8a0cc2f4ee6f1b45b8de543ace3eeba0","coverage":null,"id":"enwiki-24634-1352727744::In-text #3987e0a6","item":"In-text #3987e0a6","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Pi.mulAction","end_line":100,"library":"mathlib","line":98,"location_key":"3e201050e710ee36b4f0b5cffc8f16ab8a0cc2f4ee6f1b45b8de543ace3eeba0","module":"Mathlib.Algebra.Group.Action.Pi","note":"Lean builds the action on an arbitrary dependent product over an arbitrary index type, so the n-fold power of one set is the constant-fibre case over Fin n.","pair_key":"a7f6d9026ae91e2928f5e2bc54c85bb2f6975b7f1bc43e5b72a4739bf883420a","path":"Mathlib/Algebra/Group/Action/Pi.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Pi.mulAction {ι : Type*} {α : ι → Type*} (M : Type*) {m : Monoid M} [(i : ι) → MulAction M (α i)] : MulAction M ((i : ι) → α i)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Pi.instSMul","end_line":131,"library":"mathlib","line":131,"location_key":"1079c7d7c9201c8f62ba367010971c7c0b8b5f1658ad0cbb668a7b20a2837ada","module":"Mathlib.Algebra.Notation.Pi.Defs","note":"This is the underlying coordinatewise scalar multiplication on a dependent product, stated for any index type rather than for a fixed tuple length.","pair_key":"ffdc044625f0103d3c8f854885595fe789e9b6ba5ed5d7b3282a49ae9588c2f5","path":"Mathlib/Algebra/Notation/Pi/Defs.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Pi.instSMul {ι : Type*} {α : Type*} {M : ι → Type*} [(i : ι) → SMul α (M i)] : SMul α ((i : ι) → M i)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Pi.smul_apply","end_line":134,"library":"mathlib","line":134,"location_key":"a8c4037d11015e6e673554764ff9f9967dd2cea2576a8d9d48396c68ea070ad5","module":"Mathlib.Algebra.Notation.Pi.Defs","note":"Lean records the coordinate equation for an arbitrary index type and dependent fibres, and the passage's tuple identity is its reading at index Fin n with constant fibre S.","pair_key":"f9abb96487b4b8901fc20326c2ab762a48a4b7b15591ae92fd1c67c7bc28637f","path":"Mathlib/Algebra/Notation/Pi/Defs.lean","proof_status":"proved","rank":3,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Pi.smul_apply {ι : Type*} {α : Type*} {M : ι → Type*} [(i : ι) → SMul α (M i)] (a : α) (f : (i : ι) → M i) (i : ι) : (a • f) i = a • f i"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Action.diagonal","end_line":100,"library":"mathlib","line":99,"location_key":"c4c0cdc9ae5d1756ff897aad3a1bd5448a692d93da8bbc6a068e6c3f85328777","module":"Mathlib.CategoryTheory.Action.Concrete","note":"The acted-on set is fixed to be the group itself with its regular action, where the passage allows any set S.","pair_key":"6efc708a395a1f6a3b09685df59977d8691ed7525f714c353b0ad6b71525c1e2","path":"Mathlib/CategoryTheory/Action/Concrete.lean","proof_status":"definition","rank":4,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"abbrev Action.diagonal (G : Type u) [Monoid G] : ℕ → Action (Type u) G"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"1e17e8c2ac255f21e2b4ba756429973785b6b218ebb2f0fb9136c7041558f060","prominence":"supporting","quote":{"exact":"g(s1, ..., sn) = (g(s1), ..., g(sn))."},"quote_capped":false,"section":["Oligomorphic groups"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"before":{"layer":"When a group G acts on a set S, the action may be extended naturally to the Cartesian product Sn of S, consisting of n-tuples of elements of S: the action of an element g on the n-tuple (s1, ..., sn) is given by ","lead_in":true,"segments":[{"text":"When a group G acts on a set S, the action may be extended naturally to the Cartesian product Sn of S, consisting of n-tuples of elements of S: the action of an element g on the n-tuple (s1, ..., sn) is given by "}]},"layer":"g(s1, ..., sn) = (g(s1), ..., g(sn)).","segments":[{"text":"g(s1, ..., sn) = (g(s1), ..., g(sn))."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":4,"queries":5,"sha256":"bcb81f115275d65481feabab25fe23c9281d4869387700895fe944e759730d5f"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-24634-1352727744::In-text #023b7fff","item":"In-text #023b7fff","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"5f95d4cec3ea5a15f379927713a6e36c4f5b5662d845db4a705d8fe55885d136","prominence":"central","quote":{"exact":"The group G is said to be oligomorphic if the action on"},"quote_capped":true,"section":["Oligomorphic groups"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=24634&oldid=1352727744","text":{"layer":"The group G is said to be oligomorphic if the action on Sn has only finitely many orbits for every positive integer n.","segments":[{"text":"The group G is said to be oligomorphic if the action on Sn has only finitely many orbits for every positive integer n."}]},"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":169629,"images":[{"author":"Original: Jakob.scholbach Vector: Pbroks13","file":"Cyclic_group.svg","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0","project":"commons"},{"author":"Headbomb","file":"Lock-gray-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"User:Trappist the monk","file":"Lock-green.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"VulpesVulpes42, Headbomb","file":"Lock-red-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"This image was created by me, Booyabazooka","file":"Rubik's_cube.svg","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0/","project":"commons"}],"marks":723,"passages":89,"sha256":"d18966691b57e14e2f5ebe41c249bbd8d966c4050a94cb59cfc729da363a5041","unplaced":["enwiki-24634-1352727744::In-text #dcefcbe3"]},"record_set":"23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602","records_sha256":"2abdd6f34ce61a8961aa22a50f3626b62e3ae9a1e92a8003b1496d197f53f888","revision":1352727744,"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":"650ba3555d435184e8f3d85b6259b522f55a17d8edd3c3b2f4a326ff8bbb8df7","layer_sha256":"a58a84787578f221843c4bd5d45728549e3162249450f7ccba22cba04f9c1c8c","renderer":"web-html/3"},"source_id":"enwiki-24634-1352727744","summary":{"by_library":{"mathlib":{"complete":112,"incomplete":0,"locations":112,"passages":59,"related":23},"tauceti":{"complete":10,"incomplete":0,"locations":10,"passages":9,"related":7}},"by_prominence":{"central":{"by_status":{"formalized":29,"not_formalized":6,"partial":5,"statement_only":0,"unresolved":0},"passages":40},"subject":{"by_status":{"formalized":1,"not_formalized":0,"partial":0,"statement_only":0,"unresolved":0},"passages":1},"supporting":{"by_status":{"formalized":27,"not_formalized":16,"partial":5,"statement_only":0,"unresolved":1},"passages":49}},"by_proof_status":{"definition":69,"proved":83},"by_relation":{"broadMatch":63,"closeMatch":8,"exactMatch":13,"hasPart":24,"narrowMatch":14,"relatedMatch":30},"by_status":{"formalized":57,"not_formalized":22,"partial":10,"statement_only":0,"unresolved":1},"locations":122,"passages":90,"related":30},"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":"Permutation group","universe":{"frozen":"2026-10-17","id":"u1","libraries":48,"sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"wikidata":"Q1412905"}
