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

The half-order diagonal singularity defines a bounded improper integral

Statement

For x∈[0,1], g∈C([0,1],R), and 0<ε<1, let Sx,ε(g):=∫[0,1]∖(x−ε,x+ε)∣x−y∣−1/2g(y) dy, where the integral is the sum of the ordinary Riemann integrals on the at most two remaining closed intervals, and an empty interval contributes zero. The limit Sx(g):=lim⁡ε↓0Sx,ε(g) exists. The map Sx:C([0,1],R)→R is linear and positive, and its operator norm (The operator norm as the least bound and as the unit-sphere or unit-ball supremum) is ∥Sx∥=Sx(1)=2x+21−x≤22.

Facts & Assumptions

Given: x∈[0,1], g∈C([0,1],R), and the truncated Riemann integrals Sx,ε(g) from the Statement.

[F1]

Riemann–Stieltjes sums, upper and lower sums, and the Riemann–Stieltjes integral: ∫ab denotes the ordinary Riemann integral, realized as the Riemann–Stieltjes integral with the identity integrator.

[F2]

A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion: a continuous real-valued function on each remaining closed interval has an ordinary Riemann integral.

[F4]

The two FTC forms for a Riemann–Stieltjes integral with a C1 integrator: for the identity integrator, an antiderivative evaluates the integral; since (2r)′=r−1/2 on r>0, ∫δεr−1/2dr=2(ε−δ) for 0<δ<ε.

[F5]

The reals are complete: every Cauchy sequence of real numbers converges.

[F7]

C(K,R) is complete in the supremum metric for every nonempty compact metric space K: every continuous real-valued function on [0,1] is bounded, so M:=∥g∥∞ is finite.

[F10]

On the nonempty compact interval [0,1] (Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line), let X=C([0,1],R) with its supremum norm. Pointwise addition and real scalar multiplication preserve continuity. The supremum is finite by C(K,R) is complete in the supremum metric for every nonempty compact metric space K; the pointwise absolute-value inequalities give ∥u+v∥∞≤∥u∥∞+∥v∥∞ and ∥cu∥∞=∣c∣∥u∥∞, and ∥u∥∞=0 holds exactly when u=0. Thus this is a real norm (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms). Its induced metric is the complete supremum metric of C(K,R) is complete in the supremum metric for every nonempty compact metric space K, so X is Banach (Banach space).

[F11]

The operator norm of a bounded linear map is the supremum of its values on the closed unit ball (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

Proof

Given: The data in the Statement, M:=∥g∥∞, and 0<δ<ε<1.

1.1givenF1F2F7F9

By [F9], [F7] applies and M=∥g∥∞ is finite. The integrand y↦∣x−y∣−1/2g(y) is continuous on each closed interval in [0,1]∖(x−ε,x+ε), because that set stays away from x. Thus the truncated integrals are finite and defined by [F1].

1.2givenF2F3F4F5F8algebra

For m≥2, put am:=Sx,1/m(g). By [F8], the difference am−aℓ integrates only over the two annuli between the cutoffs 1/m and 1/ℓ. On each annulus, ∣g(y)∣≤M; by [F2] and [F3], its absolute integral is bounded by M∫min⁡(1/m,1/ℓ)max⁡(1/m,1/ℓ)r−1/2dr. Adding at most two sides gives ∣am−aℓ∣≤4M∣m−1/2−ℓ−1/2∣, so (am) is Cauchy and has a limit L by [F5]. For any ε>0, choose m with 1/m<ε; comparing the two cutoffs gives ∣Sx,ε(g)−am∣≤4Mε. Letting m→∞ along such choices yields ∣Sx,ε(g)−L∣≤4Mε, so Sx,ε(g)→L as ε↓0.

2.1givenF3F4F8step 1.2algebra

For every ε, comparison on the left and right of x with the positive function r−1/2 gives ∣Sx,ε(g)∣≤M(2x+21−x). Taking the limit from step 1.2 proves the same bound for Sx(g). For g=1, the truncated integrals increase to the sum of the two endpoint integrals by [F8], so Sx(1)=2x+21−x. Since (2x−1)2≥0, we have 2x(1−x)≤1, and therefore Sx(1)2=4(1+2x(1−x))≤8. Thus Sx(1)≤22.

3.1F3F6F9F10F11step 2.1algebra∎

Each truncated functional is linear and nonnegative on nonnegative g; limits preserve those equalities and inequalities, so Sx is linear and positive. By [F10] it is a linear functional on a normed space. Step 2.1 gives ∣Sx(g)∣≤Sx(1)∥g∥∞, and the input g=1 attains equality; [F11] therefore gives ∥Sx∥=Sx(1).

Depends on

Used by

Dependency tree · two levels

104 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