Alphabeta Math
Pipeline-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.

✓ 5 results · all verified · 5 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full by a delegated reviewing agent on the owner's instruction; the judge is an additional, independent cross-model AI review of the proofs; all 5 also cleared it.

Nonlinear Tikhonov existence and stability

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Weakly closed nonlinear forward maps on Hilbert spaces

Definition

Let X and Y be real Hilbert spaces, let D⊆X be nonempty, and let F:D→Y be a forward map. The domain D is weakly closed when it is closed in the weak topology σ(X,X∗), the coarsest topology making every bounded real-linear functional on X continuous. The graph of F is sequentially weak-to-weak closed when, for every sequence (xn) in D and every x∈X and z∈Y, the conditions xn⇀x and F(xn)⇀z imply x∈D and F(x)=z; here weak convergence means convergence under every bounded real-linear functional on the corresponding Hilbert space. We call F a weakly closed forward map when its domain is weakly closed and its graph is sequentially weak-to-weak closed. No linearity, norm continuity, Fréchet differentiability, or convexity is assumed; linear maps are allowed as special cases.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

The nonlinear Tikhonov functional

Definition

Let X and Y be real Hilbert spaces, let D⊆X be a nonempty domain, and let F:D→Y be a forward map. For a regularization parameter α>0, reference element x0∈X, and datum y∈Y, the nonlinear Tikhonov functional is the map Jα,y,x0:D→[0,∞) defined by

Jα,y,x0(x):=12∥F(x)−y∥Y2+α2∥x−x0∥X2(x∈D).

A global minimizer is a point xα∈D such that Jα,y,x0(xα)≤Jα,y,x0(x) for every x∈D. This definition asserts neither existence nor uniqueness.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

x0-minimum-norm solutions on weakly closed domains

Definition

Let X,Y be real Hilbert spaces, let D⊆X be nonempty and weakly closed, meaning closed in the coarsest topology making every bounded real-linear functional continuous, and let F:D→Y satisfy this graph condition: whenever xn∈D, xn⇀x, and F(xn)⇀z, one has x∈D and F(x)=z; weak convergence means convergence under every bounded real-linear functional. For x0∈X and y∈Y, a point x†∈D is an x0-minimum-norm solution of F(x)=y when F(x†)=y and

∥x†−x0∥X≤∥x−x0∥Xfor every x∈D with F(x)=y.

This definition asserts neither existence nor uniqueness. The minimum is global over the exact solution set in D and uses distance from the specified reference point x0.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

The exact solution set of a weakly closed map is weakly sequentially closed

Statement

Let X,Y be real Hilbert spaces, let D⊆X be nonempty and weakly closed, meaning closed in the coarsest topology making every bounded real-linear functional continuous, and let F:D→Y satisfy this graph condition: whenever xn∈D, xn⇀x, and F(xn)⇀z, one has x∈D and F(x)=z. Weak convergence means convergence under every bounded real-linear functional. For y∈Y, the exact solution set SF(y):={x∈D:F(x)=y} is weakly sequentially closed in X: every sequence in SF(y) that converges weakly to x has x∈SF(y).

Facts & Assumptions

Given: Real Hilbert spaces X,Y, a weakly closed forward map F:D→Y, a datum y∈Y, a sequence (xn) in SF(y), and xn⇀x.

[F1]

Sequential weak-to-weak graph closure means that xn∈D, xn⇀x, and F(xn)⇀z imply x∈D and F(x)=z (Weakly closed nonlinear forward maps on Hilbert spaces).

[F2]

Weak convergence is convergence in the weak topology; in particular, a constant sequence with value y converges weakly to y (Weak convergence of nets and sequences).

Proof

1.1givenF2

Since xn∈SF(y), each xn lies in D and F(xn)=y. Thus (F(xn)) is the constant sequence at y, so it converges weakly to y by [F2].

2.1givenF1step 1.1∎

