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

Compact-set formula and local finiteness of the RMK measure

Statement

For every compact KX, μ(K)=inf{Λ(f):fCc(X), 1Kf}. In particular μ(K)<.

Facts & Assumptions

Given: The Borel measure μ constructed from Λ.

[L1]

LCH cutoffs exist between a compact set and an open neighbourhood. (LCH Urysohn cutoff)

Proof

technique · direct
1.1

Suppose 1KfCc(X). For 0<ε<1, the open set Uε={f>1ε} contains K. Every gUε satisfies gf/(1ε), so positivity gives ρ(Uε)Λ(f)/(1ε). Outer regularity therefore yields μ(K)Λ(f)/(1ε), and then μ(K)Λ(f).

given
1.2

Conversely, for every open UK, choose an open V with [L1, choose] KVVU and compact closure. [L1] applied to KV supplies fCc(X) with 1Kf1V. Since f=0 off V, suppfVU, and hence fU. Thus Λ(f)ρ(U). Taking first the infimum over f, then over U, gives the reverse inequality. For K=, f=0 gives both sides zero.

L1
2.1

Choosing one relatively compact open neighbourhood U of K and the [step 1.1, step 1.2, L1] cutoff produced in step 1.2 gives μ(K)Λ(f)<.

step 1.1step 1.2L1

Depends on

Used by

Dependency tree · two levels

12 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