Alphabeta Math
AlgorithmAlgorithm: AI-adaptedProof: Not applicablePipeline-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.

Unanchored Levenberg–Marquardt step with explicit early stopping

Definition

Assume Countable Choice, as required for the Hilbert-space adjoints in the normal equation.

Let X,Y be Hilbert spaces over the same field F∈{R,C}, let U⊆X be open, and let F:U→Y be continuously Fréchet differentiable over F. In the complex case, each F′(x) is a bounded complex-linear operator and the Fréchet remainder is measured over complex increments, so lim⁡h→0, h≠0x+h∈U∥F(x+h)−F(x)−F′(x)h∥∥h∥=0. Inputs are x0∈U, noisy data yδ∈Y, a bound δ≥0, a discrepancy factor τ>1, a finite budget N∈N, and parameters α0>0 and q∈(0,1). The output is a tuple (xk,k,status). Starting with k=0, repeat the following checks and update. If xk∉U return (xk,k,domain-failure). Otherwise put Ak=F′(xk) and αk=α0qk. Before computing an update, if ∥F(xk)−yδ∥≤τδ, return (xk,k,discrepancy). If k=N, return (xk,k,budget-exhausted).

For k<N, solve the unique Hilbert-space Tikhonov normal equation (Ak∗Ak+αkIX)sk=Ak∗(yδ−F(xk)) and set xk+1=xk+sk, then replace k by k+1 and repeat the checks. The shifted normal operator is invertible by The shifted Hilbert-space normal operator is invertible with inverse norm at most 1/λ. If the new iterate leaves U, the next check returns domain-failure. The procedure asserts no convergence theorem; its prescribed step is the unanchored Levenberg–Marquardt form used in the assigned contract.

Depends on

Used by

Dependency tree · two levels

42 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