Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Parabolic cylinder and parabolic boundary

Definition

Let n≥1, let Ω⊆Rn be a nonempty bounded open set with closure Ω‾ and boundary ∂Ω in the sense of Interior, closure, boundary, limit point, isolated point and dense subset of a metric space, and let T>0. Write Q:=Ω×(0,T] for the space-time cylinder and Q‾:=Ω‾×[0,T]⊆Rn+1 for its closure in the space-time variable; the final-time face is Ω×{T}, while the parabolic boundary of Q is ∂pQ:=(Ω‾×{0})∪(∂Ω×[0,T]). No point of the final-time face belongs to ∂pQ: the intersections (Ω×{T})∩(Ω‾×{0}) and (Ω×{T})∩(∂Ω×[0,T]) are empty because T>0 and Ω∩∂Ω=∅.

A function u on Q‾ is of class C2,1(Q‾) if it is continuous there, is C2 in x and C1 in t on Q, and the functions ut and Dxαu for ∣α∣≤2 extend continuously to Q‾; the multi-index notation and the classes Ck are those of Ck maps and multi-index derivative notation in Euclidean space, and at t=T the time derivative means the left one-sided limit. The relevant operator is ∂t−Δx, the heat operator of The heat operator, the heat equation, and the Cauchy problem, and the phrase "ut−Δu≤0 in Q" always refers to that cylinder, with the one-sided interpretation of ut on the final-time face.

On this page a classical heat solution means a function with the stated C2,1 regularity satisfying the equation pointwise; no second time derivative is required. Formulas that put time first use the canonical coordinate permutation (x,t)↔(t,x); regularity and derivatives always refer to the named spatial and time variables. The analogous interior class has the same continuous derivatives without an up-to-boundary requirement.

Two elementary topological facts are part of the vocabulary. First, Q‾ is compact: Ω is bounded, so Ω‾ is closed and bounded in Rn, hence compact (Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line); then Q‾=Ω‾×[0,T] is closed and bounded in Rn+1, hence compact by the same theorem (Open cover, subcover, compact metric space, and compact subset of a metric space). Second, ∂pQ is closed in Rn+1, being the union of the two closed sets Ω‾×{0} and ∂Ω×[0,T]; in particular it is a closed subset of Q‾ (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space).

Remarks

  • The class C2,1(Q‾) is a convention fixing where the one-sided time derivatives live. The cylinder Q=Ω×(0,T] is open in the spatial directions and half-open in time, and equation statements on Q are read at points with t<T in the usual two-sided sense and at t=T with the left derivative. No global smoothness of ∂Ω is assumed; the maximum principles proved later on this page use only this vocabulary.

  • Top versus parabolic boundary. The decomposition of Q‾ into the parabolic boundary and the cylinder Q is not a topological boundary decomposition: the final-time face is part of the topological boundary of Q but is deliberately excluded from ∂pQ, which is exactly the set on which initial and lateral data are prescribed. A later counterexample on the companion page shows that this asymmetry is forced by the sign of the heat operator and cannot be removed.

Depends on

Used by

Dependency tree · two levels

43 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