PhysicsLogic · Paper-first editionLean-extracted article 111

Formal reconstruction · phase-space instability, deterministic finite-resolution divergence, finite-memory numerical recurrence, severe three-mode convection truncation, expanding return-map evidence, and qualified atmospheric extrapolation

Deterministic Nonperiodic Flow

What the finite model establishes, what the numerical run supports, and what remains conditional about weather prediction

Formal objectPhysicsLogic.Papers.Lorenz1963
Physical resultFor the selected finite deterministic hydrodynamic system, a central nonperiodic trajectory is unstable, while a noncentral nonperiodic trajectory cannot be uniformly stable. Two initial states compatible at finite input resolution may evolve to states separated beyond the prediction resolution; with an explicit reliability criterion, point prediction then fails even though forward evolution is unique. A separate finite-memory numerical route shows that a bounded digital run is eventually periodic, not that the represented continuum flow is periodic. A severe Fourier truncation gives Lorenz's actual three-mode equations X' = -σX + σY, Y' = -XZ + rX - Y, Z' = XY - bZ with b = 4/(1+a²), together with bounded, volume-contracting dynamics and three steady states; it has physical meaning near onset but no established fidelity in strong convection. At the selected p. 136 values, finite return-map calculations strongly support unstable nonperiodic flow without mathematically proving it. The atmospheric forecasting conclusion is conditional on finite dimensionality, determinism, nonperiodicity, and inevitable observational error; the applicability premises, an analogue recurrence, and an exact forecast horizon remain unresolved.
Argument architecture7 routes · 23 semantic claims · 23 sourced steps · 7 independent roots · 2 phase-space stability exclusions · 1 finite-resolution predictability route · 1 finite-memory numerical-method route · 1 controlled three-mode reduction · 1 qualified numerical-evidence route · 1 conditional atmospheric-scope route · grounded and source-sensitive shared finite-precision trajectory semantics · 18 formal countermodels · 2 status audits

Definitions, structures, and assumptions

Structures, classes, and inductive alternatives

  • structureThe proof-free finite-resolution constraint responsible for the selected prediction limit. It retains both nearby initial states and both resolution scales rather than collapsing the argument into a generic chaos label.
  • structureThe selected phenomenon: unique deterministic evolution exists for the reference state, but its successor is not predictively accessible at the declared input and output resolutions.
  • structureA reduced value readout for the boundary between deterministic pointwise prediction failure, ontic branching, and reliability of a selected ensemble statistic. It retains the finite input and output resolutions, actual initial and final separations, the number of physical successors of the reference state, and a separately tested pair of ensemble fractions.
  • inductive
  • structureShared semantics for the repeated deterministic-predictability distinction. The exact dynamics, state metric, finite-resolution specification, divergence calculation, and reliability criterion are supplied by paper-local adapters.
  • structure
  • structureExplicit interpretation of one technical trajectory model in a containing theory and represented physical system.
  • structureProof-free data selected from one finite-precision trajectory argument. The model retains all seven selected indices and all eight proposition-valued relation families used by the shared route. It stores no proof that the dynamics is deterministic, that the two initial states are experimentally indistinguishable, or that their trajectories diverge.
  • structure
  • structure
  • structure
  • structure
  • structure
  • inductive
  • inductive
  • inductive
  • structure
  • inductive
  • structure
  • structureA selected claim must depend on exactly these source-map steps.
  • structureA selected claim must retain exactly these epistemic statuses.
  • structureA selected route must name exactly these immediate predecessor routes.
  • structure
  • structure
  • inductive
  • structurePointwise physical data for the convection equations and Fourier modes.
  • inductiveThe paper-local route producing Lorenz's finite-resolution limit.
  • structurePaper-local physical data and proposition-valued semantics. No field carries a proof of a desired conclusion.
  • structure
  • structure
  • structureA concrete p. 136 initial-state report. It satisfies equations (25)-(27) with Lorenz's selected values, but that local ODE fact alone is not a claim of fidelity for strong convection.
  • inductive
  • inductive
  • inductive
  • structureFinite empirical evidence and the explicitly idealized p. 139 map.
  • structureSource-valued linearization, equilibria, and phase-volume readouts.
  • structure
  • structureProof-free relation families for one computational inference problem.
  • structureMathematical certification is a separate contract layered over computational support. It is used only by papers that explicitly compare a numerical claim with proof status.
  • structure
  • structurePractical prediction is represented separately from lawlike evolution. The relation may encode an agent, computational resource, information state, or experimental limitation in a later adapter.
  • structure
  • structure
  • structure

