Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

Finitely many polynomial moments control the uniform distance on bounded Lipschitz profiles

Statement

Fix I=[a,b] with a≤b and let ΣI be the set of real functions σ with support in I satisfying ∣σ(x)−σ(y)∣≤∣x−y∣ for all x,y. Then for every ε>0 there exist K∈N and δ>0 such that every σ∈ΣI with ∣∫Rσ(x)xk dx∣≤δ(k=0,1,…,K) satisfies sup⁡x∈R∣σ(x)∣≤ε. Consequently, if (σn)⊆ΣI and ∫Rσn(x)xk dx→0 for every k≥0, then σn→0 uniformly on R; equivalently, on ΣI the topology of all polynomial moments coincides with the topology of uniform convergence.

Facts & Assumptions

Given: reals a≤b, the set ΣI of real functions σ vanishing outside I with ∣σ(x)−σ(y)∣≤∣x−y∣ for all x,y, and a real ε>0. For σ∈ΣI the integral ∫Rσ(x)xk dx of the Statement is read as ∫abσ(x)xk dx (Riemann-Darboux, The lower and upper Darboux integrals of a bounded f on [a,b] as sup⁡PL(f,P) and inf⁡PU(f,P), Darboux integrability as their equality, and the notation ∫abf) when a<b, and as 0 when a=b; the convention x0=1 is used.

[F1]

A function with ∣g(x)−g(y)∣≤∣x−y∣ for all reals x,y is continuous on R: at every point and every real η>0, δ:=η witnesses continuity (Continuity of f:A→R at a point of A and on A: the ε-δ condition, its agreement with lim⁡x→cf(x)=f(c) at a limit point, and continuity at an isolated point).

[F2]

For a≤b, every continuous real function on [a,b] is a uniform limit of polynomials (Polynomials are uniformly dense in C([a,b],R) for every closed interval).

[F4]

For a<b, if f,g are integrable on [a,b] then so are f+g and λf for real λ, with ∫ab(λf+μg)=λ∫abf+μ∫abg (Integrable functions on [a,b] form a set closed under sums and scalar multiples, and ∫ab(λf+μg)=λ∫abf+μ∫abg); if f≤g pointwise on [a,b] then ∫abf≤∫abg, and if m≤f≤M then m(b−a)≤∫abf≤M(b−a) (If f≤g on [a,b] and both are integrable then ∫abf≤∫abg; and m(b−a)≤∫abf≤M(b−a)).

[F5]

Absolute value and its basic inequalities: ∣u∣=u for u≥0 and ∣u∣=−u for u<0 (Absolute value in an ordered field); for every real c>0 and real x, ∣x∣≤c if and only if −c≤x≤c (Basic properties of the absolute value); and ∣x+y∣≤∣x∣+∣y∣ for all reals x,y (The triangle inequality).

[F6]

A sequence (gn) of real functions converges uniformly to 0 on R when for every real η>0 there is N with ∣gn(x)∣<η for all n≥N and all x (Pointwise convergence, uniform convergence, and the uniformly Cauchy condition for sequences of real-valued functions).

Proof

technique · direct
1.1givenF1algebra

Boundedness of the profiles: let σ∈ΣI. If a=b, then for every real r>0 the point y:=a+r lies outside I, so σ(y)=0 and ∣σ(a)∣≤∣a−y∣=r; hence ∣σ(a)∣=0 and σ≡0. If a<b, the Lipschitz bound together with σ(y)=0 for y<a gives ∣σ(a)∣=∣σ(a)−σ(y)∣≤a−y for every y<a, hence ∣σ(a)∣≤0, and symmetrically σ(b)=0; then for x∈I one has ∣σ(x)∣≤∣x−a∣ and ∣σ(x)∣≤∣b−x∣, so ∣σ(x)∣≤(b−a)/2. Put C:=max⁡{1,(b−a)/2}, so sup⁡R∣σ∣≤C for every σ∈ΣI, and σ is continuous on R by [F1]. For the rest of the proof assume a<b; the case a=b is finished below.

1.2givenF1F3F4F5constructalgebra

The comparison bump: fix x∈I and a real η>0, and put u:=max⁡(a,x−η/2), v:=min⁡(b,x+η/2), so u<v because a<b and x∈I. Let c:=(u+v)/2 and define F(y):=max⁡{0, 2v−u(1−2∣y−c∣v−u)} for real y. Then F≥0 is continuous, its support is [u,v]⊆I∩[x−η/2,x+η/2], and ∫RF=1, the graph of F being a triangle of height 2(v−u)−1 and base v−u. Since every y in the support of F satisfies ∣y−x∣≤η/2, σ(y)≥σ(x)−∣y−x∣≥σ(x)−η/2; hence if σ(x)>η then σF≥(η/2)F pointwise on I and, as σF and F are continuous there, [F4] and [F3] give ∫RσF≥(σ(x)−η/2)∫RF=σ(x)−η/2>η/2, while if σ(x)<−η then symmetrically ∫RσF≤σ(x)+η/2<−η/2. In either case ∣σ(x)∣>η implies ∣∫RσF∣>η/2, so {σ∈ΣI:∣∫RσF∣≤η/2}⊆V(x,η):={σ∈ΣI:∣σ(x)∣≤η}.

