Documentation

GQ2.Roe.Devissage.LESCore

§5.11 dévissage on the r_R spine: the long exact sequence — SES of complexes and connecting maps #

Mechanical R-spine clone of GQ2/Devissage/LESCore.lean (campaign decision, docs/orchestration/roe-r20-recon.md); proofs ported verbatim. Spine renames Z1w → Z1wR, H1w → H1wR, H2w → H2wR, d1Fun → d1FunR, d1 → d1R, mixedB → mixedB_R, WildRel → WildRelR, IsSelfDual(W) → IsSelfDual(W)_R, with R-suffixed public names. The (A) degreewise-exactness helpers pi_g_surjective, pi_exact, prod_g_surjective, prod_exact are reused from GQ2.Devissage.LESCore, never cloned.

The long exact sequence #

A module SES 0 → A' --f--> A --g--> A'' → 0 (with C-equivariant f, g) induces a short exact sequence of word complexes; the degreewise functors (·)⁴ and (·)² are exact. From this we build the connecting maps and the nine-term LES.

The connecting map δ¹ : H¹w(A'') → H²w(A') (snake) #

noncomputable def GQ2.FoxH.snakeLift_R {A : Type u_3} {A'' : Type u_4} [AddCommGroup A] [AddCommGroup A''] (g : A →+ A'') (hsurj : Function.Surjective g) (c'' : Fin 4A'') :
Fin 4A

A chosen lift of a degree-1 A''-cochain to A⁴ (via g surjective).

Equations
Instances For
    @[simp]
    theorem GQ2.FoxH.snakeLift_spec_R {A : Type u_3} {A'' : Type u_4} [AddCommGroup A] [AddCommGroup A''] (g : A →+ A'') (hsurj : Function.Surjective g) (c'' : Fin 4A'') (i : Fin 4) :
    g (snakeLift_R g hsurj c'' i) = c'' i
    theorem GQ2.FoxH.snake_d1_mem_R {C : Type u_1} [Group C] {A : Type u_3} {A'' : Type u_4} [AddCommGroup A] [DistribMulAction C A] [Finite A] [AddCommGroup A''] [DistribMulAction C A''] [Finite A''] [Finite C] (g : A →+ A'') (hg : ∀ (c : C) (a : A), g (c a) = c g a) (hsurj : Function.Surjective g) (t : Marking C) (c'' : (Z1wR t)) :
    (g.prodMap g) ((d1R t) (snakeLift_R g hsurj c'')) = 0

    For a cocycle c'' ∈ Z¹w(A''), of its lift lands in ker(g × g).

    noncomputable def GQ2.FoxH.snakeZ_R {C : Type u_1} [Group C] {A' : Type u_2} {A : Type u_3} {A'' : Type u_4} [AddCommGroup A'] [AddCommGroup A] [DistribMulAction C A] [Finite A] [AddCommGroup A''] [DistribMulAction C A''] [Finite A''] [Finite C] (f : A' →+ A) (g : A →+ A'') (hg : ∀ (c : C) (a : A), g (c a) = c g a) (hsurj : Function.Surjective g) (hexact : f.range = g.ker) (t : Marking C) (c'' : (Z1wR t)) :
    A' × A'

    The A'²-element the snake extracts: (f × f)(snakeZ_R) = d¹(lift c'').

    Equations
    Instances For
      theorem GQ2.FoxH.snakeZ_spec_R {C : Type u_1} [Group C] {A' : Type u_2} {A : Type u_3} {A'' : Type u_4} [AddCommGroup A'] [AddCommGroup A] [DistribMulAction C A] [Finite A] [AddCommGroup A''] [DistribMulAction C A''] [Finite A''] [Finite C] (f : A' →+ A) (g : A →+ A'') (hg : ∀ (c : C) (a : A), g (c a) = c g a) (hsurj : Function.Surjective g) (hexact : f.range = g.ker) (t : Marking C) (c'' : (Z1wR t)) :
      (f.prodMap f) (snakeZ_R f g hg hsurj hexact t c'') = (d1R t) (snakeLift_R g hsurj c'')
      theorem GQ2.FoxH.snakeZ_welldef_R {C : Type u_1} [Group C] {A' : Type u_2} {A : Type u_3} {A'' : Type u_4} [AddCommGroup A'] [DistribMulAction C A'] [Finite A'] [AddCommGroup A] [DistribMulAction C A] [Finite A] [AddCommGroup A''] [DistribMulAction C A''] [Finite A''] [Finite C] (f : A' →+ A) (g : A →+ A'') (hf : ∀ (c : C) (a : A'), f (c a) = c f a) (hg : ∀ (c : C) (a : A), g (c a) = c g a) (hinj : Function.Injective f) (hsurj : Function.Surjective g) (hexact : f.range = g.ker) (t : Marking C) (c'' : (Z1wR t)) (c : Fin 4A) (z : A' × A') (hc : (fun (i : Fin 4) => g (c i)) = c'') (hz : (f.prodMap f) z = (d1R t) c) :
      z = (snakeZ_R f g hg hsurj hexact t c'')

      Well-definedness of the snake: for any lift c of c'' and any z with (f×f)(z) = d¹(c), the class [z] ∈ H²w(A') equals [snakeZ_R c''] — so δ¹ will not depend on the chosen lift, hence descends to a hom on H¹w(A'').

      noncomputable def GQ2.FoxH.delta1raw_R {C : Type u_1} [Group C] {A' : Type u_2} {A : Type u_3} {A'' : Type u_4} [AddCommGroup A'] [DistribMulAction C A'] [Finite A'] [AddCommGroup A] [DistribMulAction C A] [Finite A] [AddCommGroup A''] [DistribMulAction C A''] [Finite A''] [Finite C] (f : A' →+ A) (g : A →+ A'') (hf : ∀ (c : C) (a : A'), f (c a) = c f a) (hg : ∀ (c : C) (a : A), g (c a) = c g a) (hinj : Function.Injective f) (hsurj : Function.Surjective g) (hexact : f.range = g.ker) (t : Marking C) :
      (Z1wR t) →+ H2wR t

      The connecting map on cocycles, Z¹w(A'') →+ H²w(A'), c'' ↦ [snakeZ_R c''] (a hom by snakeZ_welldef_R, using additive lifts).

      Equations
      Instances For
        noncomputable def GQ2.FoxH.delta1_R {C : Type u_1} [Group C] {A' : Type u_2} {A : Type u_3} {A'' : Type u_4} [AddCommGroup A'] [DistribMulAction C A'] [Finite A'] [AddCommGroup A] [DistribMulAction C A] [Finite A] [AddCommGroup A''] [DistribMulAction C A''] [Finite A''] [Finite C] (f : A' →+ A) (g : A →+ A'') (hf : ∀ (c : C) (a : A'), f (c a) = c f a) (hg : ∀ (c : C) (a : A), g (c a) = c g a) (hinj : Function.Injective f) (hsurj : Function.Surjective g) (hexact : f.range = g.ker) (t : Marking C) (ht : t.TameRel) (hw : t.WildRelR) :
        H1wR t →+ H2wR t

        The snake connecting map δ¹ : H¹w(A'') → H²w(A'). Descends delta1raw_R through the B¹w-quotient: a coboundary c'' = d⁰(a'') lifts to d⁰(â), whose is 0, so its class is 0.

        Equations
        Instances For

          The connecting map δ⁰ : H⁰w(A'') → H¹w(A') (snake) #

          The mirror of δ¹ one degree down. Lift a'' ∈ H⁰w(A'') to a ∈ A; then d⁰a ∈ ker(g∘·) (as g∘d⁰a = d⁰(g a) = d⁰a'' = 0), so d⁰a = f∘w for a unique w : A'⁴, which is a cocycle (f∘d¹w = d¹(f∘w) = d¹d⁰a = 0, f injective). δ⁰(a'') := [w] ∈ H¹w(A'); the class is independent of the lift a (a different lift shifts w by a coboundary). The domain H⁰w is an honest subgroup (no quotient), so — unlike δ¹ — no descent is needed, only lift-independence.

          theorem GQ2.FoxH.snake0_d0_mem_R {C : Type u_1} [Group C] {A : Type u_3} {A'' : Type u_4} [AddCommGroup A] [DistribMulAction C A] [AddCommGroup A''] [DistribMulAction C A''] (g : A →+ A'') (hg : ∀ (c : C) (a : A), g (c a) = c g a) (hsurj : Function.Surjective g) (t : Marking C) (a'' : (H0w t)) :
          (fun (i : Fin 4) => g ((d0 t) .choose i)) = 0

          For a'' ∈ H⁰w(A''), d⁰ of the chosen lift lands in ker(g∘·) (degree 1).

          noncomputable def GQ2.FoxH.snake0Z'_R {C : Type u_1} [Group C] {A' : Type u_2} {A : Type u_3} {A'' : Type u_4} [AddCommGroup A'] [AddCommGroup A] [DistribMulAction C A] [AddCommGroup A''] [DistribMulAction C A''] (f : A' →+ A) (g : A →+ A'') (hg : ∀ (c : C) (a : A), g (c a) = c g a) (hsurj : Function.Surjective g) (hexact : f.range = g.ker) (t : Marking C) (a'' : (H0w t)) :
          Fin 4A'

          The A'⁴-cochain the degree-0 snake extracts: f∘(snake0Z'_R) = d⁰(lift a'').

          Equations
          Instances For
            theorem GQ2.FoxH.snake0Z'_spec_R {C : Type u_1} [Group C] {A' : Type u_2} {A : Type u_3} {A'' : Type u_4} [AddCommGroup A'] [AddCommGroup A] [DistribMulAction C A] [AddCommGroup A''] [DistribMulAction C A''] (f : A' →+ A) (g : A →+ A'') (hg : ∀ (c : C) (a : A), g (c a) = c g a) (hsurj : Function.Surjective g) (hexact : f.range = g.ker) (t : Marking C) (a'' : (H0w t)) :
            (fun (i : Fin 4) => f (snake0Z'_R f g hg hsurj hexact t a'' i)) = (d0 t) .choose
            theorem GQ2.FoxH.snake0Z'_mem_R {C : Type u_1} [Group C] {A' : Type u_2} {A : Type u_3} {A'' : Type u_4} [AddCommGroup A'] [DistribMulAction C A'] [Finite A'] [AddCommGroup A] [DistribMulAction C A] [Finite A] [AddCommGroup A''] [DistribMulAction C A''] [Finite C] (f : A' →+ A) (g : A →+ A'') (hf : ∀ (c : C) (a : A'), f (c a) = c f a) (hg : ∀ (c : C) (a : A), g (c a) = c g a) (hinj : Function.Injective f) (hsurj : Function.Surjective g) (hexact : f.range = g.ker) (t : Marking C) (ht : t.TameRel) (hw : t.WildRelR) (a'' : (H0w t)) :
            (d1R t) (snake0Z'_R f g hg hsurj hexact t a'') = 0

            snake0Z'_R ∈ Z¹w(A'): its vanishes (pull d¹∘d⁰ = 0 back through the injection f).

            theorem GQ2.FoxH.delta0_welldef_R {C : Type u_1} [Group C] {A' : Type u_2} {A : Type u_3} {A'' : Type u_4} [AddCommGroup A'] [DistribMulAction C A'] [Finite A'] [AddCommGroup A] [DistribMulAction C A] [Finite A] [AddCommGroup A''] [DistribMulAction C A''] [Finite C] (f : A' →+ A) (g : A →+ A'') (hf : ∀ (c : C) (a : A'), f (c a) = c f a) (hg : ∀ (c : C) (a : A), g (c a) = c g a) (hinj : Function.Injective f) (hsurj : Function.Surjective g) (hexact : f.range = g.ker) (t : Marking C) (ht : t.TameRel) (hw : t.WildRelR) (a'' : (H0w t)) (a : A) (w : Fin 4A') (hwmem : (d1R t) w = 0) (ha : g a = a'') (hfw : (fun (i : Fin 4) => f (w i)) = (d0 t) a) :
            w, = snake0Z'_R f g hg hsurj hexact t a'',

            Lift-independence of δ⁰: any lift a of a'' with cocycle w (f∘w = d⁰a) gives the same class [w] = δ⁰(a''). A second lift differs by f a', shifting w by d⁰a'.

            noncomputable def GQ2.FoxH.delta0_R {C : Type u_1} [Group C] {A' : Type u_2} {A : Type u_3} {A'' : Type u_4} [AddCommGroup A'] [DistribMulAction C A'] [Finite A'] [AddCommGroup A] [DistribMulAction C A] [Finite A] [AddCommGroup A''] [DistribMulAction C A''] [Finite C] (f : A' →+ A) (g : A →+ A'') (hf : ∀ (c : C) (a : A'), f (c a) = c f a) (hg : ∀ (c : C) (a : A), g (c a) = c g a) (hinj : Function.Injective f) (hsurj : Function.Surjective g) (hexact : f.range = g.ker) (t : Marking C) (ht : t.TameRel) (hw : t.WildRelR) :
            (H0w t) →+ H1wR t

            The degree-0 connecting map δ⁰ : H⁰w(A'') →+ H¹w(A').

            Equations
            Instances For