Delphi.science

A Quadratic Lower Bound for Fourier RIP with Tree-Structured Sparsity

Source: github.com/chinmayhegde/fourier-tree-rip-palomar/tree/d3542…

Chinmay Hegde

Palomar Registrypalomar/PALOMAR-2026-11-16-000025Nov 16, 2026math.NAscore 0

Lean 4 formalization of an explicit lower bound for uniformly row-subsampled discrete Fourier transforms acting on canonical binary-heap tree-sparse vectors. With constant distortion, at least half of frequency sequences violate tree-RIP when 20000 m <= k min(k, log_2(N/k)), with an explicit quadratic corollary. The proof uses broom supports, Fejer-kernel concentration, simultaneous Diophantine approximation, and finite counting. A full-DFT isometry theorem checks the normalization and nonvacuity of the definitions.

RepositoryJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-16-000025
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-16-000025/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-16-000025/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'