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.

Compact linear inverse maps and the Picard criterion

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

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

Hilbert-space Moore–Penrose inverse

Definition

Assume the Axiom of Countable Choice. Let X and Y be real or complex Hilbert spaces over the same scalar field, and let K:X→Y be a bounded linear operator. Write R(K):={Kx:x∈X} for its range, N(K):={x∈X:Kx=0} for its kernel, and M⊥:={z:⟨z,m⟩=0 for every m∈M} for the orthogonal complement of a subspace M. The kernel N(K) is closed, so the restriction K~:=K∣N(K)⊥:N(K)⊥→R(K) is a linear bijection. Define the Hilbert-space Moore–Penrose inverse K† to have domain D(K†):=R(K)⊕R(K)⊥ and, for the unique decomposition y=r+z with r∈R(K) and z∈R(K)⊥, set K†y:=K~−1r. Thus K†y is the unique minimum-norm solution of Kx=r, and the orthogonal-range component is mapped to zero. Boundedness of K† on this domain is not part of the definition.

Facts & Assumptions

Given: Countable Choice, real or complex Hilbert spaces X,Y, and a bounded linear operator K:X→Y.

[F1]

A bounded linear operator has a real bound C≥0 such that ∥Kx∥≤C∥x∥ for every x (A bounded linear operator between normed spaces).

[F2]

For a subspace M, M⊥ consists of vectors orthogonal to every element of M, and M∩M⊥={0} (Orthogonality and the orthogonal complement).

[F3]

Every closed subspace M of a Hilbert space splits the space uniquely as M⊕M⊥ (Orthogonal decomposition by a closed subspace).

[F4]

Finite orthogonal sums satisfy Pythagoras (Pythagoras and finite orthogonal sums).

[F5]

For nonempty A in a metric space, x∈A‾ exactly when every ball about x meets A, and A‾ is the smallest closed superset (The closure of a nonempty A is {x:d(x,A)=0}, equals A together with its limit points, and is the smallest closed superset).

[F6]

The inner-product norm is definite: ∥v∥=0 implies v=0 (Real and complex inner-product spaces and their induced length).

[A1]

Countable Choice is the hypothesis used by [F3] (The Axiom of Countable Choice (ACω)).

Proof

technique · direct
1.1givenF1F5F6choosealgebra

If K=0, then N(K)=X is closed. Otherwise choose a bound C>0 from [F1]. For any x∈N(K)‾, [F5] lets us choose, for every ε>0, an nε∈N(K) with ∥x−nε∥<ε. Hence ∥Kx∥=∥K(x−nε)∥≤Cε for every ε>0, so ∥Kx∥=0 and Kx=0 by [F6]. Thus N(K)‾⊆N(K), and [F5] implies that N(K) is closed.

2.1givenstep 1.1F2F3A1choosealgebra

Fix r0∈R(K) and choose x0∈X with Kx0=r0. By [F3] and step 1.1, write x0=p+n with p∈N(K)⊥ and n∈N(K); then Kp=Kx0−Kn=r0. The restriction K~ is therefore surjective. If p,q∈N(K)⊥ and Kp=Kq, then p−q∈N(K)∩N(K)⊥, so p=q by [F2]. Thus K~ is bijective.

3.1step 2.1F2F4F6algebra

If x is any solution of Kx=r0, then x−p∈N(K). Since p⊥(x−p), [F4] gives ∥x∥2=∥p∥2+∥x−p∥2≥∥p∥2, with equality only when x=p. So p=K~−1r0 is the unique minimum-norm solution.

4.1step 2.1step 3.1F2algebra∎

For y=r+z∈R(K)⊕R(K)⊥, the decomposition is unique because R(K)∩R(K)⊥={0} by [F2], so the definition is single-valued. If z∈R(K)⊥, then r=0 and the unique minimum-norm preimage of 0 is 0 by step 3.1; hence K†z=0. For yi=ri+zi and scalars a,b, the vector aK†y1+bK†y2 lies in N(K)⊥ and maps under K to ar1+br2, so uniqueness in step 2.1 gives K†(ay1+by2)=aK†y1+bK†y2. The definition is therefore a well-defined linear operator on the stated domain.

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

