Two matched free factors give an indexed basis for the van Kampen free product
ProvedHatcher.matched_cover_factor_basis_v1This is the algebraic free-product certificate used after a two-piece van Kampen cover has been constructed. Suppose the old factor has a free-group basis B₀ indexed by Fin n, the new factor has a cyclic free-group basis B₁ indexed by Fin 1, and the two factor isomorphisms are fold and enew. If their inclusion images are the named global generators q j.castSucc and q (Fin.last n), then the free product has a free-group basis indexed by Fin (n+1) whose old indices lie in the first factor and whose last index lies in the second factor. The final clause records that the canonical van Kampen homomorphism sends every indexed basis element to the corresponding named generator. This theorem contains no geometric cover hypothesis and no injectivity assumption; it is a reusable construction of the matched factor certificate.
import Mathlib import Definitions.Def_Hatcher_VanKampen
import Mathlib
import Definitions.Def_Hatcher_VanKampen
namespace Hatcher
noncomputable section
open scoped Pointwise
theorem matched_cover_factor_basis_v1 {X : Type*} [TopologicalSpace X]
{A : Bool → Set X} {x₀ : X}
{G₀ G₁ : Type*} [Group G₀] [Group G₁]
{n : ℕ}
(hx₀ : ∀ i, x₀ ∈ A i)
(B₀ : FreeGroupBasis (Fin n) G₀)
(B₁ : FreeGroupBasis (Fin 1) G₁)
(fold : G₀ ≃* FundamentalGroup (A Bool.false)
(basept A x₀ hx₀ Bool.false))
(enew : G₁ ≃* FundamentalGroup (A Bool.true)
(basept A x₀ hx₀ Bool.true))
(q : Fin (n + 1) → FundamentalGroup X x₀)
(himages : ∀ j : Fin n,
inclHom A x₀ hx₀ Bool.false (fold (B₀ j)) = q j.castSucc)
(hnew : inclHom A x₀ hx₀ Bool.true (enew (B₁ 0)) = q (Fin.last n)) :
∃ B : FreeGroupBasis (Fin (n + 1))
(FreeProd A x₀ hx₀),
(∀ j : Fin n, B j.castSucc =
(Monoid.CoprodI.of (fold (B₀ j)) : FreeProd A x₀ hx₀)) ∧
B (Fin.last n) =
(Monoid.CoprodI.of (enew (B₁ 0)) : FreeProd A x₀ hx₀) ∧
(∀ j : Fin (n + 1), vanKampenHom A x₀ hx₀ (B j) = q j) := by sorry
end
end Hatcher