Finite-rank kernel realization and completion

We consider when local finite-rank positive definite kernels comefrom a single global finite-rank kernel. The first part treats thecase where the global kernel is fixed and shows that the missing mixedblocks control when a global rank-$r$ realization exists and howrank grows when it does not. The second part treats the completionproblem, where only local kernels are given. In that setting, rank-preservingcompletion becomes a unitary patching problem on overlap generatedsubspaces. Forests always patch, full overlaps are governed by cycleconditions for the induced unitaries, and partial overlaps lead tofinite-dimensional subspace compatibility conditions. We also givea rank bound for finite completions obtained by joining two completedpieces along their common feature subspace.

Authors

Institutions

Publication Details

Journal
Constructive Mathematical Analysis
Published
2026-06-30
DOI
https://doi.org/10.33205/cma.1942507
Primary Topic
Sparse and Compressive Sensing Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Finite-rank kernel realization and completion

Feng Tian
Constructive Mathematical Analysis
Sparse and Compressive Sensing Techniques
article

Finite-rank kernel realization and completion

Feng Tian
article en

Abstract

We consider when local finite-rank positive definite kernels comefrom a single global finite-rank kernel. The first part treats thecase where the global kernel is fixed and shows that the missing mixedblocks control when a global rank-$r$ realization exists and howrank grows when it does not. The second part treats the completionproblem, where only local kernels are given. In that setting, rank-preservingcompletion becomes a unitary patching problem on overlap generatedsubspaces. Forests always patch, full overlaps are governed by cycleconditions for the induced unitaries, and partial overlaps lead tofinite-dimensional subspace compatibility conditions. We also givea rank bound for finite completions obtained by joining two completedpieces along their common feature subspace.

Constructive Mathematical Analysis(Advanced Online Publication)
Annual Reviews (US)
Life in Land
Openalex Percentile: Top 9%
Sparse and Compressive Sensing Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.