Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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.

Cutoffs around surface-null edges

Statement

Assume ACω and n2. Let E be a compact subset of finitely many compact regular C1 hypersurface patches, with its intersection with each patch surface-null. For every ε>0 there is smooth 0η1, equal to one near E, supported within distance epsilon of E, such that RnDη<ε. These cutoffs can be chosen with support volume tending to zero as epsilon tends to zero.

Facts & Assumptions

Given: Assume ACω, n2. The compact set E is contained in finitely many compact regular C1 hypersurface patches and is surface-null in each. Fix ε>0.

[F1]

Regular chart density is positive and computes face surface measure. (Chart and partition independence of surface measure).

[F2]

Lebesgue-null sets admit cubic covers of arbitrarily small total volume. (Countable covers by closed boxes, by open boxes and by closed cubes all compute Lebesgue outer measure).

[F3]

A ball bump has gradient integral C_n times radius to the power n-1. (Compactly supported scaled Euclidean bumps).

Proof

1.1

If E is empty use eta=0. Otherwise subdivide the compact chart preimages into finitely many smaller closed boxes contained in chart domains, with interiors covering them. On each box the derivative has a bound L, enlarged to at least one, and its density J has a positive lower bound c by regularity and compactness (F1). The parameter subset mapping into E is compact and null: cλn1(A)AJ=0. The segment integral of DX in the convex box gives X(y)X(z)Lyz.

givenF1
2.1

Fix delta,A_0>0. F2 covers each null preimage by closed cubes with sum of side lengths to the power n-1 as small as desired. Make them open by enlarging the kth side by a positive amount with added volume below a prescribed geometric error 2k times the budget. Subdivide beforehand if needed so every resulting side is smaller than a prescribed positive bound. Intersect with the chart box. Compactness of each null preimage retains finitely many covering cubes; discard empty intersections with that preimage and choose one such point in each retained cube. The Lipschitz bound from step 1.1 places its image in a ball centered at the chosen image point of E with radius rj=2Ln1j. Choosing the finitely many chart budgets and side bounds sufficiently small gives a finite open ball cover of E with rj<δ and jrjn1<A0.

step 1.1F2
3.1

Use the fixed bump of F3 and put bj(x)=b((xcj)/rj) and η=1j(1bj). It lies between zero and one and is one on the union of the covering balls, hence near E. Its support lies in the union of the doubled balls, within distance 2δ of E. The finite product rule and 01bj1 give DηjDbj, so F3 yields DηCnjrjn1<CnA0.

step 2.1F3algebra
4.1

The support volume is at most 2nB1jrjn2nB1δA0 by volume dilation F4 and translation invariance. Take δ=ε/4 and A0=ε/(2max(1,Cn)). Then the support is within epsilon of E, its gradient integral is less than epsilon, and its volume is bounded by a fixed dimensional constant times ε2, tending to zero.

step 2.1step 3.1F4F5

Source notes

Hunter §1.10.2 and §1.12, printed pp. 15–18, for the surface convention and motivation only. The complete cube-cover and scaled-bump argument is local, as retained in research/phase-2-local-mathematical-repairs-2026-09-08.md, §PDE-2D.

Depends on

Used by

Dependency tree · two levels

64 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