least_squares_certificate_neumann_partial_tendsto_pos
ProvedRole. Section 4.3 convergence/identity core of the dual-certificate branch.
Claim. Suppose the entrywise sampling rate satisfies and the tangent-space concentration bound holds at scale , i.e. for every , (equivalently ). Then for every least-squares dual certificate (the minimum-Frobenius matrix supported on with ), the partial sums of the normal-space Neumann certificate terms converge to the normal projection of :
where is the Neumann error operator and .
Why it is the genuine open sub-problem. With and the concentration bound, is invertible on (Neumann series in converges since ), so the least-squares certificate equals and its normal part is exactly the convergent series above. This is the §4.3 Neumann expansion identity that the parent normal-bound node consumes; it is not otherwise present on the platform. The hypotheses and the concentration bound are necessary: at the operator is identically zero and the identity fails (this is precisely the degeneracy that disproves the no-hypothesis variant 22bf6cfe).
import Definitions.Def_matrix_completion_neumann import Mathlib.Topology.Algebra.InfiniteSum.Basic open MatrixCompletion open Filter Topology
theorem least_squares_certificate_neumann_partial_tendsto_pos
{n₁ n₂ r : ℕ} {M : Matrix (Fin n₁) (Fin n₂) ℝ}
(Omega : Finset (Fin n₁ × Fin n₂)) (S : SVD M r) (p : ℝ) :
0 < p →
TangentSamplingConcentration Omega S p ((1 : ℝ) / 2) →
∀ Y : Matrix (Fin n₁) (Fin n₂) ℝ,
LeastSquaresDualCertificate Omega S Y →
Filter.Tendsto
(fun K => ∑ k ∈ Finset.range (K + 1),
neumannCertificateTerm Omega S p k)
Filter.atTop (nhds (normalProjection S Y)) := by
sorry