Binary entropy function¶

The Shannon entropy of a Bernoulli variable as a concave function of its success probability.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3463
Domain group: Formal Sciences
Origin domain: Information Theory

Core Idea¶

For probability p and a fixed logarithm base, binary entropy is minus p log p minus one-minus-p log one-minus-p, with zero-log-zero defined by continuity.^[1] Expected self-information from the two outcomes produces a symmetric concave curve, zero at deterministic endpoints and maximal at the unbiased probability. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of information theory. It is the domain-specific identity determined by p lies in the unit interval, the log base fixes the information unit, endpoint limits are used, symmetry holds under p versus one-minus-p, and the maximum occurs at one half. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that p lies in the unit interval, the log base fixes the information unit, endpoint limits are used, symmetry holds under p versus one-minus-p, and the maximum occurs at one half fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test. This gives the entry an operational identity rather than merely a historical label.

A useful analysis keeps three layers separate. The constitutive layer says what must be true: p lies in the unit interval, the log base fixes the information unit, endpoint limits are used, symmetry holds under p versus one-minus-p, and the maximum occurs at one half. The evidential layer asks what observation or proof warrants the claim: type the carrier, state every parameter and convention in the definition, test that p lies in the unit interval, the log base fixes the information unit, endpoint limits are used, symmetry holds under p versus one-minus-p, and the maximum occurs at one half, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. The use layer asks what reasoning becomes available once the identity is established: recognizing and comparing instances of Binary entropy function, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Conflating the layers is the most common source of scope inflation.

How would you explain it like I'm…

The Coin Surprise Meter

Think about flipping a coin. If the coin always lands heads, you are never surprised. If it lands heads or tails equally often, you can never guess, so it surprises you the most. The binary entropy function is a number that says how surprising a two-way choice is on average.

Two-Choice Surprise Hill

Some events have only two outcomes, like heads or tails, and one outcome happens with some chance p. The Binary entropy function measures how uncertain you are, on average, before you see the result. If p is 0 or 1, you already know the answer, so the uncertainty is zero. It is biggest when both outcomes are equally likely, at p = one half. It also treats the two outcomes the same way, so a coin that lands heads 90% of the time is just as uncertain as one that lands tails 90% of the time.

Two-Outcome Uncertainty Curve

The binary entropy function gives the average information from an event with two outcomes of probability p and 1 - p. Its formula is H(p) = -p log p - (1 - p) log(1 - p), where the base of the logarithm sets the unit, such as bits for base 2. At p = 0 or p = 1, the terms 0 log 0 are taken to be zero, so H is zero when the result is certain. The curve is symmetric, since H(p) = H(1 - p), and it is concave, reaching its maximum at p = 1/2. It is the expected surprise of a biased coin, not the surprise of any single flip.

The Binary entropy function is the Shannon entropy of a two-outcome (Bernoulli) random variable, written as a function of the probability p in [0, 1]: H(p) = -p log p - (1 - p) log(1 - p). It is the expected self-information of the two outcomes. The logarithm base fixes the unit of information, for example bits for base 2 and nats for base e. The endpoints are handled by the continuity convention 0 log 0 = 0, so H(0) = H(1) = 0, reflecting that a deterministic outcome carries no uncertainty. The function is symmetric, H(p) = H(1 - p), concave on the unit interval, and attains its unique maximum at p = 1/2. Using it correctly means checking that the argument really is a probability of one of two outcomes and stating the log base, rather than applying the formula to anything two-valued by resemblance.

Structural Signature¶

Carrier: the typed information theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets
Inputs or antecedent state: the exact information theory carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Binary entropy function
Constitutive operation: Expected self-information from the two outcomes produces a symmetric concave curve, zero at deterministic endpoints and maximal at the unbiased probability.
Invariant: p lies in the unit interval, the log base fixes the information unit, endpoint limits are used, symmetry holds under p versus one-minus-p, and the maximum occurs at one half
Recognition test: type the carrier, state every parameter and convention in the definition, test that p lies in the unit interval, the log base fixes the information unit, endpoint limits are used, symmetry holds under p versus one-minus-p, and the maximum occurs at one half, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases
Output or consequence: recognizing and comparing instances of Binary entropy function, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions
Failure boundary: the carrier is mistyped, the condition that p lies in the unit interval, the log base fixes the information unit, endpoint limits are used, symmetry holds under p versus one-minus-p, and the maximum occurs at one half fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test

