Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Sieve metric entropy produces uniform exponential tests

Statement

Let (X,A,μ) be a measure space with a fixed sigma-finite measure. A probability density is a finite-valued nonnegative measurable p with ∫p dμ=1, and its induced law is Pp=p dμ as in The measure with density f relative to μ. Let p0 be a probability density and write P0:=p0 dμ. Let F be a family of such densities, write Pp:=p dμ for p∈F, and let Fn⊆F be nonempty. Let X1,…,Xn be IID under each law used below. The selected metric d is one of:

  • the root-L2 Hellinger distance h of Root-L2 Hellinger distance between density laws;
  • the full density distance d1(p,q):=∫∣p−q∣ dμ;
  • the density distance d2(p,q):=(∫∣p−q∣2 dμ)1/2, provided a fixed B>0 bounds p0 and every p∈F by B almost everywhere.

For r>0, let D(r,Fn,d) be the supremum of the cardinalities of finite subsets of Fn whose distinct points have d-distance greater than r. Suppose ϵn>0, ϵn→0, nϵn2→∞, and log⁡D(ϵn,Fn,d)≤nϵn2. Then for every fixed M≥128 and all sufficiently large n, there is a measurable test ϕn:Xn→{0,1} such that, for some cd>0 depending only on the selected metric (and on B in the d2 case), P0n(ϕn=1)≤2e−(cdM2−1)nϵn2, and Ppn(ϕn=0)≤e−cdM2nϵn2 for every p∈Fn with d(p,p0)>Mϵn.

The entropy metric is the same metric used in the separation and test-error conclusion. The d1 convention is the full integral ∫∣p−q∣ dμ, which equals twice the library event-supremum total variation distance.

Facts & Assumptions

Given: A sigma-finite measure μ, a density family F, its nonempty subset Fn, density p0, a selected metric d from the Statement, and a sequence ϵn satisfying the stated entropy and rate conditions.

[A2]

In the d2 branch only, assume p0 and every model density satisfy 0≤p≤B μ-almost everywhere for one fixed finite B>0.

[F1]

Root-L2 Hellinger distance between density laws: h(P,Q)=∥p−q∥2 under the fixed common dominator.

[F2]

Hellinger distance is a metric and controls L1 and total variation: h satisfies the triangle inequality, d1(p,q)≤2h(P,Q), and ∥P−Q∥TV≤h(P,Q).

[F3]

Total variation distance for probability laws: for probability laws, ∥P−Q∥TV=sup⁡A∣P(A)−Q(A)∣.

[F4]

Bernstein tail bound for independent bounded sums: for independent centered variables bounded in absolute value by b with total variance V, each one-sided tail at t>0 is at most exp⁡[−t2/(2(V+bt/3))].

[F5]

Identical distribution and IID families: an IID sample is mutually independent and has one common law.

[F6]

Measurable coordinatewise functions preserve independence and Disjoint groups of an independent sigma-algebra family remain independent: measurable functions of independent coordinates remain independent, and disjoint finite coordinate blocks are independent.

[F7]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: nonnegative product-measurable functions on sigma-finite product spaces may be integrated in either order.

[F8]

Independent random elements have product joint law: a finite IID sample has the product of its one-observation laws as its joint law. For a density p, Tonelli and the density-measure definition give the product density ∏ip(xi) relative to μm: its masses on measurable rectangles factor into the product-law rectangle masses, and uniqueness on the generating product rectangles identifies the measures (The measure with density f relative to μ, The product sigma-algebra and its finite iterates, Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system).

[F9]

Minkowski's inequality for integrals, including p=∞: L1 and L2 norms satisfy the triangle inequality.

[F10]

Holder's inequality for integrals, including the endpoint cases: the integral Cauchy–Schwarz inequality holds for two L2 functions.

[F11]

The natural logarithm as the inverse of the exponential function, The real exponential function and the number e by a power series and The exponential function is strictly increasing: the natural logarithm is increasing and inverse to the real exponential, whose power series has nonnegative terms at positive arguments.