Definitions and domain choices

  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definitionThe selected model is exactly the seven-index model induced by this context, including all eight proposition-valued relation families.
  • definitionThe complete selected pre-output boundary for grounding this trajectory test. It fixes the context-owned model, requires the actual finite-resolution nearby state setup, and realizes the paper's deterministic classification as forward uniqueness of the selected trajectory relation. Divergence and prediction failure remain outside it.
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definitionThe unique seven-index trajectory test selected by this context.
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definitionA source-sensitive explanation of finite-resolution prediction failure.
  • definitionThe realized deterministic finite-resolution divergence constraint structurally explains the selected deterministic point-prediction failure.
  • definition
  • definitionThe complete finite-precision prediction limit as a direct proposition on one trajectory model. It retains the actual nearby-state setup, the calculated pair of separated selected-time trajectories, and unique deterministic reference evolution together with failure of the selected point prediction. No implication-valued calculation or interpretation contract is stored.
  • definitionThis bridge states the point-prediction consequence of reliability at the selected resolutions. It is separate from the divergence calculation.
  • definitionThe exact output of the paper-local divergence calculation. It retains the two selected-time states and both trajectory relations.
  • definitionThe actual trajectory relation selected by this finite-precision test.
  • definitionPredictive access for the same trajectory relation, time, state, and pair of resolutions used by the technical route.
  • definition
  • definitionThe paper-local deterministic classification must be realized as forward uniqueness of the actual selected trajectory relation. The implication is an explicit imported physics or mathematics premise, not a consequence of the name of the classification predicate.
  • definition
  • definitionNonvacuous unique evolution for the selected reference test.
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definitionThe exact finite-resolution divergence constraint selected by this model.
  • definitionThe deterministic point-prediction failure selected by this model.
  • definitionThe exact paper-local derivation selected for this trajectory route.
  • definition
  • definition
  • definition
  • definition
  • definitionStructural-explanation semantics for the deterministic finite-precision prediction limit. A candidate satisfies the selected constraint only when the nearby-state setup, explicit realization of deterministic dynamics, actual selected-time divergence, and reliability-exclusion bridge all hold. The explained phenomenon is unique evolution together with failed selected point prediction, not divergence or determinism alone.
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definitionImmediate predecessor routes. Claims established by their transitive predecessors are inherited by the dependency closure.
  • definition
  • definition
  • definition
  • definition
  • definition
  • definitionTemporary reductio-introduction steps discharged by this inference. Discharge removes only those exact origins from the conclusion's epistemic basis; it does not assert the temporary hypotheses globally.
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definitionA source-mapped claim holds when its declared formula evaluates under the given paper-local semantic interpretation.
  • definition
  • definition
  • definition
  • definitionEvery claim in the supplied identifier list holds.
  • definitionA source-mapped step is semantically sound when the interpreted premises imply the interpreted conclusion. Physical principles and imported calculations therefore remain explicit hypotheses of paper-specific certificates rather than acquiring truth from their source-map labels. A reductio hypothesis is different: it introduces a temporary assumption into a subargument and therefore is not required to hold globally. Its later uses remain ordinary premise-sensitive steps, and discharging it into a negated conclusion remains an ordinary semantic obligation.
  • definitionEvery step in the supplied identifier list is semantically sound.
  • definition
  • definition
  • definition
  • definition
  • definition
  • definitionThe formula declared for a claim identifier, when that claim is present.
  • definition
  • definitionEvery source-mapped step whose justification contributes to the claim through declared premise-to-conclusion steps.
  • definitionAll justification statuses contributed by the exact source-mapped origins of a claim. This records epistemic provenance; it does not assert any paper claim or discharge any physical assumption.
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definitionThe declared argument step with the requested identifier, when present.
  • definition
  • definitionThe premise list and conclusion attached to a declared step identifier.
  • definition
  • definition
  • definition
  • definition
  • definitionThe complete Lean-side fidelity certificate. The first conjunct is computed from source-map data; the second is supplied by checked route semantics; the third requires each declared independence boundary to have a countermodel.
  • definition
  • definition
  • definition
  • definition
  • definitionA typed countermodel matrix avoids string-keyed audit rows. Each index selects one proposition-valued separation obligation.
  • definition
  • definitionEvery route actually declared in the source map has a semantic certificate under the paper-local interpretation.
  • definition
  • definition
  • definitionOne countermodel row retains a weaker proposition while rejecting a stronger upgrade. This is a proposition, not a structure carrying proof fields.
  • definition
  • definition
  • definitionIndependent dependency and epistemic ledgers must review the same actual source claims, including every public conclusion and the selected paper conclusion. Empty, duplicated, nonexistent, or one-sided entries are invalid.
  • definitionEvery actually declared source route must have exactly one independently reviewed predecessor row. Correct rows for a selected subset are insufficient.
  • definitionThe declared main conclusion must be exposed by at least one public route output, rather than existing only as an unexported source-map claim.
  • definition
  • definition
  • definitionTwo finite lists describe the same dependency set. Duplicate expected entries are rejected so a ledger cannot pass by repeating a label.
  • definitionEvery paper-level, claim-level, and step-level source reference is present and has a nonempty work and locator. PaperArgument.auditable separately checks that every claim and step carries at least one source.
  • definitionA source reference is usable for review only when both the work and its locator are nonempty.
  • definitionStatic fidelity checks that can be evaluated from a paper's source map alone. They do not assert the truth of any physical premise.
  • definitionEvery declared output of a named source route holds under the semantic interpretation. This is the proof obligation discharged by paper-specific Lean theorems.
  • definition
  • definitionA route is fully certified only when both its individual steps and its declared outputs are semantically checked.
  • definitionEvery source-mapped inference step in a named route is semantically sound.
  • definitionEvery route named in the supplied identifier list is semantically certified.
  • definition
  • definition
  • definition
  • definition
  • definition
  • definitionThe source-mapped route with the requested identifier, when present.
  • definition
  • definitionThe public semantic interface inherited from predecessor routes. Descendants receive only declared route outputs, not every internal intermediate claim. Outputs still carrying a temporary reductio origin are excluded.
  • definitionAll direct and inherited route dependencies. The route-order check separately ensures that the declared graph is acyclic and topologically ordered.
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definitionJournal pp. 134-135, equations (17)-(18), Rayleigh controls `Ra` and `Rc` in (21)-(22), Fourier modes (23)-(24), and the dimensionless rescalings.
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definitionA nonzero buoyancy/advection sample with an observable second mode.
  • definitionThe paper's selected state, Jacobian, two equilibria, and volume law.
  • definition
  • definition
  • definition
  • definition
  • definition
  • definitionThe paper's deterministic-equation assertion is realized as uniqueness of the paper-local trajectory relation. It remains an explicit semantic bridge rather than following from the word `deterministic` alone.
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definitionThe sign domain stated for the dimensionless convection parameters. It also keeps the denominator in Lorenz's definition of `b` away from zero.
  • definition
  • definition
  • definition
  • definition
  • definition
  • definitionJournal p. 136 numerical choices: `σ = 10`, `r = 28`, `a^2 = 1/2` (hence `b = 8/3`), `Δτ = .01`, and initial `(X,Y,Z) = (0,1,0)`.
  • definition
  • definition
  • definition
  • definitionThe numerical run is above the convective steady-state instability.
  • definitionThe selected convection equations retain their dimensional origin.
  • definitionEquation (35) remains an idealized partial map, not the empirical flow.
  • definitionThe selected Jacobian and equilibria use the actual reduced parameters.
  • definition
  • definitionJournal p. 135, equations (25)-(27), at one state of the reduced convection system. The derivatives are with respect to Lorenz's dimensionless time `τ`; no differential-equation existence theorem is imported here.
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definitionLorenz's parameter `b = 4 / (1 + a^2)` below equations (25)-(27). `geometricParameter` stores the selected value of `a^2`.
  • definitionThe raw Lorenz route retained by the source-sensitive explanation.
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definitionThe old label-only three-mode predicate is now the actual global equation claim: the selected reduced model, in its near-onset regime, satisfies Lorenz's equations (25)-(27) at every state belonging to that model.
  • definition
  • definition
  • definitionLorenz's finite return-map computation supports a claim about the selected three-variable model. Mathematical proof and atmospheric transfer are not part of this paper-local computational-evidence interpretation.
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definitionExact surrogate dynamics never certify the numerically integrated flow.
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definitionEquation (35) is undefined at its midpoint and outside its unit domain.
  • definition
  • definitionJournal pp. 135-136, equations (29)-(34), and p. 140 equation (37).
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definitionA model-scoped run was executed, produced the selected result, passed a nonempty selected validation family, and supports the selected claim.
  • definitionA selected validation family is nonempty and every selected check matters.
  • definitionEvery check in the selected nonempty family passes.
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definitionMathematical proof is an additional relation, not a validation synonym.
  • definition
  • definition
  • definition
  • definitionForward uniqueness restricted to one selected initial state and time. This is the appropriate contract when a physical argument does not assert global forward uniqueness over every state represented by the carrier type.
  • definitionOne forward continuation exists and every continuation from the same selected state and time is that continuation. This is nonvacuous, unlike uniqueness alone.
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definitionA model-to-world interpretation law. It does not assert that the model has produced a conclusion; use `GroundedModelConclusionAt` for that.
  • definitionA model-to-theory interpretation law. It does not assert that the model has produced a conclusion; use `GroundedModelConclusionAt` for that.
  • definition
  • definition
  • definition
  • definition
  • definition
  • definitionBuild the epistemic dependency basis in paper order. A conclusion inherits the justification origin of its own step and every origin already attached to its premises.
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definitionExpand a set of route identifiers by one dependency edge, iterated with enough fuel to traverse any acyclic graph on the declared routes.
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition

