Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7.4.6: transfer of symmetry and Picardness

Open
QAlgorithms.Papers.Independent.Intakenext100.P71.braidedButterfly_transfer

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

prove2quantum

Let [H∙,E,G∙][H_\bullet,E,G_\bullet][H∙​,E,G∙​] be a braided butterfly on a subcanonical site SSS, with specified right-action brackets cHc_HcH​ and cGc_GcG​. A bracket is symmetric when c(x,y)=c(y,x)−1c(x,y)=c(y,x)^{-1}c(x,y)=c(y,x)−1, and Picard when it is symmetric and c(x,x)=1c(x,x)=1c(x,x)=1, for all local sections.

  1. If j:E→G0j:E\to G_0j:E→G0​ is locally epimorphic, symmetry of cHc_HcH​ implies symmetry of cGc_GcG​, and Picardness of cHc_HcH​ implies Picardness of cGc_GcG​.
  2. If κ:H1→E\kappa:H_1\to Eκ:H1​→E is a monomorphism, the reverse implications hold.

Consequently, for a reversible braided butterfly,

H∙ is symmetric  ⟺  G∙ is symmetric,H∙ is Picard  ⟺  G∙ is Picard.H_\bullet\text{ is symmetric}\iff G_\bullet\text{ is symmetric},\qquad H_\bullet\text{ is Picard}\iff G_\bullet\text{ is Picard}.H∙​ is symmetric⟺G∙​ is symmetric,H∙​ is Picard⟺G∙​ is Picard.

These statements allow commutativity constraints to pass along suitable weak morphisms and equivalences. The monomorphism condition in the second part is the explicit condition used by the source cancellation argument.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P71
Formal statement
namespace QAlgorithms.Papers.Independent.Intakenext100.P71

open CategoryTheory Opposite

universe u v w

variable {C : Type u} [Category.{v} C]

variable {J : GrothendieckTopology C}

