Proof Path TheoryReading edition

Compression debt

Reading tools
Reading libraryFind statementsInspect Lean
Switch work

Saved reading

Read side by side

Start reading

Resources & source

Read and explore

Proofs and implementation

About this work

Other resources

Original TeX with line links · Download TeX

The wording and mathematics follow the retained manuscript. This reading format does not add a proof review or extend Lean coverage.

Skip contents and start reading

13 Compression debt

Compression may postpone work rather than eliminate it. A later task may require reconstruction of material that was omitted from the current representation.

Definition 13.1: Future task model

Let \({\mathcal T}\) be a finite task set with probabilities \(p_t\ge0\) satisfying \(\sum_t p_t=1\). Let \(R_t\subseteq V\) be the node set required by task \(t\), and let \(c(v)\ge0\) be the recovery cost of node \(v\) when it is absent.

Definition 13.2: Expected compression debt

The expected compression debt of retained set \(K\) is

\[ {\operatorname{Debt}}(K) = \sum_{t\in{\mathcal T}}p_t \sum_{v\in R_t\setminus K}c(v). \]

Proposition 13.3: Debt is monotone under retention

If \(K_1\subseteq K_2\), then

\[ {\operatorname{Debt}}(K_2)\le{\operatorname{Debt}}(K_1). \]

Proof

For every task \(t\), the missing set \(R_t\setminus K_2\) is contained in \(R_t\setminus K_1\). Recovery costs are nonnegative. The taskwise cost cannot increase, and neither can its probability-weighted sum.

Corollary 13.4: Irreversible compression accumulates debt

For a descending sequence of retained sets

\[ K_0\supseteq K_1\supseteq\cdots\supseteq K_r, \]

the expected debt is nondecreasing.

A recovery archive can change the cost function. If an omitted node has a stable provenance pointer and a reproducible generator, its recovery cost may be small. If it survives only in memory, its recovery cost may be effectively infinite.

Source and conversion record

Source SHA-256: ce05e88b439e9fd55ef6eb04da708a63ce02e6627424e6daac0dca4177b8ab51

Unsupported prose commands stop the build. The mathematical expression sequence is checked against the source, with manuscript macros expanded for display.

Conversion records

Notation in Proof Path Theory

Look up a symbol without leaving this chapter. Select text before opening help to search for it.

Search this work’s notation.

    Symbols can have different meanings in different passages. Read each result in its own context.

    Open the full notation index