Selected instances and coercions

  • instance
  • instance
  • instance
  • instance
  • instance
  • instance
  • instance
  • instance
  • instance
  • instance
  • instance
  • instance
  • instance
  • instance
  • instance
  • instance
  • instance
  • instance
  • instance
  • instance

Source mappings and interpretation choices

  • inductive
  • definition
  • instance
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • definition
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • definition
  • definition
  • definition
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • definition
  • definition
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • recursor
  • definition
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • definition
  • constructor
  • definition
  • checked statement
  • inductive
  • definition
  • instance
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • definition
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • definition
  • definition
  • definition
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • definition
  • definition
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • recursor
  • definition
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • definition
  • constructor
  • definition
  • checked statement
  • inductive
  • definition
  • instance
  • definition
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • definition
  • definition
  • definition
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • definition
  • definition
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • recursor
  • definition
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • checked statement
  • definition
  • checked statement
  • instance
  • checked statement
  • checked statement
  • instance
  • definition
  • definition
  • definition
  • definition
  • definition
  • definition
  • checked statement
  • checked statement
  • inductive
  • definition
  • instance
  • constructor
  • definition
  • checked statement
  • definition
  • constructor
  • definition
  • checked statement
  • definition
  • definition
  • definition
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • definition
  • definition
  • constructor
  • definition
  • checked statement
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • recursor
  • definition
  • constructor
  • definition
  • checked statement
  • definition
  • inductive
  • definition
  • instance
  • constructor
  • definition
  • checked statement
  • definition
  • constructor
  • definition
  • checked statement
  • definition
  • definition
  • definition
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • definition
  • definition
  • definition
  • checked statement
  • recursor
  • definition
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • definition
  • constructor
  • definition
  • checked statement
  • structure
  • definition
  • instance
  • checked statement
  • checked statement
  • definition
  • checked statement
  • definition
  • checked statement
  • checked statementThe evidence result retains the exact surrogate without claiming proof.
  • checked statement
  • checked statement
  • definition
  • definition
  • definition
  • definition
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • checked statement
  • definition
  • checked statement
  • definition
  • definition
  • checked statement
  • checked statement
  • recursor
  • definition
  • checked statementThe actual reduction result retains the convection PDE and Jacobian.
  • checked statement**Alias** of `PhysicsLogic.Papers.Lorenz1963.SemanticContext.all_routes_are_semantically_realizable`.
  • checked statement
  • inductive
  • definition
  • instance
  • definition
  • definition
  • definition
  • definition
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • definition
  • definition
  • definition
  • checked statement
  • recursor
  • definition
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • constructor
  • definition
  • checked statement
  • definition
  • definition
  • checked statement
  • checked statement
  • definition
  • checked statement
  • definition
  • definition
  • definition
  • instance
  • checked statement
  • checked statement
  • instance
  • checked statement
  • checked statement
  • instance
  • checked statement
  • checked statement
  • instance
  • checked statement
  • checked statement
  • instance
  • checked statement
  • checked statement
  • instance
  • definition
  • definition
  • instance
  • definition
  • definition
  • instance
  • definition
  • definition
  • instance
  • definition
  • definition
  • instance
  • definition
  • definition
  • checked statement
  • definition
  • definition
  • checked statement
  • definition
  • definition
  • definition
  • definition
  • definition
  • checked statement
  • definition
  • definition
  • checked statement
  • checked statement
  • checked statement
  • definition
  • definition
  • checked statement
  • checked statement
  • checked statement
  • checked statement

Checked statements: parameters, hypotheses, and interpretation

  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statementThe p. 133 finite-observation argument realizes the direct shared proposition: the selected finite flow has a nonvacuous deterministic trajectory witness, nearby observationally compatible states diverge at the selected time, and the corresponding point prediction is unreliable.
  • checked statement
  • checked statementLorenz's journal p. 133 finite-resolution argument directly realizes the structural explanation of deterministic point-prediction failure.
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statementThe evidence route retains Lorenz's exact p. 136 parameter choices.
  • checked statement
  • checked statement
  • checked statementEquation (35) and its threshold remain attached to qualified evidence.
  • checked statement
  • checked statementRayleigh's selected aspect ratio gives the source's exact onset value.
  • checked statementThe p. 136 threshold follows from equation (34), not from its label.
  • checked statement
  • checked statementThe reduction route exposes the source's actual equations rather than merely retaining the name “three-mode system.” This projection is intentionally local to Lorenz's reduced model and near-onset regime.
  • checked statementThe truncation route includes the PDE, Fourier modes, and linearization.
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statement
  • checked statementThe exact divergence and exponential law entail genuine volume loss.
  • checked statement
  • checked statement
  • checked statement
  • checked statement

