Alphabeta Math
CorollaryStatement: 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.

Strict positivity propagates to later interior times

Statement

Assume Countable Choice. Let Ω be bounded and connected and u∈C2,1(Ω‾×[0,T]) be a nonnegative homogeneous heat solution. If u(x∗,s∗)>0 at an interior point with 0<s∗<T, then u(x,t)>0 for every x∈Ω and s∗<t≤T. The same conclusion for every 0<t≤T holds if the continuous initial trace is positive at some interior point. Nontriviality only at a later time does not assert positivity before that time.

Facts & Assumptions

Given: Countable Choice, a bounded connected open Ω⊆Rn, T>0, and a nonnegative u∈C2,1(Q‾) on Q=Ω×(0,T] with ut−Δu=0 in Q.

[A1]

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

[F1]

Strong parabolic maximum principle: on a bounded parabolic cylinder, a subsolution attaining its maximum M at an interior point (x0,t0) with x0∈Ω and 0<t0≤T is equal to M on Ω0×(0,t0], where Ω0 is the connected component of Ω containing x0 (Strong parabolic maximum principle).

[F2]

The cylinder Q=Ω×(0,T] and the class C2,1(Q‾) are those of Parabolic cylinder and parabolic boundary; in particular u is continuous on Q‾ and ut−Δu=0 on the open cylinder.

[F3]

Connectedness and components: C(x) is the largest connected subset of X containing x (Connected components, quasicomponents, and totally disconnected spaces), so a connected space X has C(x)=X for every x∈X since X itself is then a connected subset containing x (Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets); in particular the component Ω0 of [F1] equals Ω for every x0∈Ω.

[F4]

Continuity at a point: for real ε>0 there is δ>0 with ∣u(x,s)−u(x0,0)∣<ε whenever (x,s)∈Q‾ is within δ of (x0,0) (Continuity of a map between metric spaces, at a point and globally, in the ε-δ form).

Proof

Given: Countable Choice, a bounded connected Ω, and a nonnegative solution u∈C2,1(Q‾) with ut−Δu=0 in Q.

1.1A1F1F2F3given

Let t1∈(s∗,T] and x1∈Ω with u(x1,t1)=0. On the truncated cylinder Q1:=Ω×(0,t1] put v:=−u; then v∈C2,1(Q1‾), vt−Δv=0 in Q1, and v≤0 on Q1‾ because u≥0, so the maximum M=0 of v over Q1‾ is attained at (x1,t1) with x1∈Ω and 0<t1≤t1; since Ω is connected, [F3] makes the relevant component all of Ω, and [F1] gives v=0 on Ω×(0,t1], that is u=0 there. But s∗<t1 and x∗∈Ω, so u(x∗,s∗)=0, contradicting the hypothesis u(x∗,s∗)>0. Hence u(x,t)>0 for every x∈Ω and s∗<t≤T.

2.1step 1.1F2F4given

Suppose now that the continuous initial trace satisfies u(x0,0)>0 at some interior point x0∈Ω, and let t∈(0,T] be given. Choose s∗∈(0,min⁡(t,T)); by [F4] applied with ε=u(x0,0)/2>0 there is δ>0 with u(x,s)>u(x0,0)/2>0 for every (x,s)∈Q‾ with ∣(x,s)−(x0,0)∣<δ, and the point (x0,s∗) qualifies for s∗ small enough, so it is admissible in step 1.1; since s∗<t, step 1.1 gives u(x,t)>0 for every x∈Ω. As t∈(0,T] was arbitrary, a positive interior point of the initial trace forces strict positivity at all later interior space-time points.

3.1step 1.1step 2.1given∎

Steps 1.1 and 2.1 establish both positivity clauses of the statement, together with the recorded caveat: positivity of u at one interior time s∗ propagates only to later times t>s∗, and no claim is made about times before s∗; no global lower bound, boundary positivity or uniqueness statement is asserted. The argument uses no choice beyond the Countable Choice declared in [A1].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

40 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