Documentation

Q2Presentation.Induction.ZeroEdgeRealization

§A The weak-base difference torsor (the liftHom_equiv_Z1 #

construction at weak bases: no surjectivity onto the quotient is imposed on the basepoint, so the fibres feed clause (d))

The weak framed-lift set at a basepoint hom: continuous framed homs agreeing with h0 modulo the elementary kernel (the fibre of the mod-E.N reduction through h0's coset; surjectivity NOT imposed — lem:affinelifting's weak coordinates).

Equations
  • One or more equations did not get rendered due to their size.
Instances For

    The weak-base difference torsor (liftHom_equiv_Z1 re-run at a weak framed basepoint): weak framed lifts biject with the clause-(d) twisted-cocycle carrier weakZ1 — the counting bridge to q2_localduality_weakZ1_card (N5) and the N6 corank engine.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For

      §B Carriers at the child: one-spelling bridges (banked #

      mixed-defeq-carrier fix-class — every downstream statement consumes THESE spellings)

      @[reducible, inline]

      The λ-liftable W2a total space, abbreviated (the Zcount carrier, RadicalEdgeCount.lean:160).

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For
        @[reducible, inline]

        The base of the W2a fibration, ASCRIBED at the cChild-spelling (the one-spelling bridge: coverLiftBase produces the (mChildKernel).N-spelled child type, defeq to (cChild chief K).1/.2; this abbrev pins the cChild spelling every ρ-sum below uses).

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For
          @[reducible, inline]

          The framed M-lift fibre over a lower map (all framed lifts, weak in the ambient target — liftHom at the child M-kernel, ρ taken in the cChild spelling).

          Equations
          • One or more equations did not get rendered due to their size.
          Instances For
            def Q2Presentation.Induction.mTotal {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) (ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd) (l : mLift chief K B ρ) :
            edgeTotal chief K B

            An M-lift, repackaged as a W2a total-space point (the coverLiftFibreEquiv.invFun packaging; .val is UNCHANGED — rfl).

            Equations
            Instances For
              @[simp]
              theorem Q2Presentation.Induction.mTotal_val {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) (ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd) (l : mLift chief K B ρ) (γ : ↑Γ.toProfinite.toTop) :
              (ProfiniteGrp.Hom.hom ↑(mTotal chief K B ρ l)) γ = (ProfiniteGrp.Hom.hom ↑l) γ
              def Q2Presentation.Induction.liftableML {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) (ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd) (l : mLift chief K B ρ) :

              λ-liftability read on the M-lift carrier (the coverLiftableWeak predicate of the total point; reads only l.val).

              Equations
              Instances For
                theorem Q2Presentation.Induction.coverLiftableWeak_congr {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) {f g : edgeTotal chief K B} (h : ↑f = ↑g) :
                coverLiftableWeak chief K lam hinv B f ↔ coverLiftableWeak chief K lam hinv B g

                coverLiftableWeak is .val-determined (Prop-subtype extensionality; the transport across repackagings).

                def Q2Presentation.Induction.modT {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) (ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd) (l : mLift chief K B ρ) :
                btLiftHom chief K B ρ

                The mod-T' reduction of an M-lift: the induced V⋊C-lift of ρ (composition with the tChild-projection; the T′-stage map of lem:affinelifting).

                Equations
                • One or more equations did not get rendered due to their size.
                Instances For
                  @[simp]
                  theorem Q2Presentation.Induction.modT_val {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) (ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd) (l : mLift chief K B ρ) (γ : ↑Γ.toProfinite.toTop) :
                  (ProfiniteGrp.Hom.hom ↑(modT chief K B ρ l)) γ = (QuotientGroup.mk' (tChild chief K)) ((ProfiniteGrp.Hom.hom ↑l) γ)

                  §C The |W_ρ| = 2^{2·dimV} numerics: `edgeZ1 ≃ btLiftHom ≃ #

                  weakZ1(vLayerKernel) at the pinned-section basepoint, closed per source by N5/N6 (weakZ1_vLayer_card, weakZ1_vLayer_card_gammaA`)

                  Two elements of B/T' agree modulo the V-layer iff their btProj-images agree (ker btProj = vLayer in coset form).

                  def Q2Presentation.Induction.sBaseHom {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) (ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd) (Z : ZeroEdgeDescentData chief K lam hinv) (P : ZeroEdgePinning chief K lam hinv Z) :

                  The pinned-section basepoint hom γ ↦ s(ρ̄γ) (the trivialization of z = 0, as a framed continuous hom into B/T').

                  Equations
                  • One or more equations did not get rendered due to their size.
                  Instances For
                    @[simp]
                    theorem Q2Presentation.Induction.sBaseHom_apply {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) (ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd) (Z : ZeroEdgeDescentData chief K lam hinv) (P : ZeroEdgePinning chief K lam hinv Z) (γ : ↑Γ.toProfinite.toTop) :
                    (ProfiniteGrp.Hom.hom (sBaseHom chief K lam hinv B ρ Z P)) γ = P.s (lowerBar chief K B ρ γ)
                    theorem Q2Presentation.Induction.sBaseHom_frame {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) (ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd) (Z : ZeroEdgeDescentData chief K lam hinv) (P : ZeroEdgePinning chief K lam hinv Z) (γ : ↑Γ.toProfinite.toTop) :
                    (btChild chief K).fst.qYMap ((ProfiniteGrp.Hom.hom (sBaseHom chief K lam hinv B ρ Z P)) γ) = (ProfiniteGrp.Hom.hom (btChild chief K).snd.beta) ((ProfiniteGrp.Hom.hom B.toBoundary) γ)

                    The basepoint is framed.

                    def Q2Presentation.Induction.sBaseTotal {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) (ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd) (Z : ZeroEdgeDescentData chief K lam hinv) (P : ZeroEdgePinning chief K lam hinv Z) :

                    The basepoint, packaged as a V-stage total-space point (the carrier N5/N6's weakZ1_vLayer_card* counts read).

                    Equations
                    Instances For
                      @[simp]
                      theorem Q2Presentation.Induction.sBaseTotal_val {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) (ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd) (Z : ZeroEdgeDescentData chief K lam hinv) (P : ZeroEdgePinning chief K lam hinv Z) :
                      ↑(sBaseTotal chief K lam hinv B ρ Z P) = sBaseHom chief K lam hinv B ρ Z P
                      def Q2Presentation.Induction.btLiftHom_equiv_weakLift {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) (ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd) (Z : ZeroEdgeDescentData chief K lam hinv) (P : ZeroEdgePinning chief K lam hinv Z) :
                      btLiftHom chief K B ρ ≃ weakLift (btChild chief K).fst (vLayerKernel chief K) B (btChild chief K).snd (sBaseHom chief K lam hinv B ρ Z P)

                      V⋊C-lifts of ρ are exactly the weak framed lifts at the pinned basepoint (the projection clause read modulo the V-layer).

                      Equations
                      Instances For
                        theorem Q2Presentation.Induction.card_edgeZ1_eq_weakZ1_vLayer {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) (ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd) (Z : ZeroEdgeDescentData chief K lam hinv) (P : ZeroEdgePinning chief K lam hinv Z) :
                        Nat.card ↥(edgeZ1 chief K B ρ) = Nat.card (weakZ1 (vLayerKernel chief K) (sBaseHom chief K lam hinv B ρ Z P))

                        |Z¹_ρ(V)| = |weakZ1(vLayer)| — the carrier chain edgeZ1 ≃ btLiftHom ≃ weakLift ≃ weakZ1 at the pinned basepoint.

                        The per-source |W_ρ|-numerics (N5/N6 closed). Stated at the #

                        CONCRETE packages boundaryPackage_GammaA/boundaryPackage_GQ2 — the N5 cards ride clause (d) of the GQ2-pinned q2_localduality_general and the N6 cards ride the GammaA ledger, so neither is package-generic; the §C constructions above ARE generic and are simply instantiated here.

                        theorem Q2Presentation.Induction.card_edgeZ1_gammaA {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) (ρ : boundaryFramedSurj boundaryPackage_GammaA (cChild chief K).fst (cChild chief K).snd) (Z : ZeroEdgeDescentData chief K lam hinv) (P : ZeroEdgePinning chief K lam hinv Z) :
                        Nat.card ↥(edgeZ1 chief K boundaryPackage_GammaA ρ) = 2 ^ (2 * dimV chief K)

                        |W_ρ| = 2^{2·dimV}, candidate source (N6's weakZ1_vLayer_card_gammaA at the pinned basepoint).

                        theorem Q2Presentation.Induction.card_edgeZ1_gq2 {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) (ρ : boundaryFramedSurj boundaryPackage_GQ2 (cChild chief K).fst (cChild chief K).snd) (Z : ZeroEdgeDescentData chief K lam hinv) (P : ZeroEdgePinning chief K lam hinv Z) :
                        Nat.card ↥(edgeZ1 chief K boundaryPackage_GQ2 ρ) = 2 ^ (2 * dimV chief K)

                        |W_ρ| = 2^{2·dimV}, local source (N5's weakZ1_vLayer_card at the pinned basepoint).

                        The per-source T'-fibre numerics (N5/N6 closed; concrete #

                        packages for the same reason as the |W_ρ|-cards)

                        |weakLift(T')| = 2^{2·dimT+rT} at every candidate M-lift (N6's weakZ1_tChild_card_gammaA through the difference torsor).

                        |weakLift(T')| = 2^{2·dimT+rT} at every local M-lift (N5's weakZ1_tChild_card through the difference torsor).

                        §D The honest floors (named Props, consumed as HYPOTHESES — #

                        never axioms; the N7 EdgeDelSurj discipline)

                        def Q2Presentation.Induction.FibHom {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) (Z : ZeroEdgeDescentData chief K lam hinv) (ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd) (P : ZeroEdgePinning chief K lam hinv Z) (z : ↥(edgeZ1 chief K B ρ)) (f : Γ ⟶ ProfiniteGrp.ofFiniteGrp (FiniteGrp.of (XRZero.xrChild chief K).fst.Y)) :

                        The T'-fibre condition of a framed M-lift over the z-twisted V⋊C-lift: l mod T' = γ ↦ vInG(zγ)·s(ρ̄γ) pointwise (the graph of the trivialized coordinate; modT l = edgeTrivial … z in value form).

                        Equations
                        • One or more equations did not get rendered due to their size.
                        Instances For
                          def Q2Presentation.Induction.EdgeAffineLifting {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) (Z : ZeroEdgeDescentData chief K lam hinv) (ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd) (P : ZeroEdgePinning chief K lam hinv Z) :

                          F-affine floor Prop (design §4-N9's honest residue of S2/S3; lem:affinelifting l.4048–4083, eq:affineequation l.4060 + lem:elementarystage l.4171–4205): a twisted cocycle z ∈ Z¹_ρ(V) supports a framed M-lift over ρ through the pinned trivialization IFF its per-χ constraint readings (edgeLRead, the Γ_{γ_χ}-graph ι-values) hit the χ_*e-targets (edgeKappaRead) — the affine equation ∂z = ρ*e in per-cocycle, token-FREE spelling. PROVENANCE + dissolution: (⟸, existence) is the H²_{Γ,ρ}(M_χ-complement) = 0 counting dévissage — in-tree route: clause (d) of q2_localduality_general at ker χ̃-kernels (local) resp. the N6 corank engine (candidate), the SAME ladder as EdgeDelSurj's dissolution (the concurrent ∂-glue lane); (⟹, admissibility) is the tau_eT-deck calculus of the pinning (eq:basekappacochain l.2131 read along the lift; dischargeable from P.tau/P.tau_eT + edgeLRead_eq_chiDefect, budgeted as the first dissolution rung). Falsifiable per (ρ, z): both sides are decidable-in-principle finite statements at a concrete bundle. Strictly below keeps 3/4 (it carries no count, no sign, no Gauss content).

                          Equations
                          • One or more equations did not get rendered due to their size.
                          Instances For

                            F-sgn-C1 floor Prop, VALUE spelling (design §5, candidate Gauss-type constancy; prop:candidatezero l.2731 = lem:wall + lem:unitaryline + lem:ramifiedhermitian, P6-OWNED — consumed, not created, by this lane): the descended base-problem Gauss sum takes the single value baseGaussSign s · 2^{dimV/2} at EVERY candidate lower map. The value spelling absorbs the nonsingularity/positivity of the descended form (the "radical ⊆ B¹" converse of the N7 landing note) — each is implied by keep 5 + P6.4–P6.8 and each is falsifiable here as a single ℤ-equation per ρ. Bound to the CONCRETE package boundaryPackage_GammaA (the over-strength guard: never quantify a floor over arbitrary packages). F1/audit-§A guard: NO gaussType (edgeHeadForm …)-tie is stated or implied.

                            Equations
                            • One or more equations did not get rendered due to their size.
                            Instances For

                              F-sgn-L1 floor Prop, VALUE spelling (design §5, local Gauss-type constancy; prop:localzero l.3349 weak half — strictly below keep 5, dissolved BY keep 5 at P8-S2). Audit-§A guard: the nearest literature form (Poonen–Rains JAMS 2012 Prop 4.11) has the OPPOSITE sign and is NEVER cited for this value. Bound to the CONCRETE package boundaryPackage_GQ2 (over-strength guard).

                              Equations
                              • One or more equations did not get rendered due to their size.
                              Instances For

                                The one-common-sign package (S6 + F-sgn-X1: "the common Gauss sum is supplied by prop:candidatezero, prop:localzero — one sign", joint sentence l.3358–3360): ONE bit serves both sources' value floors. The keeps-file residue sec7_zeroEdge_sign_agree : zeroEdgeSign … Z = s_cand mentions zeroEdgeSign and therefore belongs to the coordinator's swap in BlockRecursionKeeps.lean; THIS Prop is its keeps-free content.

                                Equations
                                • One or more equations did not get rendered due to their size.
                                Instances For

                                  §E The T′-stage absorption (the f-level Zcount fibre #

                                  absorption recorded as N9 scope by the N7 landing note)

                                  theorem Q2Presentation.Induction.edgeZ1EquivBtLift_pinned_val {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) (Z : ZeroEdgeDescentData chief K lam hinv) (ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd) (P : ZeroEdgePinning chief K lam hinv Z) (z : ↥(edgeZ1 chief K B ρ)) (γ : ↑Γ.toProfinite.toTop) :
                                  (ProfiniteGrp.Hom.hom ↑((edgeZ1EquivBtLift_pinned chief K B ρ lam hinv Z P) z)) γ = vInG chief K (↑z γ) * P.s (lowerBar chief K B ρ γ)

                                  Value readout of the pinned trivialization (rfl through Equiv.ofBijective and edgeTrivial_apply).

                                  theorem Q2Presentation.Induction.modT_eq_pinned_iff {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) (Z : ZeroEdgeDescentData chief K lam hinv) (ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd) (P : ZeroEdgePinning chief K lam hinv Z) (l : mLift chief K B ρ) (z : ↥(edgeZ1 chief K B ρ)) :
                                  modT chief K B ρ l = (edgeZ1EquivBtLift_pinned chief K B ρ lam hinv Z P) z ↔ FibHom chief K lam hinv B Z ρ P z ↑l

                                  The trivialized-coordinate fibre condition, as an equality of V⋊C-lifts: modT l = trivialization(z) iff the pointwise T'-fibre condition FibHom holds.

                                  theorem Q2Presentation.Induction.liftableML_iff_desc {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) (Z : ZeroEdgeDescentData chief K lam hinv) (ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd) (P : ZeroEdgePinning chief K lam hinv Z) (l : mLift chief K B ρ) (z : ↥(edgeZ1 chief K B ρ)) (hfib : FibHom chief K lam hinv B Z ρ P z ↑l) :
                                  liftableML chief K lam hinv B ρ l ↔ edgeLiftableDesc chief K lam hinv Z B ρ P z

                                  Stage-1 transport at a fibre point: an M-lift over the z-twisted V⋊C-lift is λ-liftable iff z is desc-liftable (N1's coverLiftableWeak_iff_descLiftableWeak + the fibre-condition rewiring).

                                  theorem Q2Presentation.Induction.card_fib_dichotomy {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) (Z : ZeroEdgeDescentData chief K lam hinv) (ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd) (P : ZeroEdgePinning chief K lam hinv Z) (tok : IotaToken Γ) [Finite (Γ ⟶ ProfiniteGrp.ofFiniteGrp (FiniteGrp.of (XRZero.xrChild chief K).fst.Y))] (haff : EdgeAffineLifting chief K lam hinv B Z ρ P) (hT : ∀ (l0 : mLift chief K B ρ), Nat.card (weakLift (XRZero.xrChild chief K).fst (tChildKernel chief K) B (XRZero.xrChild chief K).snd ↑l0) = 2 ^ (2 * dimT chief K + rT chief K)) (z : ↥(edgeZ1 chief K B ρ)) :
                                  Nat.card { l : mLift chief K B ρ // liftableML chief K lam hinv B ρ l ∧ FibHom chief K lam hinv B Z ρ P z ↑l } = if (edgeL chief K B ρ tok) z = edgeKappa chief K lam hinv Z B ρ tok ∧ edgeLiftableDesc chief K lam hinv Z B ρ P z then 2 ^ (2 * dimT chief K + rT chief K) else 0

                                  The per-coordinate fibre dichotomy: over a twisted cocycle z, the λ-liftable M-lift fibre count is 2^{2·dimT+rT} when z is constrained (L z = κ₀, via the affine floor) and desc-liftable, and 0 otherwise.

                                  theorem Q2Presentation.Induction.edgeRealization_absorption {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) (Z : ZeroEdgeDescentData chief K lam hinv) (ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd) (P : ZeroEdgePinning chief K lam hinv Z) (tok : IotaToken Γ) [Fintype ↥(edgeZ1 chief K B ρ)] [Finite (Γ ⟶ ProfiniteGrp.ofFiniteGrp (FiniteGrp.of (XRZero.xrChild chief K).fst.Y))] (haff : EdgeAffineLifting chief K lam hinv B Z ρ P) (hT : ∀ (l0 : mLift chief K B ρ), Nat.card (weakLift (XRZero.xrChild chief K).fst (tChildKernel chief K) B (XRZero.xrChild chief K).snd ↑l0) = 2 ^ (2 * dimT chief K + rT chief K)) :
                                  Nat.card { l : mLift chief K B ρ // liftableML chief K lam hinv B ρ l } = 2 ^ (2 * dimT chief K + rT chief K) * Nat.card { z : ↥(edgeZ1 chief K B ρ) // (edgeL chief K B ρ tok) z = edgeKappa chief K lam hinv Z B ρ tok ∧ edgeLiftableDesc chief K lam hinv Z B ρ P z }

                                  The T′-stage absorption (design §4-N9 / N7-landing-note scope): per lower map, the λ-liftable framed M-lift count equals 2^{2·dimT+rT} times N7's constrained desc-liftable cocycle count. The torsor and stage-1 descent are theorems; the image characterization enters through the EdgeAffineLifting floor; the T′-numeric enters through the per-source hT-slot (card_weakLift_tChild_gammaA/gq2).

                                  §F The Zcount partition over the lower maps #

                                  (coverLiftTotal_equiv_sigma_liftHom restricted to the liftable subtype, through coverLiftFibreEquiv)

                                  def Q2Presentation.Induction.liftableFibreEquiv {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) (ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd) :
                                  { fl : { f : edgeTotal chief K B // coverLiftableWeak chief K lam hinv B f } // edgeBase chief K B ↑fl = ρ } ≃ { l : mLift chief K B ρ // liftableML chief K lam hinv B ρ l }

                                  The per-ρ fibre of the liftable total space is the liftable M-lift set (coverLiftFibreEquiv conjugated through the subtype reassociations).

                                  Equations
                                  • One or more equations did not get rendered due to their size.
                                  Instances For
                                    theorem Q2Presentation.Induction.zcount_eq_sum_liftable {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) [Finite (Γ ⟶ ProfiniteGrp.ofFiniteGrp (FiniteGrp.of (XRZero.xrChild chief K).fst.Y))] [Fintype (boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd)] :
                                    Zcount chief K lam hinv B = ∑ ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd, Nat.card { l : mLift chief K B ρ // liftableML chief K lam hinv B ρ l }

                                    The Zcount partition over the lower maps.

                                    §G The per-χ regroup: Σ_ρ ι±(ρ*Δ_χ) = 2·n_{Γ,0}(Δ_χ) − e_Γ(C) #

                                    (N2's reading lemmas + the proven sGammaZ_eq)

                                    theorem Q2Presentation.Induction.iotaSign_pullDelta_eq_ite {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) (Z : ZeroEdgeDescentData chief K lam hinv) (chi : ↥(XT chief K)) (g : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd) :
                                    iotaSign Γ (pullCochain (cChild chief K).fst (Delta chief K lam hinv Z chi) B (cChild chief K).snd g) = if Nonempty (Lifting.cocycleCoverLiftHom (cChild chief K).fst (Delta chief K lam hinv Z chi) ⋯ ⋯ ⋯ B (cChild chief K).snd g) then 1 else -1

                                    The ±1-indicator of the pulled phase class, in sGammaZ's summand form (N2's iotaSign_pullCochain_eq_one_iff both ways).

                                    theorem Q2Presentation.Induction.sum_iotaSign_pullDelta {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) (Z : ZeroEdgeDescentData chief K lam hinv) (chi : ↥(XT chief K)) [Fintype (boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd)] :
                                    ∑ ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd, iotaSign Γ (pullCochain (cChild chief K).fst (Delta chief K lam hinv Z chi) B (cChild chief K).snd ρ) = 2 * ↑(phaseCount chief K (Delta chief K lam hinv Z chi) ⋯ ⋯ ⋯ B) - ↑(eC chief K B)

                                    The per-χ regroup (eq:recursionR5a consumed): the ρ-sum of the ±1-indicators is 2·phaseCount − eC.

                                    §H The generic assembly (source-generic over the token and the #

                                    per-source numeric/floor slots)

                                    theorem Q2Presentation.Induction.zeroEdgeRealization_assembly {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) (Z : ZeroEdgeDescentData chief K lam hinv) (P : ZeroEdgePinning chief K lam hinv Z) (tok : IotaToken Γ) [Finite (Γ ⟶ ProfiniteGrp.ofFiniteGrp (FiniteGrp.of (XRZero.xrChild chief K).fst.Y))] [Fintype (boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd)] [(ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd) → Fintype ↥(edgeZ1 chief K B ρ)] (s : Bool) (hdel : ∀ (ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd), EdgeDelSurj chief K B ρ) (haff : ∀ (ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd), EdgeAffineLifting chief K lam hinv B Z ρ P) (hW : ∀ (ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd), Nat.card ↥(edgeZ1 chief K B ρ) = 2 ^ (2 * dimV chief K)) (hT : ∀ (ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd) (l0 : mLift chief K B ρ), Nat.card (weakLift (XRZero.xrChild chief K).fst (tChildKernel chief K) B (XRZero.xrChild chief K).snd ↑l0) = 2 ^ (2 * dimT chief K + rT chief K)) (hg : ∀ (ρ : boundaryFramedSurj B (cChild chief K).fst (cChild chief K).snd), Quadratic.Dickson.gaussSum ⋯.descend = Quadratic.baseGaussSign s * 2 ^ (dimV chief K / 2)) :
                                    2 ^ (rT chief K + 1) * ↑(Zcount chief K lam hinv B) = ↑(muT chief K) * (2 ^ dimV chief K * ↑(eC chief K B) + Quadratic.baseGaussSign s * 2 ^ (dimV chief K / 2) * ∑ chi : ↥(XT chief K), (2 * ↑(phaseCount chief K (Delta chief K lam hinv Z chi) ⋯ ⋯ ⋯ B) - ↑(eC chief K B)))

                                    The R4b realization, generic assembly (design §4-N9): the ZeroEdgeCount*-shaped ℤ-identity at a free sign s, from N7's pointwise engine summed over the lower maps. Slots: hdel (the F-∂ floor, per ρ), haff (the affine floor, per ρ), hW/hT (the per-source |Z¹(V)|/|Z¹(T')| numerics — theorems at both sources, §C), hg (the F-sgn value floor at s).

                                    §I The tie-break instrument and the per-source sign-parametric #

                                    exits

                                    theorem Q2Presentation.Induction.zeroEdgeIdentity_sign_free {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) {Γ : ProfiniteGrp.{0}} (B : BoundaryPackage Γ) (Z : ZeroEdgeDescentData chief K lam hinv) (h1 : 2 ^ (rT chief K + 1) * ↑(Zcount chief K lam hinv B) = ↑(muT chief K) * (2 ^ dimV chief K * ↑(eC chief K B) + Quadratic.baseGaussSign true * 2 ^ (dimV chief K / 2) * ∑ chi : ↥(XT chief K), (2 * ↑(phaseCount chief K (Delta chief K lam hinv Z chi) ⋯ ⋯ ⋯ B) - ↑(eC chief K B)))) (h0 : 2 ^ (rT chief K + 1) * ↑(Zcount chief K lam hinv B) = ↑(muT chief K) * (2 ^ dimV chief K * ↑(eC chief K B) + Quadratic.baseGaussSign false * 2 ^ (dimV chief K / 2) * ∑ chi : ↥(XT chief K), (2 * ↑(phaseCount chief K (Delta chief K lam hinv Z chi) ⋯ ⋯ ⋯ B) - ↑(eC chief K B)))) (s : Bool) :
                                    2 ^ (rT chief K + 1) * ↑(Zcount chief K lam hinv B) = ↑(muT chief K) * (2 ^ dimV chief K * ↑(eC chief K B) + Quadratic.baseGaussSign s * 2 ^ (dimV chief K / 2) * ∑ chi : ↥(XT chief K), (2 * ↑(phaseCount chief K (Delta chief K lam hinv Z chi) ⋯ ⋯ ⋯ B) - ↑(eC chief K B)))

                                    The both-signs tie-break (design §3.1(ii)/§4-N9: "both signs ⟹ the phase-sum term vanishes ⟹ every consumer identity is sign-insensitive"): if the R4b identity holds at BOTH signs then it holds at every sign — the instrument the keeps-file swap uses to resolve zeroEdgeSign's definite description against the delivered sign.

                                    The per-source exits (sign-parametric; the keeps-file swap #

                                    connects them to zeroEdgeSign)

                                    theorem Q2Presentation.Induction.zeroEdgeCount_gammaA_of_floors {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) (Z : ZeroEdgeDescentData chief K lam hinv) (P : ZeroEdgePinning chief K lam hinv Z) (s : Bool) (hdel : ∀ (ρ : boundaryFramedSurj boundaryPackage_GammaA (cChild chief K).fst (cChild chief K).snd), EdgeDelSurj chief K boundaryPackage_GammaA ρ) (haff : ∀ (ρ : boundaryFramedSurj boundaryPackage_GammaA (cChild chief K).fst (cChild chief K).snd), EdgeAffineLifting chief K lam hinv boundaryPackage_GammaA Z ρ P) (hgauss : EdgeGaussLineGammaA chief K lam hinv Z s) :
                                    ZeroEdgeCountGammaA chief K lam hinv Z s

                                    The R4b count, candidate source, at a delivered sign — keep 3's count content, sign-parametric (design §4-N9 output ZeroEdgeCount* Z s_source): all four floor slots explicit.

                                    theorem Q2Presentation.Induction.zeroEdgeCount_gq2_of_floors {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) (Z : ZeroEdgeDescentData chief K lam hinv) (P : ZeroEdgePinning chief K lam hinv Z) (s : Bool) (hdel : ∀ (ρ : boundaryFramedSurj boundaryPackage_GQ2 (cChild chief K).fst (cChild chief K).snd), EdgeDelSurj chief K boundaryPackage_GQ2 ρ) (haff : ∀ (ρ : boundaryFramedSurj boundaryPackage_GQ2 (cChild chief K).fst (cChild chief K).snd), EdgeAffineLifting chief K lam hinv boundaryPackage_GQ2 Z ρ P) (hgauss : EdgeGaussLineGQ2 chief K lam hinv Z s) :
                                    ZeroEdgeCountGQ2 chief K lam hinv Z s

                                    The R4b count, local source, at a delivered sign — keep 4's count content, sign-parametric.

                                    theorem Q2Presentation.Induction.zeroEdgeCount_gammaA_of_delSurj {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) (Z : ZeroEdgeDescentData chief K lam hinv) (hpin : ZeroEdgeDescentDataPinned chief K lam hinv Z) (hds : ∀ (ρ : boundaryFramedSurj boundaryPackage_GammaA (cChild chief K).fst (cChild chief K).snd), EdgeDelSurj chief K boundaryPackage_GammaA ρ) (haff : ∀ (P : ZeroEdgePinning chief K lam hinv Z) (ρ : boundaryFramedSurj boundaryPackage_GammaA (cChild chief K).fst (cChild chief K).snd), EdgeAffineLifting chief K lam hinv boundaryPackage_GammaA Z ρ P) (hgauss : ∃ (s : Bool), EdgeGaussLineGammaA chief K lam hinv Z s) :
                                    ∃ (s : Bool), ZeroEdgeCountGammaA chief K lam hinv Z s

                                    Keep 3's count content in the ∃-sign form, at a merely-pinned bundle (the mission's ∃ s-exit shape; P recovered by choice from ZeroEdgeDescentDataPinned, so the affine floor is quantified over the pinning).

                                    theorem Q2Presentation.Induction.zeroEdgeCount_gq2_of_delSurj {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) (Z : ZeroEdgeDescentData chief K lam hinv) (hpin : ZeroEdgeDescentDataPinned chief K lam hinv Z) (hds : ∀ (ρ : boundaryFramedSurj boundaryPackage_GQ2 (cChild chief K).fst (cChild chief K).snd), EdgeDelSurj chief K boundaryPackage_GQ2 ρ) (haff : ∀ (P : ZeroEdgePinning chief K lam hinv Z) (ρ : boundaryFramedSurj boundaryPackage_GQ2 (cChild chief K).fst (cChild chief K).snd), EdgeAffineLifting chief K lam hinv boundaryPackage_GQ2 Z ρ P) (hgauss : ∃ (s : Bool), EdgeGaussLineGQ2 chief K lam hinv Z s) :
                                    ∃ (s : Bool), ZeroEdgeCountGQ2 chief K lam hinv Z s

                                    Keep 4's count content in the ∃-sign form (the mission's zeroEdgeCount_gq2_of_delSurj shape).

                                    theorem Q2Presentation.Induction.zeroEdgeCount_pair_of_commonGauss {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) (Z : ZeroEdgeDescentData chief K lam hinv) (hpin : ZeroEdgeDescentDataPinned chief K lam hinv Z) (hdsA : ∀ (ρ : boundaryFramedSurj boundaryPackage_GammaA (cChild chief K).fst (cChild chief K).snd), EdgeDelSurj chief K boundaryPackage_GammaA ρ) (hdsQ : ∀ (ρ : boundaryFramedSurj boundaryPackage_GQ2 (cChild chief K).fst (cChild chief K).snd), EdgeDelSurj chief K boundaryPackage_GQ2 ρ) (haffA : ∀ (P : ZeroEdgePinning chief K lam hinv Z) (ρ : boundaryFramedSurj boundaryPackage_GammaA (cChild chief K).fst (cChild chief K).snd), EdgeAffineLifting chief K lam hinv boundaryPackage_GammaA Z ρ P) (haffQ : ∀ (P : ZeroEdgePinning chief K lam hinv Z) (ρ : boundaryFramedSurj boundaryPackage_GQ2 (cChild chief K).fst (cChild chief K).snd), EdgeAffineLifting chief K lam hinv boundaryPackage_GQ2 Z ρ P) (hcommon : ZeroEdgeCommonGauss chief K lam hinv Z) :
                                    ∃ (s : Bool), ZeroEdgeCountGammaA chief K lam hinv Z s ∧ ZeroEdgeCountGQ2 chief K lam hinv Z s

                                    The joint one-sign package (keeps 3+4's count content at ONE common sign, from the S6/X1 common-Gauss floor): both source counts hold at the same s. The keeps swap resolves zeroEdgeSign Z against this s by the §3.1(ii) case split (zeroEdgeCountGQ2_sign_free supplies the both-signs branch).

                                    The per-source both-signs instruments (def-Prop wrappers of #

                                    zeroEdgeIdentity_sign_free; the keeps swap's §3.1(ii) branch)

                                    theorem Q2Presentation.Induction.zeroEdgeCountGammaA_sign_free {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) (Z : ZeroEdgeDescentData chief K lam hinv) (h1 : ZeroEdgeCountGammaA chief K lam hinv Z true) (h0 : ZeroEdgeCountGammaA chief K lam hinv Z false) (s : Bool) :
                                    ZeroEdgeCountGammaA chief K lam hinv Z s

                                    Both signs ⟹ every sign, candidate source.

                                    theorem Q2Presentation.Induction.zeroEdgeCountGQ2_sign_free {p : FramedPair} (chief : FirstNonScalarChiefFactor p) (K : KernelMinimal chief.toNonScalarChiefFactor) (lam : Module.Dual (ZMod 2) (Lifting.NAdd (xrKernel chief K))) (hinv : lam ∈ Lifting.conjInvDuals (xrKernel chief K)) (Z : ZeroEdgeDescentData chief K lam hinv) (h1 : ZeroEdgeCountGQ2 chief K lam hinv Z true) (h0 : ZeroEdgeCountGQ2 chief K lam hinv Z false) (s : Bool) :
                                    ZeroEdgeCountGQ2 chief K lam hinv Z s

                                    Both signs ⟹ every sign, local source.