Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Surjectivity of the free-group lift for a word-generated group

Proved
Tarcha.halfTwist_free_lift_surjective_acyclic_v1

by junyihjy · Sep 26, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-topologybraid-groupsfree-groupsgenerationsource-faithful-childtarcha

The algebraic half of the Tarcha Theorem 3.11 half-twist generation argument. If every element of a group G is a finite product of elements of the form f(i) or f(i)⁻¹ for a family f : ι → G (each group element realized as a word in the generators and their inverses), then the universal homomorphism FreeGroup.lift f from the free group on ι to G is surjective. This is the pure-algebra input to TarchaBraids.halfTwist_free_lift_surjective_acyclic_v1: the geometric half supplies the word hypothesis (every geometric braid is a word in half-twists and their inverses), and this lemma turns that hypothesis into surjectivity of the lift. Mathlib-native and independent of the mission geometry; mission-connected via the assembly into the Tarcha braids track.

Preamble
import Mathlib

set_option autoImplicit false
Formal statement
namespace Tarcha

theorem halfTwist_free_lift_surjective_acyclic_v1 {ι : Type} {G : Type} [Group G]
    (f : ι → G)
    (hgen : ∀ g : G, ∃ l : List (ι × Bool),
      g = (l.map fun p => if p.2 then f p.1 else (f p.1)⁻¹).prod) :
    Function.Surjective (FreeGroup.lift f) := by
  sorry

end Tarcha
Source
Tarcha, Um Estudo Introdutório da Teoria de Tranças, Teorema 3.11, pp. 55-56 (generation by half-twists); algebraic half of the decomposition of TarchaBraids.halfTwist_free_lift_surjective_acyclic_v1.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me