Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 ridge estimate lies in a time-uniform linear confidence ellipsoid

Statement

Assume AC and Countable Choice and the finite-dimensional linear contextual bandit model. For δ∈(0,1) and 1≤t≤n, set

ρt=λ m2+2log⁡(1/δ)+log⁡ ⁣(det⁡Vt−1λd),Ct={θ∈Rd:∥θ−θ^t−1∥Vt−12≤ρt2}.

Then

P{θ∗∈Ct for every 1≤t≤n}≥1−δ.

Facts & Assumptions

Given: AC, Countable Choice, the model's deterministic θ∗ with ∥θ∗∥2≤m2, predictable feature vectors, reward equation, and conditional MGF bound.

[A1]

The Axiom of Choice: conditional-expectation versions exist under the supplied AC branch; the optional-sampling interface assumes AC.

[A2]

The Axiom of Countable Choice (ACω): the Gaussian-integral supplier assumes Countable Choice.

[F1]

Finite-dimensional linear contextual bandit model: Xt=⟨θ∗,At⟩+ηt, bt=∑s≤tAsXs, Vt=λI+∑s≤tAsAsT, and ∥θ∗∥2≤m2.

[F2]

The ridge information matrix is positive definite and invertible: each Vt is symmetric positive definite, det⁡(Vt)≥λd>0, and xTVt−1x≤λ−1∥x∥22.

[F3]

The conditional Gaussian mixture is a nonnegative supermartingale: Zs=det⁡(V0)/det⁡(Vs)exp⁡(12SsTVs−1Ss) is a nonnegative integrable supermartingale with Z0=1.

[F4]

Optional sampling for bounded stopping times: for an integrable supermartingale and stopping times σ≤τ bounded by a deterministic integer, E[Zτ]≤E[Zσ].

[F5]

Markov's inequality for random variables: if Y≥0 and a>0, then P(Y≥a)≤E[Y]/a.

[F7]
[F8]

The ridge estimates and self-normalized sums are measurable: Vt, det⁡(Vt), bt, and θ^t are measurable through time t+1, so the confidence-ellipsoid events and radii are measurable.

[F10]

Arithmetic and lattice operations preserve measurability whenever they are defined: finite sums and products of real-valued measurable functions are measurable.

[F11]

Sigma-algebras: a sigma-algebra is closed under complements and countable unions, so finite intersections follow by De Morgan's law.

Proof

1.1F1F3F7construct

Since V0=λId is diagonal, [F7] gives det⁡V0=λd>0. On Hs=Fs+1, define σ as the first s∈{0,…,n} with Zs≥1/δ, and set σ=n if there is no such s. For k<n, {σ≤k}=⋃s=0k{Zs≥1/δ}∈Hk, while {σ≤n}=Ω. Hence σ is a stopping time bounded by n.

1.2F1algebra

For each 0≤s<n, the model reward equation gives bs=Gsθ∗+Ss=(Vs−λId)θ∗+Ss. Therefore θ^s−θ∗=Vs−1Ss−λVs−1θ∗.

1.3F1F2F6algebra

For fixed s, define ⟨x,y⟩Vs=xTVsy. By [F2] this form is symmetric and positive definite, so [F6] gives its induced norm triangle inequality. Also ∥Vs−1Ss∥Vs2=SsTVs−1Ss and ∥λVs−1θ∗∥Vs2=λ2(θ∗)TVs−1θ∗≤λ∥θ∗∥22≤λm22.

2.1step 1.1A1A2F3F4F5algebra

By [F4], E[Zσ]≤E[Z0]=1. On the event that some Zs crosses 1/δ by time n, the definition of σ gives Zσ≥1/δ. Thus [F5] yields P{∃s≤n:Zs≥1/δ}≤δ.

3.1step 1.1step 2.1F2F3F9algebra

Outside the crossing event bounded in step 2.1, every 0≤s≤n has Zs<1/δ. Taking logarithms in [F3]'s formula and using det⁡V0=λd from step 1.1 gives SsTVs−1Ss<2log⁡(1/δ)+log⁡ ⁣(det⁡Vsλd). All logarithm arguments are positive by [F2].

4.1step 3.1step 1.2step 1.3F1F2F8F9F10F11algebra∎

Apply the triangle inequality from step 1.3 to step 1.2, then use step 3.1. For t=s+1 this yields ∥θ^t−1−θ∗∥Vt−1≤St−1TVt−1−1St−1+λm2≤ρt. The radius ρt is measurable: its determinant input is measurable by [F8], the logarithm is continuous by [F9], and x↦x is continuous on [0,∞) since ∣x−y∣2≤∣x−y∣ there; the radicand is nonnegative by [F2] and δ∈(0,1). By [F8] and [F10], the quadratic form defining Ct is measurable. The finite intersection of these events is measurable by [F11], so {θ∗∈Ct for every 1≤t≤n} is measurable. Its probability is at least 1−δ by step 2.1.

Depends on

Used by

Dependency tree · two levels

85 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