Compact linear inverse model between Hilbert spaces

Definition

Let X,Y be real or complex Hilbert spaces over the same scalar field, and let K:X→Y be a compact linear operator. The associated compact linear inverse model has parameter space X, data space Y, forward map K, and admissible truth class X: for a true parameter x†∈X, the exact datum is y=Kx†∈Y. Given an exact datum y∈Y, solving this inverse problem means finding a parameter x∈X such that Kx=y. No injectivity, surjectivity, or closed-range assumption is included in the model.

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

Closed range and boundedness of the Hilbert pseudoinverse

Statement

Assume the Axiom of Countable Choice. Let K:X→Y be the compact linear operator of a real or complex Hilbert-space inverse model, and let K†:D(K†)→X be its Hilbert-space Moore–Penrose inverse, with D(K†)=R(K)⊕R(K)⊥ carrying the norm inherited from Y. Then K† is bounded on its domain if and only if R(K) is closed in Y; for compact K, these conditions are also equivalent to R(K) being finite-dimensional. Here bounded means that some real C≥0 satisfies ∥K†y∥X≤C∥y∥Y for every y∈D(K†).

Facts & Assumptions

Given: Countable Choice, a compact linear map K:X→Y between real or complex Hilbert spaces, and its Moore–Penrose inverse K†.

[F1]

The compact model has Hilbert parameter/data spaces and a compact linear forward map K (Compact linear inverse model between Hilbert spaces).

[F2]

D(K†)=R(K)⊕R(K)⊥, and on r+z the inverse is the minimum-norm preimage of r (Hilbert-space Moore–Penrose inverse).

[F3]

Under Countable Choice, the compact singular system has a finite positive index set exactly in the finite-dimensional-range case; otherwise its positive singular values are indexed by J={1,2,3,…} and form a sequence tending to zero, with orthonormal singular vectors and Kvj=sjuj, K∗uj=sjvj (Singular value decomposition for compact operators).

[F4]

The adjoint identity is ⟨Kx,u⟩Y=⟨x,K∗u⟩X (The Hilbert-space adjoint of a bounded operator).

[F5]

For a finite orthonormal family (ei), ∑i∣⟨x,ei⟩∣2≤∥x∥2 (The finite Bessel inequality and best approximation by a finite orthonormal family).

[F6]

Finite orthogonal sums satisfy Pythagoras (Pythagoras and finite orthogonal sums).

[F7]

A finite-dimensional subspace of a normed space is closed (A finite-dimensional normed subspace is closed).

[F8]

A Hilbert space is complete in its induced norm (Hilbert space).

[F10]

For every real ε>0 there is a natural n≥1 with 1/n<ε (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε).

[F11]

A starting value and a total recursive rule define a unique sequence (The recursion theorem).

[F12]

Every nonempty subset of N has a least element (The well-ordering principle).

[A1]

Countable Choice is the hypothesis of the compact SVD in [F3] (The Axiom of Countable Choice (ACω)).

Proof

technique · direct
1.1givenF1F2F3F5F6F7algebra

Suppose the positive singular system is finite, with index set J={1,…,r}. If r=0, the SVD expansion gives K=0, so R(K)={0} is closed by [F7] and K†=0 is bounded on its domain. If r>0, each uj=sj−1Kvj lies in R(K), while the SVD expansion places every Kx in span⁡{u1,…,ur}; hence the range equals this finite-dimensional span and is closed by [F7]. For y=q+z∈D(K†), q∈R(K) and z∈R(K)⊥, so K†y=∑j=1rsj−1⟨q,uj⟩vj by [F2] and [F3]. Pythagoras and Bessel give ∥K†y∥2=∑j=1rsj−2∣⟨q,uj⟩∣2≤sr−2∥q∥2≤sr−2∥y∥2; here sr is the smallest positive singular value, and the last inequality follows from q⊥z. Thus finite rank implies closed range and bounded K†.

1.2givenF3F4F5F6F8F9F10F11F12A1chooseconstructalgebra

