SYSTEMA CONSTRUCTUM

Accepted ontology entry

entropy

Entropy is a human-made mathematical measure of uncertainty, randomness, or information content within a probability distribution or data set. For a discrete random variable with outcomes x_i and probabilities p_i, entropy H is defined as…

ACCEPTED THINGcmsfrqasq00aqqszg1stkbizq

Definition

Entropy is a human-made mathematical measure of uncertainty, randomness, or information content within a probability distribution or data set. For a discrete random variable with outcomes x_i and probabilities p_i, entropy H is defined as H = -Σ p_i · log(p_i), using logarithms in a chosen base (typically 2 for bits, e for nats, or 10 for hartleys). The function maps any probability distribution to a non-negative real number, with zero entropy for deterministic distributions and maximal entropy for uniform distributions. Entropy persists through mathematical formalism — it is the foundational quantity in information theory (Shannon entropy), thermodynamics (Boltzmann entropy, S = k_B ln W), statistical mechanics, and machine learning (cross-entropy loss, information gain). The concept was formalized by Claude Shannon in 1948 as a measure of information uncertainty in communication systems, building on prior work by Boltzmann and Gibbs in statistical physics. The mathematical framework treats entropy as an extensive state function whose value depends only on the distribution, not on the particular identities of outcomes. [formal: entropia | substrate: mind | horizon: centuries | explicit: yes | epoch: 0.12]

Why it is in scope

A human-made mathematical concept measuring the degree of uncertainty, randomness, or information content in a probability distribution or data set. It quantifies the expected value of information contained in a message.

Names and aliases

Relations from this entry

  • cmsf6w1ek06ms3vv3snhiwxwlDEPENDS_ON →

    Entropy operates on probability distributions — remove probability theory as a concept and entropy loses its mathematical framework entirely. The removal test passes: entropy cannot function without the concept of probability.

  • cmreawf22000vg8vu90kto3goDEPENDS_ON →

    Entropy as a concept (especially Shannon entropy in information theory) needs the concept of information to operate: entropy measures uncertainty/information content. Remove information and entropy as an informational metric ceases to function. This is a present-tense operational dependency, not merely historical or sayable.

Relations to this entry

  • cmsr844f000lckp53swl41f68← DERIVED_FROM

    Spectral entropy is Shannon entropy applied to power spectral density. It was derived by taking the entropy concept from information theory and applying it to the frequency domain representation of signals. Entropy as a concept predates and feeds into spectral entropy.

  • renyi-entropy← DERIVED_FROM

    Rényi entropy (1961) was introduced as a one-parameter generalization of Shannon entropy (1948). Shannon entropy is the α→1 limit of the Rényi formula. Historical direction: Shannon existed first and fed into Rényi's generalization.

  • cmsfd71ln06zx3vv3gel55wem← DERIVED_FROM

    Cross-entropy H(p,q) = -Σ p(x) log q(x) is the extension of Shannon entropy H(p) = -Σ p(x) log p(x) to two distributions. The entropy concept (Shannon 1948) existed first and cross-entropy was derived from it — the cross-entropy formula is literally the negative expected log of q, while entropy is the same form with p=q. Entropy is the more fundamental construct that cross-entropy derives from.

  • kullback-leibler-divergence← DERIVED_FROM

    KL-divergence D_KL(P||Q) = Σ P(x) log(P(x)/Q(x)) = -Σ P(x) log Q(x) + Σ P(x) log P(x) = cross-entropy(P,Q) - entropy(P). The KL formula is literally decomposed into Shannon entropy terms. It was derived from the entropy concept by Kullback and Leibler (1951). Entropy (Shannon 1948) predates and feeds into KL-divergence.

  • conditional-entropy← DERIVED_FROM

    Conditional entropy H(Y|X) extends Shannon entropy H(X) to the setting of dependent variables. Entropy existed first (Shannon 1948) and conditional entropy was derived from it by introducing the conditioning variable. The chain rule H(X,Y)=H(X)+H(Y|X) shows conditional entropy as the extension of entropy to joint distributions.

  • conditional-entropy← INSTANCE_OF

    Conditional entropy is a specific kind of entropy — the entropy of one random variable given knowledge of another. A competent speaker would call it 'an entropy measure' — it is a specific case within the general concept of entropy.

  • differential-entropy← INSTANCE_OF

    Differential entropy is the specific instance of Shannon entropy applied to continuous (density-based) distributions rather than discrete ones, nearest kind being entropy itself.

  • differential-entropy← DERIVED_FROM

    Differential entropy is the continuous analog of Shannon (discrete) entropy, replacing summation with integration over a probability density. It was derived from Shannon entropy to handle continuous distributions — entropy came first and gives rise to differential entropy as its continuous extension.

Record identity

Created
Aug 5, 2026, 7:31 AM UTC
Content hash
47e70bccd8c84e099ad6f02006e789324c38b5363b9911b7bef69af530e4042d

Open a related act record