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

Test function cutoffs and euclidean localization

Statement

In ZF, for compact KΩRn with Ω open, there is χCc(Ω) with 0χ1 and χ=1 on a neighborhood of K. Every open cover of Ω admits an at most countable locally finite smooth partition of unity with compact supports, each support contained in some cover member. Subordination here asserts existence of such a member for each support; it does not select cover labels.

Facts & Assumptions

[F1]

The explicit smooth cutoff b equals one on the closed unit ball, vanishes outside the radius-two ball, and satisfies 0b1; translated dilates have the stated derivative scaling (Explicit compactly supported smooth cutoffs).

[F2]

Smoothness and multi-index notation are as in Ck maps and multi-index derivative notation in Euclidean space, applied componentwise.

Proof

Given: the compact set and open set of the first assertion; an open cover U of Ω for the second.

1.1

For each point of K, there is a rational center q and positive rational r such that the point belongs to B(q,r) and B(q,2r)Ω. These inner balls cover K, so a finite list suffices by compactness. Put bj(x)=b((xqj)/rj) and χ=1j(1bj). Then χ is smooth, lies in [0,1], equals one on the union of the inner balls, and has support in the finite union of the compact outer balls inside Ω. For K= take the empty product and χ=0.

givenF1F2
2.1

For nonempty Ω, set Kj={x:xj, dist(x,RnΩ)1/j} for j1, interpreting distance to the empty set as infinity; set K0=K1=. These are compact subsets of Ω, KjintKj+1, and their interiors cover Ω. Closedness follows from continuity of distance (its absolute difference is at most the distance of the two points), and boundedness gives compactness. The shell Hj=KjintKj1 is compact and lies in the open set Gj=intKj+1Kj2.

step 1.1algebra
3.1

Fix an enumeration of rational center/radius pairs and a coding of finite lists by natural numbers. For each j, consider pairs with B(q,2r)Gj and with this closed ball contained in some UU. Their inner balls cover Hj: at any shell point openness of Gj and of one cover member gives a sufficiently small ball, then a rational center and radius. Compactness gives a finite subcover. Select the least code of a finite list that covers Hj, taking the empty list for an empty shell. This is a specified function of j, not Countable Choice.

step 2.1given
4.1

Form the corresponding translated dilates bj,k of F1. Their supports lie in Gj, and each support lies in some cover member. This family is locally finite: a point has a neighborhood inside some KN, and supports with jN+2 miss KN, while only finitely many balls occur at each of the finitely many earlier stages. Every point belongs to some shell, so s=j,kbj,k is everywhere positive. The sum is locally finite and smooth; hence ηj,k=bj,k/s are smooth, nonnegative, have compact support in the same outer balls, and sum to one. The double index is countable. For empty Ω use the empty family. These constructions choose no cover labels and no arbitrary sequence of witnesses.

step 3.1F1F2

Depends on

Used by

Dependency tree · two levels

10 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