WikiRNG
Rolled Version rolled

Incompressibility method

Proof method

In mathematics, the incompressibility method is a proof method like the probabilistic method, the counting method or the pigeonhole principle. To prove that an object in a certain class (on average) satisfies a certain property, select an object of that class that is incompressible.

ObscureTop 13%
136,264SP

Badges17 earned

  1. Problem SetObscure+49,666 SP
    Has 20+ math formulas. ยท 111 formulas
  2. UsesObscure+25,639 SP
    Has a Uses or Applications section.
  3. arXivObscure+18,888 SP
    Links to arXiv.
  4. EquationObscure+17,503 SP
    Has a math formula.
  5. AmazonObscure+11,805 SP
    Links to Amazon.
  1. Stuck in a LoopNotable+5,509 SP
    First links loop forever and never reach Philosophy.
  2. Free to ReadNotable+1,731 SP
    Cites a source that is free to read.
  3. Five-Minute ReadNotable+1,372 SP
    1,200+ words of prose. ยท 2,138 words
Basic9
rolled by Catapulfy