Documentation

GQ2.GaussZ.RelatorGammaA

Q⁰ over Γ_A as a relator value in the κ⁰-extension #

The evaluation brick of the (83)-for-Γ_A seam (docs/orchestration/p16d6e4aA-gammaA-gauss-design.md §2): the graph pullback is, on the nose, the pullback of the base central cocycle κ⁰_q on the semidirect product V ⋊ C (eq. (61)/(62): graphPullback dat ρ₀ b = κ⁰ ∘ (graph × graph), where graph γ = (b γ, ρ₀ γ) is a homomorphism exactly because b is a crossed cocycle). Hence, by A-2 (QZero_eq_levelFactor_obs) and the level-change naturality (relZPair_comap), the base determinant form evaluates as a relator value in the concrete finite extension CentExt κ⁰:

Q⁰_{Γ_A,ρ'}(c) = relZPair (graph-marking) κ⁰-cocycle |₁ + |₂

where the graph marking is the image of the Γ_A-generator marking gammaGen under the graph homomorphism — the four explicit pairs (c(gᵢ), ρ'₀(gᵢ)) ∈ V ⋊ C. This is the A-4 interface: the two relator words evaluated at those pairs in CentExt κ⁰ ARE the paper's (83) quadratic in the generator values.

Contents: the semidirect group Sd C V (isolated carrier, no Prod-instance pollution); kappa0Cocycle (κ⁰ as a normalized WordCoh2.TwoCocycle — Lemma 6.1's associativity from the IsEquivariantFactorSet clauses); graphSdHom (the crossed-cocycle graph hom) and its continuity; the explicit LevelFactor for the graph pullback (kernel level of the graph hom); and the assembled QZero_eq_relZPair_kappa0.

All std-3; no axioms, no sorries.

The semidirect product V ⋊ C as an isolated group carrier #

def GQ2.SectionEight.AffineTLift.Sd (C : Type u_1) (V : Type u_2) :
Type (max u_1 u_2)

The carrier of V ⋊ C — a def (not an abbrev), so the group structure below does not leak onto raw products.

Equations
Instances For
    def GQ2.SectionEight.AffineTLift.Sd.v {C : Type u_1} {V : Type u_2} (p : Sd C V) :
    V

    The V-component.

    Equations
    • p.v = p.1
    Instances For
      def GQ2.SectionEight.AffineTLift.Sd.cc {C : Type u_1} {V : Type u_2} (p : Sd C V) :
      C

      The C-component.

      Equations
      • p.cc = p.2
      Instances For
        def GQ2.SectionEight.AffineTLift.Sd.mk {C : Type u_1} {V : Type u_2} (v : V) (c : C) :
        Sd C V

        Pairs as semidirect elements.

        Equations
        Instances For
          theorem GQ2.SectionEight.AffineTLift.Sd.ext {C : Type u_1} {V : Type u_2} {p q : Sd C V} (h1 : p.v = q.v) (h2 : p.cc = q.cc) :
          p = q
          theorem GQ2.SectionEight.AffineTLift.Sd.ext_iff {C : Type u_1} {V : Type u_2} {p q : Sd C V} :
          p = q p.v = q.v p.cc = q.cc
          @[implicit_reducible]
          instance GQ2.SectionEight.AffineTLift.instGroupSd {C : Type u_1} {V : Type u_2} [Group C] [AddCommGroup V] [DistribMulAction C V] :
          Group (Sd C V)
          Equations
          • One or more equations did not get rendered due to their size.
          @[simp]
          theorem GQ2.SectionEight.AffineTLift.Sd.mul_v {C : Type u_1} {V : Type u_2} [Group C] [AddCommGroup V] [DistribMulAction C V] (p q : Sd C V) :
          (p * q).v = p.v + p.cc q.v
          @[simp]
          theorem GQ2.SectionEight.AffineTLift.Sd.mul_cc {C : Type u_1} {V : Type u_2} [Group C] [AddCommGroup V] [DistribMulAction C V] (p q : Sd C V) :
          (p * q).cc = p.cc * q.cc
          @[simp]
          theorem GQ2.SectionEight.AffineTLift.Sd.one_v {C : Type u_1} {V : Type u_2} [Group C] [AddCommGroup V] [DistribMulAction C V] :
          v 1 = 0
          @[simp]
          theorem GQ2.SectionEight.AffineTLift.Sd.one_cc {C : Type u_1} {V : Type u_2} [Group C] [AddCommGroup V] [DistribMulAction C V] :
          cc 1 = 1
          instance GQ2.SectionEight.AffineTLift.instFiniteSd {C : Type u_1} {V : Type u_2} [Finite C] [Finite V] :
          Finite (Sd C V)
          @[implicit_reducible]
          instance GQ2.SectionEight.AffineTLift.instTopologicalSpaceSd {C : Type u_1} {V : Type u_2} [TopologicalSpace C] [TopologicalSpace V] :
          TopologicalSpace (Sd C V)
          Equations
          instance GQ2.SectionEight.AffineTLift.instDiscreteTopologySd {C : Type u_1} {V : Type u_2} [TopologicalSpace C] [DiscreteTopology C] [TopologicalSpace V] [DiscreteTopology V] :
          DiscreteTopology (Sd C V)

          κ⁰_q as a normalized TwoCocycle on V ⋊ C (Lemma 6.1's associativity) #

          theorem GQ2.SectionEight.AffineTLift.IsEquivariantFactorSet.m_zero {C : Type u_1} {V : Type u_2} [Group C] [AddCommGroup V] [DistribMulAction C V] {q : VZMod 2} (dat : FactorSet C V) (hdat : IsEquivariantFactorSet q dat) (c : C) :
          dat.m c 0 = 0

          m_c(0) = 0 (from m_quad at v = w = 0 in characteristic 2).

          noncomputable def GQ2.SectionEight.AffineTLift.kappa0Cocycle {C : Type u_1} {V : Type u_2} [Group C] [AddCommGroup V] [DistribMulAction C V] {q : VZMod 2} (dat : FactorSet C V) (hdat : IsEquivariantFactorSet q dat) :

          The base central cocycle κ⁰_q as a normalized TwoCocycle on V ⋊ C (eq. (61); the cocycle identity is Lemma 6.1's "associativity of E_f", assembled from f_cocycle, m_quad, and m_mul).

          Equations
          Instances For
            @[simp]
            theorem GQ2.SectionEight.AffineTLift.kappa0Cocycle_κ {C : Type u_1} {V : Type u_2} [Group C] [AddCommGroup V] [DistribMulAction C V] {q : VZMod 2} (dat : FactorSet C V) (hdat : IsEquivariantFactorSet q dat) (p r : Sd C V) :
            (kappa0Cocycle dat hdat).κ p r = dat.f p.v (p.cc r.v) + dat.m p.cc r.v

            The graph homomorphism of a crossed cocycle #

            noncomputable def GQ2.SectionEight.AffineTLift.graphSdHom {Bg : Type} [Group Bg] [Finite Bg] [TopologicalSpace Bg] {D : RadicalCoverData Bg} {DD : DescData D} {Γ : Type} [Group Γ] [TopologicalSpace Γ] {ρM : Γ →ₜ* Bg D.M} (c : VCocycle DD ρM) :
            Γ →* Sd DD.C0 DD.Vmod

            The graph homomorphism γ ↦ (c(γ), ρ'₀(γ)) : Γ →* V ⋊ C — the crossed-cocycle condition is exactly the homomorphism law.

            Equations
            Instances For
              theorem GQ2.SectionEight.AffineTLift.graphPullback_eq_kappa0_graph {Bg : Type} [Group Bg] [Finite Bg] [TopologicalSpace Bg] {D : RadicalCoverData Bg} {DD : DescData D} {Γ : Type} [Group Γ] [TopologicalSpace Γ] {ρM : Γ →ₜ* Bg D.M} {q : DD.VmodZMod 2} (hdat : IsEquivariantFactorSet q DD.dat) (c : VCocycle DD ρM) (p : Γ × Γ) :
              graphPullback DD.dat (fun (γ : Γ) => (rho0 DD ρM) γ) c.c p = (kappa0Cocycle DD.dat hdat).κ ((graphSdHom c) p.1) ((graphSdHom c) p.2)

              The graph pullback is the κ⁰-pullback along the graph hom (eq. (62), on the nose).

              The explicit level factorization over Γ_A and the assembled relator value #

              theorem GQ2.SectionEight.AffineTLift.continuous_vcocycle_c {Bg : Type} [Group Bg] [Finite Bg] [TopologicalSpace Bg] [DiscreteTopology Bg] {D : RadicalCoverData Bg} {DD : DescData D} {ρM : WordCohBridge.GA →ₜ* Bg D.M} [TopologicalSpace DD.Vmod] (c : VCocycle DD ρM) :
              Continuous c.c

              A crossed cocycle's underlying function is continuous into the (discrete) module: its composition with the injective iV ∘ ofAdd is continuous into the discrete Bg ⧸ T, so every fiber is open.

              theorem GQ2.SectionEight.AffineTLift.QZero_eq_relZPair_kappa0 {Bg : Type} [Group Bg] [Finite Bg] [TopologicalSpace Bg] [DiscreteTopology Bg] {D : RadicalCoverData Bg} {DD : DescData D} {ρM : WordCohBridge.GA →ₜ* Bg D.M} [TopologicalSpace DD.Vmod] [DiscreteTopology DD.Vmod] [TopologicalSpace DD.C0] [DiscreteTopology DD.C0] [Finite DD.C0] [Finite DD.Vmod] [DistribMulAction WordCohBridge.GA (ZMod 2)] [ContinuousSMul WordCohBridge.GA (ZMod 2)] (htriv : ∀ (x : WordCohBridge.GA) (m : ZMod 2), x m = m) {q : DD.VmodZMod 2} (hdat : IsEquivariantFactorSet q DD.dat) (c : VCocycle DD ρM) :

              The A-3 keystone: over Γ_A, the base determinant form Q⁰ of a crossed V-cocycle is the relator value in the concrete κ⁰-extension: the (tame + wild) relator-z pair of the κ⁰-cocycle on V ⋊ C at the marking graph(gammaGen) — the four explicit pairs (c(gᵢ), ρ'₀(gᵢ)). (A-2's QZero_eq_levelFactor_obs at the kernel level of the graph hom, transported by relZPair_comap.)

              Paper-tag ledger (auto-generated by paperforge; do not edit) #