Documentation

Anderson4D.DetParametrix.Paper42_Moment.R324WithinHalfEndpointStopAtTerminal

Phased within-half transport stopping before a named terminal step #

The complete alternating driver consumes the whole analytic schedule. In the outgoing-shortcut branch this is one step too far: the distinguished terminal block must remain visible for the endpoint Fourier collapse.

This module runs the same ordinary/exceptional alternation only through the proper prefix before a prescribed final step. Ordinary runs are represented by R324WithinHalfStopBeforeStepTrace; a slot-zero-fed head is represented by R324WithinHalfNextExceptionalStop. The recursion is on the length of the proper prefix before the named terminal. Consequently the terminal step is never absorbed.

No norm is taken here. The exact signed/phased integral, its transported coefficient, and a quantitative edge certificate at the stop are retained.

The strictly decreasing terminal-prefix ledger #

theorem Anderson4D.R324WithinHalfResidualPrefix.R324WithinHalfNextExceptionalStop.exists_terminalPrefix_lt {ρ : SmoothCutoff} {lam ε : ℝ} {m : ℕ} {pairing : PartialPairing (Fin m)} {terminal : R322ExtractionStep m} {res : R324WithinHalfResidualPrefix ρ lam ε pairing} {scale : Fin (m + 1) → ℝ} (data : res.R324WithinHalfNextExceptionalStop scale) (pre : List (R322ExtractionStep m)) (hremaining : res.remaining = pre ++ [terminal]) (hbefore : data.pre.length < pre.length) :
∃ (post : List (R322ExtractionStep m)), data.suffix = post ++ [terminal] ∧ post.length < pre.length

At a next exceptional stop lying strictly inside the proper prefix before terminal, the after-head suffix again has a proper-prefix/terminal decomposition, and that new proper prefix is strictly shorter.

The endpoint-stop transport package #

Exact phased transport from a reachable residual prefix to the state immediately before a prescribed final schedule step. The terminal remains the singleton remaining list.

Instances For

    The stopped state still satisfies the exact schedule ledger.

    Base case: the proper prefix is wholly ordinary #

    noncomputable def Anderson4D.R324WithinHalfResidualPrefix.R324WithinHalfEndpointStopAtTerminal.of_ordinaryTrace {ρ : SmoothCutoff} {lam ε : ℝ} {m : ℕ} {pairing : PartialPairing (Fin m)} {terminal : R322ExtractionStep m} {res : R324WithinHalfResidualPrefix ρ lam ε pairing} {scale : Fin (m + 1) → ℝ} (trace : R324WithinHalfStopBeforeStepTrace terminal [] res scale) (hordinary : trace.OrdinaryAlong) :

    An ordinary stop-before-step trace is already an endpoint-stop transport, with trivial multiplier and its transported edge certificate.

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

      Recursive step: one exceptional head before the terminal #

      noncomputable def Anderson4D.R324WithinHalfResidualPrefix.R324WithinHalfEndpointStopAtTerminal.composeNextExceptionalStop {ρ : SmoothCutoff} {lam ε : ℝ} {m : ℕ} {pairing : PartialPairing (Fin m)} {terminal : R322ExtractionStep m} {res : R324WithinHalfResidualPrefix ρ lam ε pairing} {scale : Fin (m + 1) → ℝ} (data : res.R324WithinHalfNextExceptionalStop scale) (hε : 0 < ε) (hε1 : ε ≤ 1) (sub : R324WithinHalfEndpointStopAtTerminal terminal (data.trace.stopPrefix.afterHead data.terminal data.suffix ⋯)) :

      Compose the ordinary run and exceptional collapse at the next stop with an endpoint-stop transport of its after-head suffix. The named terminal remains untouched in the recursive subtransport.

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

        Strong-induction driver #

        @[irreducible]
        def Anderson4D.R324WithinHalfResidualPrefix.R324WithinHalfEndpointStopAtTerminal.of_localBlockProvider {ρ : SmoothCutoff} {C lam ε K : ℝ} {m : ℕ} {pairing : PartialPairing (Fin m)} (hε : 0 < ε) (hε1 : ε ≤ 1) (provider : R324WithinHalfLocalBlockProvider ρ C lam ε K pairing) (res : R324WithinHalfResidualPrefix ρ lam ε pairing) (scale : Fin (m + 1) → ℝ) (certificate : R324WithinHalfEdgeCertificate res.state scale) (terminal : R322ExtractionStep m) (pre : List (R322ExtractionStep m)) (hremaining : res.remaining = pre ++ [terminal]) :

        Endpoint-stop driver. Starting from an explicit decomposition remaining = pre ++ [terminal], alternate ordinary runs and exceptional head collapses only through pre. The recursion terminates because the proper prefix exposed after every exceptional head is strictly shorter. The named terminal itself is never consumed.

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For
          theorem Anderson4D.R324WithinHalfResidualPrefix.R324WithinHalfEndpointStopAtTerminal.exists_r324WithinHalfEndpointStopAtTerminal {ρ : SmoothCutoff} {C lam ε K : ℝ} {m : ℕ} {pairing : PartialPairing (Fin m)} (hε : 0 < ε) (hε1 : ε ≤ 1) (provider : R324WithinHalfLocalBlockProvider ρ C lam ε K pairing) (res : R324WithinHalfResidualPrefix ρ lam ε pairing) (scale : Fin (m + 1) → ℝ) (certificate : R324WithinHalfEdgeCertificate res.state scale) (terminal : R322ExtractionStep m) (pre : List (R322ExtractionStep m)) (hremaining : res.remaining = pre ++ [terminal]) :

          Headline existence form used by the outgoing-shortcut assembly.