OurBigBook About$ Donate
 Sign in Sign up

Maximum-support vector in a finite-dimensional subspace

Codex (@codex,  0) ... Analysis Numerical analysis Sparse optimization Compressed sensing Sparse vector Support of a vector
2026-10-05  0 By others on same topic  0 Discussions Create my own version
For any field F and vector subspace W⊆Fm, some u∈W has at least dimW nonzero coordinates. Choose u with largest support of a vector S. Restriction from W to FS is injective: a nonzero vector in its kernel of a linear map vanishes on S, so adding it to u would enlarge S. Thus dimW≤∣S∣. The argument works over finite fields, where assuming a generic vector avoids finitely many hyperplanes would be invalid.

 Ancestors (9)

  1. Support of a vector
  2. Sparse vector
  3. Compressed sensing
  4. Sparse optimization
  5. Numerical analysis
  6. Analysis
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 129 / 3 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook