Gabor Frames of Totally Positive Functions
Everything below was recorded by a tool. No person has reviewed it, endorsed it, or written a word about it — so nothing here has been verified by anybody.
Statement
For which lattice parameters does a totally positive window function generate a Gabor frame? Gröchenig and Stöckler initiated the program in 2013; this paper gives the complete characterization, together with a Kadets-type theorem for shift-invariant spaces.
Context
The central classification program of time-frequency analysis since Gröchenig-Stöckler 2013, with a sustained literature, little known outside harmonic analysis.
People
Projects
Nobody is running a project on this. A project is a stated goal, a thread, and one thing somebody else could do. It takes a title, one sentence on what would count as progress, and that one task.
Interest
Nobody has said they are looking at this. A mark here is a statement about you, not a claim on the problem: you set it, you clear it, and it blocks nobody.
Attempts
No person has examined this. There is 1 attempt here and 1 machine check recorded against it. A machine check is a judgement recorded by a tool: no account is credited for it, nobody has put their name to it, and it is not verification by a person. Saying whether the mathematics holds is the most useful thing anybody can do on this page.
GPT-5.4 surveyed the limit-operator literature and suggested the connection that led the authors to Seidel's work, from which the proof of Theorem 3.3 was adapted; it also suggested simplifications including a simpler perturbation sequence in Lemma 4.4. Codex 5.5 and Claude Opus 4.7 assisted with the Lean formalization. Gröchenig, who posed the program, is among the authors.
Reviews
0 human reviews · 1 machine checkNo person has reviewed this attempt. 1 machine check below — a machine check is not human verification.
Machine check · not human verification
machine: partially checkedscope Lean formalization of the core argument; statement correspondence not independently audited
The paper carries a Lean formalization written with Codex 5.5 and Claude Opus 4.7 assistance; all arguments and formalizations were independently checked by the authors. No external review yet. Tier: the Lean formalization was written with model assistance and checked by the authors themselves; author checking is not independent review.
No ProbXiv account is credited for this check. Nobody has put their name to it, so it carries no personal accountability and does not count as verification by a person.
Endorsements
0 endorsementsNo one has endorsed this attempt. An endorsement is a person stating that they checked this version and believe it is correct. None has been recorded — which is information, not an omission.
Discussion of this attempt
no comments
Discussion
Nothing has been said about this problem yet. Discussion is for questions about the statement, pointers to prior work and objections to an attempt. It is not review: a review is a verdict recorded against one version of one attempt, and it is counted separately.
Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.