Constructors, projections, and other meaning dependencies

  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • recursor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • recursor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • recursor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • recursor
  • constructor
  • constructor
  • constructor
  • recursor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • recursor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • recursor
  • constructor
  • recursor
  • constructor
  • recursor
  • constructor
  • recursor
  • constructor
  • recursor
  • constructor
  • recursor
  • constructor
  • recursor
  • recursor
  • constructor
  • constructor
  • recursor
  • constructor
  • recursor
  • constructor
  • recursor
  • constructor
  • recursor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor
  • constructor

External mathematical declarations

  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary
  • external type boundary

Every statement below comes only from Lorenz1963.lean, SourceMap.lean, and Coverage.lean. The dimensional convection equations, Fourier modes, Rayleigh thresholds, three-mode ODEs, Jacobian, equilibria, exact phase-volume law, partial return map, printed cycles, and p. 136 numerical choices below are value-level Lean content. The idealized map is never identified with the empirical flow; no textbook chaos theorem or unencoded atmospheric equation is imported.

01

Seven independent routes prevent an illicit leap from finite model to atmosphere

The source map does not arrange the paper as one chain ending in a weather theorem. Every route is an independent root. The two stability arguments concern an abstract finite phase flow; the predictability route concerns finite observational resolution; the numerical-method route concerns a digital sequence; the reduction route concerns a three-mode model; the evidence route concerns one finite run; and the atmospheric route states a conditional implication together with open qualifications.

Central trajectoryown limiting trajectory · stable limit would imply quasi-periodicity · instability
Noncentral trajectoryuniform stability would supply stable limit · nonuniform instability
Finite-resolution predictionnearby states · separated futures · unique yet unreliable point forecast
Digital methodbounded finite memory · eventual periodic sequence · centered-difference limit
Three-mode reductionequations (25)-(27) · bounded dissipative flow · near-onset scope
Finite numerical evidenceirregular transitions · expanding return map · support, not proof
Atmospheric forecast scopeconditional implication · unsettled applicability · no exact horizon
Figure 1. Seven source-mapped roots. Their thematic relationship is physical, but the formal route graph does not smuggle conclusions from the reduced model into the atmosphere.
Epistemic ledger
Claim transitionStatusPreserved boundary
Stable limit to quasi-periodicitypaper calculationThe limiting-trajectory and exclusion bridges are explicit.
Finite-resolution separation to forecast failureinterpretive reliability bridgeDivergence alone does not define unreliable prediction.
Finite memory and bounded digital run to recurrencepaper calculationEventual periodicity belongs to the numerical sequence.
Hydrodynamics to three modescontrolled severe truncationNear-onset meaning is retained; strong-convection fidelity is not.
Expanding return relation to nonperiodic flowqualified evidenceThe finite run supports but does not prove the continuum claim.
Finite-model lessons to atmosphereconditional extrapolationFiniteness, determinism, nonperiodicity, analogue recurrence, and horizon remain unsettled.
02

Nonperiodicity excludes two different notions of stability

The first route concerns a central trajectory: one that is its own limiting trajectory. If that limit were stable, the stable-limit calculation would make the original trajectory quasi-periodic. The paper's nonperiodicity bridge excludes quasi-periodicity, so stability leads to contradiction.

central trajectory ⇒ trajectory limits to itself,
stable limit ⇒ quasi-periodic trajectory,   nonperiodic ⇒ not quasi-periodic,
therefore a central nonperiodic trajectory is unstable. central_nonperiodic_trajectory_is_unstable; journal pp. 132–133 (1)

The noncentral case is weaker and carefully worded. Uniform stability would supply some limiting trajectory and make that limit stable. The same stable-limit calculation would again imply quasi-periodicity, contradicting nonperiodicity. What is excluded is uniform stability, not every possible local notion of stability.

noncentral and nonperiodic + assumed uniform stability
⇒ stable limiting trajectory ⇒ quasi-periodicity,
therefore the trajectory is not uniformly stable. noncentral_nonperiodic_trajectory_is_not_uniformly_stable; journal p. 133 (2)
03

Unique exact evolution can coexist with failed finite-resolution point prediction

Choose two admissible initial states compatible at the input resolution. Both evolve under the same deterministic finite model to the selected time. The divergence calculation supplies final states whose separation exceeds the prediction resolution.

initial states x₀ and x₀′ indistinguishable at input resolution εin,
x₀ → x(T),   x₀′ → x′(T),   separation of x(T) and x′(T) exceeds εpred. FinitePrecisionDivergenceCalculation; journal p. 133 (3)

A separate reliability bridge states that a reliable point prediction from the finite specification would exclude such separated continuations. Lean then checks the contradiction while retaining deterministic evolution.

deterministic finite flow + finite-resolution-compatible initial states + later separation beyond target resolution
⇒ the selected distant point prediction is not reliable,
while exact forward evolution remains unique. finite_deterministic_flow_realizes_unique_but_unpredictable_evolution (4)

Determinism is not a synonym for predictability

FiniteModelDeterminismRealization explicitly turns the paper-local determinism predicate into uniqueness of the trajectory relation. PointPredictionReliabilityBridge separately interprets finite-resolution divergence as forecast failure. Neither meaning is hidden in the other word.

04

A bounded finite-memory computation must recur, even if the represented flow does not

The selected numerical run has finite state memory, uses a deterministic forward update, and adopts a sufficiently small time step in the numerical regime. A dissipative-step calculation bounds the run. Finitely many machine states plus deterministic updating then force eventual repetition.

finite digital memory + deterministic update + bounded numerical run
⇒ the computed sequence is eventually periodic. FiniteMemoryRecurrenceCalculation; journal p. 134 (5)

The route also records a scheme-specific negative result: the centered-difference scheme does not determine a unique future in the selected setup. The forward scheme and the centered scheme must not be treated as logically interchangeable.

