Harmonic analysis on Euclidean spaces Frames and time-frequency analysis Theorem
Feichtinger conjecture
Builds on Hilbert spaceRiesz basis
Statement
Let be a separable Hilbert space, and let be a frame of with . That is, there are constants with for all . Then is the union of finitely many sets such that each family is a Riesz sequence. Here a Riesz sequence is a family that is a Riesz basis of its closed linear span.
Remarks
The question is due to Hans Feichtinger, who came to it from time–frequency analysis. In the 2000s Peter Casazza and coauthors showed that it is equivalent to the Kadison–Singer problem. The positive solution of the Kadison–Singer problem by Marcus, Spielman and Srivastava therefore proves the statement. The hypothesis is necessary: a Riesz sequence has norms bounded below, so a frame containing vectors of norm tending to cannot be split into finitely many Riesz sequences.
Example: the union of two orthonormal bases and of is a frame with ; it splits into the two Riesz sequences and .
Going deeper
For a student
The statement lets one replace a redundant frame by finitely many non-redundant pieces, each of which behaves like an orthonormal basis of its span. The equivalence with the Kadison–Singer problem passes through Anderson's paving conjecture and Weaver's discrepancy conjecture. The proof of Marcus, Spielman and Srivastava works with sums of random rank-one matrices and interlacing families of polynomials.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Hilbert space concept
- Riesz basis concept
- Feichtinger conjecture statement
Further reading
About this page
| Tag | QYQ983Z0BK |
|---|---|
| URI | m2://QYQ983Z0BK |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 42C15, 46C05, 46L05 |
| Status | This copy of the site has no build data. Run m2 status QYQ983Z0BK. |
| About | Riesz basis |
| Uses | Hilbert space, Riesz basis |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.