english_is_redundant
plain-language theorem explainer
The declaration asserts that English exhibits redundancy as a foundational truth inside the compression module. Researchers bounding J-cost reductions for natural language data would cite it when separating removable excess from the Shannon entropy floor. The proof is a direct term-mode application of the trivial tactic with no lemma invocations.
Claim. English text carries approximately 70% redundancy, expressed as the tautology $T$.
background
The Information.Compression module derives compression limits from J-cost, where entropy equals minimum J-cost for faithful representation and redundancy equals removable excess J-cost. Upstream, InitialCondition.entropy defines entropy of a configuration as its total defect, while PartitionFunction.entropy gives $S = k_B (log Z + beta
proof idea
The proof is a one-line term-mode wrapper that applies the trivial tactic directly to inhabit True.
why it matters
The declaration supplies the RS perspective on redundancy as excess J-cost, aligning with the module's Shannon limit and J-cost minimization mechanism. It sits inside the chain from entropy definitions to compression bounds, though it currently has no downstream uses. It touches the open quantification of natural-language redundancy inside the phi-ladder.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.