What It Is Not¶

It is not the whole field of information theory. The field contains many questions and methods that do not instantiate Binary entropy function.
It is not its most familiar example. A canonical instance directly demonstrates that p lies in the unit interval, the log base fixes the information unit, endpoint limits are used, symmetry holds under p versus one-minus-p, and the maximum occurs at one half. exhibits the structure, but the example is evidence for the abstraction rather than its definition.
It is not the neighboring catalog concept Bernoulli variance. Both peak at one half and vanish at endpoints, but Bernoulli variance measures squared dispersion while binary entropy measures expected logarithmic surprise.
It is not a claim that every boundary case has one uncontested classification. a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Binary entropy function must control the decision
It is not an unrestricted metaphor for any process that seems similar. Outside information theory, the vocabulary and validity conditions do not transfer literally.

Scope of Application¶

Binary entropy function belongs to information theory and is useful where the analyst can specify the typed information theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate p lies in the unit interval, the log base fixes the information unit, endpoint limits are used, symmetry holds under p versus one-minus-p, and the maximum occurs at one half. The scope is broad within that domain but bounded by the need for p lies in the unit interval, the log base fixes the information unit, endpoint limits are used, symmetry holds under p versus one-minus-p, and the maximum occurs at one half. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.^[2]

Definition and recognition. Determine whether a proposed instance satisfies the constitutive conditions rather than merely sharing terminology.
Construction or evolution. Track how the exact information theory carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Binary entropy function are converted, constrained, or organized by Expected self-information from the two outcomes produces a symmetric concave curve, zero at deterministic endpoints and maximal at the unbiased probability..
Comparison. Compare instances using carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior, without treating convenience measures as the definition.
Boundary analysis. Diagnose cases where a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Binary entropy function must control the decision and state which convention or theorem controls the decision.
Downstream reasoning. Use the established identity to support recognizing and comparing instances of Binary entropy function, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions while preserving the assumptions under which the inference is valid.

Clarity¶

The abstraction clarifies a crowded vocabulary by making p lies in the unit interval, the log base fixes the information unit, endpoint limits are used, symmetry holds under p versus one-minus-p, and the maximum occurs at one half the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Binary entropy function can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated. The disciplined statement is: given the exact information theory carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Binary entropy function, the structure counts as Binary entropy function exactly when p lies in the unit interval, the log base fixes the information unit, endpoint limits are used, symmetry holds under p versus one-minus-p, and the maximum occurs at one half.

This format also separates identity from measurement. Empirical, computational, or documentary proxies support recognition only under declared validity and uncertainty assumptions; formal cases require proof rather than measurement. Measurements can be noisy, implementations can approximate, and proofs can use equivalent characterizations; none of those facts licenses changing the object being measured. When reports disagree, first check scope and convention, then data or proof, and only then interpret the disagreement as substantive.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Binary entropy function. Binary entropy function compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

The compression has a price. A single label can hide canonical, generalized, restricted, approximate, computational, empirical, and historically variant formulations of Binary entropy function. Good use therefore carries a small declaration of assumptions alongside the name. The abstraction manages complexity when it reduces the state space of the question while keeping the failure boundary visible; it mismanages complexity when the label substitutes for that boundary analysis.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed information theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express p lies in the unit interval, the log base fixes the information unit, endpoint limits are used, symmetry holds under p versus one-minus-p, and the maximum occurs at one half independently of one notation or implementation. This step prevents the canonical example from becoming the definition.
Derive consequences. From p lies in the unit interval, the log base fixes the information unit, endpoint limits are used, symmetry holds under p versus one-minus-p, and the maximum occurs at one half, infer recognizing and comparing instances of Binary entropy function, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Record each assumption used so that a later change of setting does not silently preserve an invalid conclusion.
Test adversarial cases. Examine a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Binary entropy function must control the decision and an object that resembles Binary entropy function in purpose or vocabulary but does not satisfy its invariant is outside the class. A robust identity explains why the first is convention-sensitive and why the second is outside the class.
Compare and refine. Use carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior to compare legitimate instances, and refine the model when discrepancies reflect hidden variation rather than failure of the abstraction itself.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of information theory because they reuse the typed information theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Expected self-information from the two outcomes produces a symmetric concave curve, zero at deterministic endpoints and maximal at the unbiased probability., and type the carrier, state every parameter and convention in the definition, test that p lies in the unit interval, the log base fixes the information unit, endpoint limits are used, symmetry holds under p versus one-minus-p, and the maximum occurs at one half, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. A theorem, diagnostic, or modeling warning can travel when those roles remain literal. For example, the distinction between constitutive identity and a convenient observable transfers from A canonical instance directly demonstrates that p lies in the unit interval, the log base fixes the information unit, endpoint limits are used, symmetry holds under p versus one-minus-p, and the maximum occurs at one half. to An applied instance preserves the same invariant under a changed notation, scale, implementation, or empirical setting..^[3]

