Documentation

GQ2.Devissage.LESMaster

§5.11 dévissage: the dualized SES, δ-squares, and the master two-of-three #

Part of the §5.11 dévissage development (split from GQ2/Devissage.lean).

The dualized SES and the δ-squares #

Dualizing the SES gives 0 → A''^∨ --g^∨--> A^∨ --f^∨--> A'^∨ → 0; the LES machinery instantiates on it verbatim. The δ-squares — the genuinely new commutativity content of the ladder — reduce to two snake-vs-snake core computations, each a chain of Prop 5.8 and Lemma 5.6 through the chosen lifts.

noncomputable def GQ2.FoxH.delta0D {C : Type u_1} [Group C] {A' : Type u_2} {A : Type u_3} {A'' : Type u_4} [AddCommGroup A'] [DistribMulAction C 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) (hA₂ : ∀ (a : A), a + a = 0) (t : Marking C) (ht : t.TameRel) (hw : t.WildRel) :
(H0w t) →+ H1w t

δ⁰ of the dualized SES: H⁰w(A'^∨) →+ H¹w(A''^∨).

Equations
Instances For
    noncomputable def GQ2.FoxH.delta1D {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) (hA₂ : ∀ (a : A), a + a = 0) (t : Marking C) (ht : t.TameRel) (hw : t.WildRel) :
    H1w t →+ H2w t

    δ¹ of the dualized SES: H¹w(A'^∨) →+ H²w(A''^∨).

    Equations
    Instances For
      theorem GQ2.FoxH.delta_square_core1 {C : Type u_1} [Group C] {A' : Type u_2} {A : Type u_3} {A'' : Type u_4} [AddCommGroup A'] [DistribMulAction C 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) (hA₂ : ∀ (a : A), a + a = 0) (t : Marking C) (ht : t.TameRel) (hw : t.WildRel) (c'' : (Z1w t)) (lam : (H0w t)) :
      lam ((snakeZ f g hg hsurj hexact t c'').1 + (snakeZ f g hg hsurj hexact t c'').2) = mixedB t (↑c'') (snake0Z' (dualMap g) (dualMap f) t lam)

      δ-square core 1: evaluating λ ∈ H⁰w(A'^∨) on the δ¹-snake of c'' equals pairing c'' against the dual δ⁰-snake word of λ. (Lift λ to Λ along f^∨; both sides equal B(lift c'', d⁰Λ) by Prop 5.8 right resp. Lemma 5.6.)

      theorem GQ2.FoxH.delta_square_core2 {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) (hA₂ : ∀ (a : A), a + a = 0) (t : Marking C) (ht : t.TameRel) (hw : t.WildRel) (a'' : (H0w t)) (y' : (Z1w t)) :
      mixedB t (snake0Z' f g hg hsurj hexact t a'') y' = (snakeZ (dualMap g) (dualMap f) t y').1 a'' + (snakeZ (dualMap g) (dualMap f) t y').2 a''

      δ-square core 2: pairing the primal δ⁰-snake word of a'' against a dual cocycle y' equals evaluating the dual δ¹-snake of y' on a''. (Mirror of core 1: Prop 5.8 left + Lemma 5.6 through the lifts.)

      theorem GQ2.FoxH.square_delta1 {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) (hA₂ : ∀ (a : A), a + a = 0) (t : Marking C) (ht : t.TameRel) (hw : t.WildRel) (h'' : H1w t) :
      (chi2 t ht hw) ((delta1 f g hf hg hinj hsurj hexact t ht hw) h'') = (dualMap (delta0D f g hf hg hinj hsurj hexact hA₂ t ht hw)) ((chi1 t ht hw) h'')

      δ-square (1,2): χ²_{A'} ∘ δ¹ = (δ⁰ of the dual SES)^∨ ∘ χ¹_{A''}.

      theorem GQ2.FoxH.square_delta0 {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) (hA₂ : ∀ (a : A), a + a = 0) (t : Marking C) (ht : t.TameRel) (hw : t.WildRel) (a'' : (H0w t)) :
      (chi1 t ht hw) ((delta0 f g hf hg hinj hsurj hexact t ht hw) a'') = (dualMap (delta1D f g hf hg hinj hsurj hexact hA₂ t ht hw)) ((chi0 t ht hw) a'')

      δ-square (0,1): χ¹_{A'} ∘ δ⁰ = (δ¹ of the dual SES)^∨ ∘ χ⁰_{A''}.

      theorem GQ2.FoxH.square_delta0D {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) (hA₂ : ∀ (a : A), a + a = 0) (t : Marking C) (ht : t.TameRel) (hw : t.WildRel) (lam : (H0w t)) :
      (chi1T t ht hw) ((delta0D f g hf hg hinj hsurj hexact hA₂ t ht hw) lam) = (dualMap (delta1 f g hf hg hinj hsurj hexact t ht hw)) ((chi0T t ht hw) lam)

      δ-square (0,1), transposed: χ¹ᵀ_{A''} ∘ δ⁰_dual = (δ¹)^∨ ∘ χ⁰ᵀ_{A'}.

      theorem GQ2.FoxH.square_delta1D {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) (hA₂ : ∀ (a : A), a + a = 0) (t : Marking C) (ht : t.TameRel) (hw : t.WildRel) (z' : H1w t) :
      (chi2T t ht hw) ((delta1D f g hf hg hinj hsurj hexact hA₂ t ht hw) z') = (dualMap (delta0 f g hf hg hinj hsurj hexact t ht hw)) ((chi1T t ht hw) z')

      δ-square (1,2), transposed: χ²ᵀ_{A''} ∘ δ¹_dual = (δ⁰)^∨ ∘ χ¹ᵀ_{A'}.

      theorem GQ2.FoxH.selfdualW_two_of_three {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) (hA₂ : ∀ (a : A), a + a = 0) (t : Marking C) (ht : t.TameRel) (hw : t.WildRel) :
      (IsSelfDualW t A' IsSelfDualW t A''IsSelfDualW t A) (IsSelfDualW t A' IsSelfDualW t AIsSelfDualW t A'') (IsSelfDualW t A IsSelfDualW t A''IsSelfDualW t A')

      Lemma 5.11, word-internal form (exact-cone dévissage): two-out-of-three for IsSelfDualW along the module SES. Proof: translate each IsSelfDualW into χ-bijectivities (isSelfDualW_iff, chi_bij_of_selfdualW), then chase the duality ladder — nine four-lemma windows across the two LESs (word complex of the SES, and of its dualization) tied by the lemma_5_6-squares, the evaluation squares and the δ-squares.