bounded selected run and eventual digital periodicity,
but no unique continuation from the centered-difference scheme. finite_numerical_method_has_recurrence_bound_and_scheme_scope (6)

Eventual periodicity here is a finite-state fact about the stored numerical sequence. The source claim explicitly refuses to infer periodicity of the represented continuum flow.

05

The convection equations are reduced to three modes under a severe, near-onset truncation

Saltzman's two-dimensional convection equations are truncated to three specific Fourier amplitudes, not three unspecified variables. The formalization retains the dimensional vorticity and temperature equations, identifies the selected reduced-state amplitudes, and keeps the original Rayleigh controls and dimensionless rescaling.

d_t laplacian(psi) = -J(psi, laplacian(psi)) + nu laplacian^2(psi) + g alpha d_x(theta),
d_t(theta) = -J(psi, theta) + (Delta T/H) d_x(psi) + kappa laplacian(theta),
Ra = g alpha H^3 Delta T/(nu kappa),   Rc = pi^4(1+a^2)^3/a^2. EquationsAndFourierTruncationAt; equations (17)-(18) and (21)-(22), journal p. 134 (7a)

The stream function retains its X sin(pi a x/H) sin(pi z/H) mode. Temperature retains both the Y cos(pi a x/H) sin(pi z/H) current-difference mode and the distinct -Z sin(2 pi z/H) vertical-profile distortion, together with their original normalization factors. Omitting the second temperature mode fails a checked physical countermodel. At the selected geometry a^2=1/2, Lean derives Rc=27 pi^4/4.

X′ = −σX + σY,
Y′ = −XZ + rX − Y,
Z′ = XY − bZ,   b = 4/(1+a²). ThreeModeEquationsAt · three_mode_reduction_retains_equations_twenty_five_to_twenty_seven; equations (25)–(27), journal p. 135 (7)
J = [(-sigma, sigma, 0); (r-Z, -1, -X); (Y, X, -b)],   div = -(sigma+b+1),
r_onset = 1,   (X,Y,Z) = (+/-sqrt(b(r-1)), +/-sqrt(b(r-1)), r-1),
r_instability = sigma(sigma+b+3)/(sigma-b-1),   sigma > b+1. LinearizedSteadyDynamicsAt; equations (29)-(34), journal pp. 135-136 (7b)

Both the no-convection and steady-convection characteristic polynomials are encoded. At sigma=10 and b=8/3, the instability threshold is exactly 470/19, below the selected r=28; the two nonzero equilibria are (+/-6 sqrt(2), +/-6 sqrt(2), 27). The exact phase-volume law gives V(t+7/10)=exp(-287/30)V(t). Lean proves this volume contraction, but a checked witness simultaneously has growing trajectory separation: volume loss does not mean convergence to a point.

The scope bridge says that the model physically represents convection near onset, while fidelity to the original hydrodynamics in the strong-convection regime is not established.

three modes + retained convection meaning + dissipation + bounded phase region + phase-volume contraction + three steady states,
with near-onset physical representation, but without established strong-convection fidelity. severe_truncation_yields_bounded_three_mode_model_with_limited_scope; journal pp. 135–136 (8)

The countermodels a_three_mode_truncation_does_not_establish_strong_convection_fidelity and equations_twenty_five_to_twenty_seven_do_not_supply_strong_convection_fidelity fix this boundary in the formal development. The value-level witness keeps the p. 136 parameters and initial state, satisfies all three ODEs, and retains three modes with a required fourth mode and nonzero omitted amplitude; strong-convection fidelity is therefore still false.

06

The selected run reveals an expanding return relation, classified as evidence rather than proof

The numerical evidence route chooses σ = 10, r = 28, a² = 1/2, b = 8/3, time step 0.01, and a model-member initial state (0, 1, 0). NumericalValueSetup stores these as real-valued equalities; they and the calculated trajectory form the setup, not conclusions of the earlier truncation route.

(σ, r, a², b) = (10, 28, 1/2, 8/3),   step = 0.01,   (X₀, Y₀, Z₀) = (0, 1, 0). NumericalValueSetup · numerical_evidence_setup_retains_original_parameter_values; journal p. 136 (9)

The finite calculation observes irregular transitions, calculates successive maxima and an empirical return relation, and finds the selected trajectories unstable. The exactly analyzable equation-(35) map is an explicitly idealized surrogate for that finite evidence, not an identification with the empirical flow.

F(M) = 2M for 0 <= M < 1/2,   F(1/2) is undefined,
F(M) = 2-2M for 1/2 < M <= 1,   slopes = +2 and -2. printedTentMap · EquationThirtyFiveIdealizationAt; equation (35), journal p. 139 (9a)

Lean checks the fixed point 2/3, the cycle 2/5 -> 4/5 -> 2/5, both printed length-three cycles 2/7 -> 4/7 -> 6/7 -> 2/7 and 2/9 -> 4/9 -> 8/9 -> 2/9, and the terminating sequence 1/4 -> 1/2 -> undefined. The distinct values 1/3 and 2/3 both map to 2/3. Checked countermodels reject an invented midpoint continuation, injectivity, and an incorrect reflected branch even when the left branch is correct.

irregular transitions + calculated return map + expanding return relation + unstable selected trajectories
⇒ strong support for nonperiodic flow, but not a mathematical proof of nonperiodicity. finite_return_map_calculation_supports_but_does_not_prove_nonperiodic_flow; journal pp. 138–140 (10)

finite_numerical_evidence_does_not_prove_continuum_nonperiodicity is the corresponding formal countermodel: it keeps 6000 integration steps, multiple return maxima, and return-slope magnitude greater than one while a periodic continuum continuation remains possible. The stronger exact_surrogate_and_finite_evidence_do_not_prove_flow_nonperiodicity preserves that failure even after adding the exact idealized return map. The source-map theorem numerical_evidence_is_not_classified_as_mathematical_proof verifies that the route retains its interpretive status.

Scoped computational-evidence theoremsupport + explicit nonproof

The executed finite return-map run, its selected segment check, and the supporting result realize computational evidence for the reduced numerical model, while mathematical certification is false.

finite_return_map_realizes_scoped_computational_evidence_without_proof · journal pp. 138–140
07

The atmospheric conclusion is an implication whose applicability and timescale remain open

