Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (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.

Energy identity for the forced Dirichlet heat equation

Statement

Assume Countable Choice. Let n≥2 and let Ω⊂Rn be a bounded C1 domain in the class of the first Green identity (Bounded C1 domains and their outward normals), let T>0, and let real u∈C2,1(Ω‾×[0,T]) solve ut−Δu=f in Ω×(0,T] with f∈C(Ω‾×[0,T]) and u=0 on the lateral boundary ∂Ω×[0,T]. Then for 0<t<T, 12ddt∫Ωu(x,t)2 dx+∫Ω∣Du(x,t)∣2 dx=∫Ωf(x,t)u(x,t) dx, and integrating in t gives the energy balance 12∫Ωu(x,t2)2dx−12∫Ωu(x,t1)2dx+∫t1t2 ⁣∫Ω∣Du∣2 dx dt=∫t1t2 ⁣∫Ωfu dx dt for 0<t1<t2<T. The identity carries exactly the Countable Choice assumption of the Green identity supplier.

Facts & Assumptions

Given: Countable Choice, n≥2, a bounded C1 domain Ω, T>0, u∈C2,1(Ω‾×[0,T]) with ut−Δu=f in Ω×(0,T], f continuous, and u=0 on ∂Ω×[0,T].

[A1]

Countable Choice is the ambient hypothesis (The Axiom of Countable Choice (ACω)).

[F1]

Differentiation under the integral sign: under the domination and measurability hypotheses of the theorem, F(t)=∫f(x,t) dμ(x) is differentiable with F′=∫∂tf dμ (Differentiation under the integral sign).

[F2]

Green's first identity: for real u∈C2(Ω‾) and v∈C1(Ω‾), ∫Ω(vΔu+Du⋅Dv) dx=∫∂Ωv∂νu dS (First Green identity).

[F3]

If G is differentiable on [a,b] with integrable derivative G′, then ∫abG′=G(b)−G(a) (The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a)).

[F5]

The domain class, the outward normal ν, the surface element dS and the conventions C1(Ω‾), C2(Ω‾) are those of Bounded C1 domains and their outward normals.

Proof

Given: Countable Choice, n≥2, a bounded C1 domain Ω in the Green-identity class, T>0, real u∈C2,1(Ω‾×[0,T]) with ut−Δu=f in Ω×(0,T] for continuous f, and u=0 on ∂Ω×[0,T].

1.1A1F1F4given

Define E(t):=12∫Ωu(x,t)2 dx for t∈(0,T). The maps u and ut are continuous on the compact cylinder by [F4], hence bounded there by constants M,M1<∞; the bounded domain has finite measure since it lies in a bounded box (A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included); therefore x↦u(x,t)2 is integrable on Ω for every t, the derivative ∂tu(x,t)2=2u(x,t)ut(x,t) is bounded by 2MM1, and [F1] applies with the constant majorant, giving that E is differentiable on (0,T) with E′(t)=12∫Ω2u(x,t)ut(x,t) dx=∫Ωu(x,t)ut(x,t) dx.

2.1step 1.1F2F5given

Substituting the equation ut=Δu+f from the hypothesis into step 1.1 gives E′(t)=∫ΩuΔu dx+∫Ωfu dx; [F2] with v=u reads ∫Ω(uΔu+∣Du∣2) dx=∫∂Ωu ∂νu dS, and the boundary term vanishes because u=0 on ∂Ω×[0,T], so ∫ΩuΔu dx=−∫Ω∣Du(x,t)∣2dx; hence 12ddt∫Ωu2+∫Ω∣Du∣2=∫Ωfu for every t∈(0,T).

3.1step 2.1F3F4given∎

The three functions of t in the identity of step 2.1 are continuous on (0,T): E′ is given there by the integral of the continuous function uΔu+fu, while t↦∫Ω∣Du∣2dx and t↦∫Ωfu dx are integrals of continuous functions on the compact cylinder [F4], and dominated convergence (Dominated convergence) with these uniform bounds proves their continuity; integrating the identity from t1 to t2 and applying [F3] to the energy term yields the balance 12∫Ωu(x,t2)2dx−12∫Ωu(x,t1)2dx+∫t1t2∫Ω∣Du∣2dx dt=∫t1t2∫Ωfu dx dt for 0<t1<t2<T.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

85 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