[F13]

Basic identities for a probability measure: the probability of a finite union is at most the sum of the event probabilities.

[F14]

The measure with density f relative to μ: the law associated with a nonnegative measurable density p is the measure Pp(A)=∫Ap dμ.

[F15]

Arithmetic and lattice operations preserve measurability whenever they are defined: sums, differences, products, and lattice operations on measurable functions preserve measurability.

[F16]

Composition with a Borel measurable outer map preserves measurability: composing measurable functions with Borel maps preserves measurability, including square roots, signs, and threshold events used below.

[F17]

Monotonicity and nonnegative homogeneity of the nonnegative integral and Additivity of the nonnegative Lebesgue integral: the nonnegative integral preserves order, is additive, and is homogeneous under positive finite scalars.

Proof

1.1A2F1F2F5F9F14F17givenchoose

Put η:=1/128 and, for integers j≥0, set aj:=(M+j)ϵn and Sn,j:={p∈Fn:aj<d(p,p0)≤aj+ϵn}. These shells cover every p with d(p,p0)>Mϵn. The selected metrics are bounded on probability densities: h2≤2 by [F1], d1≤2 by [F17] and the unit-mass densities, and in the d2 branch only, [A2] and [F17] give d22≤∫(p+p0)2dμ≤2B∫(p+p0)dμ=4B. Thus only finitely many shells are nonempty for fixed n. For each nonempty shell choose a maximal subset Qn,j⊆Sn,j whose distinct points are more than rj:=ηaj apart. Such a finite maximal set exists: the attainable cardinalities of finite rj-separated subsets form a nonempty bounded subset of N, so a largest cardinality is attained. Since aj≥Mϵn and M≥128, rj≥ϵn; its size is at most D(ϵn,Fn,d)≤enϵn2. Maximality puts every shell member within rj of a center, and the triangle inequality gives d(q,p0)>(1−η)aj for each center. Only finitely many choices are made for each n, so no arbitrary-index choice axiom is used to form the nets.

1.2F4F15F16givenconstructalgebra

Now let d=d1. For a center q in shell j, put s:=d1(q,p0)>(1−η)a, r=ηa, and f(x):=sign⁡(q(x)−p0(x)), with sign⁡(0)=1. By [F15, F16], f is measurable, so its sample mean and threshold event are measurable. Then ∣f∣≤1, Pqf−P0f=s, and every p with d1(p,q)≤r satisfies Ppf−P0f≥Δ:=s−r>(1−2η)a. Test by whether the sample mean of f(Xi) is at least P0f+Δ/2. Under either law, the centered summands have variance at most one and absolute value at most two; also Δ≤s≤2. Bernstein [F4] with t=nΔ/2, total variance at most n and bound b=2 gives exponent at least nΔ2/[8(1+Δ/3)]≥3nΔ2/40, so each error is at most exp⁡(−3nΔ2/40). Thus this branch has c1=3(1−2η)2/40.

1.3A2F4F10F15F17givenconstructalgebra

Now let d=d2 and assume [A2]. At center q, put s:=∥q−p0∥2>(1−η)a, r=ηa, and f:=q−p0. This is measurable by [F15]. Then Pqf−P0f=s2. Since r/s<η/(1−η)<1/2, every p with ∥p−q∥2≤r satisfies, by [F10], Ppf−P0f≥Δ:=s2−rs≥s2/2. Also Δ≤s2, ERf(X)2≤Bs2 for R=P0 or P by [A2] and monotonicity [F17], and ∣f(X)−Rf∣≤2B under either law because ∣f∣≤B. Testing the sample mean at threshold P0f+Δ/2 and applying [F4] with total variance at most nBs2, bound b=2B, and t=nΔ/2 gives exponent at least 3ns2/(128B)≥3na2/(512B). Thus each error is at most exp⁡(−3na2/(512B)) and c2=3/(512B).

2.1F7F8F10F11F12F15F16step 1.1givenconstruct

