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.

Periodic averaging and rescaling bounds on the unit cube

Statement

Let Y=(0,1)d, Q=(0,1)d, g∈L1(Y) be extended Zd-periodically, and φ∈Cc1(Q). As ϵ↓0, ∫Qφ(x)g(x/ϵ) dx⟶(∫Yg)(∫Qφ). If g∈L2(Y) and 0<ϵ≤1, then ∥g(⋅/ϵ)∥L2(Q)≤Cd∥g∥L2(Y). In particular, for g∈L2(Y), g(⋅/ϵ)⇀∫Yg weakly in L2(Q).

Facts & Assumptions

Given: A periodic L1 or L2 function on the unit cell, a compactly supported C1 slow factor, cell tiling by ϵ(k+Y), affine change of variables for Lebesgue-measurable functions, Cauchy--Schwarz, and smooth density in L2(Q).

[F1]

Holder's inequality for integrals, including the endpoint cases: integral Cauchy--Schwarz holds on Q and on each cell.

[F2]
[F3]

A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions: affine pullbacks preserve the measurability and almost-everywhere class of periodic functions and transform nonnegative integrals by the determinant.

[F4]

If f:[a,b]→Rm is differentiable with integrable f′ then ∫abf′=f(b)−f(a); and a bounded derivative makes f Lipschitz: the bounded gradient of the C1 slow factor gives ∣φ(x)−φ(xk)∣≤∥∇φ∥∞∣x−xk∣ along each line segment in a grid cell.

[A1]

The Axiom of Countable Choice (ACω): the periodic representatives and L2 classes use the stated Countable Choice convention.

Proof

1.1F3F4givenalgebra

Tile Rd by cells Ckϵ=ϵ(k+Y). Only Od(ϵ−d) cells meet the fixed compact support of φ. On each such cell choose its lower corner xk=ϵk. The mean-value bound gives ∣φ(x)−φ(xk)∣≤dϵ∥∇φ∥∞. By [F3], ∫Ckϵ∣g(x/ϵ)∣dx=ϵd∥g∥L1(Y). Therefore replacing φ by φ(xk) on every intersecting cell changes the integral by at most Cϵ∥g∥1∥∇φ∥∞; for sufficiently small ϵ, every such cell is contained in Q because the support is compact in Q. Extend φ by zero to a compactly supported C1 function on Rd. For all sufficiently small ϵ, the grid sum has only cells in a fixed bounded box, and ∣ϵd∑kφ(ϵk)−∫Rdφ(x) dx∣≤∑k∫Ckϵ∣φ(ϵk)−φ(x)∣ dx≤Cϵ∥∇φ∥∞, since the total volume of those cells is uniformly bounded. Thus the grid Riemann sums converge. By [F3], the change-of-variables identity first holds for g+ and g− separately; subtracting their finite integrals gives ∫Ckϵg(x/ϵ) dx=ϵd∫Yg for signed g. The cell-corner sum is therefore ϵd∑kφ(ϵk)∫Yg, which converges to the stated mean times integral.

1.2F1F3algebra

The same tiling bounds the L2 rescaling: each cell has ∫Ckϵ∣g(x/ϵ)∣2dx=ϵd∥g∥22 by [F3], and at most Cdϵ−d cells meet Q when ϵ≤1. Summing gives the asserted uniform bound.

2.1step 1.2F2F1step 1.1A1algebra∎

The averaging result applied to every Cc∞(Q) test gives convergence of pairings against that dense class. The uniform L2 bound in step 1.2, together with ∣∫Yg∣≤∥g∥2, lets one approximate an arbitrary L2(Q) test by [F2] and pass the pairing limit. This proves weak L2 convergence.

Depends on

Used by

Dependency tree · two levels

71 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