Suppose instead that the positive singular index set is J={1,2,3,…}. Since sj→0, for each pair (k,n) the set of integers m>n with sm<2−(k+1) is nonempty; [F12] gives its least element, so [F11] defines recursively n0=0<n1<n2<⋯ and snk<2−k for every k≥1. Set yN=∑k=1Nsnkunk. For M>N, [F6] gives ∥yM−yN∥2=∑k=N+1Msnk2≤∑k=N+1M4−k≤4−N/3, so (yN) is Cauchy and converges to some y∈Y by [F8]. Each yN belongs to R(K) because snkunk=Kvnk, hence y∈R(K)‾. If y=Kx, then for every k≥1 and every N≥k, orthonormality gives ⟨yN,unk⟩=snk; by [F9] we may pass to the limit to get ⟨y,unk⟩=snk. The SVD and adjoint identity [F3]–[F4] then give snk=⟨Kx,unk⟩=snk⟨x,vnk⟩, so ⟨x,vnk⟩=1 for every k≥1. Applying [F5] to any first N of these orthonormal vectors gives N≤∥x∥2 for every N≥1. Taking ε=1/(∥x∥2+1) in [F10] yields an integer N≥1 with 1/N<1/(∥x∥2+1), hence N>∥x∥2, a contradiction. Thus y∉R(K) and the range is not closed.

2.1step 1.2F2F3algebra

For each k≥1, Kvnk=snkunk∈D(K†) and K†Kvnk=vnk by [F2], since vnk∈N(K)⊥. Therefore ∥K†Kvnk∥/∥Kvnk∥=1/snk>2k, so K† is unbounded when the positive singular system is infinite.

3.1step 1.1step 1.2step 2.1F3∎

By [F3], every compact K has either finite range dimension, covered by step 1.1, or an infinite positive singular system, covered by steps 1.2 and 2.1. Thus R(K) is closed exactly in the finite-dimensional case, and in exactly that case K† is bounded. This proves both stated equivalences.

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

Picard range and pseudoinverse-domain criterion

Statement

Assume the Axiom of Countable Choice. Let K:X→Y be a compact linear map between real or complex Hilbert spaces, with Hilbert adjoint K∗:Y→X. Write N>0:={1,2,3,…}. If R(K) has finite dimension r∈N, put J={1,…,r}, interpreted as empty when r=0; if R(K) is infinite-dimensional, put J=N>0. Thus J indexes exactly the positive singular values sj>0 in nonincreasing order. Let (vj)j∈J and (uj)j∈J be complete orthonormal families in N(K)⊥ and R(K)‾, respectively, with Kvj=sjuj and K∗uj=sjvj. The empty sum is zero, finite J uses a finite sum, and infinite J uses the norm-convergent series whenever the stated square-summability condition holds. Use inner products linear in the first argument. Define the Picard sum PK(y):=∑j∈J∣⟨y,uj⟩Y∣2sj2,y∈Y. Then:

  1. The exact equation Kx=y is solvable if and only if y⊥N(K∗) and PK(y)<∞.

  2. The domain of the Hilbert-space Moore–Penrose inverse is D(K†)=R(K)⊕R(K)⊥={y∈Y:PK(y)<∞}, and for every y∈D(K†), K†y=∑j∈J⟨y,uj⟩Ysjvj. Thus the orthogonal component in R(K)⊥=N(K∗) is discarded by K†; exact range membership additionally requires that component to be zero.

Singular-system diagram

For a fixed positive singular index j, the diagram records the domain/codomain action on its one-dimensional singular directions:

FFXY¸7!sj¸¸7!¸vj¸7!¸ujK

The two composites agree because K(λvj)=λKvj=λsjuj. This diagram explains the singular-pair convention; no proof step relies on it.

Facts & Assumptions

Given: Countable Choice, the compact Hilbert-space model K:X→Y, its adjoint K∗, and the positive singular system described in the statement.

[F1]

The model supplies real or complex Hilbert parameter/data spaces and a compact linear forward map (Compact linear inverse model between Hilbert spaces).

[F2]

The compact SVD supplies the positive singular values, complete orthonormal right and left singular families, the singular relations, and the operator expansion (Singular value decomposition for compact operators).

[F3]

(R(K))⊥=N(K∗) and R(K)‾=(N(K∗))⊥ (Kernel–range orthogonality for Hilbert adjoints).