Apply [F1] to xn⇀x and F(xn)⇀y. It follows that x∈D and F(x)=y, hence x∈SF(y). This is the asserted sequential weak closedness.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Existence of a global nonlinear Tikhonov minimizer

Statement

Assume the ultrafilter lemma, dependent choice, and the real Hahn–Banach dominated-extension principle. Let X,Y be real Hilbert spaces, let D⊆X be nonempty and weakly closed, and let F:D→Y be a map such that for every sequence (xn) in D and every x∈X,z∈Y, xn⇀x and F(xn)⇀z imply x∈D and F(x)=z. Here D is closed in the coarsest topology making every bounded real-linear functional continuous, and weak convergence means convergence under every such functional. For any α>0, x0∈X, and y∈Y, the nonlinear Tikhonov functional

Jα,y,x0(x)=12∥F(x)−y∥Y2+α2∥x−x0∥X2(x∈D)

attains a global minimum on D; that is, there exists xα∈D such that Jα,y,x0(xα)≤Jα,y,x0(x) for every x∈D. No exact solution of F(x)=y is required.

Facts & Assumptions

Given: The ultrafilter lemma, dependent choice, and HB; real Hilbert spaces X,Y; a nonempty weakly closed domain D⊆X; a map F:D→Y with sequentially weak-to-weak closed graph; α>0, x0∈X, and y∈Y.

[A1]

The ultrafilter lemma says every filter on a set extends to an ultrafilter (The ultrafilter extension principle (UL/BPI)).

[A2]

