-
Definition · Subject of the article
✓Formalized
Formalized: Mathlib states a more general result (a definition).
In mathematics, given two groups, (G,∗) and (H, ·), a group homomorphism from (G,∗) to (H, ·) is a function h : G → H such that for all u and v in G it holds that h(u ∗ v) = h(u) ⋅ h(v) where the group operation on the left side of the equation is that of G and on the right side that of H.
Show in article · Read it in context on Wikipedia ↗
MonoidHom more general
structure MonoidHom (M : Type*) (N : Type*) [MulOne M] [MulOne N]
Mathlib.Algebra.Group.Hom.Defs · lines 366–367
Why more general: Mathlib's type is set up for any multiplicative-unit structure, so monoids are included alongside the article's groups, and it bundles preservation of the unit as a second field; for groups that field carries no extra demand.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
dbb0d1f5fa3e · pair key 8d75486b364d.
MulHom more general
structure MulHom (M : Type*) (N : Type*) [Mul M] [Mul N]
Mathlib.Algebra.Group.Hom.Defs · lines 294–298
Why more general: Mathlib states this for bare multiplications, so magmas and semigroups are covered as well as the article's groups, and it carries only the product condition the article writes down.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
571247eed309 · pair key ad7df48fb84f.
Sign in to tag this passage
-
Theorem · main statement
✓Formalized
Formalized by 2 parts together (more general):
MonoidHom.map_one Mathlib (proved)- a group homomorphism carries the identity element of its source group to the identity element of its target group
MonoidHom.map_inv Mathlib (proved)- a group homomorphism carries the inverse of an element to the inverse of that element's image
From this property, one can deduce that h maps the identity element eG of G to the identity element eH of H, h(eG) = eH and it also maps inverses to inverses in the sense that h(u−1) = h(u)−1.
Show in article · Read it in context on Wikipedia ↗
MonoidHom.map_one states part
theorem MonoidHom.map_one {M : Type*} {N : Type*} [MulOne M] [MulOne N] (f : M →* N) : f 1 = 1
Mathlib.Algebra.Group.Hom.Defs · lines 691–692
Why only part: The declaration is stated for any multiplicative-unit structure, monoids included, and the article's groups are among them.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
234f19ccefcb · pair key dca7f46bc65a.
MonoidHom.map_inv states part
theorem MonoidHom.map_inv {α : Type*} {β : Type*} [Group α] [DivisionMonoid β] (f : α →* β) (a : α) : f a⁻¹ = (f a)⁻¹
Mathlib.Algebra.Group.Hom.Defs · lines 1075–1076
Why only part: Mathlib allows the target to be a division monoid, so structures with a zero are covered too, while the source is required to be a group exactly as in the article.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
fc4c8bfbb94a · pair key 6c0e5caafdf1.
Sign in to tag this passage
-
Theorem · supporting · Properties
✕Not formalized
With community edits: Not formalized. As published it is Formalized.
Let eH be the identity element of the group (H, ·) and u ∈ G, then h(u) ⋅ eH = h(u) = h(u ∗ eG) = h(u) ⋅ h(eG)
Show in article · Read it in context on Wikipedia ↗
Related, but states something else
MonoidHom.map_one related
theorem MonoidHom.map_one {M : Type*} {N : Type*} [MulOne M] [MulOne N] (f : M →* N) : f 1 = 1
Mathlib.Algebra.Group.Hom.Defs · lines 691–692
Community Agent The pipeline said more general; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
How it differs: The passage is the chain h(u)·e_H = h(u) = h(u*e_G) = h(u)·h(e_G), the step before cancelling in H to get e_H = h(e_G). MonoidHom.map_one states only that conclusion, f 1 = 1, which Mathlib builds into the definition of a monoid homomorphism; the chain itself uses the identity law and multiplicativity.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
a7b8f79d9c21 · pair key 6c8c042799b6.
map_one related
theorem map_one {M : Type*} {N : Type*} {F : Type*} [One M] [One N] [FunLike F M N] [OneHomClass F M N] (f : F) : f 1 = 1
Mathlib.Algebra.Group.Hom.Defs · lines 234–235
Community Agent The pipeline said more general; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
How it differs: The passage is a computation, h(u)·e_H = h(u) = h(u*e_G) = h(u)·h(e_G), the step before cancelling to e_H = h(e_G). map_one states that conclusion, f 1 = 1, for any class of unit-preserving maps, not the displayed chain, which uses the identity law and multiplicativity.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
92ff91aa3069 · pair key 7e5035d1f27f.
Sign in to tag this passage
-
Theorem · supporting · Properties
✓Formalized
Formalized: Mathlib states a more general result (proved).
Now by multiplying by the inverse of h(u) (or applying the cancellation rule) we obtain
eH = h(eG)
Show in article · Read it in context on Wikipedia ↗
MonoidHom.map_one more general
theorem MonoidHom.map_one {M : Type*} {N : Type*} [MulOne M] [MulOne N] (f : M →* N) : f 1 = 1
Mathlib.Algebra.Group.Hom.Defs · lines 691–692
Why more general: Mathlib states the fact for any multiplicative-unit structure, so monoids are covered as well as the article's groups, and the equation itself is the article's with the sides written the other way round.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
58abafb4afd1 · pair key 129a7ba4836c.
map_one more general
theorem map_one {M : Type*} {N : Type*} {F : Type*} [One M] [One N] [FunLike F M N] [OneHomClass F M N] (f : F) : f 1 = 1
Mathlib.Algebra.Group.Hom.Defs · lines 234–235
Why more general: The hom-class form of the same equation, stated for any structures carrying a unit, the article's groups among them.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
abd134d46ff3 · pair key da25e14c2952.
Sign in to tag this passage
-
Theorem · supporting · Properties
◐Statement only
With community edits: Statement only. As published it is Not formalized.
Statement only, by a community edit: Mathlib states a more general result (statement only: the proof is not finished).
Similarly,
eH = h(eG) = h(u ∗ u−1) = h(u) ⋅ h(u−1)
Show in article · Read it in context on Wikipedia ↗
map_mul_eq_one more general
No module or line: an editor named the declaration, not a place in the source.
Mathlib
Community Agent Added by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026
Why more general: The passage computes e_H = h(u u^-1) = h(u) h(u^-1), i.e. a homomorphism sends u and u^-1 to elements whose product is the identity. map_mul_eq_one states this for any a, b with a * b = 1 and any monoid homomorphism (class), so the passage is the case a = u, b = u^-1 in a group. Its proof runs the same chain: map_mul, then a * b = 1, then map_one. The consequence h(u^-1) = h(u)^-1 is map_inv.
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 4 candidates examined (receipt c2113e6df6f8). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Related, but states something else
MonoidHom.map_mul related
theorem MonoidHom.map_mul {M : Type*} {N : Type*} [MulOne M] [MulOne N] (f : M →* N) (a b : M) : f (a * b) = f a * f b
Mathlib.Algebra.Group.Hom.Defs · lines 700–701
How it differs: It gives the image of the product of u with its inverse as the product of the two images; turning the left side into the unit of H still needs the cancellation law in G together with the fact about the unit, so a named lemma bridges it.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
815fe8a344df · pair key c06a4b133fee.
MonoidHom.map_inv related
theorem MonoidHom.map_inv {α : Type*} {β : Type*} [Group α] [DivisionMonoid β] (f : α →* β) (a : α) : f a⁻¹ = (f a)⁻¹
Mathlib.Algebra.Group.Hom.Defs · lines 1075–1076
How it differs: It rewrites the image of the inverse as the inverse of the image; reaching the unit of H from that product still requires the cancellation law, so another lemma is needed.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
78bb897915cf · pair key bfca56875cdd.
Sign in to tag this passage
-
Theorem · supporting · Properties
✓Formalized
Formalized: Mathlib states a more general result (proved).
Therefore, by the uniqueness of the inverse: h(u−1) = h(u)−1.
Show in article · Read it in context on Wikipedia ↗
MonoidHom.map_inv more general
theorem MonoidHom.map_inv {α : Type*} {β : Type*} [Group α] [DivisionMonoid β] (f : α →* β) (a : α) : f a⁻¹ = (f a)⁻¹
Mathlib.Algebra.Group.Hom.Defs · lines 1075–1076
Why more general: Mathlib permits the target to be a division monoid, so structures with a zero are covered as well as the article's group H, while the equation is the article's.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
2dbb788c3166 · pair key 6b663ed62899.
map_inv more general
theorem map_inv {G : Type*} {H : Type*} {F : Type*} [FunLike F G H] [Group G] [DivisionMonoid H] [MonoidHomClass F G H] (f : F) (a : G) : f a⁻¹ = (f a)⁻¹
Mathlib.Algebra.Group.Hom.Defs · lines 447–449
Why more general: The hom-class form of the inverse rule, also available when the target is only a division monoid; its docstring records it as the statement that homomorphisms respect inversion.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
ef473161419e · pair key ccdacd656e40.
Sign in to tag this passage
-
Definition · main statement · Types
◔Partial
Partial: Mathlib states this up to a convention difference, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.
Monomorphism
A group homomorphism that is injective (or, one-to-one); i.e., preserves distinctness.
Show in article · Read it in context on Wikipedia ↗
GrpCat.mono_iff_injective close match
theorem GrpCat.mono_iff_injective {A B : GrpCat} (f : A ⟶ B) : CategoryTheory.Mono f ↔ Function.Injective ⇑(CategoryTheory.ConcreteCategory.hom f)
Mathlib.Algebra.Category.Grp.EpiMono · lines 86–87
Why close, not exact: Mathlib carries the notion for a morphism in the category of groups and proves it unfolds to injectivity of the underlying function, which is the property the article attaches to the name.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
0838570c869d · pair key 0eacd4adae9f.
Sign in to tag this passage
-
Definition · main statement · Types
◔Partial
Partial: Mathlib states this up to a convention difference, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.
Epimorphism
A group homomorphism that is surjective (or, onto); i.e., reaches every point in the codomain.
Show in article · Read it in context on Wikipedia ↗
GrpCat.epi_iff_surjective close match
theorem GrpCat.epi_iff_surjective {A B : GrpCat} (f : A ⟶ B) : CategoryTheory.Epi f ↔ Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom f)
Mathlib.Algebra.Category.Grp.EpiMono · lines 302–303
Why close, not exact: Mathlib carries the notion for a morphism in the category of groups and proves it unfolds to surjectivity of the underlying function, the property the article uses to name such a map.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
a34a9c3d15cc · pair key 45b868925f6e.
Sign in to tag this passage
-
Definition · main statement · Types
✓Formalized
Formalized: Mathlib states a more general result (a definition).
Isomorphism
A group homomorphism that is bijective; i.e., injective and surjective.
Show in article · Read it in context on Wikipedia ↗
MulEquiv more general
structure MulEquiv (M : Type*) (N : Type*) [Mul M] [Mul N]
Mathlib.Algebra.Group.Equiv.Defs · line 73
Why more general: The data packages the map with its inverse map and the multiplicativity proof, which is the bijection itself rather than extra content.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
88abe4494362 · pair key b83e33ed91ac.
MulEquiv.ofBijective more general
def MulEquiv.ofBijective {M : Type*} {N : Type*} {F : Type*} [Mul M] [Mul N] [FunLike F M N] [MulHomClass F M N] (f : F) : Function.Bijective ⇑f → M ≃* N
Mathlib.Algebra.Group.Equiv.Defs · lines 504–506
Why more general: Its docstring states the same thing for semigroup homomorphisms, of which group homomorphisms are an instance.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
facb3e0c72e3 · pair key cba8d7de37ca.
Sign in to tag this passage
-
Theorem · main statement · Types
✓Formalized
Formalized: Mathlib states a more general result (a definition).
Its inverse is also a group homomorphism.
Show in article · Read it in context on Wikipedia ↗
MonoidHom.inverse more general
def MonoidHom.inverse {A : Type*} {B : Type*} [Monoid A] [Monoid B] (f : A →* B) (g : B → A) : Function.LeftInverse g ⇑f → Function.RightInverse g ⇑f → B →* A
Mathlib.Algebra.Group.Hom.Defs · lines 962–965
Why more general: Its docstring says the same for bijective monoid homomorphisms, and it presents the inverse as a given two-sided inverse function rather than as derived from bijectivity.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
7725903b7113 · pair key 0cb07621b7fd.
MulEquiv.symm more general
def MulEquiv.symm {M : Type*} {N : Type*} [Mul M] [Mul N] : M ≃* N → N ≃* M
Mathlib.Algebra.Group.Equiv.Defs · lines 278–279
Why more general: Its docstring records the same fact, with the bijective homomorphism packaged as an isomorphism object.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
24969ea6001b · pair key 44a32f2b93e6.
Sign in to tag this passage
-
Definition · main statement · Types
✓Formalized
Formalized: Mathlib states a more general result (a definition).
In this case, the groups G and H are called isomorphic; they differ only in the notation of their elements (except of identity element) and are identical for all practical purposes.
Show in article · Read it in context on Wikipedia ↗
MulEquiv more general
structure MulEquiv (M : Type*) (N : Type*) [Mul M] [Mul N]
Mathlib.Algebra.Group.Equiv.Defs · line 73
Why more general: Mathlib has no separate predicate for the relation; it says that the groups are isomorphic by exhibiting or asserting the existence of a term of this type.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
6c189e8f15b3 · pair key bde47aa2e6a6.
MulEquiv.ofBijective more general
def MulEquiv.ofBijective {M : Type*} {N : Type*} {F : Type*} [Mul M] [Mul N] [FunLike F M N] [MulHomClass F M N] (f : F) : Function.Bijective ⇑f → M ≃* N
Mathlib.Algebra.Group.Equiv.Defs · lines 504–506
Why more general: It converts the passage's condition into Mathlib's isomorphism object, which is how the relation is recorded there.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
02e5792d8923 · pair key fd7e1768d9fe.
Sign in to tag this passage
-
Definition · main statement · Types
✓Formalized
Formalized: Mathlib states a more general result (a definition).
Endomorphism
A group homomorphism, h: G → G; the domain and codomain are the same. Also called an endomorphism of G.
Show in article · Read it in context on Wikipedia ↗
Monoid.End more general
def Monoid.End (M : Type u_4) [MulOne M] : Type u_4
Mathlib.Algebra.Group.Hom.Defs · line 975
Why more general: Its docstring calls it the monoid of endomorphisms, and for a group the monoid homomorphisms from G to G are exactly the group homomorphisms from G to G.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
dc7dc4e3b566 · pair key 4d18db22ee90.
Sign in to tag this passage
-
Definition · main statement · Types
✓Formalized
Formalized: Mathlib states a more general result (a definition).
Automorphism
A group endomorphism that is bijective, and hence an isomorphism.
Show in article · Read it in context on Wikipedia ↗
MulAut more general
abbrev MulAut (M : Type u_7) [Mul M] : Type u_7
Mathlib.Algebra.Group.End · lines 631–632
Why more general: Mathlib builds the type as the isomorphisms of G with itself, which is the second description the passage gives.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
a5c4584b14c6 · pair key 1c39f01e0760.
MulEquiv.ofBijective more general
def MulEquiv.ofBijective {M : Type*} {N : Type*} {F : Type*} [Mul M] [Mul N] [FunLike F M N] [MulHomClass F M N] (f : F) : Function.Bijective ⇑f → M ≃* N
Mathlib.Algebra.Group.Equiv.Defs · lines 504–506
Why more general: Taking source and target to be the same group turns the construction into the passage's statement about endomorphisms.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
f424aa398ceb · pair key d0781cacc25d.
Sign in to tag this passage
-
Definition · main statement · Types
✓Formalized
Formalized: Mathlib states a more general result (a definition).
The set of all automorphisms of a group G, with functional composition as operation, itself forms a group, the automorphism group of G.
Show in article · Read it in context on Wikipedia ↗
MulAut.instGroup more general
instance MulAut.instGroup (M : Type*) [Mul M] : Group (MulAut M)
Mathlib.Algebra.Group.End · lines 648–655
Why more general: The product of this structure applies one automorphism after the other, as MulAut.coe_mul records, and its unit is the identity map.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
109851ada4d0 · pair key 056fed227370.
Related, but states something else
MulAut.coe_mul related
theorem MulAut.coe_mul (M : Type*) [Mul M] (e₁ e₂ : MulAut M) : ⇑(e₁ * e₂) = ⇑e₁ ∘ ⇑e₂
Mathlib.Algebra.Group.End · lines 662–663
How it differs: It unfolds the product of the automorphism group to composition of the underlying maps, a definitional lemma about the structure rather than the passage's assertion.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
4ca5d1c71faf · pair key a8b5e4dd5f46.
Sign in to tag this passage
-
Notation · supporting · Types
✓Formalized
Formalized: Mathlib states a more general result (a definition).
The set of all automorphisms of a group G, with functional composition as operation, itself forms a group, the automorphism group of G. It is denoted by Aut(G).
Show in article · Read it in context on Wikipedia ↗
MulAut more general
abbrev MulAut (M : Type u_7) [Mul M] : Type u_7
Mathlib.Algebra.Group.End · lines 631–632
Why more general: Mathlib writes this object as MulAut G, the multiplicative spelling, where the passage writes Aut(G).
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
2d8d16beefb2 · pair key f1efe83d6c75.
Related, but states something else
CategoryTheory.Aut related
structure CategoryTheory.Aut {C : Type u} [CategoryTheory.Category C] : C → Type v
Mathlib.CategoryTheory.Endomorphism · lines 123–125
How it differs: It writes Aut for the self-isomorphisms of an object of an arbitrary category, so reaching the passage's groups needs the category of groups as a second ingredient.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
300d3e011622 · pair key 4ee567c2c117.
Sign in to tag this passage
-
Example · supporting · Types
✓Formalized
Formalized: Mathlib states this exactly (proved).
As an example, the automorphism group of (Z, +) contains only two elements, the identity transformation and multiplication with −1; it is isomorphic to (Z/2Z, +).
Show in article · Read it in context on Wikipedia ↗
Int.univ_addEquiv exact match
theorem Int.univ_addEquiv : Finset.univ = Finset.cons (AddEquiv.neg ℤ) {AddEquiv.refl ℤ} instFintypeAddEquivInt._proof_2
Mathlib.GroupTheory.ArchimedeanDensely · lines 73–75
Note: Mathlib's AddEquiv.neg sends each integer to its opposite, which is the passage's multiplication by minus one, and listing the set as a cons records that the two members differ, so there are two of them.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
2a34c194f43f · pair key d47c179777aa.
Int.addEquiv_eq_refl_or_neg states part
theorem Int.addEquiv_eq_refl_or_neg (e : ℤ ≃+ ℤ) : e = AddEquiv.refl ℤ ∨ e = AddEquiv.neg ℤ
Mathlib.GroupTheory.ArchimedeanDensely · lines 59–64
Why only part: It names the two maps of the passage but leaves the count to the distinctness of the two, which it does not record.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
6cf0293192d9 · pair key a4e886d7b81e.
Int.card_fintype_addEquiv states part
theorem Int.card_fintype_addEquiv : Fintype.card (ℤ ≃+ ℤ) = 2
Mathlib.GroupTheory.ArchimedeanDensely · line 77
Why only part: It gives the passage's count without saying which two maps they are.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
68a047b65854 · pair key be0e333c1acd.
Sign in to tag this passage
-
Example · supporting · Types
✕Not formalized
As an example, the automorphism group of (Z, +) contains only two elements, the identity transformation and multiplication with −1; it is isomorphic to (Z/2Z, +).
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 5 queries and 4 candidates examined (receipt 7c42b32b6c0b). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Related, but states something else
IsCyclic.mulAutMulEquiv related
def IsCyclic.mulAutMulEquiv (G : Type*) [Group G] [h : IsCyclic G] : MulAut G ≃* (ZMod (Nat.card G))ˣ
Mathlib.GroupTheory.SpecificGroups.Cyclic · lines 707–711
How it differs: It identifies the automorphism group of a cyclic group with the units of ZMod of its cardinality, which for the integers is the unit group of the integers.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
8e8758bc3e4d · pair key 2b5a21bfc144.
TauCeti.additiveIntUnitsAddEquiv related
def TauCeti.additiveIntUnitsAddEquiv : Additive ℤˣ ≃+ ZMod 2
TauCeti.Data.ZMod.IntUnitsPower · lines 41–48
How it differs: It states that the unit group of the integers, written additively, is the two-element group, which is the other half of the article's example.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
83245ab. - Location key
11dee747935b · pair key 2d00e268cacd.
Sign in to tag this passage
-
Definition · main statement · Image and kernel
✓Formalized
Formalized: Mathlib states a more general result (a definition).
We define the kernel of h to be the set of elements in G that are mapped to the identity in H ker(h) := {u ∈ G: h(u) = eH}.
Show in article · Read it in context on Wikipedia ↗
MonoidHom.ker more general
def MonoidHom.ker {G : Type*} [Group G] {M : Type*} [MulOneClass M] : (G →* M) → Subgroup G
Mathlib.Algebra.Group.Subgroup.Ker · lines 238–243
Why more general: Mathlib defines the kernel for a monoid target and hands it back as a subgroup of the source rather than as a bare subset.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
edd0406f4f42 · pair key 2baef185baf6.
Related, but states something else
MonoidHom.mem_ker related
theorem MonoidHom.mem_ker {G : Type*} [Group G] {M : Type*} [MulOneClass M] {f : G →* M} {x : G} : x ∈ f.ker ↔ f x = 1
Mathlib.Algebra.Group.Subgroup.Ker · lines 249–250
How it differs: It only unfolds membership in the kernel into the equation on values, so it restates what the defined term means.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
653af26a3dbf · pair key cc8f26755f3c.
Sign in to tag this passage
-
Definition · main statement · Image and kernel
✓Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
and the image of h to be im(h) := h(G) ≡ {h(u): u ∈ G}.
Show in article · Read it in context on Wikipedia ↗
MonoidHom.range close match
def MonoidHom.range {G : Type*} [Group G] {N : Type*} [Group N] : (G →* N) → Subgroup N
Mathlib.Algebra.Group.Subgroup.Ker · lines 66–67
Why close, not exact: Mathlib hands the image back as a subgroup of the target, carrying the closure proofs alongside the underlying collection of values of h.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
2a631737e004 · pair key 80b37f31e347.
Related, but states something else
MonoidHom.coe_range related
theorem MonoidHom.coe_range {G : Type*} [Group G] {N : Type*} [Group N] (f : G →* N) : ↑f.range = Set.range ⇑f
Mathlib.Algebra.Group.Subgroup.Ker · lines 74–75
How it differs: It only says that the underlying set of the range is the set of values, unfolding the term the passage glosses.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
3bdbc5b24023 · pair key df50548a834b.
Sign in to tag this passage
-
Theorem · main statement · Image and kernel
✓Formalized
Formalized: Mathlib states this exactly (a definition).
The first isomorphism theorem states that the image of a group homomorphism, h(G) is isomorphic to the quotient group G/ker h.
Show in article · Read it in context on Wikipedia ↗
QuotientGroup.quotientKerEquivRange exact match
def QuotientGroup.quotientKerEquivRange {G : Type u} [Group G] {H : Type v} [Group H] (φ : G →* H) : G ⧸ φ.ker ≃* ↥φ.range
Mathlib.GroupTheory.QuotientGroup.Basic · lines 134–135
Note: The isomorphism is written from the quotient towards the image, and the passage reads the same isomorphism starting at the image.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
09b580b81ed2 · pair key b98bb258097b.
Related, but states something else
TauCeti.QuotientGroup.quotientKerEquivRange_apply_mk related
theorem TauCeti.QuotientGroup.quotientKerEquivRange_apply_mk {G : Type*} {M : Type*} [Group G] [Group M] (φ : G →* M) (g : G) : (QuotientGroup.quotientKerEquivRange φ) ↑g = ⟨φ g, ⋯⟩
TauCeti.GroupTheory.QuotientGroup.KerEquiv · lines 70–73
How it differs: It computes the value of that isomorphism on a class, so it describes the map rather than asserting the isomorphism.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
83245ab. - Location key
3da9c3c90030 · pair key f9f5c1393864.
Sign in to tag this passage
-
Theorem · main statement · Image and kernel
✓Formalized
Formalized: Mathlib states a more general result (proved).
The kernel of h is a normal subgroup of G.
Show in article · Read it in context on Wikipedia ↗
MonoidHom.normal_ker more general
instance MonoidHom.normal_ker {G : Type*} [Group G] {M : Type*} [MulOneClass M] (f : G →* M) : f.ker.Normal
Mathlib.Algebra.Group.Subgroup.Ker · lines 368–370
Why more general: Mathlib proves normality of the kernel for any monoid target, and registers it as an instance so that resolution finds it.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
e5803e4c3713 · pair key 4e37300b22f8.
Sign in to tag this passage
-
Theorem · supporting · Image and kernel
✓Formalized
Formalized: Mathlib states a more general result (proved).
The kernel of h is a normal subgroup of G. Assume u ∈ ker(h) and show g−1 ∘ u ∘ g ∈ ker(h) for arbitrary u, g:
h(g−1 ∘ u ∘ g)= h(g)−1 ⋅ h(u) ⋅ h(g)= h(g)−1 ⋅ eH ⋅ h(g)= h(g)−1 ⋅ h(g) = eH,
Show in article · Read it in context on Wikipedia ↗
MonoidHom.normal_ker more general
instance MonoidHom.normal_ker {G : Type*} [Group G] {M : Type*} [MulOneClass M] (f : G →* M) : f.ker.Normal
Mathlib.Algebra.Group.Subgroup.Ker · lines 368–370
Why more general: Mathlib carries the fact as normality of the kernel for any unital multiplicative target, with membership in the kernel standing for the value of the map being the unit.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
fc61c78f3077 · pair key 97925240b725.
Related, but states something else
Subgroup.Normal.conj_mem' related
theorem Subgroup.Normal.conj_mem' {G : Type*} [Group G] {H : Subgroup G} : H.Normal → ∀ n ∈ H, ∀ (g : G), g⁻¹ * n * g ∈ H
Mathlib.Algebra.Group.Subgroup.Defs · lines 634–637
How it differs: Mathlib writes the conclusion as membership in the subgroup, where the article writes the same fact as the value of h being the identity of H.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack, which downgraded it. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
302822cfb8fd · pair key a5e2dd87e57f.
MonoidHom.mem_ker related
theorem MonoidHom.mem_ker {G : Type*} [Group G] {M : Type*} [MulOneClass M] {f : G →* M} {x : G} : x ∈ f.ker ↔ f x = 1
Mathlib.Algebra.Group.Subgroup.Ker · lines 249–250
How it differs: It turns membership in the kernel into the equation on values, which is how the article phrases the conclusion.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
54a85895edae · pair key 060480a0997c.
Sign in to tag this passage
-
Theorem · main statement · Image and kernel
✓Formalized
Formalized: Mathlib states this exactly (a definition).
The image of h is a subgroup of H.
Show in article · Read it in context on Wikipedia ↗
MonoidHom.range exact match
def MonoidHom.range {G : Type*} [Group G] {N : Type*} [Group N] : (G →* N) → Subgroup N
Mathlib.Algebra.Group.Subgroup.Ker · lines 66–67
Note: The content is carried by the type: the image of h is handed back as a subgroup of H, with its closure proofs.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
6f8ec8828315 · pair key 45cce6605f68.
Related, but states something else
MonoidHom.coe_range related
theorem MonoidHom.coe_range {G : Type*} [Group G] {N : Type*} [Group N] (f : G →* N) : ↑f.range = Set.range ⇑f
Mathlib.Algebra.Group.Subgroup.Ker · lines 74–75
How it differs: It identifies the underlying set of that subgroup with the set of values of h.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
e35f0d708305 · pair key 1b5836c6c9ac.
Sign in to tag this passage
-
Theorem · main statement · Image and kernel
✓Formalized
Formalized: Mathlib states a more general result (proved).
The homomorphism, h, is a group monomorphism; i.e., h is injective (one-to-one) if and only if ker(h) = {eG}.
Show in article · Read it in context on Wikipedia ↗
MonoidHom.ker_eq_bot_iff more general
theorem MonoidHom.ker_eq_bot_iff {G : Type*} [Group G] {M : Type*} [MulOneClass M] (f : G →* M) : f.ker = ⊥ ↔ Function.Injective ⇑f
Mathlib.Algebra.Group.Subgroup.Ker · lines 323–325
Why more general: Mathlib names the one-element subgroup as the least element of the subgroup lattice and states the equivalence for any monoid target.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
79ca1b655372 · pair key 697823801e6b.
Related, but states something else
MonoidHom.ker_eq_bot related
theorem MonoidHom.ker_eq_bot {G : Type*} [Group G] {M : Type*} [MulOneClass M] (f : G →* M) : Function.Injective ⇑f → f.ker = ⊥
Mathlib.Algebra.Group.Subgroup.Ker · lines 328–329
How it differs: It gives only the implication from injectivity to the kernel being least, not the equivalence the passage asserts.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
696ece0b8857 · pair key 6c6d78016033.
Sign in to tag this passage
-
Theorem · supporting · Image and kernel
✓Formalized
Formalized: Mathlib states a more general result (proved).
Injectivity directly gives that there is a unique element in the kernel, and, conversely, a unique element in the kernel gives injectivity:
h(g1)= h(g2)⇔h(g1) ⋅ h(g2)−1= eH⇔h(g1 ∘ g−12)= eH, ker(h) = {eG}⇒g1 ∘ g−12= eG⇔g1= g2
Show in article · Read it in context on Wikipedia ↗
MonoidHom.ker_eq_bot_iff more general
theorem MonoidHom.ker_eq_bot_iff {G : Type*} [Group G] {M : Type*} [MulOneClass M] (f : G →* M) : f.ker = ⊥ ↔ Function.Injective ⇑f
Mathlib.Algebra.Group.Subgroup.Ker · lines 323–325
Why more general: Mathlib writes the trivial kernel as the bottom subgroup and pairs it with injectivity; the rewriting through the image of a product with an inverse is a middle term of the article's chain (R-CHAIN).
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
7fa761957f8c · pair key de5d0451d7a0.
Sign in to tag this passage
-
Example · supporting · Examples
✓Formalized
Formalized: Mathlib states a more general result (a definition).
Consider the cyclic group Z3 = (Z/3Z, +) = ({0, 1, 2}, +) and the group of integers (Z, +). The map h : Z → Z/3Z with h(u) = u mod 3 is a group homomorphism.
Show in article · Read it in context on Wikipedia ↗
Int.castAddHom more general
def Int.castAddHom (α : Type*) [AddGroupWithOne α] : ℤ →+ α
Mathlib.Data.Int.Cast.Lemmas · lines 42–45
Why more general: Mathlib bundles the integer cast as an additive homomorphism for any such target and writes the integers modulo three as ZMod 3; the modulus enters as a natural number index while the source of the map is ℤ, so the article's integer statement is the one given.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
cf308495e6c6 · pair key bb76d13d2f27.
Int.castRingHom more general
def Int.castRingHom (α : Type*) [NonAssocRing α] : ℤ →+* α
Mathlib.Data.Int.Cast.Lemmas · lines 84–89
Why more general: It carries the multiplication as well, so it bundles more than the article claims about the two additive groups; the modulus is again a natural number index on a map whose source is ℤ.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
80ecb1bd4c0d · pair key 50f3c9d4fb75.
Sign in to tag this passage
-
Example · supporting · Examples
✓Formalized
Formalized by 2 parts together (more general):
ZMod.intCast_surjective Mathlib (proved)- reduction of integers modulo 3 onto Z/3Z is a surjective map
ZMod.ker_intCastAddHom Mathlib (proved)- the kernel of that reduction map is exactly the set of multiples of 3
It is surjective and its kernel consists of all integers that are divisible by 3.
Show in article · Read it in context on Wikipedia ↗
ZMod.intCast_surjective states part
theorem ZMod.intCast_surjective {n : ℕ} : Function.Surjective Int.cast
Mathlib.Data.ZMod.Basic · lines 229–230
Why only part: The modulus is a natural number here while the elements cast are integers, so the article's integer statement is the one obtained; Mathlib proves it for an arbitrary modulus.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
815fa5c58af4 · pair key 32ae472d4859.
ZMod.ker_intCastAddHom states part
theorem ZMod.ker_intCastAddHom (n : ℕ) : (Int.castAddHom (ZMod n)).ker = AddSubgroup.zmultiples ↑n
Mathlib.Data.ZMod.Basic · lines 599–603
Why only part: The modulus is a natural number while the kernel is a subgroup of ℤ, so the article's integers are the elements described; the multiples of three appear as the subgroup of integer multiples generated by three.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
c0b05e303d50 · pair key cb9e963ae5e7.
Sign in to tag this passage
-
Example · supporting · Examples
✕Not formalized
The set G ≡ {(ab01)|a > 0, b ∈ R} forms a group under matrix multiplication.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 3b97a07f640e). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Related, but states something else
TauCeti.GL2Borel related
abbrev TauCeti.GL2Borel (R : Type u) [CommRing R] : Subgroup (GL (Fin 2) R)
TauCeti.LinearAlgebra.Matrix.GeneralLinearGroup.Borel · line 152
How it differs: Its matrices have an arbitrary invertible entry in the lower right and no sign condition on the upper left, so it is a strictly larger set than the one the article describes.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
83245ab. - Location key
a82704a3e4c8 · pair key 97b59af98c83.
Sign in to tag this passage
-
Example · supporting · Examples
✕Not formalized
For any complex number u, the function fu : G → C* defined by (ab01) ↦ au is a group homomorphism.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt b5cfe6eb8e72). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Related, but states something else
MonoidHom.cpowCharacter related
def MonoidHom.cpowCharacter {G : Type*} [Monoid G] [TopologicalSpace G] (f : G →* NNRealˣ) : Continuous ⇑f → ℂ → G →ₜ* ℂˣ
TauCeti.Analysis.SpecialFunctions.Complex.CpowCharacter · lines 35–45
How it differs: It builds a complex-power character out of a positive-valued homomorphism that has to be given in advance, and no such homomorphism on the article's matrix group is in the index.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
83245ab. - Location key
bdb9bc2a7222 · pair key dba4b34fa45c.
Matrix.GeneralLinearGroup.det related
def Matrix.GeneralLinearGroup.det {n : Type u} [DecidableEq n] [Fintype n] {R : Type v} [CommRing R] : GL n R →* Rˣ
Mathlib.LinearAlgebra.Matrix.GeneralLinearGroup.Defs · lines 93–100
How it differs: On the article's matrices the determinant is the upper-left entry, but the declaration is stated on the whole invertible matrix group and into the units of the base ring.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
3d36843591ea · pair key ec30721a05c2.
Sign in to tag this passage
-
Example · supporting · Examples
✓Formalized
Formalized: TauCeti states a more general result (a definition).
For any complex number u, the function fu : R+ → C* defined by fu(a) = au is a group homomorphism.
Show in article · Read it in context on Wikipedia ↗
TauCeti.normCpowCharacter more general
def TauCeti.normCpowCharacter (𝕜 : Type*) [NormedDivisionRing 𝕜] : ℂ → 𝕜ˣ →ₜ* ℂˣ
TauCeti.Analysis.SpecialFunctions.Complex.CpowCharacter · lines 82–87
Why more general: It is the character of the units of a normed division ring sending a unit to the power of its norm, bundled with continuity, so it covers the negative reals as well as the article's positive ones.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
83245ab. - Location key
47d3ca847808 · pair key df0ea881e4b3.
Complex.mul_cpow_ofReal_nonneg states part
theorem Complex.mul_cpow_ofReal_nonneg {a b : ℝ} : 0 ≤ a → 0 ≤ b → ∀ (r : ℂ), (↑a * ↑b) ^ r = ↑a ^ r * ↑b ^ r
Mathlib.Analysis.SpecialFunctions.Pow.Complex · lines 189–200
Why only part: It is the multiplicativity of the complex power on nonnegative reals, stated without bundling it as a homomorphism.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
fac3caa3c2b8 · pair key 679e65067598.
Sign in to tag this passage
-
Example · supporting · Examples
✓Formalized
Formalized, by a community edit: Mathlib states this up to a convention difference (a definition).
fu(a) = au is a group homomorphism.
The exponential map yields a group homomorphism from the group of real numbers R with addition to the group of non-zero real numbers R* with multiplication.
Show in article · Read it in context on Wikipedia ↗
Real.expMonoidHom close match
def Real.expMonoidHom : Multiplicative ℝ →* ℝ
Mathlib.Analysis.Complex.Exponential · lines 216–219
Community Agent The pipeline said more general; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
Why close, not exact: Real.expMonoidHom bundles exp as a monoid hom from Multiplicative ℝ to the reals under multiplication, carrying exp 0 = 1 and exp(x + y) = exp x * exp y. The article's codomain is the group of nonzero reals instead. The two agree because a monoid hom out of a group always lands in the units of its codomain (MonoidHom.toHomUnits), and the units of ℝ are the nonzero reals.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
a948f5e7cd5b · pair key cbe7670de7c7.
TauCeti.expUnitHom more general
def TauCeti.expUnitHom {R : Type*} [NormedRing R] [NormedAlgebra ℝ R] [CompleteSpace R] : R → Multiplicative ℝ →ₜ* Rˣ
TauCeti.Geometry.Lie.Exponential.Units.Basic · lines 108–113
Why more general: It is stated for the exponential along a line in the units of any complete normed algebra and is bundled with continuity as well.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
83245ab. - Location key
8f71eedcc078 · pair key 330bf34c6852.
Sign in to tag this passage
-
Example · supporting · Examples
✓Formalized
Formalized by 2 parts together (close match):
Real.range_exp Mathlib (proved)- its image is precisely the set of positive reals
Real.exp_eq_one_iff Mathlib (proved)- the kernel of the real exponential homomorphism is the trivial subgroup {0}
The kernel is {0} and the image consists of the positive real numbers.
Show in article · Read it in context on Wikipedia ↗
Real.range_exp states part
theorem Real.range_exp : Set.range Real.exp = Set.Ioi 0
Mathlib.Analysis.SpecialFunctions.Exp · lines 320–321
Why only part: Set.Ioi 0 is Mathlib's name for the reals above zero and Set.range is the set of values the function takes.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
901bb8a07c6a · pair key 557488086507.
Real.exp_eq_one_iff states part
theorem Real.exp_eq_one_iff (x : ℝ) : Real.exp x = 1 ↔ x = 0
Mathlib.Analysis.Complex.Exponential · lines 328–329
Why only part: Mathlib records the kernel pointwise, characterising the reals whose exponential equals one as zero alone.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
a977a7d5bea6 · pair key addfba1d8040.
Sign in to tag this passage
-
Example · supporting · Examples
◔Partial
Partial: Mathlib states part of this (a definition).
The exponential map also yields a group homomorphism from the group of complex numbers C with addition to the group of non-zero complex numbers C* with multiplication.
Show in article · Read it in context on Wikipedia ↗
Complex.expMonoidHom states part
def Complex.expMonoidHom : Multiplicative ℂ →* ℂ
Mathlib.Analysis.Complex.Exponential · lines 135–138
Why only part: The target is the multiplicative monoid of ℂ rather than the group of nonzero complex numbers, so the codomain of the passage is not part of this bundling.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
29a1d6ff71fc · pair key 83d57cda4acc.
Complex.exp_ne_zero states part
theorem Complex.exp_ne_zero (x : ℂ) : Complex.exp x ≠ 0
Mathlib.Analysis.Complex.Exponential · lines 163–164
Why only part: This supplies the codomain half of the passage, that the exponential takes its values among the invertible complex numbers.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
b09c50aef688 · pair key f4ae81df44ae.
Sign in to tag this passage
-
Example · supporting · Examples
✓Formalized
Formalized by 2 parts together (close match):
Complex.range_exp Mathlib (proved)- the complex exponential homomorphism onto the nonzero complex numbers is surjective
Complex.exp_eq_one_iff Mathlib (proved)- its kernel is the set of integer multiples of 2πi
This map is surjective and has the kernel {2πki : k ∈ Z}, as can be seen from Euler's formula.
Show in article · Read it in context on Wikipedia ↗
Complex.range_exp states part
theorem Complex.range_exp : Set.range Complex.exp = {0}ᶜ
Mathlib.Analysis.SpecialFunctions.Complex.Log · lines 48–52
Why only part: Mathlib writes the surjectivity onto the nonzero complex numbers as an equality between the set of values of the exponential and the complement of zero.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
b10c4aeb44e6 · pair key 8e9ebb43bb14.
Complex.exp_eq_one_iff states part
theorem Complex.exp_eq_one_iff {x : ℂ} : Complex.exp x = 1 ↔ ∃ n, x = ↑n * (2 * ↑π * Complex.I)
Mathlib.Analysis.SpecialFunctions.Complex.Log · lines 142–151
Why only part: Mathlib spells the kernel out pointwise, as an equivalence between sending an element to one and writing it as an integer (ℤ) multiple of two pi i, in place of an equality of sets.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
05797ad92e5b · pair key 7f92c65274d8.
Sign in to tag this passage
-
Definition · supporting · Examples
✕Not formalized
Fields like R and C that have homomorphisms from their additive group to their multiplicative group are thus called exponential fields.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt c21c5659330a). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Example · supporting · Examples
✓Formalized
Formalized: Mathlib states a more general result (a definition).
The function Φ : (ℤ, +) → (ℝ, +), defined by Φ(x) = √2x is a homomorphism.
Show in article · Read it in context on Wikipedia ↗
zmultiplesHom more general
def zmultiplesHom (β : Type*) [AddGroup β] : β ≃ (ℤ →+ β)
Mathlib.Data.Int.Cast.Lemmas · lines 269–276
Why more general: Mathlib supplies, for an additive group and an element of it, the homomorphism from the integers sending one to that element, with the integer action written as scalar multiplication rather than as a product of a cast with a real.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
fd93ad5e0f85 · pair key ef0bfbce7af8.
Sign in to tag this passage
-
Example · supporting · Examples
✓Formalized
Formalized: Mathlib states a more general result (proved).
Consider the two groups (ℝ+, ∗) and (ℝ, +), represented respectively by G and H, where ℝ+ is the positive real numbers. Then, the function f : G → H defined by the logarithm function is a homomorphism.
Show in article · Read it in context on Wikipedia ↗
Real.log_mul more general
theorem Real.log_mul {x y : ℝ} : x ≠ 0 → y ≠ 0 → Real.log (x * y) = Real.log x + Real.log y
Mathlib.Analysis.SpecialFunctions.Log.Basic · lines 133–135
Why more general: Mathlib states the identity on all nonzero reals, negative ones included, where the logarithm is taken of the absolute value, a domain wider than the positive reals of the passage.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
75c58a10edd9 · pair key 9809ba5101f8.
Sign in to tag this passage
-
Theorem · main statement · Category of groups
✓Formalized
Formalized: Mathlib states a more general result (a definition).
If h : G → H and k : H → K are group homomorphisms, then so is k ∘ h : G → K.
Show in article · Read it in context on Wikipedia ↗
MonoidHom.comp more general
def MonoidHom.comp {M : Type*} {N : Type*} {P : Type*} [MulOne M] [MulOne N] [MulOne P] : (N →* P) → (M →* N) → M →* P
Mathlib.Algebra.Group.Hom.Defs · lines 795–799
Why more general: Mathlib builds the composite for homomorphisms of monoids, and a homomorphism of groups is such a homomorphism, so the construction applies to the passage's maps.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
8eb04005aaf8 · pair key 9d8c8939a9d4.
Sign in to tag this passage
-
Definition · main statement · Category of groups
✓Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
If h : G → H and k : H → K are group homomorphisms, then so is k ∘ h : G → K. This shows that the class of all groups, together with group homomorphisms as morphisms, forms a category (specifically the category of groups).
Show in article · Read it in context on Wikipedia ↗
GrpCat close match
structure GrpCat
Mathlib.Algebra.Category.Grp.Basic · lines 39–42
Why close, not exact: Mathlib packs each object as a carrier type paired with its group structure, and the arrows as wrapped multiplicative homomorphisms, the objects living in one fixed universe.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
39ec1352627f · pair key a32f52cdab8b.
GrpCat.instCategory close match
instance GrpCat.instCategory : CategoryTheory.Category GrpCat
Mathlib.Algebra.Category.Grp.Basic · lines 94–97
Why close, not exact: It equips the bundled groups with identities and composition of their wrapped homomorphisms, which is the category structure the passage describes.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
cb2db62071cd · pair key ce36c2f74ec7.
Related, but states something else
GrpCat.instConcreteCategoryMonoidHomCarrier related
instance GrpCat.instConcreteCategoryMonoidHomCarrier : CategoryTheory.ConcreteCategory GrpCat fun x1 x2 ↦ ↑x1 →* ↑x2
Mathlib.Algebra.Category.Grp.Basic · lines 100–102
How it differs: It carries more than the passage asserts, namely the faithful reading of each arrow as a function on elements, besides naming the homomorphisms as arrows.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack, which downgraded it. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
4b87d05dd875 · pair key dea55bda22ca.
Sign in to tag this passage
-
Theorem · main statement · Homomorphisms of abelian groups
✓Formalized
Formalized: Mathlib states a more general result (a definition).
If G and H are abelian (i.e., commutative) groups, then the set Hom(G, H) of all group homomorphisms from G to H is itself an abelian group: the sum h + k of two homomorphisms is defined by
Show in article · Read it in context on Wikipedia ↗
AddMonoidHom.instAddCommGroup more general
instance AddMonoidHom.instAddCommGroup {M : Type uM} {N : Type uN} [AddZeroClass M] [AddCommGroup N] : AddCommGroup (M →+ N)
Mathlib.Algebra.Group.Hom.Instances · line 114
Why more general: Mathlib puts the pointwise sum on the homomorphisms from any additive monoid into a commutative additive group, so the source need not be commutative there.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
a35f0a512756 · pair key dd71cec09ff4.
MonoidHom.instCommGroup more general
instance MonoidHom.instCommGroup {M : Type uM} {N : Type uN} [MulOneClass M] [CommGroup N] : CommGroup (M →* N)
Mathlib.Algebra.Group.Hom.Instances · lines 116–119
Why more general: This is the same construction with the groups written multiplicatively, and again the source is only required to carry a unit and a multiplication.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
5c10afbd2af2 · pair key 512db0c9d1ff.
Sign in to tag this passage
-
Definition · main statement · Homomorphisms of abelian groups
✓Formalized
Formalized: Mathlib states a more general result (a definition).
If G and H are abelian (i.e., commutative) groups, then the set Hom(G, H) of all group homomorphisms from G to H is itself an abelian group: the sum h + k of two homomorphisms is defined by
(h + k)(u) = h(u) + k(u) for all u in G.
Show in article · Read it in context on Wikipedia ↗
AddMonoidHom.add more general
instance AddMonoidHom.add {M : Type*} {N : Type*} [AddZeroClass M] [AddCommMonoid N] : Add (M →+ N)
Mathlib.Algebra.Group.Hom.Basic · line 238
Why more general: Mathlib builds the sum of two additive monoid morphisms whenever the codomain is a commutative additive monoid, a setting that contains the passage's abelian group H.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
21f231b5686e · pair key 07d279b89a5b.
AddMonoidHom.add_apply more general
theorem AddMonoidHom.add_apply {M : Type*} {N : Type*} [AddZeroClass M] [AddCommMonoid N] (f g : M →+ N) (x : M) : (f + g) x = f x + g x
Mathlib.Algebra.Group.Hom.Basic · line 250
Why more general: This lemma records the value of the sum homomorphism at a point, for a codomain that is only assumed to be a commutative additive monoid.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
41ef9f7ab465 · pair key bfd49f7877f5.
Sign in to tag this passage
-
Theorem · main statement · Homomorphisms of abelian groups
✓Formalized
Formalized by 2 parts together (more general):
AddMonoidHom.add_comp Mathlib (proved)- precomposition with f distributes over the sum: (h + k) ∘ f equals (h ∘ f) + (k ∘ f)
AddMonoidHom.comp_add Mathlib (proved)- postcomposition with g distributes over the sum: g ∘ (h + k) equals (g ∘ h) + (g ∘ k)
The addition of homomorphisms is compatible with the composition of homomorphisms in the following sense: if f is in Hom(K, G), h, k are elements of Hom(G, H), and g is in Hom(H, L), then
(h + k) ∘ f = (h ∘ f) + (k ∘ f) and g ∘ (h + k) = (g ∘ h) + (g ∘ k).
Show in article · Read it in context on Wikipedia ↗
AddMonoidHom.add_comp states part
theorem AddMonoidHom.add_comp {M : Type*} {N : Type*} {P : Type*} [AddZeroClass M] [AddCommMonoid N] [AddZeroClass P] (g₁ g₂ : M →+ N) (f : P →+ M) : (g₁ + g₂).comp f = g₁.comp f + g₂.comp f
Mathlib.Algebra.Group.Hom.Basic · line 252
Why only part: Mathlib proves this for additive monoid morphisms whose middle codomain is commutative, which covers the passage's three abelian groups.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
447377469ef7 · pair key c8322263a66b.
AddMonoidHom.comp_add states part
theorem AddMonoidHom.comp_add {M : Type*} {N : Type*} {P : Type*} [AddZeroClass M] [AddCommMonoid N] [AddCommMonoid P] (g : N →+ P) (f₁ f₂ : M →+ N) : g.comp (f₁ + f₂) = g.comp f₁ + g.comp f₂
Mathlib.Algebra.Group.Hom.Basic · line 256
Why only part: Mathlib proves this for additive monoid morphisms with commutative codomains, a setting that contains the passage's abelian groups.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
695be3309e3f · pair key c9c7c5fbed4e.
Sign in to tag this passage
-
Theorem · supporting · Homomorphisms of abelian groups
✓Formalized
Formalized: Mathlib states a more general result (proved).
Since the composition is associative, this shows that the set End(G) of all endomorphisms of an abelian group forms a ring, the endomorphism ring of G. For example, the endomorphism ring of the abelian group consisting of the direct sum of m copies of Z/nZ is isomorphic to the ring of m-by-m matrices with entries in Z/nZ.
Show in article · Read it in context on Wikipedia ↗
MonoidHom.comp_assoc more general
theorem MonoidHom.comp_assoc {M : Type*} {N : Type*} {P : Type*} {Q : Type*} [MulOne M] [MulOne N] [MulOne P] [MulOne Q] (f : M →* N) (g : N →* P) (h : P →* Q) : (h.comp g).comp f = h.comp (g.comp f)
Mathlib.Algebra.Group.Hom.Defs · lines 836–838
Why more general: Mathlib states associativity for morphisms of structures with a multiplication and a unit, and groups are among those structures.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
37abaef39c73 · pair key 811334c939b7.
AddMonoidHom.comp_assoc more general
theorem AddMonoidHom.comp_assoc {M : Type*} {N : Type*} {P : Type*} {Q : Type*} [AddZero M] [AddZero N] [AddZero P] [AddZero Q] (f : M →+ N) (g : N →+ P) (h : P →+ Q) : (h.comp g).comp f = h.comp (g.comp f)
Mathlib.Algebra.Group.Hom.Defs · line 835
Why more general: This is the additive form of the same associativity, matching the notation the section uses for its groups.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
73ef1aca5991 · pair key b5bdcc8b3f91.
Sign in to tag this passage
-
Definition · main statement · Homomorphisms of abelian groups
✓Formalized
Formalized: Mathlib states this exactly (a definition).
Since the composition is associative, this shows that the set End(G) of all endomorphisms of an abelian group forms a ring, the endomorphism ring of G.
Show in article · Read it in context on Wikipedia ↗
AddMonoid.End.instRing exact match
instance AddMonoid.End.instRing {M : Type uM} [AddCommGroup M] : Ring (AddMonoid.End M)
Mathlib.Algebra.Group.Hom.End · lines 52–56
Note: The ring structure is carried by the type of additive endomorphisms of G, with the sum taken pointwise and the product given by composing two endomorphisms.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
681480c70760 · pair key c2d20ae77eaa.
Sign in to tag this passage
-
Example · supporting · Homomorphisms of abelian groups
✕Not formalized
Since the composition is associative, this shows that the set End(G) of all endomorphisms of an abelian group forms a ring, the endomorphism ring of G. For example, the endomorphism ring of the abelian group consisting of the direct sum of m copies of Z/nZ is isomorphic to the ring of m-by-m matrices with entries in Z/nZ.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 5 queries and 5 candidates examined (receipt c15ac6d4c509). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · main statement · Homomorphisms of abelian groups
✓Formalized
Formalized: Mathlib states this exactly (a definition).
The above compatibility also shows that the category of all abelian groups with group homomorphisms forms a preadditive category; the existence of direct sums and well-behaved kernels makes this category the prototypical example of an abelian category.
Show in article · Read it in context on Wikipedia ↗
AddCommGrpCat.instPreadditive exact match
instance AddCommGrpCat.instPreadditive : CategoryTheory.Preadditive AddCommGrpCat
Mathlib.Algebra.Category.Grp.Preadditive · line 63
Note: Mathlib's AddCommGrpCat is the category whose objects are commutative additive groups and whose arrows are additive homomorphisms, and the instance puts the preadditive structure on it.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
5fe613a1b4c0 · pair key 7339d3ba2aab.
Sign in to tag this passage
-
Theorem · supporting · Homomorphisms of abelian groups
✓Formalized
Formalized: Mathlib states this exactly (a definition).
The above compatibility also shows that the category of all abelian groups with group homomorphisms forms a preadditive category; the existence of direct sums and well-behaved kernels makes this category the prototypical example of an abelian category.
Show in article · Read it in context on Wikipedia ↗
AddCommGrpCat.instAbelian exact match
instance AddCommGrpCat.instAbelian : CategoryTheory.Abelian AddCommGrpCat
Mathlib.Algebra.Category.Grp.Abelian · lines 42–44
Note: Mathlib's abelian-category class for this category carries its kernels, its cokernels and its finite biproducts, so the instance records both the direct sums and the kernels the passage mentions along with the conclusion.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
c58703f0d2a7 · pair key 37efb8195c18.
Related, but states something else
AddCommGrpCat.instHasFiniteBiproducts related
instance AddCommGrpCat.instHasFiniteBiproducts : CategoryTheory.Limits.HasFiniteBiproducts AddCommGrpCat
Mathlib.Algebra.Category.Grp.Biproducts · lines 27–28
How it differs: It records only that the category of abelian groups has finite biproducts, one ingredient the passage names on the way to its conclusion.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
505bdd5e4159 · pair key 1cdb6edc34d9.
Sign in to tag this passage