1.3givenF1F3F4F5algebra

Integral triangle inequality and polynomial bounds: let f be continuous on [a,b]. Then f and ∣f∣ are continuous and integrable by [F3]. Applying [F4] to the two pointwise chains −∣f∣≤f≤∣f∣ and −f≤∣f∣ gives ∫f≤∫∣f∣ and −∫f=∫(−f)≤∫∣f∣; by [F5], ∣∫f∣≤∫∣f∣. Now let P=∑k=0Kakxk be a real polynomial with K≥0, put S:=1+∑k=0K∣ak∣≥1, let η>0 and set δ0:=η/(4S). If σ∈ΣI satisfies ∣∫Rσxk∣≤δ0 for k=0,…,K, then σP is continuous on [a,b], [F4] gives ∫RσP=∑k=0Kak∫Rσxk, and the integral triangle inequality just proved together with [F5] yields ∣∫RσP∣≤∑k=0K∣ak∣∣∫Rσxk∣≤∑k=0K∣ak∣ δ0≤η/4.

1.4givenchoosealgebra

A finite mesh: for every real η>0 there are finitely many points a=x1<x2<⋯<xm=b with xi+1−xi≤η for all i<m; one may take m:=⌈(b−a)/η⌉+1 and split [a,b] into equal parts. Every x∈I then satisfies ∣x−xi∣≤η for at least one mesh point xi.

2.1givenF1F2F3F4F5step 1.1step 1.2step 1.3algebra

Polynomial replacement of the bump: keep the notation of step 1.2 and put θ:=η/(4C(b−a))>0 with C from step 1.1. By [F2] choose a polynomial P with sup⁡y∈I∣F(y)−P(y)∣≤θ. The functions σF, σP and σ(F−P) are continuous on [a,b] by [F1], hence integrable by [F3], and all three vanish outside I; therefore, by step 1.3 and [F4], ∣∫Rσ(F−P)∣≤∫R∣σ(F−P)∣≤C(b−a)sup⁡I∣F−P∣≤η/4, and if ∣∫RσP∣≤η/4, then [F5] gives ∣∫RσF∣≤∣∫RσP∣+∣∫Rσ(F−P)∣≤η/2. Combined with step 1.2, {σ∈ΣI:∣∫RσP∣≤η/4}⊆V(x,η).

2.2givenstep 1.4algebra

From mesh values to the supremum: let η>0, let a=x1<⋯<xm=b be a mesh as in step 1.4, and let σ∈ΣI satisfy ∣σ(xi)∣≤η for all i. For x∈I choose i with ∣x−xi∣≤η; then ∣σ(x)∣≤∣σ(xi)∣+∣x−xi∣≤2η, while ∣σ(x)∣=0≤2η for x∉I. Hence sup⁡R∣σ∣≤2η.

3.1givenstep 1.1step 1.3step 1.4step 2.1step 2.2algebra

First claim: given ε>0, apply steps 2.1 and 1.3 with η:=ε/2 at each mesh point x1,…,xm of step 1.4: for each i this produces a polynomial Pi=∑k=0Kiai,kxk such that {σ∈ΣI:∣∫RσPi∣≤ε/8}⊆V(xi,ε/2), and a threshold δi:=ε/81+∑k=0Ki∣ai,k∣>0 such that the moments up to Ki being at most δi force ∣∫RσPi∣≤ε/8. Put K:=max⁡iKi and δ:=min⁡iδi>0; both depend only on I and ε. Let σ∈ΣI satisfy ∣∫Rσxk∣≤δ for k=0,…,K. For each i the moments up to Ki≤K are at most δ≤δi, so ∣∫RσPi∣≤ε/8 and hence ∣σ(xi)∣≤ε/2; step 2.2 with η=ε/2 gives sup⁡R∣σ∣≤ε. In the case a=b every σ∈ΣI is σ≡0 by step 1.1, so any K and δ work.

4.1givenF3F4F6step 1.1step 1.3step 3.1algebra∎

Consequence and topology: for a sequence with every moment tending to zero, apply step 3.1 with tolerance ε/2; the finitely many moment conditions hold eventually, giving sup⁡∣σn∣≤ε/2<ε, hence uniform convergence by [F6]. To compare the topologies at an arbitrary τ∈ΣI, put g:=(σ−τ)/2∈ΣI. Given ε>0, step 3.1 at tolerance ε/4 supplies K,δ>0; if ∣∫(σ−τ)xk∣<2δ for k≤K, then sup⁡∣σ−τ∣=2sup⁡∣g∣≤ε/2<ε. Thus a finite intersection of moment neighborhoods of τ lies in each uniform neighborhood. Conversely, for every k, continuity and steps 1.3 and [F4] give ∣∫(σ−τ)xk∣≤(b−a)max⁡{1,∣a∣,∣b∣}ksup⁡∣σ−τ∣, so each moment functional is continuous for the uniform topology. These two neighborhood containments prove equality of the topologies; when a=b the space is the singleton zero profile by step 1.1.

Depends on

Used by

Dependency tree · two levels

45 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