Documentation

LeanPool.NavierStokesAndEuler.Euler.TransversePacketJoinedField

The complete transverse history/forward field as a genuine cylinder path #

All raw fields are canonical continuous representatives of the constructed L² paths. Restriction recovers the actual history and forward solutions.

Vector, defined pointwise by pointField P (velocityPath τ hτ hτT B G) (velocityPath_orbit τ hτ hτT B G) (D.clamp z.1) (z.2.1,(z.2.2 : AddCircle P)).

Equations
Instances For

    Vector derivative, defined pointwise by pointField P (derivativePath τ hτ hτT B G) (derivativePath_orbit τ hτ hτT B G) (D.clamp z.1) (z.2.1,(z.2.2 : AddCircle P)).

    Equations
    Instances For

      Scalar, defined pointwise by scalarPointField P (pressurePath τ hτ hτT B G) (pressurePath_orbit τ hτ hτT B G) (D.clamp z.1) (z.2.1,(z.2.2 : AddCircle P)).

      Equations
      Instances For

        Vector field, bundling path, orbit, raw_eq.

        Equations
        Instances For

          Vector derivative field, bundling path, orbit, raw_eq.

          Equations
          Instances For
            theorem EulerTransversePacketJoin.vector_hasDerivWithinAt {P : } [Fact (0 < P)] {U : Type u_1} [NormedAddCommGroup U] [InnerProductSpace U] [CompleteSpace U] {D : EulerTransversePacketProvider.Data U} (τ : ) ( : 0 < τ) (hτT : τ < D.T) (B : EulerTransversePacketProvider.HistoryData (D.initial τ )) {raw : EulerPacketProfileRecursion.VectorField} (G : EulerTransversePacketProvider.Forcing P D raw) (t : (Set.Icc 0 D.T)) (x : EulerSmoothLimit.Space) (θ : ) :
            HasDerivWithinAt (fun (s : ) => vector τ hτT B G (s, x, θ)) (vectorDerivative τ hτT B G (t, x, θ)) (Set.Icc 0 D.T) t

            Scalar gradient field, constructed using EulerPacketCylinderField.scalarGradientField.

            Equations
            • One or more equations did not get rendered due to their size.
            Instances For
              theorem EulerTransversePacketJoin.vector_left {P : } [Fact (0 < P)] {U : Type u_1} [NormedAddCommGroup U] [InnerProductSpace U] [CompleteSpace U] {D : EulerTransversePacketProvider.Data U} (τ : ) ( : 0 < τ) (hτT : τ < D.T) (B : EulerTransversePacketProvider.HistoryData (D.initial τ )) {raw : EulerPacketProfileRecursion.VectorField} (G : EulerTransversePacketProvider.Forcing P D raw) (t : (Set.Icc 0 τ)) (x : EulerSmoothLimit.Space) (θ : ) :
              vector τ hτT B G (t, x, θ) = B.field (G.initial τ ) t (x, θ)
              theorem EulerTransversePacketJoin.scalar_left {P : } [Fact (0 < P)] {U : Type u_1} [NormedAddCommGroup U] [InnerProductSpace U] [CompleteSpace U] {D : EulerTransversePacketProvider.Data U} (τ : ) ( : 0 < τ) (hτT : τ < D.T) (B : EulerTransversePacketProvider.HistoryData (D.initial τ )) {raw : EulerPacketProfileRecursion.VectorField} (G : EulerTransversePacketProvider.Forcing P D raw) (t : (Set.Icc 0 τ)) (x : EulerSmoothLimit.Space) (θ : ) :
              scalar τ hτT B G (t, x, θ) = B.pressureField (G.initial τ ) t (x, θ)
              theorem EulerTransversePacketJoin.vector_right {P : } [Fact (0 < P)] {U : Type u_1} [NormedAddCommGroup U] [InnerProductSpace U] [CompleteSpace U] {D : EulerTransversePacketProvider.Data U} (τ : ) ( : 0 < τ) (hτT : τ < D.T) (B : EulerTransversePacketProvider.HistoryData (D.initial τ )) {raw : EulerPacketProfileRecursion.VectorField} (G : EulerTransversePacketProvider.Forcing P D raw) (t : (Set.Icc τ D.T)) (x : EulerSmoothLimit.Space) (θ : ) :
              vector τ hτT B G (t, x, θ) = (G.tail τ hτT).vector (forwardInitial τ hτT B G) (t - τ, x, θ)
              theorem EulerTransversePacketJoin.vectorDerivative_right {P : } [Fact (0 < P)] {U : Type u_1} [NormedAddCommGroup U] [InnerProductSpace U] [CompleteSpace U] {D : EulerTransversePacketProvider.Data U} (τ : ) ( : 0 < τ) (hτT : τ < D.T) (B : EulerTransversePacketProvider.HistoryData (D.initial τ )) {raw : EulerPacketProfileRecursion.VectorField} (G : EulerTransversePacketProvider.Forcing P D raw) (t : (Set.Icc τ D.T)) (x : EulerSmoothLimit.Space) (θ : ) :
              vectorDerivative τ hτT B G (t, x, θ) = (G.tail τ hτT).vectorDerivative (forwardInitial τ hτT B G) (t - τ, x, θ)
              theorem EulerTransversePacketJoin.scalar_right {P : } [Fact (0 < P)] {U : Type u_1} [NormedAddCommGroup U] [InnerProductSpace U] [CompleteSpace U] {D : EulerTransversePacketProvider.Data U} (τ : ) ( : 0 < τ) (hτT : τ < D.T) (B : EulerTransversePacketProvider.HistoryData (D.initial τ )) {raw : EulerPacketProfileRecursion.VectorField} (G : EulerTransversePacketProvider.Forcing P D raw) (t : (Set.Icc τ D.T)) (x : EulerSmoothLimit.Space) (θ : ) :
              scalar τ hτT B G (t, x, θ) = (G.tail τ hτT).scalar (forwardInitial τ hτT B G) (t - τ, x, θ)