Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (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.

Finite unrolling alone gives no regularization convergence or risk guarantee

Statement

Let N≥1 and let Φθ,N be the point-valued map obtained by an initialization followed by N defined, fixed-parameter update maps on an admissible input (A,y). This finite definition does not imply that the iterates of an underlying infinite recurrence converge: even the repeated scalar update T(x)=2x is defined at every finite depth from x0=1, while Tk(x0)=2k diverges.

For the risk comparison, fix a nonempty Borel input space E⊆Dθ,N for every parameter θ under consideration, and restrict each deployed map to E. For squared reconstruction loss ℓ(t,a)=∥a−t∥22 on the signal space, let S={(Ai,yi,xi†)}i=1s be a nonempty finite training set with (Ai,yi)∈E and xi†∈X, s≥1, and let PS=s−1∑i=1sδ((Ai,yi),xi†) be its empirical joint law. The training-law risk is LS(θ)=RPS(Φθ,N), where RP(g) is the expected loss of the Borel point rule g under the joint input-target law P. At a shifted input (A,y)∈E, the forward residual is ∥AΦθ,N(A,y)−y∥2, and for a test probability law Q on E×X the test risk is RQ(θ)=RQ(Φθ,N) when this expectation is defined. No bound on either quantity follows from a bound on LS alone: for every M>0 there is a one-sample scalar training law with zero training-law risk and a shifted scalar operator with forward residual and squared test risk both greater than M.

For a recurrence zk+1=G(zk,θ), a fixed point at parameter θ is a state z∗(θ) satisfying G(z∗(θ),θ)=z∗(θ). If the initialization and update maps are continuously differentiable in their state and trainable-parameter variables on open neighborhoods of their visited inputs, automatic differentiation through the deployed graph computes the derivative of that finite map. For a piecewise-C1 primitive, assume each visited input lies strictly inside one declared branch, with its branch label fixed on an open neighborhood; at a branch boundary or ambiguous branch selection no derivative is asserted by the automatic-differentiation procedure. The derivative is that of the finite map and is not replaced by the derivative of a limiting fixed point. In particular, for G(z,θ)=qz+(1−q)θ with 0<q<1, z0(θ)=0, and θ0=0, each finite iterate has zero fixed-point residual while its parameter derivative differs from the exact fixed-point derivative.

Facts & Assumptions

Given: A depth-N architecture with all N updates defined at the selected input; for the derivative clause, a continuously differentiable initialization and recurrence in state and parameter variables on open neighborhoods and a finite number K of defined iterates, with each piecewise-C1 primitive evaluated strictly inside one declared branch whose label is fixed on an open neighborhood of every visited input; for the risk clause, a common nonempty Borel input space E⊆Dθ,N for every compared parameter, training inputs in E with signal targets in X, shifted inputs in E, and test laws on E×X.

[F1]

Unrolled regularization architecture: the deployed map is the finite composition of its initialization and the listed update maps.

[F2]

Differentiate a finite fixed-point iteration as a finite composed map: the procedure differentiates the specified finite K-step map and does not substitute the derivative of an exact fixed point.

[F3]

Learned inverse estimators and reconstruction targets: a finite unrolled learned update has a Borel initialization, Borel layer maps, and point-valued output; a point reconstruction rule is Borel.

[F4]

Inverse reconstruction risk under train and test laws: a point rule's risk under a joint input-target law is the extended nonnegative loss integral, and distinct train and test laws impose no inequality between risks.

[F5]

A continuous map has Borel preimages of Borel sets: a continuous map between topological spaces has Borel preimages of Borel sets.

[F6]

Forward mode computes the exact directional derivative of the real-arithmetic graph: forward mode returns the directional derivative of the finite scalar-output graph on a fixed strict branch.

Proof

1.1F1F3givenalgebra

Fix an admissible (A,y). By the definition of the update maps, x1=Uθ0A,y(Iθ(A,y)). If xk=Uθk−1A,y∘⋯∘Uθ0A,y(Iθ(A,y)), then applying the next defined update gives xk+1=UθkA,y∘Uθk−1A,y∘⋯∘Uθ0A,y(Iθ(A,y)). Induction through k=N−1 yields the stated finite composition. Its Borel point-rule convention is the interface in [F3].

1.2givenconstructalgebra

For the repeated scalar update T(x)=2x, induction gives T0(1)=1 and Tk+1(1)=2Tk(1)=2k+1 whenever Tk(1)=2k. Thus every finite prefix is defined, but Tk(1)=2k→+∞ as k→∞. Finite evaluability alone therefore does not imply convergence of an infinite continuation.

1.3F2F6given

Under the differentiability and strict-branch assumptions in the Given clause, [F2] forms, for each output coordinate, the finite graph of the K-step recurrence and calls forward mode in each parameter-coordinate direction. By [F6], every returned tangent is the corresponding directional derivative of that finite scalar-output graph. Assembling these entries gives the Jacobian of the finite recurrence, not the derivative of a limiting fixed point.

1.4givenalgebra

To check the zero-residual boundary, fix q∈(0,1) and set G(z,θ)=qz+(1−q)θ, θ0=0, and z0(θ)=0. At θ0, the recurrence gives zk=0 for every finite k, so the fixed-point residual zk−G(zk,θ0) is zero. The exact fixed point satisfies z∗(θ)=θ, and therefore dz∗dθ(0)=1.

1.5F1givenconstructalgebra

Use the scalar architecture with declared domain containing (A,y)=(1,1) and every (t,t) for t>1, zero initialization, identity update block, and one layer parameter τ0=θ. Choose the deployed parameter θ=1. Its one-layer formula is Φ1,1(a,y)=ay, so Φ1,1(1,1)=1.

2.1F3F4F5givenstep 1.5algebra

The map (a,y)↦ay is continuous and hence Borel by [F5], so it is a point reconstruction rule by [F3]. On the singleton training law PS=δ((1,1),1), [F4] gives LS(1)=RPS(Φ1,1)=∣1−1∣2=0.

2.2step 1.4algebra

Differentiating the finite recurrence gives e0=0 and ek+1=qek+(1−q). Induction yields eK=1−qK for each K≥1. Since 0<qK<1, eK≠1 although the finite residual in step 1.4 is zero. Thus even contraction and zero finite residual do not identify the finite-map derivative with the fixed-point derivative.

3.1F4step 1.5step 2.1algebra∎

For any shifted scalar operator A=t>1 with y=t and x†=1, the same learned parameter gives Φ1,1(t,t)=t2. Its forward residual is ∣tΦ1,1(t,t)−t∣=t(t2−1), and [F4] gives squared risk (t2−1)2 under the test law Qt=δ((t,t),1). Both tend to +∞ as t→+∞, while the training-law risk from step 2.1 remains zero. Given any M>0, choosing t sufficiently large makes both quantities exceed M, proving the claimed absence of a uniform residual or test-risk bound from training risk alone.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

28 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