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.
Local weak scalar potentials and continuation on a simply connected open set
Statement
Assume AC. Let be a nonempty open connected set, and let have zero distributional curl. Every ball compactly contained in has an primitive of . If every based loop in is homotopic to a constant loop fixing its basepoint, these local primitives glue to with . Such is unique up to a constant. This assertion alone does not assert global integrability of on .
Facts & Assumptions
Given: AC, the nonempty open connected set , , and distributional curl zero.
Mean-zero functions on a ball obey the scaled Poincare inequality by Poincare inequality on a ball. Sobolev spaces are complete by Integer-order Sobolev spaces are Banach.
Mollification is smooth and commutes with weak differentiation, and converges locally in , by Every approximate identity converges to the identity in for and Convolution with a mollifier is smooth, and derivatives pass under the integral sign.
An function with zero weak gradient is constant on each connected component by Zero weak gradient gives componentwise constants.
Choose a nonnegative smooth compact cutoff equal to one on a smaller ball and supported in using Test function cutoffs and euclidean localization, and normalize its positive finite integral using Euclidean balls have positive finite Lebesgue measure. Its rescalings have the convention of The mollifier family generated by a unit-mass smooth bump and form the approximate identity in A unit-mass smooth bump generates an approximate identity. For Sobolev derivative commutation one may use Interior mollification commutes with weak derivatives on relatively compact open sets. In step 1.1 the given vector need not have all first weak derivatives: its mollified curl is zero directly by applying the distributional zero-curl identity to the translated mollifier, whose support stays inside . Thus no regularity of the original vector is assumed. The compact-test localization in step 4.1 is justified by the real Euclidean partition statement of Test function cutoffs and euclidean localization.
Heine-Borel in : with the Euclidean metric a subset of 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 at makes the parameter square compact. Every open cover of a compact metric space has a Lebesgue number: a such that every nonempty subset of diameter less than lies inside a single member of the cover then applies to the relative open pullback cover of that compact metric square and gives the grid size in step 3.1. That theorem requires no choice principle. The analogous compact-interval use gives the finite path subdivisions in step 2.1.
Proof
Let and choose with . Zero-extend as an function and convolve at radii smaller than . The resulting are smooth and curl free on a neighborhood of , and in by [F2]. Put . The smooth curl-free identity gives . Subtract . For any , [F1] bounds the norm of this normalized difference by . Completeness gives a limit with mean zero and gradient . No passage through smooth de Rham cohomology is made.
Cover by its countable rational balls with compact closure in , and choose the primitives in step 1.1. Every nonempty intersection of two such balls is convex and connected. By [F3], almost everywhere on , with a unique real constant; , and whenever the triple intersection is nonempty. Consider a germ of a primitive to mean a local primitive on a neighborhood of a point, identifying two when they agree almost everywhere on a smaller neighborhood. Fix one germ at a basepoint. Along a path, choose a finite subdivision whose successive subpaths lie in balls, and transport the current primitive by adding the unique constant needed to agree on an overlap at each subdivision point. This defines the terminal germ. Inserting extra subdivision points does not change it, and changing the covering balls gives the same result: refine around every subdivision point so that all balls compared contain that point, use their nonempty open intersections, and use the displayed cocycle identity. Thus transport is well defined along a path and reverses under reversal of that path.
Transport is invariant under endpoint-fixed path homotopy. For a continuous homotopy , compactness gives a finite subcover of its image by the ball cover and a Lebesgue number for the pullback cover of the square. A sufficiently fine rectangular grid then maps every closed cell into one ball. The transport around the boundary of that cell is the identity: compute it with that one ball's primitive; subdivision and ball independence from step 2.1 permit this computation. Compose these identities over all cells. Every interior edge is traversed once in each direction, so its transports cancel. The two vertical boundary paths are constant when endpoints are fixed; hence the transports along the two horizontal paths agree. If has the stated loop property, any two paths from the basepoint to a given point have equal terminal germs by applying this argument to their concatenation with one reversed. A connected open subset of Euclidean space is path connected: the set reachable by polygonal paths is both open and relatively closed, since a ball about any point joins that point to all nearby points. Thus there is a terminal germ at every point.
On a small ball around any point, path independence identifies these terminal germs with one fixed local primitive plus a constant. The resulting local functions therefore agree almost everywhere on overlaps. They define an class on : enumerate the countable ball cover and use the first applicable representative on each measurable difference of balls; the overlap exceptional sets have countable union of measure zero. Any compact subset has a finite ball subcover, so the class is locally, and its weak derivative is there and hence globally on compactly supported tests. This is . Any two choices differ by a locally zero-gradient function, so [F3] makes the difference constant. AC is used only for the cited analytic interfaces and the countable local representative/primitive choices.
Depends on
- The real H(curl) graph space on a polyhedron
- Poincare inequality on a ball
- Zero weak gradient gives componentwise constants
- Integer-order Sobolev spaces are Banach
- Every $L^1$ approximate identity converges to the identity in $L^p$ for $1 \le p < \infty$
- Convolution with a mollifier is smooth, and derivatives pass under the integral sign
- The Axiom of Choice
- The mollifier family generated by a unit-mass smooth bump
- A unit-mass smooth bump generates an $L^1$ approximate identity
- Interior mollification commutes with weak derivatives
- Euclidean balls have positive finite Lebesgue measure
- Test function cutoffs and euclidean localization
- Every open cover of a compact metric space has a Lebesgue number: a $\delta > 0$ such that every nonempty subset of diameter less than $\delta$ lies inside a single member of the cover
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ 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
Used by
Dependency tree · two levels
102 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
- Ralf Hiptmair and Clemens Pechstein, Regular Decompositions of Vector Fields—Continuous, Discrete, and Structure-Preserving (standard reference, not scraped)