Fix a nonempty shell, write a:=aj, r:=ηa, and let q∈Qn,j. First consider d=h. Write s0=(1−η)a and ρ:=∫p0q dμ=1−h(P0,Q)2/2. By [F10], 0≤ρ≤1; the affinity integrand is measurable by [F15, F16]. Since h(P0,Q)>s0, this gives ρ≤1−s02/2. By step 1.1 and nonemptiness, s02≤2. Set m:=⌈2log⁡(8)/s02⌉. For u=s02/2∈[0,1], e−u−(1−u) has value zero at u=0 and derivative 1−e−u≥0 by monotonicity of the exponential; hence 1−u≤e−u. On a block of m observations use T=1{∏i=1mq(Xi)>∏i=1mp0(Xi)}. The products and comparison event are measurable by [F15, F16]. Tonelli on the finite product space gives product affinity ρm, and ρm≤(1−u)m≤e−mu≤1/8. Its type-I error under P0m is at most this affinity, since on T=1 the product density p0⊗m is at most p0⊗mq⊗m; its type-II error under Qm is at most the same bound by the symmetric inequality on T=0.

3.1F2F3F7F8F11F15F16step 2.1algebra

If p lies in the Hellinger ball h(P,Q)≤r, then Tonelli on the measurable product densities gives h(Pm,Qm)2=2(1−ρ(P,Q)m)≤mh(P,Q)2, since 1−zm=(1−z)(1+z+⋯+zm−1)≤m(1−z) for 0≤z≤1. By [F2], ∥Pm−Qm∥TV≤h(Pm,Qm)≤m r. Since a≤2 for a nonempty Hellinger shell, s02≤2, m≤8/s02, and mr2≤8η2/(1−η)2<1/64, so m r<1/8. Indeed, [F11] gives e3>1+3+9/2>8, hence log⁡8<3; also 1−η>1/2. For the event {T=0}, the change in probability from Qm to Pm is at most TV, so the type-II error is at most 1/8+1/8=1/4 uniformly over this ball.

4.1F4F5F6step 3.1algebra

Divide the first Nm observations into N:=⌊n/m⌋ disjoint blocks and reject when at least half of their block tests reject. The block indicators are independent under both P0n and Pn by [F5]–[F6]. Under P0, each has mean at most 1/8; under the ball alternatives each has mean at least 3/4. Their variances are at most 1/4 and their centered absolute values at most one. Under P0, rejection forces an upward deviation at least 3N/8, so [F4] gives exp⁡[−(3N/8)2/(2(N/4+(3N/8)/3))]=e−3N/16≤e−3N/32. Under an alternative, acceptance forces a downward deviation at least N/4, so [F4] gives exp⁡[−(N/4)2/(2(N/4+(N/4)/3))]=e−3N/32. Since m≤32/a2, na2→∞ implies n/m≥2 eventually and N≥n/(2m)≥na2/64; hence both errors are at most e−3na2/2048. Thus ch=3/2048.

5.1F4F13F15F16step 1.1step 4.1step 1.2step 1.3algebra∎

In the selected branch let cd be its constant from steps 4.1, 1.2, or 1.3. If there are no nonempty shells, the alternative set is empty and define ϕn≡0. Otherwise choose each center's local test and let ϕn be their maximum over the finitely many centers in the nonempty shells. The local tests are measurable by the density-difference, product, and threshold measurability in [F15, F16]; a finite maximum remains measurable. For a fixed alternative in shell j, its nearby center supplies type-II error at most e−cdnaj2≤e−cdM2nϵn2. For type I, the union bound over at most enϵn2 centers per shell gives P0n(ϕn=1)≤enϵn2∑j=0∞e−cdn(M+j)2ϵn2≤2e−(cdM2−1)nϵn2 for all sufficiently large n: writing x=nϵn2, the sum is e−cdM2x∑j=0∞e−cdx(2Mj+j2), whose consecutive-term ratio is at most e−cdx(2M+1)≤1/2. This proves the two test bounds for the same metric used in the packing condition.

Depends on

Used by

Dependency tree · two levels

90 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