Dependent choice supplies an infinite sequence following any everywhere-extendible relation (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[A3]

HB is the real dominated-extension principle for linear functionals (The real dominated-extension principle as an additional hypothesis over ZF).

[F1]

DC implies countable choice, the principle that every countable family of nonempty sets admits a choice function (Dependent choice implies countable choice, The Axiom of Countable Choice (ACω)).

[F2]

Under countable choice, every complete real inner-product space is reflexive (Hilbert spaces are reflexive by Riesz representation).

[F3]

Under the ultrafilter lemma, DC, and HB, every bounded sequence in a real reflexive Banach space has a weakly convergent subsequence (A bounded sequence in a reflexive Banach space has a weakly convergent subsequence).

[F4]

Under HB, weak convergence implies lower semicontinuity of the norm (Weak convergence implies lower semicontinuity of the norm).

[F5]

Every nonempty real set bounded below has an infimum, and if m=inf⁡S, then for every ε>0 some s∈S satisfies s<m+ε (Greatest lower bound (infimum), Every nonempty set bounded below has an infimum, Epsilon characterisation of the infimum).

[F6]

The objective is the finite nonnegative sum Jα,y,x0(x)=12∥F(x)−y∥Y2+α2∥x−x0∥X2 on D (The nonlinear Tikhonov functional).

[F7]

Sequential graph closure identifies a joint weak limit: if xn∈D, xn⇀x, and F(xn)⇀z, then x∈D and F(x)=z (Weakly closed nonlinear forward maps on Hilbert spaces).

Proof

1.1givenF5

Let m:=inf⁡{Jα,y,x0(x):x∈D}. The set of objective values is nonempty because D≠∅, is bounded below by 0, and contains a finite value. Thus m is a finite real number by [F5].

2.1A2F1F5step 1.1choose

For each n≥1, [F5] gives xn∈D with m≤Jα,y,x0(xn)<m+1/n. Since DC implies countable choice by [F1], choose these points as a sequence; then Jα,y,x0(xn)→m.

3.1givenF6step 2.1algebra

The sequence of objective values is bounded above, say by M>0. Nonnegativity of both summands in [F6] and α>0 give ∥F(xn)−y∥Y2≤2M and ∥xn−x0∥X2≤2M/α. The triangle inequality then bounds (xn), and the first estimate together with fixed y bounds (F(xn)).

4.1A1A2A3F1F2F3step 3.1construct

By [F2], X and Y are real reflexive Banach spaces: they are complete inner-product spaces, and DC supplies the countable choice assumed in [F2] by [F1]. Apply [F3] to the bounded sequence (xn) to obtain a subsequence xnk⇀x; apply [F3] in Y to the bounded sequence (F(xnk)) and pass to a further subsequence so that F(xnk)⇀z. The further subsequence still has xnk⇀x.

5.1F7step 4.1

By [F7], x∈D and F(x)=z. Subtracting the fixed vector y preserves weak convergence, so F(xnk)−y⇀F(x)−y, while xnk−x0⇀x−x0.

6.1A3F4F5F6step 2.1step 5.1algebra∎

Apply [F4] to the two weakly convergent sequences in step 5.1. The maps r↦r2/2 and r↦αr2/2 are increasing and continuous on [0,∞), so each squared-norm term is lower semicontinuous. If their limit values are a:=12∥F(x)−y∥Y2 and b:=α2∥x−x0∥X2, then for every ε>0 each sequence term is eventually at least its limit value minus ε/2; taking the larger of the two eventual indices gives Jα,y,x0(xnk)≥a+b−ε. Thus Jα,y,x0(x)≤lim inf⁡kJα,y,x0(xnk)=m. Since x∈D, the definition of m gives m≤Jα,y,x0(x), so equality holds and x is a global minimizer.

Remarks

The theorem guarantees global minimizers, not uniqueness. The sequential weak-to-weak graph condition is needed to identify the weak limit of the data sequence; weak-to-strong closedness alone would not identify a merely weak data limit. The direct method makes no claim that a numerical algorithm finds a global minimizer; nonlinear objectives may also have local minima.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Existence of an x0-minimum-norm exact solution

Statement

Assume the ultrafilter lemma, dependent choice, and HB. Let X,Y be real Hilbert spaces, let D⊆X be nonempty and weakly closed in the coarsest topology making every bounded real-linear functional continuous, and let F:D→Y satisfy: for every sequence xn∈D and x∈X,z∈Y, if xn⇀x and F(xn)⇀z, then x∈D and F(x)=z; weak convergence means convergence under every bounded real-linear functional. If SF(y):={x∈D:F(x)=y} is nonempty for some y∈Y, then for every x0∈X there exists x†∈SF(y) such that ∥x†−x0∥X≤∥x−x0∥X for every x∈SF(y).

Facts & Assumptions

Given: The ultrafilter lemma, DC, and HB; real Hilbert spaces X,Y; a weakly closed forward map F:D→Y; a nonempty exact solution set SF(y); and x0∈X.

[A1]

The ultrafilter lemma says every filter on a set extends to an ultrafilter (The ultrafilter extension principle (UL/BPI)).

[A2]

DC supplies an infinite sequence following any everywhere-extendible relation (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[A3]
[F1]

The exact solution set SF(y) is weakly sequentially closed (The exact solution set of a weakly closed map is weakly sequentially closed).

[F2]

DC implies countable choice, the principle that every countable family of nonempty sets admits a choice function (Dependent choice implies countable choice, The Axiom of Countable Choice (ACω)); every complete real inner-product space is reflexive under that principle (Hilbert spaces are reflexive by Riesz representation).

[F3]

On a nonempty weakly sequentially closed subset of a real reflexive Banach space, a proper coercive weakly sequentially lower-semicontinuous functional attains its infimum under the ultrafilter lemma, DC, and HB (The direct method in a reflexive Banach space).

[F4]

Under HB, weak convergence implies lower semicontinuity of the norm (Weak convergence implies lower semicontinuity of the norm).

[F5]

An extended-real functional on a nonempty admissible set is proper when it is finite somewhere; coercivity is equivalent to bounded sublevel sets; weak sequential lower semicontinuity is the liminf inequality along weakly convergent sequences (Proper, coercive and weakly lower semicontinuous extended-real functionals).

[F6]

An x0-minimum-norm solution is an exact solution whose distance to x0 is no greater than that of any other exact solution in D (x0-minimum-norm solutions on weakly closed domains).

Proof

Given: The assumptions above.

1.1givenF1F5construct

Let S:=SF(y). It is nonempty by hypothesis and weakly sequentially closed by [F1]. Define I:S→(−∞,+∞] by I(x):=12∥x−x0∥X2. This is finite everywhere on S, so it is proper. Its sublevel set {x∈S:I(x)≤Λ} is empty for Λ<0 and, for Λ≥0, satisfies ∥x∥X≤∥x0∥X+2Λ by the triangle inequality. Hence I is coercive on S.

2.1A3F4F5step 1.1algebra

If xn∈S and xn⇀x∈S, then xn−x0⇀x−x0. By [F4], ∥x−x0∥X≤lim inf⁡n∥xn−x0∥X; since norms are nonnegative and squaring is increasing and continuous there, I(x)≤lim inf⁡nI(xn). Thus I is weakly sequentially lower semicontinuous on S.

3.1A1A2A3F2F3step 1.1step 2.1construct

By [F2], countable choice follows from the assumed DC, so the real Hilbert space X is reflexive; it is Banach by completeness in the Hilbert-space definition. The nonempty set S is weakly sequentially closed by step 1.1, and I is proper, coercive, and weakly sequentially lower semicontinuous by steps 1.1 and 2.1. Apply [F3], whose choice assumptions are exactly [A1], [A2], and [A3], to obtain x†∈S minimizing I on S.

4.1F6step 3.1algebra∎

Since I(x)=12∥x−x0∥X2 and the square function is increasing on nonnegative reals, minimizing I on S is equivalent to minimizing ∥x−x0∥X. Thus x† satisfies [F6] and is an x0-minimum-norm exact solution.

Remarks

The theorem gives existence, not uniqueness: a nonlinear exact solution set need not have a unique point at minimum distance from x0. The use of DC also supplies the countable choice assumed by the Hilbert reflexivity supplier; no full axiom of choice is used.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Weak-cluster stability for fixed-parameter nonlinear Tikhonov regularization

Statement

Assume the ultrafilter lemma, dependent choice, and HB. Let X,Y be real Hilbert spaces, let D⊆X be nonempty and weakly closed in the coarsest topology making every bounded real-linear functional continuous, and let F:D→Y satisfy: whenever xn∈D, xn⇀x, and F(xn)⇀z, one has x∈D and F(x)=z; weak convergence means convergence under every bounded real-linear functional. Fix α>0, x0∈X, and y∈Y, and let data yn∈Y satisfy ∥yn−y∥Y→0. There exists a sequence (xn) of global minimizers of Jα,yn,x0 on D. Every such sequence has a subsequence xnk with xnk⇀x, and every such weak limit x minimizes Jα,y,x0 on D. No uniqueness of the limiting minimizer is asserted.

Facts & Assumptions

Given: The ultrafilter lemma, DC, and HB; a weakly closed forward map F:D→Y between real Hilbert spaces; α>0, x0∈X; and data yn→y in norm.

[A1]

The ultrafilter lemma says every filter extends to an ultrafilter (The ultrafilter extension principle (UL/BPI)).

[A2]

DC supplies an infinite sequence following an everywhere-extendible relation (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[A3]
[F1]

For each datum in a real Hilbert space and each positive parameter, the Tikhonov functional has a global minimizer under the stated weak-closedness and axiom hypotheses (Existence of a global nonlinear Tikhonov minimizer).

[F2]

DC implies countable choice, the principle that every countable family of nonempty sets admits a choice function (Dependent choice implies countable choice, The Axiom of Countable Choice (ACω)).

[F3]

Under countable choice, real Hilbert spaces are reflexive (Hilbert spaces are reflexive by Riesz representation).

[F4]

Under the ultrafilter lemma, DC, and HB, bounded sequences in real reflexive Banach spaces have weakly convergent subsequences (A bounded sequence in a reflexive Banach space has a weakly convergent subsequence).

[F5]

Under HB, weak convergence implies lower semicontinuity of the norm (Weak convergence implies lower semicontinuity of the norm).

[F6]

The graph condition says xn∈D, xn⇀x, and F(xn)⇀z imply x∈D and F(x)=z (Weakly closed nonlinear forward maps on Hilbert spaces).

[F7]

Jα,y,x0(x)=12∥F(x)−y∥Y2+α2∥x−x0∥X2 for x∈D (The nonlinear Tikhonov functional).

Proof

Given: The assumptions above.

1.1A2F1F2choose

For each n, [F1] makes the set Mn of global minimizers of Jα,yn,x0 on D nonempty. Since the family (Mn) is countable and DC implies countable choice by [F2], choose xn∈Mn for every n.

2.1givenF7step 1.1choosealgebra

Fix v∈D, possible because D≠∅. Strong convergence yn→y bounds Jα,yn,x0(v) by some M>0, and minimality gives Jα,yn,x0(xn)≤M. By [F7] and α>0, this bounds ∥xn−x0∥X and ∥F(xn)−yn∥Y; the convergent sequence (yn) is bounded, so both (xn) and (F(xn)) are bounded.

3.1A1A2A3F3F4step 2.1construct

By [F3], [F4], and the bounds in step 2.1, pass to a subsequence with xnk⇀x and then a further subsequence with F(xnk)⇀z. The further subsequence still converges weakly to x.

4.1F6step 3.1

By [F6], x∈D and F(x)=z. Since ynk→y strongly, F(xnk)−ynk⇀F(x)−y, and xnk−x0⇀x−x0.

5.1A3F5F7step 3.1step 4.1algebra∎

By [F5], each norm in [F7] is weakly lower semicontinuous; composition with the increasing continuous square function on nonnegative reals preserves this property. For any ε>0, the two summand sequences are eventually at least their respective limit values minus ε/2, so their sum is eventually at least Jα,y,x0(x)−ε. Thus Jα,y,x0(x)≤lim inf⁡kJα,ynk,x0(xnk). For any w∈D, minimality gives Jα,ynk,x0(xnk)≤Jα,ynk,x0(w), and the right side converges to Jα,y,x0(w) because F(w) is fixed and ynk→y. Hence Jα,y,x0(x)≤lim inf⁡kJα,ynk,x0(xnk)≤lim sup⁡kJα,ynk,x0(xnk)≤Jα,y,x0(w). This holds for every w∈D, so x is a global minimizer. Applying the same argument to any weakly convergent subsequence proves the claim for every weak cluster point.

Remarks

The conclusion is weak-cluster stability at fixed positive α. Nonlinearity can prevent uniqueness, so the theorem does not assert convergence of the full sequence or strong convergence.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Vanishing-noise convergence to an x0-minimum-norm exact solution

Statement

Assume the ultrafilter lemma, dependent choice, and HB. Let X,Y be real Hilbert spaces, let D⊆X be nonempty and weakly closed in the coarsest topology making every bounded real-linear functional continuous, and let F:D→Y satisfy: whenever xn∈D, xn⇀x, and F(xn)⇀z, one has x∈D and F(x)=z; weak convergence means convergence under every bounded real-linear functional. Fix x0∈X and suppose SF(y†):={x∈D:F(x)=y†} is nonempty. Let δn≥0, δn→0, αn>0, αn→0, and δn2/αn→0, and let yn∈Y satisfy ∥yn−y†∥Y≤δn. There exists a sequence (xn) of global minimizers of Jαn,yn,x0 on D; every such sequence has a subsequence xnk⇀x, and every such weak limit x is an x0-minimum-norm solution of F(x)=y† on D. No uniqueness or full-sequence convergence is asserted.

Facts & Assumptions

Given: The ultrafilter lemma, DC, and HB; a weakly closed forward map F:D→Y between real Hilbert spaces; x0∈X; a nonempty exact solution set for y†; and sequences δn,αn,yn satisfying the stated noise and parameter conditions.

[A1]

The ultrafilter lemma extends every filter to an ultrafilter (The ultrafilter extension principle (UL/BPI)).

[A3]
[F1]

DC implies countable choice, the principle that every countable family of nonempty sets admits a choice function (Dependent choice implies countable choice, The Axiom of Countable Choice (ACω)).

[F2]

Under countable choice, real Hilbert spaces are reflexive (Hilbert spaces are reflexive by Riesz representation).

[F3]

Under the ultrafilter lemma, DC, and HB, bounded sequences in real reflexive Banach spaces have weakly convergent subsequences (A bounded sequence in a reflexive Banach space has a weakly convergent subsequence).

[F4]

The exact solution set contains an x0-minimum-norm solution under these hypotheses (Existence of an x0-minimum-norm exact solution).

[F5]

For each αn>0 and yn∈Y, the Tikhonov functional has a global minimizer under these hypotheses (Existence of a global nonlinear Tikhonov minimizer).

[F6]

Under HB, weak convergence implies lower semicontinuity of the norm (Weak convergence implies lower semicontinuity of the norm).

[F7]

A sequentially weak-to-weak closed graph maps weak limits (xn,F(xn))⇀(x,z) to x∈D and F(x)=z (Weakly closed nonlinear forward maps on Hilbert spaces).

[F8]

Jα,y,x0(x)=12∥F(x)−y∥Y2+α2∥x−x0∥X2 (The nonlinear Tikhonov functional).

[F9]

An x0-minimum-norm solution is an exact solution with least distance to x0 among all exact solutions in D (x0-minimum-norm solutions on weakly closed domains).

Proof

Given: The assumptions above.

1.1A2F1F4F5choose

By [F4], choose an x0-minimum-norm exact solution x^∈D and put R:=∥x^−x0∥X. For each n, [F5] makes the set of global minimizers of Jαn,yn,x0 nonempty; by [F1] and the assumed DC, choose one xn from each set.

2.1givenF5F8step 1.1algebra

Minimality, [F8], exactness of x^, and ∥yn−y†∥Y≤δn give 12∥F(xn)−yn∥Y2+αn2∥xn−x0∥X2≤Jαn,yn,x0(x^)≤δn22+αn2R2. Consequently ∥xn−x0∥X2≤δn2/αn+R2, so (xn) is bounded, and ∥F(xn)−yn∥Y2≤δn2+αnR2→0.

3.1A1A2A3F2F3F7step 2.1constructalgebra

By [F2] and [F3], a subsequence satisfies xnk⇀x∈X. The triangle inequality and step 2.1 give ∥F(xnk)−y†∥Y≤∥F(xnk)−ynk∥Y+δnk≤δnk2+αnkR2+δnk→0. Thus F(xnk)→y† strongly, hence weakly. Applying [F7] gives x∈D and F(x)=y†.

4.1A3F6F9step 1.1step 2.1step 3.1algebra∎

By [F6], ∥x−x0∥X2≤lim inf⁡k∥xnk−x0∥X2. The bound in step 2.1 gives lim sup⁡k∥xnk−x0∥X2≤lim⁡k(δnk2/αnk+R2)=R2, so ∥x−x0∥X2≤lim inf⁡k∥xnk−x0∥X2≤lim sup⁡k∥xnk−x0∥X2≤R2. Since x is an exact solution and x^ minimizes distance among exact solutions by [F9], R2≤∥x−x0∥X2; equality follows, so x is an x0-minimum-norm exact solution. The same reasoning applies to any weakly convergent subsequence.

Remarks

The fixed-positive-α stability theorem concerns minimizers of one limiting functional. This vanishing-noise theorem has the separate assumptions of exact solvability, αn→0, and δn2/αn→0. It identifies weak cluster points as minimum-norm exact solutions but does not assert a unique limit.

4 · Examples, counterexamples and false statements

None yet.

Sources