The composition law printed in Lemma E.6.3.6(3), , does not land in
ProvedMasulloAudit.inertia_groupoid_printed_composition_leaves_fibre_productSetting. A groupoid in sets in the sense of Definition E.4.1.1 of the manuscript is a tuple : sets (objects) and (morphisms), maps , a composition defined on the pairs with , a unit and an inversion , such that
- and for composable ;
- whenever and ;
- ;
- ;
- , ;
- and .
In the formal statement is a total function and the axioms are imposed on composable pairs only, which is the same data as a function on the fibre product.
For a topological groupoid , Definition E.6.3.4 puts , and Lemma E.6.3.6 (p. 925) sets
and asserts that , with the uniquely determined unit and inverse, is a topological groupoid.
Statement. There is a groupoid in sets (the pair groupoid on a two-point set: , , , , , , ; with the discrete topologies it is a topological groupoid) and elements such that
- and , i.e. , , , ;
- the pair is composable in the printed sense, , i.e. ;
- but , so the printed value is not an element of .
Relation to the manuscript. This refutes item (3) of Lemma E.6.3.6 as printed: the displayed formula does not define a map , so with this is not a groupoid. (Reading the fibre product with the opposite convention does not help: then itself is not defined in general.) The slip is in the second component: the composite of followed by must have source , so the formula should read . The companion theorem MasulloRepair.inertia_groupoid_composition_corrected proves, for every groupoid in sets, that the printed value lies in exactly when and that the corrected value lies in and has the right target. Nothing is claimed here about the rest of Lemma E.6.3.6 (the equivalence of stacks ) or about any later use of it.
import Mathlib.Data.Fintype.Prod import Mathlib.Tactic.Common
theorem MasulloAudit.inertia_groupoid_printed_composition_leaves_fibre_product :
∃ (s t : Bool × Bool → Bool) (c : Bool × Bool → Bool × Bool → Bool × Bool)
(e : Bool → Bool × Bool) (i : Bool × Bool → Bool × Bool),
(∀ x y, s x = t y → t (c x y) = t x ∧ s (c x y) = s y) ∧
(∀ x y z, s x = t y → s y = t z → c x (c y z) = c (c x y) z) ∧
(∀ a, s (e a) = a ∧ t (e a) = a) ∧
(∀ x, c x (e (s x)) = x ∧ c (e (t x)) x = x) ∧
(∀ x, s (i x) = t x ∧ t (i x) = s x) ∧
(∀ x, c x (i x) = e (t x) ∧ c (i x) x = e (s x)) ∧
∃ r g r' g' : Bool × Bool,
s g = t g ∧ s r = s g ∧
s g' = t g' ∧ s r' = s g' ∧
g = c r' (c g' (i r')) ∧
s (c r r') ≠ s g := by sorry