Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Example 1.5

Proved
QAlgorithms.Papers.Independent.Intakenext100.P09.example_1_5

by Gohan · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let GGG be a topological group and U⊆GU\subseteq GU⊆G an open set containing the identity. Define UU={gU:g∈G}\mathcal U_U=\{gU:g\in G\}UU​={gU:g∈G}. Then UU\mathcal U_UUU​ is an invariant open cover of GGG. In each degree n≥0n\ge0n≥0, let

UU[n]=⋃g∈G(gU)n+1.\mathcal U_U[n]=\bigcup_{g\in G}(gU)^{n+1}.UU​[n]=g∈G⋃​(gU)n+1.

These sets are open and invariant under simultaneous left translation. Every coordinate-selection map, including every face and degeneracy map, sends the corresponding set into the set in its target degree. Thus they form an open simplicial GGG-subspace of G∙+1G^{\bullet+1}G∙+1. Invariance refers to the translated family; its individual members need not be invariant.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P09
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P09

universe u v w

/-- PDF p. 3, Example 1.5: translated identity neighborhoods cover the group,
are invariant as a family, and give an open simplicial invariant subspace.
All coordinate maps include faces and degeneracies. -/
theorem example_1_5 {G : Type u} [Group G] [TopologicalSpace G] [IsTopologicalGroup G]
    (U : Set G) (hU : IsOpen U) (h1 : (1 : G) ∈ U) :
    ∃ C : OpenCover G, C.sets = translatedFamily U ∧ InvariantCover G C ∧
      (∀ n : ℕ, IsOpen (coverDiagonal C n)) ∧
      (∀ (n : ℕ) (x : Fin (n + 1) → G), x ∈ coverDiagonal C n →
        ∀ g : G, (fun i => g * x i) ∈ coverDiagonal C n) ∧
      (∀ (n m : ℕ) (a : Fin (m + 1) → Fin (n + 1)) (x : Fin (n + 1) → G),
        x ∈ coverDiagonal C n → x ∘ a ∈ coverDiagonal C m) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P09

end
Source
A Spectral Sequence Connecting Continuous With Locally Continuous Group Cohomology, arXiv:1110.0994v1, PDF p. 3, Example 1.5
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let GGG be a topological group and let U⊆GU\subseteq GU⊆G be open and contain the identity element. There exists an open cover CCC of GGG, meaning a family of open subsets whose union is GGG, whose family of members is exactly {gU:g∈G}\{gU:g\in G\}{gU:g∈G}, where gU={gu:u∈U}gU=\{gu:u\in U\}gU={gu:u∈U}. This cover is invariant under left translation: for every g∈Gg\in Gg∈G and every member WWW of CCC, the set gWgWgW is also a member of CCC. For each natural number n≥0n\geq 0n≥0, define

Dn={(x0,…,xn)∈Gn+1:all xi lie in one member of C}.D_n=\{(x_0,\ldots,x_n)\in G^{n+1}:\text{all }x_i\text{ lie in one member of }C\}.Dn​={(x0​,…,xn​)∈Gn+1:all xi​ lie in one member of C}.

Every DnD_nDn​ is open in the product topology; whenever x∈Dnx\in D_nx∈Dn​ and g∈Gg\in Gg∈G, the tuple (gx0,…,gxn)(gx_0,\ldots,gx_n)(gx0​,…,gxn​) also belongs to DnD_nDn​; and for all natural numbers n,m≥0n,m\geq 0n,m≥0, every map a:{0,…,m}→{0,…,n}a:\{0,\ldots,m\}\to\{0,\ldots,n\}a:{0,…,m}→{0,…,n}, and every x∈Dnx\in D_nx∈Dn​, the tuple (xa(0),…,xa(m))(x_{a(0)},\ldots,x_{a(m)})(xa(0)​,…,xa(m)​) belongs to DmD_mDm​. The map aaa need not be injective or surjective, so repetitions and omissions are included. In degree 000, D0=G1D_0=G^1D0​=G1.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me