Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passverified 2026-10-23 (gpt-6.1-sol)
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.

Bounded velocity-observation error for the smooth MINI branch

Statement

Assume Countable Choice and a smooth MINI observation interface as specified by the interface definition on this page. In particular, let D⊂Rd be bounded, connected, Lipschitz and polygonal or polyhedral with d∈{2,3}; use a shape-regular conforming affine simplicial mesh, viscosity ν>0, f∈L2(0,T;L2(D)d), the mass-projected initial value, and any actual mixed backward Euler MINI solution. Suppose the exact no-slip solution has u∈W1,∞(0,T;H2(D)d∩Vσ) and p∈W1,∞(0,T;H1(D)∩L02(D)). Set M=1+∥u∥W1,∞H2+∥p∥W1,∞H1,H=hM+τmax⁡M2,Mu=∥u∥L∞(0,T;V),Λ=1+CDν−3Mu4. Assume τmax⁡Λ≤12. Let M∞, ME and C∗ have exactly the values in the smooth MINI velocity-error estimate, namely M∞=(∥u(0)∥22+CP(D)2ν−1∥f∥L2L22)1/2,ME=ν−1/2∥u(0)∥2+CP(D)ν−1∥f∥L2L2, C∗=CD,shape(1+ν)2(1+ν−4)(1+T)2(1+M∞+ME+M)4exp⁡(2TΛ), where CD depends only on the domain, dimension and trilinear-form constant, and CD,shape is independent of h, the time steps and ν. No mesh/time coupling is imposed beyond the stated time-step restriction. For any sensors ℓn∈V∗, define ∥ℓ∥ℓτ2(V∗)=(∑n=1Nτn∥ℓn∥V∗2)1/2. Then the endpoint-sampled observations of the interface satisfy ∣Oh(ℓ;uh)−O(ℓ;u)∣≤ν−1/2C∗H ∥ℓ∥ℓτ2(V∗). This is a conditional bound for bounded linear velocity sensors on the smooth branch; it makes no Reynolds-uniform claim.

Facts & Assumptions

Given: Countable Choice, the smooth MINI interface and its exact and discrete solution data, the time-step restriction, and bounded real-linear sensors ℓn∈V∗.

[A1]

Countable Choice means that every family (Xn)n∈N of nonempty sets has a choice function f with f(n)∈Xn. (The Axiom of Countable Choice (ACω))

[F1]

The smooth MINI velocity theorem, under the domain, regularity, initialization, mesh and time-step hypotheses in the Statement, gives max⁡n∥u(tn)−uhn∥2+ν1/2(∑nτn∥u(tn)−uhn∥V2)1/2≤C∗H. (Smooth-branch velocity error for backward Euler MINI)

[F2]

The interface defines O(ℓ;u)=∑nτnℓn(u(tn)) and Oh(ℓ;uh)=∑nτnℓn(uhn) for ℓn∈V∗. (Smooth MINI observation interface)

Proof

1.1givenF2construct

Put en=u(tn)−uhn∈V. By [F2], Oh(ℓ;uh)−O(ℓ;u)=−∑n=1Nτnℓn(en).

2.1givenstep 1.1algebra

The dual norm inequality and weighted Cauchy–Schwarz give ∣∑n=1Nτnℓn(en)∣≤∑n=1Nτn∥ℓn∥V∗∥en∥V≤∥ℓ∥ℓτ2(V∗)(∑n=1Nτn∥en∥V2)1/2.

3.1A1F1step 2.1algebra∎

By [F1], (∑nτn∥en∥V2)1/2≤ν−1/2C∗H. Substitution into step 2.1 proves the claimed observation bound.

Depends on

Dependency tree · 2 levels

Sources