Corrected composition law for the inertia groupoid of Lemma E.6.3.6:
ProvedMasulloRepair.inertia_groupoid_composition_correctedSetting. Let be a groupoid in sets in the sense of Definition E.4.1.1 of the manuscript: , a composition defined for , a unit and an inversion with
- , for composable ;
- whenever and ;
- ; ;
- , ; , .
(In the formal statement is total and the axioms are imposed on composable pairs only.) Following Definition E.6.3.4 and Lemma E.6.3.6 (p. 925), let be the inertia, , and (that is, ).
Statement. Let with , i.e. . Then:
- , so is defined;
- the value printed in Lemma E.6.3.6(3), , lies in if and only if : formally ;
- the corrected value lies in : (and by hypothesis);
- the corrected value has the right target:
Its source is by definition.
Relation to the manuscript. This is a corrected version of the composition law in item (3) of Lemma E.6.3.6 (p. 925), which is printed as . By (2) the printed formula leaves whenever is not a loop (a concrete instance is MasulloAudit.inertia_groupoid_printed_composition_leaves_fibre_product); by (1), (3), (4) the formula is well defined on and compatible with and , as required by axiom (1)(a) of Definition E.4.1.1. The theorem is purely set-theoretic; it does not address continuity, the remaining groupoid axioms for , or the equivalence of stacks asserted in the second half of the lemma.
import Mathlib.Logic.Basic import Mathlib.Tactic.Common
theorem MasulloRepair.inertia_groupoid_composition_corrected
{X R : Type*} (s t : R → X) (c : R → R → R) (e : X → R) (i : R → R)
(hc : ∀ x y, s x = t y → t (c x y) = t x ∧ s (c x y) = s y)
(hassoc : ∀ x y z, s x = t y → s y = t z → c x (c y z) = c (c x y) z)
(he : ∀ a, s (e a) = a ∧ t (e a) = a)
(hid : ∀ x, c x (e (s x)) = x ∧ c (e (t x)) x = x)
(hi : ∀ x, s (i x) = t x ∧ t (i x) = s x)
(hinv : ∀ x, c x (i x) = e (t x) ∧ c (i x) x = e (s x))
(r g r' g' : R)
(hg : s g = t g) (hr : s r = s g)
(hg' : s g' = t g') (hr' : s r' = s g')
(hgeq : g = c r' (c g' (i r'))) :
s r = t r' ∧
(s (c r r') = s g ↔ s r' = t r') ∧
s (c r r') = s g' ∧
c (c r r') (c g' (i (c r r'))) = c r (c g (i r)) := by sorry