Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Strong L2 compactness for weakly solenoidal MINI trajectories

Statement

Assume the Axiom of Choice. Let D⊂Rd be bounded, connected and polyhedral, d=2 or 3. Let Tj be matching shape-regular meshes with hj→0, let Zj be the weak MINI divergence kernels, and let 0=t0j<⋯<tNjj=T have maximum step tending to zero. Suppose Ujn∈Zj, their piecewise-constant reconstructions U‾j satisfy sup⁡j(max⁡n∥Ujn∥L2+∥U‾j∥L2(0,T;H01))<∞, and the following coefficient condition holds: for every finite L2-orthonormal family e1,…,em∈Vσ, the E-valued piecewise-constant functions Yj(t)=∑i=1m(Ujn,Πjei)L2ei(t∈(tn−1j,tnj]) have uniformly bounded L2(0,T;E) norms and their backward difference quotients are bounded in L4/3(0,T;E); here Πj is the MINI Fortin map and E=span⁡{ei}. Then (U‾j) is relatively compact in L2(0,T;L2(D)d).

Facts & Assumptions

Given: The shape-regular matching mesh family, Zj, the energy bounds, the coefficient condition, and the Axiom of Choice.

[F1]

Under the Axiom of Choice, H01(D) embeds compactly into L2(D) on bounded open D; applying the scalar result successively to the finitely many components gives the same compact embedding for H01(D)d. (Compactness of W01,p(Ω)↪Lp(Ω) on bounded open sets)

[F2]

∫Ddiv⁡z=0 for z∈H01(D)d, and b(z,qh)=0 for z∈Zj, qh∈Qj. (Zero mean of the divergence of a zero-boundary field, Weak and pointwise divergence-free discrete velocities)

[F3]

For q∈H1(D), the face-average interpolant approximates it in L2; subtracting the mean gives a continuous piecewise-affine zero-mean pressure approximation. (Boundary-preserving face-average P1 interpolation, Stokes velocity and pressure spaces and weak forms)

[F4]

The MINI Fortin map satisfies b(Πjv,qh)=b(v,qh) and ∥v−Πjv∥2≤Chj∥v∥V. (Uniform Fortin stability of the mini element, The mini-element Fortin map approximates in L2)

[F5]

The piecewise-constant discrete Aubin–Lions theorem gives compactness in L2(0,T;E) from a uniform L2(E) bound and an L4/3(E) difference-quotient bound when the time steps vanish. (Piecewise-constant discrete Aubin–Lions compactness)

[F6]

The scalar space H01(D) with its Sobolev norm is a separable real Hilbert space; its finite vector product is therefore also separable and Hilbert. (The zero-boundary Sobolev energy space is a separable Hilbert space)

[F7]

Poincare makes the gradient norm on H01(D)d equivalent to its Sobolev norm, so a sequence bounded in V is bounded in the separable Hilbert norm and weak convergence is the same for both norms. Every bounded sequence in a separable real Hilbert space has a weakly convergent subsequence. (The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction, A bounded sequence in a separable Hilbert space has a weakly convergent subsequence)

[F8]

The Sobolev norm is weakly lower semicontinuous; the equivalent gradient norm on V is also weakly lower semicontinuous. (Weak lower semicontinuity of the Sobolev norm, The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction)

[F9]

The Bochner space L2(0,T;L2(D)d) is complete. (Bochner Lp is complete for a Banach value space)

[A1]

The compactness and subsequence extractions use the Axiom of Choice. (The Axiom of Choice)

Proof

1.1A1F1F2F3givenalgebra

Consider any sequence zj∈Zj with ∥zj∥V≤R and hj→0. By [F1], a subsequence converges strongly in L2 and weakly in H01 to some z∈H01. For any q∈Cc∞(D), put q0=q−∣D∣−1∫Dq, interpolate q0 by [F3], and subtract the interpolant's mean to obtain qj∈Qj with qj→q0 in L2. Since b(zj,qj)=0 and ∫Ddiv⁡zj=0 by [F2], ∫Dq div⁡zj=∫D(q0−qj)div⁡zj→0. Weak convergence of the gradients gives div⁡z=0, hence z∈Vσ.

1.2A1F4F5givenalgebra

For an L2-orthonormal basis e1,…,em of E, [F4] and the uniform L∞L2 bound imply ∥PEU‾j−Yj∥L∞(0,T;E)2=∑i∣(Ujn,ei−Πjei)L2∣2≤CEhj2. The coefficient condition and [F5], applied to the finite-dimensional evolution triple E↪E↪E, make (Yj) relatively compact in L2(0,T;E).

2.1A1F1F6F7F8step 1.1choose

For each R>0, KR={z∈Vσ:∥z∥V≤R} is totally bounded in L2 by [F1], so choose a finite ϵ/2-net with centers ei∈KR and let E be their span. If arbitrarily fine meshes had zj∈Zj, ∥zj∥V≤R, and distance at least ϵ from E, [A1, F1, F6, F7] would give a subsequence strongly convergent in L2 and weakly in H01. Step 1.1 puts its limit in KR, and [F8] retains the norm bound; this contradicts the ϵ/2-net. Thus every such zj is within ϵ of E for all sufficiently large j.

3.1givenstep 2.1algebra

Let PE be the L2-orthogonal projection. On times when ∥U‾j(t)∥V≤R, step 2.1 gives ∥U‾j−PEU‾j∥2≤ϵ. The measure of the remaining times is at most R−2∥U‾j∥L2V2, and there ∥U‾j−PEU‾j∥2≤2sup⁡j,n∥Ujn∥2. First choose R large, then ϵ small; this makes the L2(0,T;L2) projection remainder uniformly small for sufficiently large j.

4.1F5F9step 3.1step 1.2algebra∎

Given any tolerance, steps 3.1 and 1.2 approximate the tail of (U‾j) within that tolerance by a relatively compact family Yj in L2(0,T;E). Hence the tail is totally bounded in L2(0,T;L2); adjoining finitely many initial terms preserves total boundedness. Completeness [F9] gives relative compactness.

Depends on

Used by

Dependency tree · two levels

80 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources