Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Well-posedness for measurable coercive parabolic forms

Statement

Assume Countable Choice. Let T>0, let V be a separable real Hilbert space, and let (V,H,V∗) be its real evolution triple. Suppose a(t;⋅,⋅):V×V→R is bilinear and scalar measurable for each fixed pair v,w∈V, and there is one null set outside which ∣a(t;v,w)∣≤M∥v∥V∥w∥V,a(t;v,v)≥α∥v∥V2 for all v,w∈V, with constants M>0 and α>0. Let f∈L2(0,T;V∗) and u0∈H. Then there is a unique u∈W(0,T;V) with u(0)=u0 and, for almost every t, ⟨u′(t),v⟩V∗,V+a(t;u(t),v)=⟨f(t),v⟩V∗,V(v∈V). For every t∈[0,T] it satisfies ∥u(t)∥H2+α∫0t∥u(s)∥V2 ds≤∥u0∥H2+α−1∫0t∥f(s)∥V∗2 ds. The proof applies BNB to the space-time form. Scalar measurability suffices because V is separable and the measurable inverse action is proved locally.

Facts & Assumptions

Given: Countable Choice; the separable real evolution triple; T>0; the common almost-everywhere bounded/coercive scalar-measurable form; f∈L2(0,T;V∗); and u0∈H.

[F1]

W(0,T;V) consists of u∈L2(0,T;V) with weak derivative u′∈L2(0,T;V∗), under the displayed scalar test convention (Evolution triples and the parabolic energy space).

[F2]

Every W(0,T;V) function has a unique continuous H representative and satisfies the energy-pairing identity (The evolution-space energy identity and continuous H trace).

[F3]

For separable V, the product L2(0,T;V)×L2(0,T;V∗) is a separable Hilbert space, its weak-derivative graph is closed, and bounded sequences in W(0,T;V) have weakly convergent subsequences (Bounded sequences in a separable Hilbert space have weakly convergent subsequences).

[F4]

For the stated form, A(t)u(t) and A∗(t)y(t) are strongly measurable, and the pointwise direct and transposed coercive equations have measurable L2(V) solutions (Measurable actions and inverse actions of parabolic forms).

[F5]

A bounded space-time bilinear form with the stated inf-sup bound and trivial right kernel solves every bounded variational equation uniquely (The Hilbert-space Babuška–Nečas–Babuška criterion).

[F6]

If a locally integrable scalar function pairs to zero with every smooth compactly supported test function, it vanishes almost everywhere (The fundamental lemma of the calculus of variations).

[F7]

A countable union of null sets is null (Finite and countable subadditivity of measures).

[A1]

Countable Choice is retained by the trace, weak compactness, measurable inverse, BNB, and scalar distribution suppliers (The Axiom of Countable Choice (ACω)).

Proof

1.1A1F1F2F3F4givenconstruct

If V={0}, density in H forces H={0}, and the only data and solution are zero, so the conclusion holds. Assume henceforth V≠{0}. By [F1], W(0,T;V) has the stated graph norm. Set Y=L2(0,T;V) and X={w∈W(0,T;V):w(0)=0}, with the inherited W norm. By [F3], W and Y are Hilbert spaces; by the trace bound in [F2], X is a closed Hilbert subspace. Define b(w,y)=∫0T(⟨w′(t),y(t)⟩V∗,V+a(t;w(t),y(t))) dt. The integrand is measurable by [F4], and Cauchy–Schwarz and the form bound give ∣b(w,y)∣≤(1+M)∥w∥W∥y∥Y.

2.1A1F2F4step 1.1givenalgebra

For w∈X, let z0(t) solve a(t;z0(t),v)=⟨w′(t),v⟩ and set z=z0+μw, where μ=M4α−4. By [F4], z0∈Y and ∥z0∥Y≤α−1∥w′∥L2(V∗), so ∥z∥Y≤Cz∥w∥W with Cz=α−1+μ. Since A(t)z0(t)=w′(t), coercivity and the operator bound give ⟨w′,z0⟩=a(t;z0,z0)≥αM−2∥w′∥V∗2. The energy identity [F2] and w(0)=0 give ∫0T⟨w′,w⟩=12∥w(T)∥H2. The remaining mixed term obeys ∣a(t;w,z0)∣≤(M/α)∥w∥V∥w′∥V∗, and Young's inequality bounds it by α2M2∥w′∥V∗2+M42α3∥w∥V2. Therefore b(w,z)≥α2M2∥w′∥L2(V∗)2+M42α3∥w∥L2(V)2+μ2∥w(T)∥H2≥c0∥w∥W2, where c0=min⁡{α/(2M2),M4/(2α3)}>0. For w≠0, positivity forces z≠0, and b(w,z)≤∥z∥Ysup⁡∥y∥Y≤1∣b(w,y)∣ together with ∥z∥Y≤Cz∥w∥W gives sup⁡∥y∥Y≤1∣b(w,y)∣≥(c0/Cz)∥w∥W; the inequality is trivial for w=0.

2.2A1F1F2F4step 1.1givenalgebra

Suppose y∈Y and b(w,y)=0 for every w∈X. By [F4], g(t):=A∗(t)y(t) belongs to L2(0,T;V∗). Taking w(t)=ϕ(t)v for v∈V and ϕ∈Cc∞(0,T) in b(w,y)=0 gives ∫ϕ′(t)(iv(t),iy(t))H+ϕ(t)a(t;v,y(t)) dt=0. By [F1], this means y′=g weakly, so y∈W(0,T;V). Testing the weak derivative identity against tϕ and expanding (tϕ)′ shows that w(t)=ty(t) has weak derivative y+ty′. Its H trace at zero is zero, so w∈X. Substituting this w and using y′=A∗y gives 0=b(ty,y)=∫0T(∥y(t)∥H2+2t a(t;y(t),y(t))) dt≥∫0T∥y(t)∥H2+2tα∥y(t)∥V2 dt. Hence y=0 in Y, proving the trivial right-kernel condition.

3.1A1F3F5step 1.1step 2.1step 2.2

The preceding steps verify the boundedness, inf-sup and right-kernel hypotheses of [F5]. Consequently, for every g∈L2(0,T;V∗) the functional y↦∫0T⟨g(t),y(t)⟩ dt has a unique solution w∈X to b(w,y)=∫⟨g,y⟩ for all y∈Y. Its boundedness follows from Cauchy–Schwarz.

4.1A1F4step 3.1givenconstruct

By density of V in H and [A1], choose vn∈V with ∥ivn−u0∥H<1/(n+1). The measurable-action result [F4] gives gn=f−A(t)vn∈L2(0,T;V∗). Let wn∈X be the solution from step 3.1 for gn, and let ℓn(t)=vn be the constant path. Then un=wn+ℓn∈W(0,T;V) has un(0)=ivn and b(un,y)=∫0T⟨f(t),y(t)⟩ dt for every y∈Y.

5.1A1F2F4F6F7step 4.1givenchoose

For 0≤τ≤T, test the equation for un with y=1(0,τ)un∈Y. By [F2], coercivity, and 2ab≤αa2+α−1b2, ∥un(τ)∥H2+α∫0τ∥un(t)∥V2dt≤∥ivn∥H2+α−1∫0τ∥f(t)∥V∗2dt. The right side is bounded uniformly in n. Also Gn=un′+A(t)un−f∈L2(0,T;V∗) by [F4]. Testing with y=ϕv shows ∫ϕ⟨Gn,v⟩=0 for every fixed v∈V and ϕ∈Cc∞(0,T). Choose a countable dense subset of V, apply [F6] to its scalar pairings, and take the union of their null sets. Outside that null set continuity of Gn(t)∈V∗ gives Gn(t)=0. Thus un′=f−A(t)un a.e. and ∥un′∥L2(V∗)≤∥f∥L2(V∗)+M∥un∥L2(V). Together these estimates bound (un) in W(0,T;V).

6.1A1F2F3F4F6F7step 1.1step 5.1given

By [F3], a subsequence converges weakly in W(0,T;V) to some u. The trace map w↦w(0) is bounded linear by [F2], so weak trace convergence and ivn→u0 in H imply u(0)=u0. For every y∈Y, b(un,y)=∫⟨f,y⟩ and boundedness of b from step 1.1 let us pass to the weak limit, giving b(u,y)=∫⟨f,y⟩. With G=u′+A(t)u−f∈L2(V∗), testing by ϕv and applying [F6] on a countable dense subset of V as in step 5.1, with [F7] to unite the null sets, proves the pointwise variational equation for a.e. t and every v∈V. Testing the limiting identity with 1(0,τ)u and using [F2] gives the stated energy estimate for every τ∈[0,T].

7.1A1F5step 1.1step 2.1step 2.2step 6.1∎

If u1,u2 are two solutions with the same data, z=u1−u2 lies in X and satisfies b(z,y)=0 for every y∈Y. The uniqueness in [F5] applied to the zero functional gives z=0. This proves uniqueness.

Depends on

Used by

Dependency tree · two levels

39 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