Documentation

Anderson4D.DetParametrix.Paper42_Moment.R324OrdinaryAlongDischarge

Discharging OrdinaryAlong: the longest ordinary run and the next stop #

OrdinaryAlong is false for a general remaining suffix: a later block all of whose earlier vertices have already been consumed is fed by slot zero. This module provides the decomposition that the alternating trace needs: every remaining list splits as the longest ordinary run followed either by nothing or by a slot-zero-fed head.

The sparse predecessor slot depends only on the processed schedule prefix, never on the named kernels. The run is therefore a purely combinatorial takeWhile-style recursion on the remaining list with an evolving processed accumulator. Its specifications discharge OrdinaryAlong both for complete certified analytic traces (when the run covers the whole remaining list) and for certified stop-before-step traces that stop at the run boundary. The phased one-head transport then iterates exactly up to the next slot-zero-fed head, at arbitrary Fourier-evaluated endpoints, and the packaged next-stop data exposes the boundary head with its literal slot-zero certificate for the exceptional collapse.

The predecessor slot is a function of the processed prefix #

The sparse predecessor slot reads only the active carrier, hence only the processed schedule prefix; the named kernels are irrelevant.

noncomputable def Anderson4D.r324WithinHalfListPredecessorSlot {m : ℕ} (processed : List (R322ExtractionStep m)) (step : R322ExtractionStep m) :
Fin (m + 1)

The predecessor slot of a head over a bare processed prefix.

