Documentation

GQ2.Roe.FoxBasic

The r_R Fox spine: the Roe word complex and the traced mixed coordinate (Roe note §4) #

The Γ_R counterparts of the Γ_A spine objects of GQ2.FoxHeisenberg.Basic (the word complex (30)/(31) built on the wild relator) and GQ2.FoxHeisenberg.Heisenberg (the traced mixed central coordinate mixedB), for the Roe candidate presentation

Γ_R = ⟨σ, τ, x₀, x₁ ∣ τ^σ = τ², r_R = (x₀^σ)⁻¹ · (x₀⁻³τ)^{ω₂} · x₁² · [x₁, x₁^{σ₂}]⟩

(note eq. (1.2) ⟦eq:relators⟧, GQ2.Roe.Words). The tame relator is shared with Γ_A, so the tame component of every object below is definitionally the Γ_A one (d1FunR_fst, d1FunR_tame — reused, never re-proved); only the wild component changes, Marking.wildValue → Marking.wildValueR.

Provided here, mirroring Basic.lean's names with an R suffix:

The evaluated closed forms of the wild row (⟦prop:jacobian⟧'s L_w = Pb + (P + S⁻¹)c) are in GQ2.Roe.WildRow.

The R-word complex (the (30)/(31) clone on the Roe wild relator) #

noncomputable def GQ2.FoxH.d1FunR {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] (t : Marking C) (x : Fin 4A) :
A × A

d¹_R, function level (note §4, the differential of display ⟦eq:jacobian⟧): the pair of A-coordinates of the evaluated tame and Roe wild relators at the lifted marking — the Γ_R counterpart of d1Fun. The tame component is identical to Γ_A's (d1FunR_fst).

Equations
Instances For
    theorem GQ2.FoxH.d1FunR_fst {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] (t : Marking C) (x : Fin 4A) :
    (d1FunR t x).1 = (d1Fun t x).1

    Stress test (shared tame row). The tame component of d1FunR is definitionally the Γ_A one — the tame relator is shared, so the Γ_A tame-row lemmas (d1Fun_tame, d1Fun_tame_split) apply verbatim through this equation.

    theorem GQ2.FoxH.d1FunR_snd {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] (t : Marking C) (x : Fin 4A) :
    (d1FunR t x).2 = (liftMarking t x).wildValueR.u

    The wild component of d1FunR, in relator form (the input to GQ2.Roe.WildRow's rows).

    theorem GQ2.FoxH.d1FunR_tame {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] (t : Marking C) (ht : t.TameRel) (x : Fin 4A) :
    (d1FunR t x).1 = t.σ⁻¹ t.τ x 0 - t.σ⁻¹ x 0 + t.σ⁻¹ x 1 - (x 1 + t.τ x 1)

    The tame row of d¹_R, in closed formΓ_A's d1Fun_tame, reused (not re-proved): the note's "The tame row is unchanged from [RT (5.5)]", L_t = S⁻¹(1+T)a + (S⁻¹+1+T)b.

    theorem GQ2.FoxH.d1FunR_add {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] [Finite A] [Finite C] (t : Marking C) (x y : Fin 4A) :
    d1FunR t (x + y) = d1FunR t x + d1FunR t y

    d¹_R is additive in the lift variables — the finite Fox rules for the Roe word, proved by functoriality exactly as d1Fun_add: evaluate the relators over the coefficient module A × A, then push through the three C-equivariant maps fst, snd, fst + snd : A × A →+ A (Marking.map_tameValue/Marking.map_wildValueR + WordLift.map).

    noncomputable def GQ2.FoxH.d1R {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] [Finite A] [Finite C] (t : Marking C) :
    (Fin 4A) →+ A × A

    d¹_R bundled on d1FunR_add (finite coefficients, per d1FunR_add).

    Equations
    Instances For
      theorem GQ2.FoxH.d1R_apply {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] [Finite A] [Finite C] (t : Marking C) (x : Fin 4A) :
      (d1R t) x = d1FunR t x

      d1R evaluates as d1FunR.

      theorem GQ2.FoxH.d1FunR_zero {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] [Finite A] [Finite C] (t : Marking C) :
      d1FunR t 0 = 0

      Stress test: d1FunR kills 0 (the additivity bundled in d1R).

      theorem GQ2.FoxH.d1FunR_comp_d0 {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] [Finite A] [Finite C] (t : Marking C) (ht : t.TameRel) (hw : t.WildRelR) (v : A) :
      d1FunR t ((d0 t) v) = 0

      The Roe complex is a complex: d¹_R ∘ d⁰ = 0 at a marking satisfying the two Γ_R relations. Proof exactly as d1Fun_comp_d0: liftMarking t (d0 t v) is t pushed through g ↦ ⟨g•v − v, g⟩ = ⟨v,1⟩⁻¹⟨0,g⟩⟨v,1⟩, so its relator values are conjugates of t's — which are 1 by TameRel/WildRelR — hence have zero A-coordinate.

      def GQ2.FoxH.H0wR {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] (t : Marking C) :
      AddSubgroup A

      H⁰_{R,ρ}(A) = ker d⁰. The relator does not enter d⁰, so this is the shared H0w (H0wR_eq_H0w); the R-name exists for the Roe complex's uniform API.

      Equations
      Instances For
        noncomputable def GQ2.FoxH.Z1wR {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] [Finite A] [Finite C] (t : Marking C) :
        AddSubgroup (Fin 4A)

        Z¹_{R,ρ}(A) = ker d¹_R (the Roe degree-one cocycles).

        Equations
        Instances For
          def GQ2.FoxH.B1wR {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] (t : Marking C) :
          AddSubgroup (Fin 4A)

          B¹_{R,ρ}(A) = im d⁰ — again relator-free, = B1w (B1wR_eq_B1w).

          Equations
          Instances For
            theorem GQ2.FoxH.H0wR_eq_H0w {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] (t : Marking C) :
            H0wR t = H0w t

            Stress test (shared d⁰-layer): H0wR is definitionally Γ_A's H0w.

            theorem GQ2.FoxH.B1wR_eq_B1w {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] (t : Marking C) :
            B1wR t = B1w t

            Stress test (shared d⁰-layer): B1wR is definitionally Γ_A's B1w.

            theorem GQ2.FoxH.mem_Z1wR_iff {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] [Finite A] [Finite C] (t : Marking C) (x : Fin 4A) :
            x Z1wR t d1FunR t x = 0

            Membership in Z1wR is vanishing of d1FunR.

            theorem GQ2.FoxH.B1wR_le_Z1wR {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] [Finite A] [Finite C] (t : Marking C) (ht : t.TameRel) (hw : t.WildRelR) :
            B1wR t Z1wR t

            The chain inclusion B¹ ≤ Z¹_R under the Γ_R relations (mirrors B1w_le_Z1w, GQ2/Devissage/Naturality.lean).

            noncomputable def GQ2.FoxH.H1wR {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] [Finite A] [Finite C] (t : Marking C) :
            Type u_2

            H¹_{R,ρ}(A) (as for H1w: the addSubgroupOf-quotient is total — the chain inclusion B¹ ≤ Z¹_R is B1wR_le_Z1wR, needed only for lemmas).

            Equations
            Instances For
              @[implicit_reducible]
              noncomputable instance GQ2.FoxH.instAddCommGroupH1wR {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] [Finite A] [Finite C] (t : Marking C) :
              AddCommGroup (H1wR t)
              Equations
              • One or more equations did not get rendered due to their size.
              noncomputable def GQ2.FoxH.h1wMkR {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] [Finite A] [Finite C] (t : Marking C) (x : (Z1wR t)) :

              The class of a degree-one Roe cocycle in H¹_{R,ρ}.

              Equations
              Instances For
                noncomputable def GQ2.FoxH.H2wR {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] [Finite A] [Finite C] (t : Marking C) :
                Type u_2

                H²_{R,ρ}(A) = A² ⧸ im d¹_R.

                Equations
                Instances For
                  @[implicit_reducible]
                  noncomputable instance GQ2.FoxH.instAddCommGroupH2wR {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] [Finite A] [Finite C] (t : Marking C) :
                  AddCommGroup (H2wR t)
                  Equations
                  • One or more equations did not get rendered due to their size.

                  The traced mixed coordinate mixedB_R #

                  noncomputable def GQ2.FoxH.mixedB_R {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] (t : Marking C) (x : Fin 4A) (y : Fin 4ElemDual A) :
                  ZMod 2

                  B_{R,ρ,A}: the traced mixed central coordinate of the Γ_R word — the sum of the central coordinates of the two evaluated relators (not the central coordinate of their product), mirroring mixedB (GQ2/FoxHeisenberg/Heisenberg.lean:312) with wildValue → wildValueR. Its cocycle closed form — the note's scalar Gram ⟦eq:scalarform⟧, with the honest diagonal dd' in place of Γ_A's opaque ω₂-scalar — is ticket R25's mixedB_cocycle_R.

                  Equations
                  Instances For
                    theorem GQ2.FoxH.bridge_wildR {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] [Finite A] [Finite C] (t : Marking C) (x : Fin 4A) (y : Fin 4ElemDual A) :
                    (heisMarking t x y).wildValueR = (stokesEval (markVec t) x y) (wildValueExpR freeMarking (omega2Exp (Monoid.exponent (HeisLift A C))))

                    Wild bridge for the Roe word: the Roe wild relator value at heisMarking equals the free-word evaluation stokesEval … (wildValueExpR freeMarking e) at the target-dependent exponent e = omega2Exp (exponent H(A)⋊C) — the Γ_R analogue of bridge_wild. Proof: wildValueExpR_eq_wildValueR trades the two ω₂-powers for the explicit exponent inside the finite group H(A)⋊C, and wildValueExpR_map (no ω₂, hence no finiteness) pulls the word back along the classifying hom stokesEval (markVec t) x y. This is the naturality lemma feeding the Stokes rows (ticket R23) and the bilinearity below.

                    theorem GQ2.FoxH.mixedB_R_add_left {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] [Finite A] [Finite C] (t : Marking C) (x x' : Fin 4A) (y : Fin 4ElemDual A) :
                    mixedB_R t (x + x') y = mixedB_R t x y + mixedB_R t x' y

                    mixedB_R is additive in the primal offsets x (ported from mixedB_add_left, GQ2/MixedBilinear.lean, with bridge_wild → bridge_wildR).

                    theorem GQ2.FoxH.mixedB_R_add_right {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] [Finite A] [Finite C] (t : Marking C) (x : Fin 4A) (y y' : Fin 4ElemDual A) :
                    mixedB_R t x (y + y') = mixedB_R t x y + mixedB_R t x y'

                    mixedB_R is additive in the dual offsets y (ported from mixedB_add_right).

                    theorem GQ2.FoxH.mixedB_R_zero_right {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] [Finite A] [Finite C] (t : Marking C) (x : Fin 4A) :
                    mixedB_R t x 0 = 0

                    mixedB_R t x 0 = 0 (from right-additivity, in the 2-torsion target).

                    theorem GQ2.FoxH.mixedB_R_zero_left {C : Type u_1} [Group C] {A : Type u_2} [AddCommGroup A] [DistribMulAction C A] [Finite A] [Finite C] (t : Marking C) (y : Fin 4ElemDual A) :
                    mixedB_R t 0 y = 0

                    mixedB_R t 0 y = 0 (from left-additivity, in the 2-torsion target).

                    Paper-tag ledger (Roe note paper/roe-presentation-verification.tex; hand-maintained) #