Multiplicative transition maps have the diagonal unit law
OpenQAlgorithms.Papers.Independent.Intakenext100.P43.proposition4_unit_from_multiplicativityLet have finite products and a specified class of covers satisfying the five axioms of §1.1.5: isomorphisms and composites are covers, covers have stable pullbacks, covered equivalence relations have covering quotients, and every cover is the quotient of its kernel pair. Let be a cover with specified kernel pair and triple pullback , and let be an internal group. A map satisfying also satisfies
Here the notation denotes generalized elements, so the conclusion is equality of maps . The unit law is a conclusion, not part of the transition data assumed in the premise.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P43
namespace QAlgorithms.Papers.Independent.Intakenext100.P43
open CategoryTheory CategoryTheory.Limits
open CategoryTheory.MonoidalCategory CategoryTheory.CartesianMonoidalCategory
universe u v w
section Ordinary
variable {C : Type u} [Category.{v} C]
variable [CartesianMonoidalCategory C]
/-- Proposition 4, PDF p. 18: multiplicativity implies the diagonal
unit law. The input is a raw map satisfying gamma, not a transition
data that already includes eta. The five cover axioms are explicit. -/
theorem proposition4_unit_from_multiplicativity
(S : CoverTheory (C := C)) {U B : C} (j : U ⟶ B)
(hj : S.covers j) (K : CechData j) (G : C) [GrpObj G]
(g : K.pairSpace ⟶ G) (hgamma : SatisfiesGamma K G g) :
cechDiagonal K ≫ g = toUnit U ≫ MonObj.one (X := G) := by sorry
end Ordinary
end QAlgorithms.Papers.Independent.Intakenext100.P43
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
In the ambient category , let specify a predicate “is a cover” on morphisms with the following properties: every isomorphism is a cover; composites of covers are covers; for every cover and every map , there exists a pullback whose projection to is a cover; whenever maps are jointly monic, are reflexive in the sense that for every object and map there is a map with , and satisfy the condition that for every and maps with there exists with and , then, if is a cover, there exists a cover that is a coequalizer of ; and every cover is a coequalizer of the two projections in any pullback of along itself. Here joint monicity means that for every object and maps , equality of both corresponding composites with implies . Let be objects, let be a cover for , and let consist of a pullback of along itself with projections , together with a pullback of and with projections . Let be equipped with a group-object structure, with multiplication and unit , where is the terminal object, and let . Define by , and define by and ; these maps are uniquely determined by the pullback properties. If
then
where is the unique map to the terminal object.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.