entropyApplications
plain-language theorem explainer
entropyApplications enumerates five physical domains where Shannon entropy appears, including thermodynamics via S = k_B H, black-hole area laws, and quantum entanglement. A researcher connecting information theory to fundamental physics would cite the list to illustrate RS-derived entropy extensions. The definition is a direct static enumeration of strings with no computation or proof steps.
Claim. Define the list of entropy applications in physics as the enumeration containing thermodynamic entropy $S = k_B H$ (Boltzmann), black-hole entropy $S_{BH} = A/(4G)$, quantum entanglement entropy, coding-theory compression limits, and channel-capacity bounds.
background
The module INFO-001 derives Shannon entropy H = -Σ p_i log(p_i) from J-cost over probability distributions, where J(x) = ½(x + x^{-1}) - 1 measures recognition effort. Upstream, H(x) = J(x) + 1 reparametrizes the Recognition Composition Law into the d'Alembert equation H(xy) + H(x/y) = 2 H(x) H(y). The InitialCondition.entropy definition states that entropy of a configuration is proportional to its total defect, with zero defect yielding the minimum-entropy state. The local setting treats information as deviation from uniformity, with uniform distribution (p_i = 1/n) maximizing entropy.
proof idea
Direct definition that constructs the List String by enumerating five hardcoded application descriptions; no lemmas or tactics are applied.
why it matters
The definition supports the module claim that Shannon entropy emerges from J-cost minimization and links to thermodynamic entropy via k_B and the defect-based entropy from InitialCondition. It illustrates the paper proposition on information theory from Recognition Science but has no downstream uses recorded. It touches the T5 J-uniqueness and RCL landmarks without advancing the forcing chain.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.