/-- Lemma 7.4.6 and its following reversible consequence,
arXiv:0808.3627v2, PDF p.72.
Correction: the second premise is the explicit monicity of kappa used by
the cancellation argument; the printed equivalence with triviality of the
entire homotopy kernel is false. Both symmetry and Picardness are retained. -/
theorem braidedButterfly_transfer [J.Subcanonical]
    {H G : RightCrossedModule.{u, v, w} J}
    (E : Butterfly H G) (cH : Braiding H) (cG : Braiding G)
    (hbraided : E.IsBraided cH cG) :
    (IsLocalEpi E.j →
      (cH.IsSymmetric → cG.IsSymmetric) ∧ (cH.IsPicard → cG.IsPicard)) ∧
    ((∀ U, Function.Injective (onSections E.kappa U)) →
      (cG.IsSymmetric → cH.IsSymmetric) ∧ (cG.IsPicard → cH.IsPicard)) ∧
    (E.IsReversible →
      (cH.IsSymmetric ↔ cG.IsSymmetric) ∧ (cH.IsPicard ↔ cG.IsPicard)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P71
Source
Butterflies I: morphisms of 2-group stacks, arXiv:0808.3627v2, PDF p. 72, Lemma 7.4.6: transfer of symmetry and Picardness
Read-back

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

Let JJJ be a subcanonical Grothendieck topology on a category CCC, meaning that every representable presheaf is a JJJ-sheaf. Let H,GH,GH,G be given by group sheaves M1,M0M_1,M_0M1​,M0​, natural group homomorphisms dM:M1→M0d_M:M_1\to M_0dM​:M1​→M0​, and restriction-compatible right actions axa^xax by group automorphisms satisfying dM(ax)=x−1dM(a)xd_M(a^x)=x^{-1}d_M(a)xdM​(ax)=x−1dM​(a)x and adM(b)=b−1aba^{d_M(b)}=b^{-1}abadM​(b)=b−1ab, for M∈{H,G}M\in\{H,G\}M∈{H,G} and every appropriate section at every object. Let EEE consist of a group sheaf BBB and natural group homomorphisms κ:H1→B\kappa:H_1\to Bκ:H1​→B, ι:G1→B\iota:G_1\to Bι:G1​→B, π:B→H0\pi:B\to H_0π:B→H0​, and j:B→G0j:B\to G_0j:B→G0​, satisfying objectwise πκ=dH\pi\kappa=d_Hπκ=dH​, jι=dGj\iota=d_Gjι=dG​, jκ=1j\kappa=1jκ=1, and πι=1\pi\iota=1πι=1. Assume that every ιU\iota_UιU​ is injective, that πU(e)=1\pi_U(e)=1πU​(e)=1 exactly when e=ιU(g)e=\iota_U(g)e=ιU​(g) for some g∈G1(U)g\in G_1(U)g∈G1​(U), and that every section of H0(U)H_0(U)H0​(U) lifts through π\piπ after restriction along each arrow of some JJJ-covering sieve on UUU. Assume also ιU(gjU(e))=e−1ιU(g)e\iota_U(g^{j_U(e)})=e^{-1}\iota_U(g)eιU​(gjU​(e))=e−1ιU​(g)e and κU(hπU(e))=e−1κU(h)e\kappa_U(h^{\pi_U(e)})=e^{-1}\kappa_U(h)eκU​(hπU​(e))=e−1κU​(h)e for all appropriate sections. For M=H,GM=H,GM=H,G, let cMc_McM​ provide brackets [a,b]M,U∈M1(U)[a,b]_{M,U}\in M_1(U)[a,b]M,U​∈M1​(U), natural under restriction, satisfying, for every object and appropriate sections,

dM([a,b]M)=b−1a−1ba,[a,bc]M=[a,b]M c[a,c]M,[ab,c]M=[b,c]M[a,c]M b,[a,dM(h)]M=h−1ha,[dM(g),b]M=(gb)−1g.\begin{aligned} d_M([a,b]_M)&=b^{-1}a^{-1}ba,& [a,bc]_M&=[a,b]_M^{\,c}[a,c]_M,& [ab,c]_M&=[b,c]_M[a,c]_M^{\,b},\\ [a,d_M(h)]_M&=h^{-1}h^a,& [d_M(g),b]_M&=(g^b)^{-1}g. \end{aligned}dM​([a,b]M​)[a,dM​(h)]M​​=b−1a−1ba,=h−1ha,​[a,bc]M​[dM​(g),b]M​​=[a,b]Mc​[a,c]M​,=(gb)−1g.​[ab,c]M​=[b,c]M​[a,c]Mb​,

Assume, for every UUU and x,y∈B(U)x,y\in B(U)x,y∈B(U), that κU([πU(x),πU(y)]H,U) ιU([jU(x),jU(y)]G,U)=y−1x−1yx\kappa_U([\pi_U(x),\pi_U(y)]_{H,U})\,\iota_U([j_U(x),j_U(y)]_{G,U})=y^{-1}x^{-1}yxκU​([πU​(x),πU​(y)]H,U​)ιU​([jU​(x),jU​(y)]G,U​)=y−1x−1yx. Write SMS_MSM​ for the condition [a,b]M,U=([b,a]M,U)−1[a,b]_{M,U}=([b,a]_{M,U})^{-1}[a,b]M,U​=([b,a]M,U​)−1 for every U,a,bU,a,bU,a,b, and write PMP_MPM​ for the conjunction of SMS_MSM​ with [a,a]M,U=1[a,a]_{M,U}=1[a,a]M,U​=1 for every U,aU,aU,a. Write LjL_jLj​ for the following precise local lifting condition: for every UUU and z∈G0(U)z\in G_0(U)z∈G0​(U), there is a JJJ-covering sieve RRR on UUU such that for each arrow i:V→Ui:V\to Ui:V→U in RRR, some e∈B(V)e\in B(V)e∈B(V) satisfies jV(e)=z∣ij_V(e)=z|_ijV​(e)=z∣i​. Then the following three implications hold simultaneously:

Lj ⟹ ((SH⟹SG) ∧ (PH⟹PG)),(∀U, κU is injective) ⟹ ((SG⟹SH) ∧ (PG⟹PH)),[(∀U, κU is injective)∧(∀U, ∀e∈B(U), jU(e)=1 ⟺ ∃h∈H1(U), κU(h)=e)∧Lj] ⟹ ((SH⟺SG) ∧ (PH⟺PG)).\begin{aligned} L_j&\ \Longrightarrow\ \bigl((S_H\Longrightarrow S_G)\ \land\ (P_H\Longrightarrow P_G)\bigr),\\ \bigl(\forall U,\ \kappa_U\text{ is injective}\bigr) &\ \Longrightarrow\ \bigl((S_G\Longrightarrow S_H)\ \land\ (P_G\Longrightarrow P_H)\bigr),\\ \Bigl[ (\forall U,\ \kappa_U\text{ is injective}) \land \bigl(\forall U,\ \forall e\in B(U),\ j_U(e)=1\ \Longleftrightarrow\ \exists h\in H_1(U),\ \kappa_U(h)=e\bigr) \land L_j \Bigr] &\ \Longrightarrow\ \bigl((S_H\Longleftrightarrow S_G)\ \land\ (P_H\Longleftrightarrow P_G)\bigr). \end{aligned}Lj​(∀U, κU​ is injective)[(∀U, κU​ is injective)∧(∀U, ∀e∈B(U), jU​(e)=1 ⟺ ∃h∈H1​(U), κU​(h)=e)∧Lj​]​ ⟹ ((SH​⟹SG​) ∧ (PH​⟹PG​)), ⟹ ((SG​⟹SH​) ∧ (PG​⟹PH​)), ⟹ ((SH​⟺SG​) ∧ (PH​⟺PG​)).​

All quantifiers include trivial section groups, and CCC may be empty, making the objectwise requirements vacuous.

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