Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Internal Grp categories correspond to group objects in Cat

Proved
QAlgorithms.Papers.Independent.Intake100.P20.internalGrpAndGroupCat

by Gohan · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let OOO and AAA be groups, equipped with source, target, identity and partial composition maps defining a small category. This is an internal category in Grp exactly when pointwise multiplication, unit and inversion on objects and arrows define a strict group object in Cat. The multiplication functor has

μO(x,y)=xy,μA(f,g)=fg.\mu_O(x,y)=xy,\qquad\mu_A(f,g)=fg.μO​(x,y)=xy,μA​(f,g)=fg.

The unit functor from the one-object discrete category picks out 1O1_O1O​ and 1A1_A1A​, and the inversion functor uses the two group inversions. In the reverse translation these functors give precisely the same group operations and category maps. Functoriality of multiplication is the interchange law; the original group structures supply associativity and both inverse laws. This states the source's inverse structure translations, without enlarging the assertion to an equivalence of unspecified categories of internal functors.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intake100_P20
Formal statement
namespace QAlgorithms.Papers.Independent.Intake100.P20

open CategoryTheory

open scoped TensorProduct Manifold ContDiff

universe u v w z

/-- PDF p. 8: the explicit mutually inverse structure translations between
internal Grp categories and strict group objects in Cat. Under total-arrow
coordinates both translations retain the category and BOTH pointwise groups.
This claims no additional equivalence of categories of internal functors. -/
theorem internalGrpAndGroupCat {A : Type u} {O : Type v} [Group A] [Group O]
    (D : CategoryMaps A O) :
    InternalCategoryInGrp D ↔ GroupObjectInCat D := by sorry

end QAlgorithms.Papers.Independent.Intake100.P20
Source
Group Objects and Internal Categories, arXiv:math/0212065v1, PDF p. 8, §3
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For arbitrary groups A,OA,OA,O and total maps s,t:A→Os,t:A\to Os,t:A→O, i:O→Ai:O\to Ai:O→A, and c:A×A→Ac:A\times A\to Ac:A×A→A, the theorem asserts an equivalence between two conditions described as follows. Let C\mathcal CC mean the conjunction of s(i(x))=t(i(x))=xs(i(x))=t(i(x))=xs(i(x))=t(i(x))=x for every x∈Ox\in Ox∈O; s(c(g,f))=s(f)s(c(g,f))=s(f)s(c(g,f))=s(f) and t(c(g,f))=t(g)t(c(g,f))=t(g)t(c(g,f))=t(g) whenever t(f)=s(g)t(f)=s(g)t(f)=s(g); c(i(t(f)),f)=fc(i(t(f)),f)=fc(i(t(f)),f)=f and c(f,i(s(f)))=fc(f,i(s(f)))=fc(f,i(s(f)))=f for every f∈Af\in Af∈A; and c(h,c(g,f))=c(c(h,g),f)c(h,c(g,f))=c(c(h,g),f)c(h,c(g,f))=c(c(h,g),f) whenever t(f)=s(g)t(f)=s(g)t(f)=s(g) and t(g)=s(h)t(g)=s(h)t(g)=s(h). Let H\mathcal HH mean the conjunction of s(1A)=t(1A)=1Os(1_A)=t(1_A)=1_Os(1A​)=t(1A​)=1O​, s(ab)=s(a)s(b)s(ab)=s(a)s(b)s(ab)=s(a)s(b) and t(ab)=t(a)t(b)t(ab)=t(a)t(b)t(ab)=t(a)t(b) for every a,b∈Aa,b\in Aa,b∈A, i(1O)=1Ai(1_O)=1_Ai(1O​)=1A​, i(xy)=i(x)i(y)i(xy)=i(x)i(y)i(xy)=i(x)i(y) for every x,y∈Ox,y\in Ox,y∈O, c(1A,1A)=1Ac(1_A,1_A)=1_Ac(1A​,1A​)=1A​, and c(gb,fa)=c(g,f)c(b,a)c(gb,fa)=c(g,f)c(b,a)c(gb,fa)=c(g,f)c(b,a) for every f,g,a,b∈Af,g,a,b\in Af,g,a,b∈A satisfying t(f)=s(g)t(f)=s(g)t(f)=s(g) and t(a)=s(b)t(a)=s(b)t(a)=s(b). The first condition is C∧H\mathcal C\land\mathcal HC∧H. The second condition is C∧H\mathcal C\land\mathcal HC∧H together with s(a−1)=s(a)−1s(a^{-1})=s(a)^{-1}s(a−1)=s(a)−1 and t(a−1)=t(a)−1t(a^{-1})=t(a)^{-1}t(a−1)=t(a)−1 for every a∈Aa\in Aa∈A, i(x)−1=i(x−1)i(x)^{-1}=i(x^{-1})i(x)−1=i(x−1) for every x∈Ox\in Ox∈O, and c(g,f)−1=c(g−1,f−1)c(g,f)^{-1}=c(g^{-1},f^{-1})c(g,f)−1=c(g−1,f−1) for every f,g∈Af,g\in Af,g∈A with t(f)=s(g)t(f)=s(g)t(f)=s(g). These two conditions are equivalent, with no further assumptions on the total composition map outside the cases constrained by the listed equations.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me