normalized
The normalized definition constructs the rescaled sequence ã(n) = a(n) / runningMax(a)(n) for any real-valued sequence a on the naturals. Navier-Stokes analysts would cite it when rescaling a hypothetical blow-up sequence of vorticity sup-norms to produce a bounded ancient solution. The definition is a direct one-line quotient by the running maximum, which itself is the finite supremum over the initial segment.
claimLet $a : ℕ → ℝ$. The normalized sequence is defined by $ã(n) := a(n) / M̃(n)$, where $M̃(n) = max_{k ≤ n} a(k)$.
background
The module formalizes running-max normalization for the Navier-Stokes regularity argument, specifically to extract ancient elements from a blowing-up sequence of times tₙ → T* with Mₙ = ‖ω(·,tₙ)‖{L^∞} → ∞. The running maximum is supplied by the upstream definition runningMax a n := Finset.sup' (Finset.range (n+1)) (Finset.nonempty_range_add_one) a, which returns the maximum of a over the finite initial segment. The local theoretical setting is pure real analysis on monotone sequences and suprema, as stated in the module documentation: it is the standard construction of Caffarelli-Kohn-Nirenberg and Escauriaza-Seregin-Šverák that yields ‖ω̃(·,tₙ)‖{L^∞} ≤ 1 by construction.
proof idea
The definition is a one-line wrapper that applies the upstream runningMax: it simply divides the current term a n by runningMax a n. No tactics or lemmas beyond the definition of runningMax are required.
why it matters in Recognition Science
This supplies the scale-invariant normalization step in NS Paper §3 Step 1. It feeds the downstream CostAlgebraData structure (canonicalCostAlgebra, cost_algebra_unique) where the same normalization pattern appears for the J-cost function satisfying the Recognition Composition Law. The construction directly supports the T5 J-uniqueness claim in the forcing chain by guaranteeing a bounded normalized sequence with |ã| ≤ 1, and it closes the scaffolding for the boundedness claim in the Navier-Stokes regularity argument.
scope and limits
- Does not prove convergence or compactness of the normalized sequence.
- Does not assume a is positive or monotone.
- Does not extend the construction to continuous-time functions.
- Does not discharge any regularity hypotheses on the underlying flow.
formal statement (Lean)
70noncomputable def normalized (a : ℕ → ℝ) (n : ℕ) : ℝ :=
proof body
Definition body.
71 a n / runningMax a n
72
73/-- The normalized sequence is bounded by 1 in absolute value. -/
used by (40)
-
canonicalCostAlgebra -
CostAlgebraData -
cost_algebra_unique -
cost_algebra_unique_aczel -
costFamily_one_eq_J -
J -
ionizationProxy -
landscape_linear -
lambda_rec_is_forced -
total_curvature_gauss_bonnet -
eleven_is_passive_edges -
Q_max_normalized -
sigma8_predicted -
PrimitiveCostHypotheses -
primitive_to_uniqueness_of_kernel -
dAlembert_to_ODE_hypothesis_of_contDiff -
reciprocal_implies_G_even -
multiplicative_le_additive_of_sqNorm_le_one -
mu -
Jcost_is_reciprocal -
cproj_eq_two_from_J_normalization -
dAlembert_forces_cosh_is_theorem -
bilinear_family_reduction -
F_symmetric_of_P_symmetric -
rcl_right_affine -
StabilityHypotheses -
consistency_defines_composition -
IsSymmetricComparison -
public_cost_layer -
PublicCostLayer