Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generated
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 biased SGD direction can fail positive alignment

Example

For comparison with the expected-average stationarity theorem, assume AC. Let Ω={ω}, F={∅,Ω}, P(∅)=0, P(Ω)=1, and Ft=F for each t. Let f(x)=x2/2 on R, choose x0≠0 and a constant stepsize α>0, and use the deterministic direction Gt=−xt in the SGD update. The recurrence is deterministic and needs no choice principle: xt+1=(1+α)xt, so f(x1)=(1+α)2f(x0)>f(x0). At every iterate, the conditional mean direction is −∇f(xt) and its inner product with the gradient is −xt2<0; consequently no positive alignment constant μ can satisfy the theorem's condition ⟨∇f(xt),E[Gt∣Ft]⟩≥μ∥∇f(xt)∥22.

Example references

Stochastic-gradient-descent procedure: fixes the update used in the example.

Expected-average stationarity theorem: its positive-alignment hypothesis is the condition this direction violates.

Facts & Assumptions

Given: The one-dimensional objective, deterministic initial point and direction, and positive constant stepsize in the Example.

[A1]

The Axiom of Choice: AC is assumed for the conditional-expectation theorem comparison; the deterministic recurrence itself uses no choice.

[F1]

Stochastic gradient descent: the unconstrained update is xt+1=xt−αGt.

[F2]

Expected-average stationarity under aligned stochastic directions: the expected-average theorem requires ⟨∇f(xt),E[Gt∣Ft]⟩≥μ∥∇f(xt)∥22 for a constant μ>0.

[F4]

The principle of mathematical induction: a property true at the initial natural index and inherited by each successor holds at every index.

[F5]

Probability measures and probability spaces and Measures on sigma-algebras: a probability measure has total mass one and is countably additive on disjoint measurable sequences.

Verification

1.1F1F3F5givenalgebra

The singleton measure has total mass one and is countably additive because at most one set in any disjoint sequence can be nonempty [F5]. By [F3], ∇f(x)=x and f(x)=x2/2. The deterministic direction has conditional mean −xt and conditional variance zero on the trivial filtration. For any finite horizon, apply [F1] with ys=xs−1, Hs=−ys=Gs−1 for s≥1, and Hs=F for s≥0. Its positive-time update ys+1=ys−αHs becomes xt+1=xt−α(−xt)=(1+α)xt for t=s−1≥0.

2.1F4step 1.1giveninductionalgebra

The recurrence in step 1.1 and 1+α>0 give xt=(1+α)tx0≠0 for every t≥0 by [F4]. In particular, f(x1)=(1+α)2x02/2>x02/2=f(x0), so this direction can increase the objective in one step.

3.1A1F2step 1.1step 2.1givenalgebra∎

For every t, step 2.1 gives xt≠0, so ∇f(xt) E[Gt∣Ft]=xt(−xt)=−xt2<0, whereas μ∣∇f(xt)∣2=μxt2>0 for every μ>0. Therefore the local positive-alignment hypothesis [F2] fails at every iterate, despite the direction norm equaling the gradient norm and the variance being zero. This comparison invokes the theorem only in its AC branch [A1]; the displayed deterministic calculation does not use AC.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

53 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.