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.

A deterministic-prefix envelope sum for the sharper UCB count bound

Statement

Let n≥5 be an integer, let a>0, and put L=log⁡n. For x≥0 define x+=max⁡{x,0} and f(x)=exp⁡(−(ax−2L)+22). Then ∑s=1n−1f(s)≤1+8La2. For n≥12 the stronger bound ∑s=1n−1f(s)≤8L/a2 holds. All integrals in the proof are proper Riemann integrals or their separately convergent improper limits.

Statement references

Lattimore and Szepesvári, Bandit Algorithms, Theorems 7.1–7.2: supplies the UCB proof context; this deterministic estimate is proved locally.

Facts & Assumptions

Given: The integer n, positive a, and L=log⁡n in the Statement.

[F1]

The Gaussian integral is ∫−∞∞e−x2 dx=π. The Gaussian integral ∫−∞∞e−x2 dx=π

[F2]

A monotone differentiable surjection between improper intervals preserves the integral, with absolute Jacobian, when its derivative is locally integrable and proper substitution holds on every compact truncation. Change of variable in an improper integral

[F3]
[F4]

For u>0, log⁡′(u)=1/u and log⁡u=∫1udt/t; logarithms are increasing and obey the product law. The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm

[F5]

Principal arctangent satisfies (arctan⁡x)′=1/(1+x2), arctan⁡x=∫0xdt/(1+t2), and arctan⁡1=π/4. Principal arctangent: derivative, integral, power series, and the Gregory–Leibniz series

[F8]

Convergent improper integrals can be split at a finite interior point and combined linearly. Improper convergence is independent of finite truncations and split points Linearity of convergent improper integrals

[F13]

The exponential tends to zero at negative infinity. The exponential tends to +∞ at +∞ and to 0 at −∞

[F16]

A continuous real function on a compact interval is Riemann integrable (A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion).

Proof

1.1givenF6F8F9F14F15F16F17algebraF11

By [F9], for 0≤x<y the identity y−x=(y−x)(y+x) and y+x>0 imply x<y: indeed y>0, and y>0 follows because its square is y. Thus the nonnegative square-root map is increasing. It is continuous at every x0>0, since x+x0≥x0>0 and ∣x−x0∣=∣x−x0∣x+x0≤∣x−x0∣x0; given ε>0, ∣x−x0∣<εx0 makes this difference less than ε. At x0=0, for each ε>0, 0≤x<ε2 implies x<ε2=ε, so it is continuous there as well. The map u↦u+ is nondecreasing and continuous, since ∣u+−v+∣≤∣u−v∣ by its sign cases. Thus ax−2L and its positive part are continuous, and [F15] makes the final composition defining f continuous. The positive part is nonnegative and nondecreasing; for 0≤u≤v, v2−u2=(v−u)(v+u)≥0, so squaring preserves that order. Hence the exponent is nonincreasing, and [F14] makes f nonincreasing; its exponent is nonpositive, so positivity, monotonicity and exp⁡(0)=1 give 0<f≤1. The continuous function f is integrable on [0,n−1] by [F16], and repeated use of [F17] gives ∫0n−1f=∑s=1n−1∫s−1sf. For x∈[s−1,s], f(x)≥f(s); [F6] gives f(s)≤∫s−1sf(x) dx. Hence S:=∑s=1n−1f(s)≤∫0n−1f(x) dx. If ∫0∞f converges, nonnegativity of the tail and [F8] give ∫0n−1f≤∫0∞f. Also S≤n−1.

1.2F1F2F6F7F8F12F13given

Write b=2L>0. The integrands e−y2/2 and ye−y2/2 are continuous on every compact truncation of [0,∞). Evenness in [F1] and the scaling y=2x give ∫0∞e−y2/2 dy=π/2 by [F2], with convergence inherited from the Gaussian integral. The primitive −e−y2/2 gives ∫0∞ye−y2/2 dy=1 by [F6] and [F7]; the endpoint limit follows from [F13]. The substitutions are increasing smooth surjections on the half-lines, with continuous derivatives and continuous integrands on every compact truncation, so all hypotheses of [F2] hold and these two improper integrals converge separately.

