Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Vanishing gradient and time derivative force constancy on convex sets

Statement

Let U⊆Rm be an open convex set (A convex subset of Rm contains every line segment between two of its points) and let w∈C1(U) (Ck maps and multi-index derivative notation in Euclidean space) with Dw=0 on U, that is ∂iw=0 on U for every coordinate i (Directional derivatives and partial derivatives of a map U⊆Rm→Rn). Then w is constant on U.

In particular, if (x,t)↦u(x,t) is C1 on an open convex subset V of space-time Rn+1 with ∂tu=0 and Dxu=(∂0u,…,∂n−1u)=0 on V, then u is constant on V; this is the conclusion used when the energy density of a wave vanishes identically on a cone or a ball and the displacement is recovered from ut=Du=0.

Facts & Assumptions

Given: An open convex set U⊆Rm and a C1 function w:U→R whose total derivative vanishes on U; for the last sentence an open convex subset V of space-time and a C1 function u on V with ∂tu=0 and all spatial partial derivatives zero.

[F1]

If f:U→Rn is totally differentiable at a, then Dvf(a) exists for every v and equals Df(a)v; in particular ∂jf(a)=Df(a)ej, and the matrix of Df(a) is the Jacobian Jf(a). (A total derivative computes every directional derivative, and its matrix is the Jacobian)

[F2]

For scalar-valued f its gradient is ∇f(a)=(∂0f(a),…,∂m−1f(a)). (The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case)

[F3]

If U⊆Rm is convex and open and f:U→Rn is totally differentiable at every point with Df(z)=0 for every z∈U, then f is constant on U. (A totally differentiable map with zero derivative on a convex open set is constant)

[F4]

A subset U⊆Rm is convex when (1−t)x+ty∈U for all x,y∈U and t∈[0,1]. (A convex subset of Rm contains every line segment between two of its points)

Proof

1.1givenF1F2F5algebra

The two forms of the hypothesis are equivalent: at every a∈U the map w is totally differentiable by its C1 regularity and [F5], so by [F1] the Jacobian Jw(a) is the matrix of Dw(a) and its entries are exactly ∂iw(a), the coordinates of ∇w(a) [F2]; a linear map is zero exactly when its matrix (equivalently, all its partial derivatives) vanishes, so Dw=0 on U if and only if ∂iw=0 on U for every i.

2.1step 1.1F3F4

Constancy: if Dw=0 on the open convex U, then [F3] applied to f=w gives that w is constant on U; conversely if all partial derivatives of w vanish, step 1.1 converts this to Dw=0 and the same conclusion follows, so the first claim holds under either form of the hypothesis.

3.1givenstep 1.1step 2.1∎

The space-time case: an open convex subset V of Rn+1 with its Euclidean coordinates is an instance of the first claim for m=n+1, and the hypothesis ∂tu=0 together with Dxu=0 says precisely that every coordinate partial derivative of u vanishes on V; by steps 1.1 and 2.1 the function u is constant on V.

Depends on

Used by

Dependency tree · two levels

23 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