Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge 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.

Regularity and invariance of the cutoff Gaussian-mixture class

Statement

Fix u∈R3 and positive velocity-squared parameters 0<a<b (in a physical interpretation, both have units (m s−1)2). Let

Ka,b:={Σ∈R3×3:Σ=ΣT, aI≤Σ≤bI},

where the matrix inequalities mean a∣z∣2≤zTΣz≤b∣z∣2 for every z∈R3. For Σ∈Ka,b, define the normalized Gaussian density

γΣ,u(v):=(2π)−3/2(det⁡Σ)−1/2exp⁡ ⁣(−12(v−u)TΣ−1(v−u)).

Let Mu,a,b be the closure in the weighted space X of all finite convex mixtures ∑j=1NαjγΣj,u with Σj∈Ka,b, αj≥0, and ∑jαj=1. Then:

  1. Every f∈Mu,a,b has a C∞ representative satisfying

(2πb)−3/2e−∣v−u∣2/(2a)≤f(v)≤(2πa)−3/2e−∣v−u∣2/(2b).

For every multi-index α, there is a finite constant Cα,a,b, depending only on α,a,b and not on f, such that

∣∂αf(v)∣≤Cα,a,b(1+∣v−u∣∣α∣)e−∣v−u∣2/(2b).

The common derivative bounds imply that every sequence in Mu,a,b has a subsequence converging locally uniformly together with all velocity derivatives.

  1. The gain in Cutoff elastic-reflection collision measure and gain maps this class into itself: G(f,g)∈Mu,a,b whenever f,g∈Mu,a,b.

Facts & Assumptions

Given: ACω, u∈R3, positive velocity-squared parameters 0<a<b, and the definitions in the Statement.

[A1]

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)); it is the only choice principle used in the measurable representatives and countable diagonal subsequence arguments.

[F1]

Cutoff elastic-reflection collision measure and gain: G(f,g)(v)=∫f(v′)g(w′) dw dσ(n), with v′=v−((v−w)⋅n)n and w′=w+((v−w)⋅n)n.

[F2]

Well-defined elastic reflection gain and collision identities: the pair reflection is orthogonal with unit absolute Jacobian, and G is bilinear with ∥G(f,g)∥1,w0≤2∥f∥1,w0∥g∥1,w0.

[F3]

Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis: a real self-adjoint endomorphism of a finite-dimensional real inner-product space has an orthonormal eigenbasis.

[F5]

Dominated convergence: almost-everywhere convergence dominated by a single integrable function permits passage of limits through the Lebesgue integral.

[F6]

A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions: under ACω, a C1 diffeomorphism changes Lebesgue integrals by the absolute Jacobian determinant.

[F7]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: for sigma-finite factors, Tonelli permits iterated integration of nonnegative measurable functions.

Proof

Given: [A1], u, a, b, and [F1]–[F7].

Proof technique: direct.

1.1F3F4algebra

By [F3], diagonalize Σ in an orthonormal basis with eigenvalues s12,s22,s32∈[a,b]. The linear substitution yi=(v−u)i/si has Jacobian det⁡(Σ)−1/2; [F4] in each coordinate gives ∫γΣ,u(v) dv=1. The same eigenvalue bounds give (det⁡Σ)−1/2∈[b−3/2,a−3/2] and ∣v−u∣2/b≤(v−u)TΣ−1(v−u)≤∣v−u∣2/a, proving the two Gaussian envelopes for each component and hence for every finite mixture.

1.2F2F3F4F6F7algebra

Let On:R6→R6 be the orthogonal pair map from [F2], and let P:R6→R3 project onto the first component. For component densities γΣ,u and γT,u, the joint centered covariance is S=diag⁡(Σ,T). Using [F6] under On, the density of the pair after reflection is the centered Gaussian with covariance Sn=OnSOnT and mean (u,u). Write Sn in blocks as (CDDTE). Its first marginal is Gaussian with covariance C: indeed C is positive definite, the Schur complement H=E−DTC−1D is positive definite, and block elimination gives det⁡Sn=det⁡Cdet⁡H and (x,y)TSn−1(x,y)=xTC−1x+(y−DTC−1x)TH−1(y−DTC−1x). Integrating in y using [F3], [F4], and [F7] gives the normalized marginal γC,u. Also C=PSnPT satisfies aI≤C≤bI: for every z, zTCz=(z,0)TOnSOnT(z,0) lies between a∣z∣2 and b∣z∣2.

2.1F3step 1.1algebra

Differentiating a component γΣ,u in v multiplies it by a polynomial in Σ−1(v−u); each coefficient is uniformly bounded because ∥Σ−1∥≤a−1. The exponent has the upper bound from step 1.1, so every derivative of a finite mixture has the stated polynomial-Gaussian envelope, uniformly over all finite mixtures in this class.

2.2F1F5F7step 1.1step 1.2algebra

Therefore G(γΣ,u,γT,u) is the pointwise angular average ∫S2γCn,u dσ(n) with Cn∈Ka,b. The map n↦Cn is continuous, and C↦γC,u is continuous in X: pointwise convergence follows from the formula, while the weighted upper Gaussian envelope from step 1.1 is an integrable dominator and [F5] gives weighted-L1 convergence. For each n, continuity supplies a relative-open neighborhood on which the X-distance from γCn,u is less than ε; compactness of S2 gives a finite subcover. Successively subtracting earlier open sets makes this a finite Borel partition Ej, and choosing one nj in each nonempty piece gives variation at most 2ε on that piece. Tonelli [F7] and the triangle inequality bound the weighted-L1 distance from the angular average to ∑jσ(Ej)γCnj,u by 2ε∑jσ(Ej)=2ε. Since ε>0 is arbitrary, the angular average belongs to Mu,a,b. Bilinear expansion proves the same for finite convex mixtures in both inputs.

3.1F2step 2.2algebra

For general f,g∈Mu,a,b, choose finite-mixture sequences fk→f and gk→g in X. The bound [F2] gives ∥G(fk,gk)−G(f,g)∥1,w0≤2∥fk−f∥1,w0∥gk∥1,w0+2∥f∥1,w0∥gk−g∥1,w0⟶0. Each G(fk,gk) is in Mu,a,b by step 2.2, so closedness proves G(f,g)∈Mu,a,b.

4.1A1F5step 1.1step 2.1algebra∎

Let fk be finite mixtures converging in X to f∈Mu,a,b. By step 2.1, every derivative sequence (∂αfk)k is uniformly bounded and equicontinuous on every closed ball, since the next derivatives have a common bound there. On the countable dense rational grid in each ball, bounded real sequences admit convergent subsequences: repeatedly bisect a bounded interval, retain a half containing infinitely many terms, and use the nested intervals of lengths tending to zero to select a convergent subsequence. A countable diagonal selection over grid points, integer-radius balls, and multi-indices makes every derivative converge on every grid. Equicontinuity and a finite rational δ-net of each ball then make these subsequences uniformly Cauchy there, hence locally uniformly convergent. The fundamental theorem of calculus along coordinate segments identifies the limits as derivatives of a smooth function f~. Weighted-L1 convergence identifies f~=f almost everywhere on every ball, so f~ represents f. The pointwise envelopes and derivative bounds pass to the local uniform limit. This proves part 1 for every class element.

Depends on

Dependency tree · 2 levels

Sources