{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nLet $H$ be a separable [[Hilbert space|HM2HHE3J51]], and let $(f_i)_{i \\in \\N}$ be a frame of $H$ with $\\inf_{i} \\norm{f_i} \u003e 0$.\nThat is, there are constants $0 \u003c A \\le B \u003c \\infty$ with $A \\norm{f}^2 \\le \\sum_{i} \\abs{\\ip{f}{f_i}}^2 \\le B \\norm{f}^2$ for all $f \\in H$.\nThen $\\N$ is the union of finitely many sets $I_1, \\dots, I_r$ such that each family $(f_i)_{i \\in I_j}$ is a Riesz sequence.\nHere a Riesz sequence is a family that is a [[Riesz basis|ZYDYD7FB1Z]] of its closed linear span.\n\n## Remarks\n\nThe question is due to Hans Feichtinger, who came to it from time–frequency analysis.\nIn the 2000s Peter Casazza and coauthors showed that it is equivalent to the [[Kadison–Singer problem|C8TTRMVVS7]].\nThe positive solution of the Kadison–Singer problem by Marcus, Spielman and Srivastava therefore proves the statement.\nThe hypothesis $\\inf_i \\norm{f_i} \u003e 0$ is necessary: a Riesz sequence has norms bounded below, so a frame containing vectors of norm tending to $0$ cannot be split into finitely many Riesz sequences.\n\nExample: the union of two orthonormal bases $(e_n)$ and $(e'_n)$ of $H$ is a frame with $\\norm{f_i} = 1$; it splits into the two Riesz sequences $(e_n)$ and $(e'_n)$.\n\n## Explanations\n\n### L1 human\n\nA frame is a redundant spanning family in which every vector can be recovered stably.\nA Riesz sequence is a family that is as good as an orthonormal basis of the space it spans, with no redundancy.\nThe statement says that any frame whose vectors do not shrink to zero can be cut into finitely many pieces, each of them free of redundancy in this strong sense.\n\n### L2 human\n\nThe statement lets one replace a redundant frame by finitely many non-redundant pieces, each of which behaves like an orthonormal basis of its span.\nThe equivalence with the Kadison–Singer problem passes through Anderson's paving conjecture and Weaver's discrepancy conjecture.\nThe proof of Marcus, Spielman and Srivastava works with sums of random rank-one matrices and interlacing families of polynomials.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "about": [
      "ZYDYD7FB1Z"
    ],
    "kind": "statement",
    "msc": [
      "42C15",
      "46C05",
      "46L05"
    ],
    "name": "Feichtinger conjecture",
    "role": "theorem",
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Kadison%E2%80%93Singer_problem"
      }
    ],
    "tag": "QYQ983Z0BK",
    "uses": [
      "HM2HHE3J51",
      "ZYDYD7FB1Z"
    ]
  },
  "kind": "statement",
  "link": "https://tamnd.github.io/math2/node/QYQ983Z0BK/",
  "links": [
    {
      "field": "about",
      "target": "ZYDYD7FB1Z"
    },
    {
      "field": "uses",
      "target": "HM2HHE3J51"
    },
    {
      "field": "uses",
      "target": "ZYDYD7FB1Z"
    }
  ],
  "markdown": "https://tamnd.github.io/math2/node/QYQ983Z0BK.md",
  "msc": [
    "42C15",
    "46C05",
    "46L05"
  ],
  "name": "Feichtinger conjecture",
  "prov": null,
  "role": "theorem",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/QYQ/QYQ983Z0BK.md",
  "status": null,
  "tag": "QYQ983Z0BK",
  "uri": "m2://QYQ983Z0BK",
  "url": "https://tamnd.github.io/math2/wiki/feichtinger-conjecture/",
  "writing": {
    "tag": "QYQ983Z0BK",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      },
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}