1.3F5F6F12algebra

The integrand x4(1−x)4/(1+x2) is continuous on [0,1], since 1+x2>0 there. Polynomial division gives x4(1−x)41+x2=x6−4x5+5x4−4x2+4−41+x2. Integrating on [0,1] using [F5] and [F6] yields ∫01x4(1−x)41+x2 dx=17−23+1−43+4−π=227−π>0. The strict positivity follows because the integrand is nonnegative and on [1/4,3/4] is at least 1/(2⋅48)>0. Thus π<22/7.

2.1F2F3F8F9step 1.2algebra

On [0,b2/a2], f=1. On the remaining half-line use x=(y+b)2/a2, whose derivative 2(y+b)/a2 is positive and continuous and whose image is exactly [b2/a2,∞). Proper substitution applies on compact truncations by [F3], so [F2], [F8], and step 1.2 give ∫0∞f(x) dx=b2a2+2a2∫0∞(y+b)e−y2/2 dy=4L+2+8πLa2. This proves finiteness and justifies step 1.1.

2.2F3F4F6F12step 1.3algebra

Put z=(u−1)/(u+1) for u>1, so 0<z<1 and 1/(1−t2) is continuous on [0,z]. The increasing substitution t↦(1+t)/(1−t) on [0,z] has continuous derivative and takes that interval onto [1,u]. Hence [F3] and [F4] give log⁡u=2∫0zdt/(1−t2). For every integer q≥0, the finite geometric identity gives 1/(1−t2)≥∑j=0qt2j on this interval. Integrating this polynomial by [F6] proves log⁡u≥2∑j=0qz2j+12j+1. At u=2,q=1, u=3,q=2, and u=5,q=2, respectively, this yields log⁡2≥5681,log⁡3≥263240,log⁡5≥19241215>117>π2.

3.1F4step 2.2algebra

By [F4] and step 2.2, log⁡12=2log⁡2+log⁡3≥160616480>9940,log⁡11>log⁡10=log⁡2+log⁡5≥27641215>94. All comparisons follow by multiplying positive integer denominators; no decimal approximation is used.

4.1F6F9step 1.1step 2.1step 1.3step 3.1algebra

Define D(L)=2+8πL−4L. If n≥12, step 3.1 gives L>99/40. At L0=99/40, (4L0−2)2=6241100>82279940>8πL0, so D(L0)<0. For L2>L1≥L0>1, the difference of 4L−2−8πL at these two values equals (L2−L1)(4(L2+L1)−8π)>0, since π<22/7<8. Thus D(L)≤0 here. Steps 1.1 and 2.1 give S≤8L/a2, the asserted stronger bound.

4.2F4F6F9F10F12step 2.2step 3.1algebra

Suppose 5≤n≤11. Step 2.2 gives L>π/2, whence 8πL≤4L and D(L)≤2. For g(x)=4log⁡x−x+2, the derivative g′(x)=4/x−1 is continuous and negative on [5,11], so g is decreasing there. Step 3.1 gives g(11)>0, hence g(n)≥g(11)>0 and therefore n−2≤4L.

5.1givenstep 1.1step 2.1step 4.1step 4.2casesalgebra∎

If D(L)≤0, steps 1.1 and 2.1 already give S≤8L/a2. If D(L)>0 and a2≥D(L), those steps give S≤(8L+D(L))/a2≤8L/a2+1. If 0<a2<D(L)≤2, step 4.2 gives (n−2)a2≤(n−2)D(L)≤2(n−2)≤8L, so S≤n−1≤1+8L/a2. These cases exhaust 5≤n≤11 and prove the Statement together with step 4.1.

Depends on

Used by

Dependency tree · two levels

117 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