[F4]

⟨Kx,y⟩Y=⟨x,K∗y⟩X (The Hilbert-space adjoint of a bounded operator).

[F5]

Finite Bessel inequality: ∑j∈F∣⟨x,ej⟩∣2≤∥x∥2 for every finite orthonormal family (The finite Bessel inequality and best approximation by a finite orthonormal family).

[F6]

Finite orthogonal sums satisfy Pythagoras (Pythagoras and finite orthogonal sums).

[F7]

On a complete orthonormal family, the finite Fourier sums converge in norm to each vector in its closed span (Fourier expansion in a Hilbert space).

[F8]

Every closed subspace of a Hilbert space has an orthogonal decomposition (Orthogonal decomposition by a closed subspace).

[F9]

Hilbert spaces are complete and Cauchy–Schwarz makes the inner product continuous in either argument (Hilbert space, Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[F10]

For r+z with r∈R(K) and z∈R(K)⊥, the inverse returns the minimum-norm preimage of r and annihilates z (Hilbert-space Moore–Penrose inverse).

[F11]

A compact linear operator is bounded and hence continuous in norm (Compact linear operator).

[A1]

Countable Choice is the hypothesis in the compact SVD and Hilbert Fourier expansion used here (The Axiom of Countable Choice (ACω)).

Proof

technique · direct
1.1givenF2F3F4F5A1algebra

Suppose y=Kx. Then y⊥N(K∗) by [F3]. For each j∈J, the adjoint identity and singular relation give ⟨y,uj⟩Y=⟨Kx,uj⟩Y=⟨x,K∗uj⟩X=sj⟨x,vj⟩X. Applying [F5] to finite subsets of the orthonormal family (vj) shows PK(y)=∑j∈J∣⟨x,vj⟩X∣2≤∥x∥X2<∞. This proves necessity in claim 1.

1.2F2F3F6F9A1constructalgebra

Now let y⊥N(K∗) and PK(y)<∞. By [F3], y∈R(K)‾. For finite J take the finite sum; for infinite J let xN=∑j=1Nsj−1⟨y,uj⟩Yvj. For M>N, [F6] gives ∥xM−xN∥X2=∑j=N+1Msj−2∣⟨y,uj⟩Y∣2, whose tails tend to zero because PK(y)<∞. Thus (xN) is Cauchy and converges to x∈X by [F9]. The complete right singular family places x in N(K)⊥.

2.1step 1.2F1F2F7F10F11A1algebra

By [F11], applying K to the finite sums and passing to the limit gives Kx=lim⁡N→∞KxN=lim⁡N→∞∑j=1N⟨y,uj⟩Yuj=y, where the last equality is [F7] on R(K)‾. The finite-J case is the same equality with a finite sum. Since x∈N(K)⊥ and Kx=y, [F10] identifies x=K†y. This proves sufficiency in claim 1 and the formula there.

3.1step 1.2step 2.1F3F7F8F10A1construct

For arbitrary y∈Y, apply [F8] to the closed subspace M=R(K)‾ and write y=p+q with p∈M and q∈M⊥. Since R(K)⊆M, q∈R(K)⊥. The Fourier coefficients of p are ⟨p,uj⟩Y=⟨y,uj⟩Y, and [F7] expands p in the complete left singular family. If PK(y)<∞, the construction in steps 1.2–2.1 applied to p∈M=(N(K∗))⊥ gives p∈R(K) and K†p=∑jsj−1⟨y,uj⟩Yvj; hence y=p+q∈R(K)⊕R(K)⊥=D(K†) and [F10] gives the displayed formula.

4.1step 1.1F3F10∎

Conversely, let y=r+q∈D(K†) with r∈R(K) and q∈R(K)⊥. By [F3], q∈N(K∗) and each uj∈N(K∗)⊥, so ⟨q,uj⟩Y=0. Step 1.1 applied to r shows PK(y)=PK(r)<∞; [F10] gives K†y=K†r and the same series formula. Thus the domain is exactly the set where the Picard sum is finite, completing claim 2.

4 · Examples, counterexamples and false statements

None yet.

Sources