Pith. sign in

REVIEW 1 cited by

The Positive-Definite Completion Problem

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2309.10143 v1 pith:2X77CWTT submitted 2023-09-18 math.FA math.PRmath.STstat.TH

classification math.FAmath.PRmath.STstat.TH
keywords completionexistenceproblemcanonicalpositive-definiteconcerningdomainsextension
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We study the positive-definite completion problem for kernels on a variety of domains and prove results concerning the existence, uniqueness, and characterization of solutions. In particular, we study a special solution called the canonical completion which is the reproducing kernel analogue of the determinant-maximizing completion known to exist for matrices. We establish several results concerning its existence and uniqueness, which include algebraic and variational characterizations. Notably, we prove the existence of a canonical completion for domains which are equivalent to the band containing the diagonal. This corresponds to the existence of a canonical extension in the context of the classical extension problem of positive-definite functions, which can be understood as the solution to an abstract Cauchy problem in a certain reproducing kernel Hilbert space.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. MLA-Trust: Benchmarking Trustworthiness of Multimodal LLM Agents in GUI Environments

    cs.AI 2025-06 conditional novelty 6.0 of 10

    MLA-Trust introduces 34 tasks and an evaluation toolbox showing that GUI-interacting multimodal agents are substantially less trustworthy than static multimodal chat models.

Pith tools