The atmospheric route is not downstream of the reduced-model route in the formal graph. It states a conditional: if the atmosphere admits the required finite-dimensional deterministic nonperiodic description and observational error is inevitable, then the selected sufficiently distant point forecast is unreliable.

finite-dimensional atmospheric description + deterministic description + established nonperiodicity + inevitable observational error
⇒ no reliable selected distant point forecast. AtmosphericApplicationConditional; journal p. 140 (11)

The paper-local qualifications simultaneously state that atmospheric finite dimensionality, determinism, and nonperiodicity have not been established, that no analogue recurrence has been established, and that no forecast horizon has been identified. The source map describes the possible timescale as ranging from days to centuries.

conditional forecast obstruction retained,
atmospheric applicability unsettled,   analogue recurrence unsettled,   exact horizon unidentified. atmospheric_forecast_limit_is_conditional_and_horizon_remains_open; journal p. 141; declared main conclusion (12)

The countermodels finite_model_instability_does_not_establish_atmospheric_applicability and instability_does_not_identify_an_exact_forecast_horizon keep positive initial resolution and larger final separation while atmospheric validation is absent, the transfer residual is nonzero, and the horizon interval is nondegenerate. They block the two most tempting upgrades. atmospheric_unknowns_are_explicit_open_obligations confirms their status in the source graph.

08

The paper realizes both trajectory predictability and scoped computational evidence

Only the nearby-state divergence route enters the reusable framework. The adapter preserves the selected finite hydrodynamic system, reference and comparison states, time, input and prediction resolutions, regime validity, deterministic classification, trajectory relation, later separation, and reliability predicate. finite_model_setup_and_determinism_realize_shared_selected_setup combines the observationally indistinguishable-state setup with the explicit forward-uniqueness realization before any divergence output is used. The paper constructs the output-led endpoint directly from the later separated trajectories, unique reference evolution, and point-prediction failure.

nearby admissible initial states + deterministic classification realized as trajectory uniqueness + later separation beyond prediction resolution + reliability-exclusion bridge
⇒ an established finite-precision predictability limit. shared FinitePrecisionTrajectoryPredictability route (13)

The selected model is grounded in the theory of finite deterministic hydrodynamics and the world of the selected finite-flow model only from the complete nearby-state setup and explicit trajectory-uniqueness realization. Grounding consumes no separated final states or prediction-failure output. Lorenz's paper-local finite-precision setup is exactly the shared nearby-state setup, so the divergence and reliability adapters consume it directly. The later calculation yields the direct output-led endpoint, after which every shared claim transfers to theory and world semantics.

Where reuse stops

Central and noncentral stability, digital finite-memory recurrence, the three-mode truncation, return-map evidence, and atmospheric interpretation are not folded into the shared finite-precision framework. They remain paper-local routes. The source-sensitive adapter retains centralNonperiodicInstabilityAndFiniteResolutionDivergence: the central instability theorem and an explicit finite-witness bridge produce the selected divergence calculation without identifying an exact atmospheric forecast horizon.

A

Concept guide

Central trajectory

A trajectory treated as its own limiting trajectory; nonperiodicity then excludes its stability through the quasi-periodicity calculation.

CentralNonperiodicSetup

Noncentral nonuniform instability

A noncentral nonperiodic trajectory for which uniform stability would supply a forbidden stable limit.

NoncentralNonperiodicSetup

Stable-limit quasi-periodicity

The paper calculation turning convergence to a stable limiting trajectory into quasi-periodicity of the original trajectory.

StableLimitQuasiPeriodicityCalculation

Finite-precision divergence

Input-compatible initial states whose selected future states separate beyond the target prediction resolution.

FinitePrecisionDivergenceCalculation

Unique but unpredictable evolution

Unique exact forward evolution paired with failure of the selected finite-resolution point prediction.

UniqueButUnpredictableAt

Finite-memory numerical recurrence

Eventual periodicity of a bounded deterministic digital sequence with finitely many stored states.

FiniteMemoryRecurrenceCalculation

Severe three-mode truncation

The controlled reduction to three convection amplitudes, physically meaningful near onset but unvalidated for strong convection.

ThreeModeReductionCalculation

Expanding return-map evidence

The finite numerical calculation of irregular transitions, successive maxima, and an expanding two-branch return relation.

ReturnMapEvidenceCalculation

Conditional atmospheric extrapolation

A forecast obstruction conditional on unresolved atmospheric description premises and carrying no identified exact horizon.

AtmosphericApplicationConditional

Shared finite-precision trajectory model

The reusable setup, divergence, reliability, grounding, and theory/world transfer semantics realized by the finite flow.

selectedFinitePrecisionTrajectoryModel
B

Complete route inventory, claim ledger, blocked shortcuts, and provenance

The source map declares seven independent routes, twenty-three claims, and twenty-three sourced steps. Coverage interprets every claim, certifies every route, and proves exhaustive semantic realization. The qualified atmospheric forecast statement is the declared main conclusion.

Complete route inventory
RouteDirect dependenciesDeclared outputProfile
Central nonperiodic instability—Selected central trajectory is unstablestable-limit exclusion
Noncentral nonuniform instability—Selected noncentral trajectory is not uniformly stableuniform-stability exclusion
Finite-precision prediction—Established finite-precision predictability limitdeterministic divergence plus bridge
Finite numerical method—Bounded eventually periodic run and scheme limitationfinite-memory computation
Three-mode convection reduction—Bounded volume-contracting near-onset model with limited scopecontrolled severe truncation
Qualified numerical evidence—Support for, but no proof of, nonperiodic flowfinite evidential route
Atmospheric forecast scope—Conditional implication plus open qualificationsdeclared main route
Central route · central_nonperiodic_instability_route_is_semantically_realized
Certifies centrality, nonperiodicity, the own-limit bridge, stable-limit calculation, and quasi-periodicity exclusion.
Noncentral route · noncentral_nonuniform_instability_route_is_semantically_realized
Certifies the noncentral setup and the stable limiting trajectory supplied under assumed uniform stability.
Prediction route · finite_precision_prediction_route_is_semantically_realized
Certifies finite-resolution-compatible initial states, realization of trajectory uniqueness, their later separation, the reliability bridge, and the shared predictability limit.
Numerical-method route · finite_numerical_method_route_is_semantically_realized
Certifies boundedness, finite-memory recurrence, and failure of centered differences to determine a unique future.
Reduction route · three_mode_convection_reduction_route_is_semantically_realized
Certifies every three-mode dynamical property and both sides of the near-onset/strong-convection scope distinction.
Evidence route · qualified_numerical_evidence_route_is_semantically_realized
Certifies all five positive observations together with the explicit absence of mathematical proof.
Atmospheric route · atmospheric_forecast_scope_route_is_semantically_realized
Certifies the conditional implication and all five unresolved atmospheric propositions without importing any finite-model certificate.