Transfer outside the home domain is weaker. The skeletal pattern—type the carrier, apply the defining mechanism of Binary entropy function, preserve its invariant, and derive only consequences licensed by the stated boundary—may suggest an analogy, but the domain-specific mechanisms, admissible evidence, and consequences do not come along automatically. The safe transfer procedure maps each role explicitly, checks the invariant again, and refuses the name when only a superficial resemblance remains.

Examples¶

Canonical¶

A canonical instance directly demonstrates that p lies in the unit interval, the log base fixes the information unit, endpoint limits are used, symmetry holds under p versus one-minus-p, and the maximum occurs at one half. The example exposes the carrier and directly tests that p lies in the unit interval, the log base fixes the information unit, endpoint limits are used, symmetry holds under p versus one-minus-p, and the maximum occurs at one half; changing incidental notation preserves the identity, while removing that condition destroys it. This example is canonical because every role can be inspected: the carrier is the typed information theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets; the operative rule is Expected self-information from the two outcomes produces a symmetric concave curve, zero at deterministic endpoints and maximal at the unbiased probability.; the invariant is p lies in the unit interval, the log base fixes the information unit, endpoint limits are used, symmetry holds under p versus one-minus-p, and the maximum occurs at one half; and the result supports recognizing and comparing instances of Binary entropy function, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions.^[1] Changing incidental notation or scale leaves the structure intact, while removing p lies in the unit interval, the log base fixes the information unit, endpoint limits are used, symmetry holds under p versus one-minus-p, and the maximum occurs at one half destroys the classification.

Mapped back: the typed information theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets → Expected self-information from the two outcomes produces a symmetric concave curve, zero at deterministic endpoints and maximal at the unbiased probability. → p lies in the unit interval, the log base fixes the information unit, endpoint limits are used, symmetry holds under p versus one-minus-p, and the maximum occurs at one half → recognizing and comparing instances of Binary entropy function, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions

Applied / In Practice¶

An applied instance preserves the same invariant under a changed notation, scale, implementation, or empirical setting. The applied case qualifies only because the same invariant and boundary test remain literal under changed parameters or implementation. The applied case is not licensed merely by vocabulary. It qualifies because the same recognition test—type the carrier, state every parameter and convention in the definition, test that p lies in the unit interval, the log base fixes the information unit, endpoint limits are used, symmetry holds under p versus one-minus-p, and the maximum occurs at one half, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases—can be run and because the same failure boundary—the carrier is mistyped, the condition that p lies in the unit interval, the log base fixes the information unit, endpoint limits are used, symmetry holds under p versus one-minus-p, and the maximum occurs at one half fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test—remains meaningful.^[2] The case also shows why practical outputs should report assumptions, resolution, and uncertainty instead of a naked label.

Mapped back: declared instance → recognition test → boundary check → qualified use

Structural Tensions¶

T1: Axiomatic identity vs. operational recognition. The defining conditions may be exact while empirical or computational recognition is approximate. Neither pole can be removed without changing the analytical task. Diagnostic: Can the reviewer state both the exact condition and the evidence used to infer it?
T2: Local roles vs. global consequence. The mechanism is enacted through local relations, but the abstraction is usually valued for a global classification or prediction. Neither pole can be removed without changing the analytical task. Diagnostic: Does the claimed global result actually follow from the declared local conditions?
T3: Ideal form vs. finite representation. Theory states a clean invariant while data structures, measurements, or proofs expose only finite representations. Neither pole can be removed without changing the analytical task. Diagnostic: Would increasing resolution converge toward the same classification?
T4: Canonical convention vs. legitimate variants. A standard formulation supports communication, while variants may preserve the same core under changed assumptions. Neither pole can be removed without changing the analytical task. Diagnostic: Which role is invariant across variants, and which convention-specific conclusion changes?
T5: Compression vs. hidden assumptions. The name compresses a complex argument but can conceal prerequisites. Neither pole can be removed without changing the analytical task. Diagnostic: Can each downstream inference be traced to an explicit assumption?
T6: Autonomous residual vs. reduction to catalog neighbors. The candidate uses broader structures but adds an identity-bearing residual. Neither pole can be removed without changing the analytical task. Diagnostic: After subtracting the proposed parent and named neighbors, does the constitutive residual still support independent diagnostics?