Equations
Instances For

    Any state computes its predecessor slots through its processed list.

    The longest ordinary run #

    Length of the longest prefix of the remaining list along which every head, read at its own evolved processed prefix, has a nonzero predecessor slot. The recursion consumes one head at a time, appending it to the processed accumulator exactly as absorb does.

    Equations
    Instances For

      Ordinariness inside the run. Every head whose position lies strictly inside the ordinary run has a nonzero predecessor slot at its own evolved processed prefix.

      The head after the run is fed by slot zero. When the run does not exhaust the list, the first head past the run has predecessor slot zero at the processed prefix extended by the whole run.

      Processed prefixes are determined by remaining suffixes #

      Two residual prefixes of the same schedule with nested remaining lists differ by an explicit consumed middle segment, appended to the processed prefix.

      Discharge for complete certified analytic traces #

      All-ordinary discharge. If the ordinary run covers the whole remaining list, every certified analytic trace from that residual prefix is ordinary along all of its heads.

      Ordinariness along a stop-before-step trace #

      def Anderson4D.R324WithinHalfResidualPrefix.R324WithinHalfStopBeforeStepTrace.OrdinaryAlong {ρ : SmoothCutoff} {lam ε : ℝ} {m : ℕ} {pairing : PartialPairing (Fin m)} {terminal : R322ExtractionStep m} {suffix : List (R322ExtractionStep m)} {res : R324WithinHalfResidualPrefix ρ lam ε pairing} {scale : Fin (m + 1) → ℝ} (trace : R324WithinHalfStopBeforeStepTrace terminal suffix res scale) :

      Every head genuinely consumed by a stop-before-step trace has a nonzero sparse predecessor slot. The retained stop step itself is not constrained.

      Equations
      Instances For
        theorem Anderson4D.R324WithinHalfResidualPrefix.R324WithinHalfStopBeforeStepTrace.isSuffix_remaining {ρ : SmoothCutoff} {lam ε : ℝ} {m : ℕ} {pairing : PartialPairing (Fin m)} {terminal : R322ExtractionStep m} {suffix : List (R322ExtractionStep m)} {res : R324WithinHalfResidualPrefix ρ lam ε pairing} {scale : Fin (m + 1) → ℝ} (trace : R324WithinHalfStopBeforeStepTrace terminal suffix res scale) :
        terminal :: suffix <:+ res.remaining

        The retained named suffix is a suffix of every remaining list met by the trace, in particular of the starting one.

        theorem Anderson4D.R324WithinHalfResidualPrefix.R324WithinHalfStopBeforeStepTrace.ordinaryAlong_of_predecessorSlot_ne_zero {ρ : SmoothCutoff} {lam ε : ℝ} {m : ℕ} {pairing : PartialPairing (Fin m)} {terminal : R322ExtractionStep m} {suffix : List (R322ExtractionStep m)} {res : R324WithinHalfResidualPrefix ρ lam ε pairing} {scale : Fin (m + 1) → ℝ} (trace : R324WithinHalfStopBeforeStepTrace terminal suffix res scale) (hpreds : ∀ (res' : R324WithinHalfResidualPrefix ρ lam ε pairing) (head : R322ExtractionStep m) (tail : List (R322ExtractionStep m)), res'.remaining = head :: tail → res'.remaining <:+ res.remaining → terminal :: suffix <:+ tail → r324WithinHalfPredecessorSlot res'.state head ≠ 0) :

        Ordinariness along a stop-before-step trace follows from the purely combinatorial statement for every strictly pre-stop head: the retained named suffix must still lie inside the tail.

        theorem Anderson4D.R324WithinHalfResidualPrefix.R324WithinHalfStopBeforeStepTrace.ordinaryAlong_of_le_ordinaryRunLength {ρ : SmoothCutoff} {lam ε : ℝ} {m : ℕ} {pairing : PartialPairing (Fin m)} {terminal : R322ExtractionStep m} {suffix : List (R322ExtractionStep m)} {res : R324WithinHalfResidualPrefix ρ lam ε pairing} {scale : Fin (m + 1) → ℝ} (trace : R324WithinHalfStopBeforeStepTrace terminal suffix res scale) (pre : List (R322ExtractionStep m)) (hremaining : res.remaining = pre ++ terminal :: suffix) (hlen : pre.length ≤ r324WithinHalfOrdinaryRunLength res.state.processed res.remaining) :

        Run discharge for stop traces. A stop-before-step trace whose consumed prefix lies inside the ordinary run is ordinary along every consumed head.

        Phased transport up to the stop #

        theorem Anderson4D.R324WithinHalfResidualPrefix.R324WithinHalfStopBeforeStepTrace.integrable_stop_incomingPhasedResidualDensity {ρ : SmoothCutoff} {lam ε : ℝ} {m : ℕ} {pairing : PartialPairing (Fin m)} {terminal : R322ExtractionStep m} {suffix : List (R322ExtractionStep m)} {res : R324WithinHalfResidualPrefix ρ lam ε pairing} {scale : Fin (m + 1) → ℝ} (x y : T4) (trace : R324WithinHalfStopBeforeStepTrace terminal suffix res scale) (hordinary : trace.OrdinaryAlong) (coefficient : (trace.stopPrefix.SurvivingCoordinate → T4) → ℂ) (k : Z4) (hfull : MeasureTheory.Integrable (fun (w : res.SurvivingCoordinate → T4) => res.incomingPhasedResidualDensity (coefficient (trace.stopProjection w)) k ρ ε x y w) (MeasureTheory.Measure.pi fun (x : res.SurvivingCoordinate) => paperMeasure)) :

        Integrability transport to the stop. Full integrability of the phased density at the root of an ordinary stop-before-step trace transports to the stopping prefix, at arbitrary endpoints.

        theorem Anderson4D.R324WithinHalfResidualPrefix.R324WithinHalfStopBeforeStepTrace.lamEps_pow_integral_incomingPhasedResidualDensity_eq_stop {ρ : SmoothCutoff} {lam ε : ℝ} {m : ℕ} {pairing : PartialPairing (Fin m)} {terminal : R322ExtractionStep m} {suffix : List (R322ExtractionStep m)} {res : R324WithinHalfResidualPrefix ρ lam ε pairing} {scale : Fin (m + 1) → ℝ} (x y : T4) (trace : R324WithinHalfStopBeforeStepTrace terminal suffix res scale) (hordinary : trace.OrdinaryAlong) (coefficient : (trace.stopPrefix.SurvivingCoordinate → T4) → ℂ) (k : Z4) (hfull : MeasureTheory.Integrable (fun (w : res.SurvivingCoordinate → T4) => res.incomingPhasedResidualDensity (coefficient (trace.stopProjection w)) k ρ ε x y w) (MeasureTheory.Measure.pi fun (x : res.SurvivingCoordinate) => paperMeasure)) :
        (↑(lamEps lam ε) ^ (2 * res.remainingOrder) * ∫ (w : res.SurvivingCoordinate → T4), res.incomingPhasedResidualDensity (coefficient (trace.stopProjection w)) k ρ ε x y w ∂MeasureTheory.Measure.pi fun (x : res.SurvivingCoordinate) => paperMeasure) = ↑(lamEps lam ε) ^ (2 * trace.stopPrefix.remainingOrder) * ∫ (v : trace.stopPrefix.SurvivingCoordinate → T4), trace.stopPrefix.incomingPhasedResidualDensity (coefficient v) k ρ ε x y v ∂MeasureTheory.Measure.pi fun (x : trace.stopPrefix.SurvivingCoordinate) => paperMeasure

        Phased recursion to the stop. Along an ordinary stop-before-step trace, the weighted incoming phased residual integral transports exactly to the stopping prefix: the perturbative power drops to twice the retained remaining order and the density becomes the stop phased density with the same coefficient, phase mode, and endpoints.

        The exceptional entry at an arbitrary slot-zero-fed head #

        The proved exceptional collapse machinery is anchored at the refined physical root. The two identities below are its endpoint-agnostic core at an arbitrary residual prefix: the transported outgoing Fourier mode of a slot-zero-fed head re-anchors the phase at the post-head anchor with one paper second-order decay, and the phased density splits pointwise into the head character, the translated erased raw local core, and the coefficient with the ordinary outer factor. Both hold at every pair of Fourier-evaluated endpoints, in particular at the endpoint 0 produced by the first exceptional collapse.

        theorem Anderson4D.R324WithinHalfResidualPrefix.incomingExceptionalTransportedMode_eq_decay_mul_afterHead_anchor {ρ : SmoothCutoff} {lam ε : ℝ} {m : ℕ} {pairing : PartialPairing (Fin m)} (res : R324WithinHalfResidualPrefix ρ lam ε pairing) (head : R322ExtractionStep m) (tail : List (R322ExtractionStep m)) (hremaining : res.remaining = head :: tail) (hpred : r324WithinHalfPredecessorSlot res.state head = 0) (k : Z4) (x y : T4) (v : (res.afterHead head tail hremaining).SurvivingCoordinate → T4) :
        incomingExceptionalTransportedMode k (res.headSuccessorPoint head tail hremaining x y v) (res.state.edges (res.headContext head tail hremaining).outgoingSlot) = ↑(paperSecondOrderModeDecay k) * charT4 k ((res.afterHead head tail hremaining).incomingPhaseAnchor x y v)

        The transported outgoing mode of a slot-zero-fed head at an arbitrary residual prefix: one paper second-order decay times the incoming character read at the post-head phase anchor. Generalizes the root-anchored assembly identity to every stop of the alternating trace.

        theorem Anderson4D.R324WithinHalfResidualPrefix.paperDecay_mul_incomingExceptionalTransportedMode_mul_eq_afterHead_anchor {ρ : SmoothCutoff} {lam ε : ℝ} {m : ℕ} {pairing : PartialPairing (Fin m)} (res : R324WithinHalfResidualPrefix ρ lam ε pairing) (head : R322ExtractionStep m) (tail : List (R322ExtractionStep m)) (hremaining : res.remaining = head :: tail) (hpred : r324WithinHalfPredecessorSlot res.state head = 0) (k : Z4) (x y : T4) (v : (res.afterHead head tail hremaining).SurvivingCoordinate → T4) (payload : ℂ) :
        ↑(paperSecondOrderModeDecay k) * incomingExceptionalTransportedMode k (res.headSuccessorPoint head tail hremaining x y v) (res.state.edges (res.headContext head tail hremaining).outgoingSlot) * payload = ↑(paperSecondOrderModeDecay k) ^ 2 * charT4 k ((res.afterHead head tail hremaining).incomingPhaseAnchor x y v) * payload

        Consumer form of the re-anchoring identity at an arbitrary slot-zero-fed head: together with the decay extracted by the incoming Fourier evaluation, the collapse leaves a squared second-order decay and the phase re-anchored after the head.

        theorem Anderson4D.R324WithinHalfResidualPrefix.incomingPhasedResidualDensity_reconstruct_split_of_eq_zero {ρ : SmoothCutoff} {lam ε : ℝ} {m : ℕ} {pairing : PartialPairing (Fin m)} (res : R324WithinHalfResidualPrefix ρ lam ε pairing) (head : R322ExtractionStep m) (tail : List (R322ExtractionStep m)) (hremaining : res.remaining = head :: tail) (hpred : r324WithinHalfPredecessorSlot res.state head = 0) (coefficient : ℂ) (k : Z4) (ρ' : SmoothCutoff) (ε' : ℝ) (x y : T4) (t : Fin (2 * residualBlockOrder head.2) → T4) (v : (res.afterHead head tail hremaining).SurvivingCoordinate → T4) :
        res.incomingPhasedResidualDensity coefficient k ρ' ε' x y ((res.splitSurvivingPiMeasurableEquiv head tail hremaining).symm (t, v)) = charT4 k (t ⟨0, ⋯⟩) * (res.headContext head tail hremaining).incomingErasedTranslatedRawLocalCore ρ' ε' (res.headSuccessorPoint head tail hremaining x y v) t * (coefficient * ↑(res.headOuterFactor head tail hremaining ρ' ε' x y v))

        Pointwise exceptional entry for the phased density. At a slot-zero-fed head the incoming phased density splits across the head/post equivalence into the character read at the first head coordinate, the translated erased raw local core, and the coefficient carrying the ordinary head outer factor.

        The next exceptional stop of a residual prefix #

        structure Anderson4D.R324WithinHalfResidualPrefix.R324WithinHalfNextExceptionalStop {ρ : SmoothCutoff} {lam ε : ℝ} {m : ℕ} {pairing : PartialPairing (Fin m)} (res : R324WithinHalfResidualPrefix ρ lam ε pairing) (scale : Fin (m + 1) → ℝ) :

        The certified decomposition of a remaining list at its next slot-zero-fed head: the longest ordinary run is consumed by a certified stop-before-step trace, ordinary along every consumed head, and the retained named step is the first head past the run.

        Instances For

          The stopping state has consumed exactly the recorded ordinary run.

          The retained head is genuinely exceptional: at the stopping state its sparse predecessor slot is literally zero.

          Re-anchoring identity read at the packaged next stop: the transported outgoing mode of the retained head collapses to a squared second-order decay and the phase re-anchored after the head, at arbitrary endpoints.

          theorem Anderson4D.R324WithinHalfResidualPrefix.R324WithinHalfNextExceptionalStop.incomingPhasedResidualDensity_reconstruct_split {ρ : SmoothCutoff} {lam ε : ℝ} {m : ℕ} {pairing : PartialPairing (Fin m)} {res : R324WithinHalfResidualPrefix ρ lam ε pairing} {scale : Fin (m + 1) → ℝ} (data : res.R324WithinHalfNextExceptionalStop scale) (coefficient : ℂ) (k : Z4) (ρ' : SmoothCutoff) (ε' : ℝ) (x y : T4) (t : Fin (2 * residualBlockOrder data.terminal.2) → T4) (v : (data.trace.stopPrefix.afterHead data.terminal data.suffix ⋯).SurvivingCoordinate → T4) :
          data.trace.stopPrefix.incomingPhasedResidualDensity coefficient k ρ' ε' x y ((data.trace.stopPrefix.splitSurvivingPiMeasurableEquiv data.terminal data.suffix ⋯).symm (t, v)) = charT4 k (t ⟨0, ⋯⟩) * (data.trace.stopPrefix.headContext data.terminal data.suffix ⋯).incomingErasedTranslatedRawLocalCore ρ' ε' (data.trace.stopPrefix.headSuccessorPoint data.terminal data.suffix ⋯ x y v) t * (coefficient * ↑(data.trace.stopPrefix.headOuterFactor data.terminal data.suffix ⋯ ρ' ε' x y v))

          Pointwise exceptional entry of the phased density at the packaged next stop.

          theorem Anderson4D.R324WithinHalfResidualPrefix.nonempty_r324WithinHalfNextExceptionalStop_of_lt_length {ρ : SmoothCutoff} {lam ε : ℝ} {m : ℕ} {pairing : PartialPairing (Fin m)} {C K : ℝ} (hε : 0 < ε) (hε1 : ε ≤ 1) (provider : R324WithinHalfLocalBlockProvider ρ C lam ε K pairing) (res : R324WithinHalfResidualPrefix ρ lam ε pairing) (scale : Fin (m + 1) → ℝ) (certificate : R324WithinHalfEdgeCertificate res.state scale) (hlt : r324WithinHalfOrdinaryRunLength res.state.processed res.remaining < res.remaining.length) :

          Existence of the next exceptional stop. Whenever the ordinary run does not exhaust the remaining list, the local block provider builds the certified stop-before-step trace to the run boundary, ordinary along every consumed head.

          theorem Anderson4D.R324WithinHalfResidualPrefix.ordinaryRunLength_eq_length_or_nonempty_nextExceptionalStop {ρ : SmoothCutoff} {lam ε : ℝ} {m : ℕ} {pairing : PartialPairing (Fin m)} {C K : ℝ} (hε : 0 < ε) (hε1 : ε ≤ 1) (provider : R324WithinHalfLocalBlockProvider ρ C lam ε K pairing) (res : R324WithinHalfResidualPrefix ρ lam ε pairing) (scale : Fin (m + 1) → ℝ) (certificate : R324WithinHalfEdgeCertificate res.state scale) :

          The alternative. Every residual prefix either is ordinary along its whole remaining list, or admits a certified next exceptional stop.

          Discharge at the proved exceptional stop assembly #

          The OrdinaryAlong hypothesis of the proved phased endgame theorems holds whenever the ordinary run of the after-head residual covers the whole retained suffix. When it does not, the after-head residual instead admits a certified next exceptional stop by nonempty_r324WithinHalfNextExceptionalStop_of_lt_length.