All twenty-three source-mapped claims

ClaimsSource anchorStatus
Central setup; stable-limit calculations; central instabilityjournal pp. 132–133Paper derivation
Noncentral setup; uniform-stability limit calculation; nonuniform instabilityjournal p. 133Paper derivation
Finite-precision setup; trajectory-determinism realization; divergence calculation; reliability bridge; prediction limitjournal pp. 132–133Physical setup, imported uniqueness realization, calculation, interpretive bridge, checked composition
Numerical-method setup; recurrence/boundedness/scheme calculations; method resultjournal p. 134Paper derivation
Reduction setup; three-mode calculation; limited-scope resultjournal pp. 135–136Controlled approximation and paper calculation
Evidence setup; return-map calculation; qualified evidence resultjournal pp. 136–140Paper calculation and interpretive inference
Atmospheric conditional; open qualifications; qualified resultjournal pp. 140–141Interpretive inference and open obligation

Five formally blocked shortcuts

Available factConclusion not suppliedLean witness
Finite numerical evidenceMathematical proof of continuum nonperiodicityfinite_numerical_evidence_does_not_prove_continuum_nonperiodicity
Three-mode truncationFidelity in strong convectiona_three_mode_truncation_does_not_establish_strong_convection_fidelity
Value-level satisfaction of equations (25)-(27)Fidelity in strong convectionequations_twenty_five_to_twenty_seven_do_not_supply_strong_convection_fidelity
Finite-model instabilityAtmospheric applicabilityfinite_model_instability_does_not_establish_atmospheric_applicability
InstabilityAn exact forecast horizoninstability_does_not_identify_an_exact_forecast_horizon

Epistemic-status audits

numerical_evidence_is_not_classified_as_mathematical_proof preserves the interpretive status of the finite return-map result. atmospheric_unknowns_are_explicit_open_obligations preserves the unresolved status of the atmospheric applicability and horizon claims.

Machine-checked audit boundary

argument_wellFormed, argument_auditable, and routes_wellFormed certify the source graph. every_source_claim_has_semantics covers all twenty-three claims, and route_semantic_realization_is_exhaustive covers all seven independent routes. The finite-precision route separately realizes, grounds, and transfers every selected claim in the shared trajectory-predictability model.

Lean-encoded bibliographic record

E. N. Lorenz, Deterministic Nonperiodic Flow, Journal of the Atmospheric Sciences 20 (1963) 130–141.

TraceComplete Lean semantic identifier ledger

Reading note. The article above is the human exposition. This collapsed cross-reference records every public theorem and every constructor of the five paper-local source-map vocabularies. It introduces no additional claim; its purpose is to make semantic omissions mechanically detectable.

Primary semantic theorems (53)

source_linearization_and_volume_law_imply_phase_volume_contractionselected_parameter_values_derive_steady_convection_instability_thresholdselected_geometry_derives_original_critical_rayleigh_numbercentral_nonperiodic_trajectory_is_unstablenoncentral_nonperiodic_trajectory_is_not_uniformly_stablefinite_precision_divergence_limits_point_predictionfinite_deterministic_flow_realizes_unique_but_unpredictable_evolutionfinite_numerical_method_has_recurrence_bound_and_scheme_scopesevere_truncation_yields_bounded_three_mode_model_with_limited_scopethree_mode_reduction_retains_equations_twenty_five_to_twenty_seventhree_mode_reduction_retains_original_convection_and_stability_equationsnumerical_evidence_setup_retains_original_parameter_valuesfinite_return_map_calculation_supports_but_does_not_prove_nonperiodic_flowqualified_evidence_retains_partial_idealized_map_and_instability_thresholdfinite_return_map_realizes_scoped_computational_evidence_without_proofatmospheric_forecast_limit_is_conditional_and_horizon_remains_openselected_finite_precision_trajectory_model_retains_paper_semanticsfinite_model_determinism_realizes_shared_trajectory_determinismfinite_model_setup_realizes_shared_nearby_initial_setupfinite_model_setup_and_determinism_realize_shared_selected_setupdivergence_calculation_realizes_shared_divergence_calculationpoint_prediction_bridge_realizes_shared_reliability_exclusionpaper_inputs_make_shared_predictability_route_applicablelorenz_finite_model_realizes_structural_prediction_failure_explanationlorenz_central_instability_realizes_source_structural_prediction_failurelorenz_finite_model_realizes_shared_predictability_limitlorenz_finite_model_exhibits_nonvacuous_shared_predictability_limittrajectory_model_inputs_establish_theory_model_groundinglorenz_finite_model_establishes_grounded_predictability_limitgrounded_lorenz_predictability_transfers_every_shared_claimsource_convection_witness_realizes_original_pdes_and_fourier_modesomitting_vertical_temperature_mode_violates_source_fourier_truncationincorrect_buoyancy_balance_violates_original_convection_equationincorrect_critical_rayleigh_value_violates_original_onset_formulasource_linearization_witness_realizes_jacobian_equilibria_and_thresholdselected_phase_volume_contracts_while_trajectory_separation_growsoriginal_jacobian_trace_requires_the_temperature_decay_channelconduction_onset_does_not_imply_convective_steady_state_instabilityidealized_return_map_witness_realizes_exact_partial_source_mapidealized_return_map_retains_all_printed_periodic_cyclesidealized_return_map_keeps_midpoint_and_domain_boundary_partialexact_source_return_map_does_not_supply_a_midpoint_continuationidealized_return_map_has_two_distinct_preimages_on_opposite_branchesexact_source_return_map_is_not_injective_on_defined_valuescorrect_left_return_branch_does_not_determine_the_reflected_branchfinite_numerical_evidence_does_not_prove_continuum_nonperiodicityexact_surrogate_and_finite_evidence_do_not_prove_flow_nonperiodicitylorenz_realizes_shared_deterministic_point_and_open_ensemble_boundarya_three_mode_truncation_does_not_establish_strong_convection_fidelityequations_twenty_five_to_twenty_seven_do_not_supply_strong_convection_fidelitythree_mode_equations_do_not_supply_original_convection_equationsfinite_model_instability_does_not_establish_atmospheric_applicabilityinstability_does_not_identify_an_exact_forecast_horizon

