Theorem 1.20 (first part): is surjective
ProvedHatcher.vanKampenHom_surjectiveThroughout, is a topological space with basepoint , and is a family of subsets of , each containing , with the subspace topology. The standing hypotheses of Lemma 1.15 are: each is open and path-connected, , and each intersection is path-connected.
Theorem 1.20, first part. Under the standing hypotheses, the homomorphism
extending the inclusion-induced maps is surjective.
Hatcher notes this is a restatement of Lemma 1.15: a factorization of as a word in the is exactly a preimage under .
Formalization Note is Hatcher.vanKampenHom, built with Mathlib's Monoid.CoprodI.lift from the induced homomorphisms Hatcher.inclHom.
import Definitions.Def_Hatcher_VanKampen import Mathlib open Hatcher
namespace Hatcher
theorem vanKampenHom_surjective {X : Type*} [TopologicalSpace X] {ι : Type*}
(A : ι → Set X) (x₀ : X) (hx₀ : ∀ α, x₀ ∈ A α)
(hopen : ∀ α, IsOpen (A α)) (hpc : ∀ α, IsPathConnected (A α))
(hcover : (⋃ α, A α) = Set.univ) (hinter : ∀ α β, IsPathConnected (A α ∩ A β)) :
Function.Surjective (vanKampenHom A x₀ hx₀) := by sorry
end HatcherRead-back
What the Lean code literally says, in plain math · claude-fable-5-1
Read-back: Hatcher.vanKampenHom_surjective
Setting and binders. Let be an arbitrary topological space (no separation, compactness, or other axioms are assumed) and let be an arbitrary index type (it may be finite, infinite, or empty). The data of the theorem are:
- a family of subsets , one for each ;
- a point ;
- a proof that for every .
Each is regarded as a topological space with the subspace topology inherited from , and , viewed as a point of (this is what the auxiliary definition basept produces: the pair " together with the proof "), serves as the basepoint of . Because the hypothesis is required for every , the case in which some does not contain is excluded.
Hypotheses. In addition to , the theorem assumes all of the following:
- (hopen) For every , the set is open in .
- (hpc) For every , the set is path-connected in the following exact sense: there exists a point such that for every there is a continuous map with , , and for all . (In particular this forces , which is already guaranteed by .)
- (hcover) The union equals the whole space .
- (hinter) For every ordered pair — including the diagonal pairs , for which the condition reduces to hypothesis 2 — the intersection is path-connected in the same sense as in item 2: there exists joined to every point of by a path staying inside . (Since , these intersections are all nonempty.) No hypothesis is stated about intersections of three or more of the sets.
Edge case. If is empty, then , whereas contains the point , so hypothesis 3 cannot hold; the hypotheses are jointly unsatisfiable in that case and the theorem says nothing. For nonempty the hypotheses are consistent (e.g. a single set when is path-connected).
The objects in the conclusion. The conclusion is a statement about a specific group homomorphism, built as follows.
-
For a topological space and a point , the fundamental group used here is the group of endomorphisms of the object in the fundamental groupoid of . Concretely, its elements are equivalence classes of loops at — continuous maps with — under homotopy relative to the endpoints ; the identity is the class of the constant loop; and the product of two classes is the class of the concatenation "first , then " (the endomorphism-monoid convention , where denotes concatenation in the order written). Inverses are given by reversing loops.
-
For each , the homomorphism
(the definition inclHom) is the homomorphism induced, via the general "map of fundamental groups along a continuous map with a specified equation on basepoints", by the inclusion map , , together with the (definitionally trivial) fact that the inclusion sends the basepoint to . On representatives, sends the class of a loop in to the class of the same loop regarded as a loop in (after a basepoint-recasting along the trivial equation ).
- The group (the definition
FreeProd) is
the free product of the family of groups , , in Mathlib's sense: the quotient of the free monoid on the disjoint union of the underlying sets by the monoid congruence generated by the relations " empty word" and "" for all and . It carries the group structure whose inverse reverses a word and inverts each letter. Each maps into by the canonical inclusion sending to the one-letter word . When is empty, is the trivial group.
- The homomorphism
(the definition vanKampenHom) is the unique monoid homomorphism obtained from the family by the universal property of the free product, i.e. the unique homomorphism with for all and all . On a general word it takes the value in , and it sends the empty word to the identity. Note that depends only on the data , , ; none of the hypotheses 1–4 enters its construction.
Conclusion. The theorem asserts that is surjective in the literal sense:
That is: every homotopy class of loops in based at is equal to for some element of the free product of the groups ; equivalently, every such class can be written as a finite product (with ) of images of classes of loops based at lying in single sets . Nothing is asserted about the kernel of , about injectivity, or about any relations among the ; the statement is purely the existence of a preimage for each element of .
Hypothesis usage. Hypotheses 1 (openness), 2 (path-connectedness of each ), 3 (covering), and 4 (path-connectedness of each pairwise intersection) appear only as assumptions; the conclusion's statement does not mention them, and they would be available only to a proof. The hypothesis is used in forming the basepoints and hence in the very statement of the conclusion.
Confirmed by the mission captain (proposal self-audit).