`CompressionFalsifier`

definition

show as: view math explainer →

module: IndisputableMonolith.Information.Compression
domain: Information
line: 243 · github
papers citing: none yet

open explainer

Read the cached plain-language explainer.

open lean source

IndisputableMonolith.Information.Compression on GitHub at line 243.

browse module

All declarations in this module, on Recognition.

explainer page

A cached Ask Recognition explainer exists for this declaration.

open explainer

formal source

 240    1. Compression below entropy achieved
 241    2. J-cost doesn't decrease with compression
 242    3. Random data can be systematically compressed -/
 243structure CompressionFalsifier where
 244  below_entropy : Prop
 245  jcost_not_decreased : Prop
 246  random_compressible : Prop
 247  falsified : below_entropy → False
 248
 249end Compression
 250end Information
 251end IndisputableMonolith

papers checked against this theorem

No papers in the current corpus map onto this theorem yet.