Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Compact support expands at speed at most c

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let c>0, T>0, let K⊆Rn be compact and let u be a classical solution of □cu=f on a neighbourhood of Rn×[0,T) with Cauchy data (u0,u1) satisfying supp⁡u0∪supp⁡u1⊆K (The support of a function on Rn and its compactly supported Riemann integral) and supp⁡f⊆{(x,t):0≤t<T, dist⁡(x,K)≤ct} (support relative to this time slab). For K=∅, use dist⁡(x,K)=+∞, so the source is zero and the asserted support is empty. Then for every t∈[0,T)

supp⁡u(⋅,t)⊆K+B‾ct(0)={x:dist⁡(x,K)≤ct},

the time-t domain of influence of the data support (Forward and backward wave cones, domain of dependence and influence).

Facts & Assumptions

Given: ACω; a compact K, a C2 solution u, defined near the closed initial slab, of □cu=f with data supported in K and source supported in {(y,s):dist⁡(y,K)≤cs}.

[F1]

Finite propagation: for t>0, if w solves □cw=g on a neighbourhood of the closed backward cone K−(x,t) with g=0 there and w(⋅,0)=wt(⋅,0)=0 on the base ball Bct(x), then w(x,t)=0. (Finite propagation speed for the wave equation)

[F2]

supp⁡u0={x:u0(x)≠0}‾ and likewise for u1; a point outside supp⁡f has f=0 there. (The support of a function on Rn and its compactly supported Riemann integral)

[F3]

The base ball of K−(x,t) is the open ball Bct(x)=x+Bct(0). For nonempty compact K, the continuous function z↦∣x−z∣ attains a minimum on K, so K+B‾ct(0)={x:dist⁡(x,K)≤ct} is closed. Also ∣x−z∣≤∣x−y∣+∣y−z∣ for every z∈K; taking infima gives dist⁡(x,K)≤∣x−y∣+dist⁡(y,K). (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value, Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation) (Forward and backward wave cones, domain of dependence and influence)

Proof

1.1givenF1F2F3algebra

Reduction to a point outside the domain of influence: if K=∅, all data and the source vanish, so [F1] applied at every (x,t) with t∈(0,T) gives u=0 there; at t=0, continuity and the Cauchy displacement limit give u(⋅,0)=u0=0, so the support inclusion holds throughout [0,T). Otherwise let t∈(0,T) and x∉K+B‾ct(0), so dist⁡(x,K)>ct; then the base ball of K−(x,t) is Bct(x) by [F3], and Bct(x)∩K=∅: if z∈Bct(x)∩K then dist⁡(x,K)≤∣x−z∣<ct, contradicting dist⁡(x,K)>ct; hence the initial data vanish on Bct(x) by [F2]: u0=u1=0 there; and the source vanishes on the cone: if (y,s)∈K−(x,t) had dist⁡(y,K)≤cs, then dist⁡(x,K)≤∣x−y∣+dist⁡(y,K)≤c(t−s)+cs=ct by [F3], a contradiction, so dist⁡(y,K)>cs and (y,s)∉supp⁡f, i.e. f(y,s)=0.

2.1givenstep 1.1F1F3∎

Conclusion: by step 1.1 the data and source of □cu=f vanish in the cone K−(x,t), so [F1] applied to u gives u(x,t)=0; as x∉K+B‾ct(0) was arbitrary, every point outside K+B‾ct(0) has u(⋅,t)=0, and the containing set is closed by [F3], whence supp⁡u(⋅,t)⊆K+B‾ct(0) for every t∈(0,T); at t=0, continuity and the Cauchy displacement limit give u(⋅,0)=u0, so the inclusion is exactly the support hypothesis on u0.

Depends on

Used by

Dependency tree · two levels

63 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