Structural–Framed Character¶

The entry is structurally mixed but domain-framed. Its portable skeleton is type the carrier, apply the defining mechanism of Binary entropy function, preserve its invariant, and derive only consequences licensed by the stated boundary. Its identity-bearing terms—Binary entropy function, carrier, parameter, invariant, boundary, evidence, model, transformation, and application—derive their meaning from information theory and cannot be replaced by generic systems language without losing the tests that distinguish valid from invalid instances.

This mixed character explains why the abstraction is reusable inside the domain yet does not meet the Prime bar. The structure organizes reasoning, but its claims still depend on domain-specific objects, evidence, and intervention semantics.

Structural Core vs. Domain Accent¶

The structural core consists of a carrier, Expected self-information from the two outcomes produces a symmetric concave curve, zero at deterministic endpoints and maximal at the unbiased probability., a recognition invariant, and a consequence. That skeleton may resemble patterns elsewhere, especially type the carrier, apply the defining mechanism of Binary entropy function, preserve its invariant, and derive only consequences licensed by the stated boundary. The domain accent is not decorative: Binary entropy function, carrier, parameter, invariant, boundary, evidence, model, transformation, and application determine what counts as an admissible carrier, a valid transition, and successful evidence.

The abstraction therefore remains domain-specific. A cross-domain reuse that preserves only words such as 'balance,' 'cut,' 'sequence,' 'loss,' or 'simulation' is metaphor. Literal transfer requires the original role structure and diagnostics, which in this case remain anchored in information theory.

This entry is a kind of Uncertainty.

It remains its own entry because p lies in the unit interval, the log base fixes the information unit, endpoint limits are used, symmetry holds under p versus one minus p, and the maximum occurs at one half.

Relationships to Other Abstractions¶

Current abstraction Binary entropy function Domain-specific

Parents (1) — outgoing typed relations

Binary entropy function is a kind of Uncertainty Prime

What makes it its own entry: the domain-specific identity determined by p lies in the unit interval, the log base fixes the information unit, endpoint limits are used, symmetry holds under p versus one-minus-p, and the maximum occurs at one half.

Hierarchy path (1) — routes to 1 parentless root

Binary entropy function → is a kind of Uncertainty

Neighborhood in Abstraction Space¶

Binary entropy function sits in a crowded region of the domain-specific corpus (11^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Information Theory & Error-Correcting Codes (20 abstractions)

Nearest neighbors

Min-entropy — 0.94
Information dimension — 0.94
Asymptotic equipartition property — 0.92
Typical set — 0.92
Directed information — 0.91

Computed from structural-signature embeddings · 2026-10-25

Not to Be Confused With¶

Bernoulli variance. Both peak at one half and vanish at endpoints, but Bernoulli variance measures squared dispersion while binary entropy measures expected logarithmic surprise.
One canonical example. An instance demonstrates the structure but does not define the whole abstraction.
Measurement or implementation of Binary entropy function. A proxy or realization is evidence for the abstraction, not the abstraction itself.
Generalized Binary entropy function. An extension qualifies only when its changed axioms and retained invariant are stated.

References¶

[1] Source cited in the frozen article, 'Bounds for entropy and divergence for distributions over a two-element set', JIPAM. Journal of Inequalities in Pure & Applied Mathematics, 2001.not authoritative registry ↩a ↩b

[2] Claude E. Shannon, A Mathematical Theory of Communication, Bell System Technical Journal 27, 1948. people.math.harvard.edu registry ↩a ↩b

[3] Thomas M. Cover and Joy A. Thomas, Elements of Information Theory, 2^nd edition, Wiley, 2006. registry ↩