Alphabeta Math
False statementConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedaudited 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.

Inner regularity on open sets implies inner regularity on all Borel sets

Statement

On a locally compact Hausdorff space, a Borel measure that is finite on compact sets, outer regular on Borel sets, and inner regular on open sets must be compact-inner-regular on every Borel set.

Facts & Assumptions

Given: Work with Countable Choice. Put A={0}×R, D={(1/n,m/n2):m,nN>0}, and X=AD. Declare each point of D isolated and declare the following sets, for N1, to be a neighbourhood basis at (0,y): WN(y)={(0,y)}{(1/n,m/n2)D:n>N, m/n2y<1/n}. In particular a basic neighbourhood contains exactly one axis point. Define μ(E)=(1/n,m/n2)EDn3 for every subset E of X, and M(E)=infEU openμ(U).

[A1]

The Baire category theorem for the ordinary complete interval [1,2] says that a countable closed cover has a member with nonempty relative interior.

Refutation

technique · direct counterexample
1.1

These sets define a Hausdorff topology: wedges with different centres become disjoint after truncation, and isolated points can be removed by truncation. Each WN(y) is compact, since any neighbourhood of its centre leaves only finitely many of its atoms uncovered. Thus X is locally compact. The axis is closed and discrete; each subset of it is closed in X, so every subset of X is Borel. At level n a wedge contains at most 2n+1 atoms, giving μ(WN(y))n>N(2n+1)n30. In particular μ is locally finite.

given
1.2

For a subset SA, if an open US has finite μ-mass, deleting finitely many atoms from U makes its mass arbitrarily small without losing S. Hence M(S) is either zero or infinity. The family I={SA:M(S)=0} is closed under subsets and countable unions: cover its jth member by an open set of mass less than ε2j1, for j0, and take their union. Thus ν(S)=0 on I and ν(S)= otherwise is a countably additive measure on the axis.

givenconstruct
1.3

Let UA be open and set BN={y[1,2]:WN(y)U}. Each BN is closed in [1,2]: its complement is the union, over missing atoms with n>N, of the open intervals m/n2y<1/n. The BN increase and cover [1,2]. By Baire some BN contains a nondegenerate interval I[1,2]. All atoms with n>N and m/n2I belong to U, so μ(U)n>N(In2+O(1))n3=. Hence M(A)=.

A1given
2.1

For every EX one has M(E)=μ(ED)+ν(EA). Indeed the lower bounds follow by monotonicity; when ν(EA)=0, adjoin an arbitrarily small open cover of EA to the open set ED. The infinite cases follow directly from the lower bounds. Consequently M is a Borel measure. For open U, M(U)=μ(U) by the defining infimum. The same infimum makes M outer regular.

step 1.2given
3.1

Every compact set has finite M-mass by a finite cover of finite-mass basic neighbourhoods. Also M({d})=μ({d}) for dD, so finite sets of atoms inside an open U have masses with supremum μ(U)=M(U). This proves compact inner regularity on opens. A compact subset of the closed discrete axis is finite, and each axis singleton has M-mass zero by the wedge estimate; therefore every compact subset of A has mass zero.

step 1.1step 2.1
4.1

We have M(A)=>0=supKA compactM(K), although M satisfies all the claimed premises. This refutes the implication, preserving the page's distinction between Radon and all-Borel regularity.

step 3.1step 1.3

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

5 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