Coverage theorems (11)

reduction_result_atom_exposes_original_convection_and_linearizationevidence_result_atom_exposes_partial_map_threshold_and_open_proofevery_source_claim_has_semanticscentral_nonperiodic_instability_route_is_semantically_realizednoncentral_nonuniform_instability_route_is_semantically_realizedfinite_precision_prediction_route_is_semantically_realizedfinite_numerical_method_route_is_semantically_realizedthree_mode_convection_reduction_route_is_semantically_realizedqualified_numerical_evidence_route_is_semantically_realizedatmospheric_forecast_scope_route_is_semantically_realizedall_routes_are_semantically_realizable

Source-map audit theorems (9)

argument_wellFormedargument_auditableroutes_wellFormedroutes_have_exact_predecessor_graphroutes_have_exact_dependency_closurelocal_inputs_and_contracts_are_independent_hypothesesresult_steps_apply_selected_inputs_and_contractsnumerical_evidence_is_not_classified_as_mathematical_proofatmospheric_unknowns_are_explicit_open_obligations

Semantic atoms (23)

centralNonperiodicSetupcentralStabilityCalculationscentralTrajectoryUnstablenoncentralNonperiodicSetupnoncentralLimitCalculationnoncentralTrajectoryNotUniformlyStablefinitePrecisionSetuptrajectoryDeterminismRealizationfinitePrecisionDivergenceCalculationpointPredictionReliabilityBridgesharedFinitePrecisionPredictabilityLimitnumericalMethodSetupnumericalMethodCalculationsnumericalMethodScopethreeModeReductionSetupthreeModeReductionCalculationboundedThreeModeModelWithLimitedScopenumericalEvidenceSetupreturnMapEvidenceCalculationqualifiedNonperiodicEvidenceatmosphericApplicationConditionalatmosphericScopeQualificationsqualifiedAtmosphericForecastConclusion

Claim identifiers (23)

centralSetupcentralCalculationscentralInstabilitynoncentralSetupnoncentralCalculationnoncentralInstabilitypredictionSetuptrajectoryDeterminismdivergenceCalculationpredictionBridgepredictionLimitmethodSetupmethodCalculationsmethodResultreductionSetupreductionCalculationreductionResultevidenceSetupevidenceCalculationevidenceResultatmosphereConditionalatmosphereQualificationsatmosphereResult

Step identifiers (23)

stateCentralSetupsupplyCentralCalculationsderiveCentralInstabilitystateNoncentralSetupsupplyNoncentralCalculationderiveNoncentralInstabilitystatePredictionSetupsupplyTrajectoryDeterminismsupplyDivergenceCalculationsupplyPredictionBridgederivePredictionLimitstateMethodSetupsupplyMethodCalculationsderiveMethodResultstateReductionSetupsupplyReductionCalculationderiveReductionResultstateEvidenceSetupsupplyEvidenceCalculationderiveEvidenceResultstateAtmosphericConditionalstateAtmosphericQualificationsderiveAtmosphericResult

Route identifiers (7)

centralNonperiodicInstabilitynoncentralNonuniformInstabilityfinitePrecisionPredictionfiniteNumericalMethodthreeModeConvectionReductionqualifiedNumericalEvidenceatmosphericForecastScope

Route kinds (7)

stableLimitExclusionuniformStabilityExclusiondeterministicFiniteResolutionDivergenceboundedFiniteMemoryComputationsevereHydrodynamicTruncationexpandingReturnMapEvidenceconditionalAtmosphericExtrapolation

R

Checked source-route details

This ledger is generated from the elaborated Lean route records. It lists direct predecessors, ordered inference steps, and exported claims. The independent fidelity audit checks every field; this ledger does not replace the physical semantics or certify every explanatory diagram.

centralNonperiodicInstability

Logical kind: stableLimitExclusion.

Required predecessor routes: none.

Ordered inference steps: stateCentralSetup, supplyCentralCalculations, deriveCentralInstability.

Exported conclusions: centralInstability.

noncentralNonuniformInstability

Logical kind: uniformStabilityExclusion.

Required predecessor routes: none.

Ordered inference steps: stateNoncentralSetup, supplyNoncentralCalculation, deriveNoncentralInstability.

Exported conclusions: noncentralInstability.

finitePrecisionPrediction

Logical kind: deterministicFiniteResolutionDivergence.

Required predecessor routes: none.

Ordered inference steps: statePredictionSetup, supplyTrajectoryDeterminism, supplyDivergenceCalculation, supplyPredictionBridge, derivePredictionLimit.

Exported conclusions: predictionLimit.

finiteNumericalMethod

Logical kind: boundedFiniteMemoryComputation.

Required predecessor routes: none.

Ordered inference steps: stateMethodSetup, supplyMethodCalculations, deriveMethodResult.

Exported conclusions: methodResult.

threeModeConvectionReduction

Logical kind: severeHydrodynamicTruncation.

Required predecessor routes: none.

Ordered inference steps: stateReductionSetup, supplyReductionCalculation, deriveReductionResult.

Exported conclusions: reductionResult.

qualifiedNumericalEvidence

Logical kind: expandingReturnMapEvidence.

Required predecessor routes: none.

Ordered inference steps: stateEvidenceSetup, supplyEvidenceCalculation, deriveEvidenceResult.

Exported conclusions: evidenceResult.

atmosphericForecastScope

Logical kind: conditionalAtmosphericExtrapolation.

Required predecessor routes: none.

Ordered inference steps: stateAtmosphericConditional, stateAtmosphericQualifications, deriveAtmosphericResult.

Exported conclusions: atmosphereResult.