Alphabeta Math
LemmaStatement: AI-generatedProof: AI-generated
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.

Smooth approximation of compactly supported interior heights

Statement

Work in ZFC. Let (R,k) be a compact smooth Riemannian region (a manifold with boundary) of dimension n≥0, and let v:R→R be Lipschitz with support compactly contained in its interior. There exist vj∈Cc∞(R∘), all supported in one fixed compact interior set, such that ∥vj−v∥∞+∫R(∣vj−v∣+∣dvj−dv∣k) dVk→0. Here dv is the almost-everywhere weak differential, ∣⋅∣k is the dual metric norm and dVk is the Riemannian volume density; for n=0, differentials vanish and each point has volume one.

Lipschitz means that there is a single finite L≥0 such that ∣v(p)−v(q)∣≤Ldk(p,q) for every pair in the same connected component of R, with the usual distance on R. Here dk is the infimum of the lengths Lk(γ)=∫∣γ˙∣k of piecewise C1 curves in R joining the two points; distinct components have extended distance +∞ and impose no cross-component inequality.

Facts & Assumptions

[F1]

Finite smooth interior cutoffs form a partition equal to one near the compact support. Finite smooth cutoffs relative to compact sets and boundary neighborhoods

[F2]

Chart and metric first-Sobolev norms are uniformly comparable on each chosen compact chart; locally Lipschitz functions have coordinate-independent weak differentials, with the smooth-cutoff product rule. The supplier also fixes the dimension-zero conventions. Weak first derivatives and Riemannian chart norm comparison

[F3]

For every dimension n≥1, a compactly supported Lipschitz coordinate function admits mollification converging uniformly and in W1,1, with fixed compact support inside its coordinate domain; an admissible kernel exists. Compactly supported chart mollification in uniform and first Sobolev norms

[F4]

The metric is the smooth positive-definite tensor k on R. Riemannian metric and riemannian manifold

[F5]

Lipschitz continuity is the finite-constant metric inequality, applied on each connected component with one common bound. Intrinsic Riemannian distance is the infimum of piecewise C1 curve lengths; the extended distance is +∞ between distinct components. Length is the integral of metric speed. Lipschitz map, α-Hölder map for rational 0 < α ≤ 1, and contraction Riemannian distance on a connected manifold Extended riemannian distance on a disconnected manifold Riemannian speed and length

[F6]

On a compact set contained in a coordinate chart, the Riemannian quadratic form has uniform positive lower and finite upper bounds relative to the Euclidean quadratic form. In particular kp(ξ,ξ)≤C∣ξ∣2 there for some finite C>0. Local comparison of a riemannian metric with the euclidean metric

[F7]

Write R∘=Int⁡R for the manifold interior: in positive dimension its points have positive last boundary-chart coordinate; in dimension zero every point is interior and the boundary is empty. Interior and boundary of a manifold with boundary

[A1]

Work in ZFC, carrying the mollification supplier's ZFC hypothesis and the chart-comparison supplier's Countable Choice hypothesis. Choice is inherited through these analytic suppliers, not through the finite partition or the explicit sequence of radii. The Axiom of Choice

Proof

**Given:**The hypotheses in the Statement.

Goal: Establish the stated construction or identity.

1.1givenF1F2F3F5F6F7A1construct

If v=0, take vj=0 with empty support. If n=0, every point is interior by [F7], and every chart is a singleton, so v is smooth; take vj=v, whose compact interior support is fixed. The zero-dimensional conventions in [F2] make both errors zero. Henceforth take n≥1 and nonempty support. Cover the support by finitely many interior coordinate balls xa:Ua→Ba, each with closure contained in a larger interior chart, and choose the cutoffs of [F1]. The identity v=∑aχav holds globally, since v vanishes outside its support. By [F6], on Ua‾ the coordinate quadratic form satisfies kp(ξ,ξ)≤Camet∣ξ∣2 for a finite Camet>0. For p,q∈Ua, the inverse-coordinate straight segment stays in Ua and has length at most Camet∣xa(p)−xa(q)∣ by [F5]. Thus dk(p,q) is at most this bound, and the hypothesis gives ∣v(p)−v(q)∣≤LCamet∣xa(p)−xa(q)∣. In particular v is locally Lipschitz in smooth coordinates, as required by [F2]. Its coordinate expression is also bounded on the bounded ball Ba. Each coordinate cutoff is smooth with compact support in Ba, so its derivative is bounded there and the coordinate straight-segment estimate makes it Lipschitz. The product inequality therefore shows that fa=(χav)∘xa−1 is Lipschitz and compactly supported in Ba. Apply [F3] in dimension n, using [A1], and fix for each chart a radius ra>0 such that every mollified support for radius at most ra stays in one fixed compact subset Ka of that chart. Use the explicit radii ra/(j+1).

2.1F2F3A1step 1.1algebra∎

Pull the finitely many smooth coordinate approximants back to their charts, extend by zero, and sum them to obtain vj. The zero extensions are smooth because their supports stay away from the chart sides, and all sums are supported in the fixed compact interior union ⋃aKa. The supremum error is at most the sum of the finitely many coordinate supremum errors. Apply [F2] to each coordinate difference fa,j−fa, with the same fixed compact support set Ka for all j; linearity and the cutoff product rule identify the resulting summed weak differential with dvj−dv. The integral error is therefore at most ∑aCa∥fa,j−fa∥W1,1, with constants Ca independent of j, and tends to zero by [F3]. Both stated convergences follow.

Depends on

Used by · 1

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.