Hartley's Law¶

Fix the maximum information a noiseless bandwidth-limited channel can carry as H = 2WT·log₂(M) — the product of a linear sample-rate factor (bandwidth) and a logarithmic resolution factor (distinguishable signal levels).

Version: v3 · 2026-09-28 · History
Domain-specific #: 490
Domain group: Applied Sciences & Engineering
Origin domain: Computer Science & Software Engineering
Subdomains: Information Technology, Channel Capacity and Signalling → Computer Science & Software Engineering

Core Idea¶

Hartley's law states that the maximum information a noiseless bandwidth-limited channel can carry in time T is H = 2WT·log₂(M) bits, where W is bandwidth and M is the number of distinguishable signal levels. A bandwidth-W channel carries 2W samples per second (Nyquist), and each sample selecting among M levels encodes log₂(M) bits, so capacity is their product — a hard ceiling with a linear rate factor and a logarithmic resolution factor.

How would you explain it like I'm…

The Flashing Light Limit

Imagine sending messages by flashing a light. You can only flash so many times each second, and you can only tell apart so many different brightness levels. Hartley's law says those two limits together set the most message you can send. Going faster helps a lot, but adding more brightness levels helps only a little.

Speed Times Levels Rule

Hartley's law is about the most information you can send through a channel, like a wire or radio, if there is no noise. Two things set the limit: how many signals per second the channel can carry (set by its bandwidth) and how many different levels each signal can have. The more levels, the more bits each signal holds, but doubling the levels adds only one bit per signal. Doubling the bandwidth, though, doubles how many signals you send. So there is always a hard ceiling on how much you can send.

Noiseless Channel Capacity Bound

Hartley's law, from Ralph Hartley in 1928, says a noiseless channel with bandwidth W hertz can carry at most H = 2WT·log₂(M) bits in time T, where M is the number of distinguishable signal levels. The factor 2W comes from the Nyquist rate, the maximum number of independent samples per second. Each sample chooses among M levels, so it carries log₂(M) bits. Capacity therefore has a hard ceiling made of two independent factors, sample rate and resolution. Resolution enters only logarithmically, so doubling M adds one bit per sample while doubling W doubles the rate. Shannon later replaced log₂(M) with log₂(1 + S/N) to handle noise.

Hartley's law states that a noiseless, band-limited channel can carry at most H = 2WT·log2(M) bits in time T. Here W is the bandwidth in hertz and M is the number of distinguishable signal levels. It rests on the Nyquist rate: a channel of bandwidth W supports 2W independent samples per second, and each M-ary sample conveys log2(M) bits. Its two structural commitments are a hard upper bound on capacity and two independent factors behind it, the spectral resource W and the amplitude resolution M. The resolution factor enters logarithmically, so doubling M adds one bit per sample, whereas doubling W doubles the sample rate. This asymmetry means that higher-order modulation, such as moving from BPSK to QPSK to 16-QAM to 256-QAM, increases capacity only logarithmically, while widening bandwidth increases it linearly. Hartley's law is the noiseless precursor of the Shannon-Hartley theorem, which substitutes log2(1 + S/N) for log2(M) to handle additive Gaussian noise and keeps the bandwidth-times-log structure.

Scope of Application¶

The formula applies literally wherever its precondition holds: a noiseless bandwidth-limited channel carrying information through M distinguishable signal levels.

Telecommunications capacity budgets — copper, coaxial, fibre, and wireless link design.
Modem and Wi-Fi standards — throughput raised by bandwidth widening or higher-order QAM.
Spectrum-allocation policy — bandwidth dependence underwrites the value of frequency bands.
Discrete-alphabet coding intuition — the log-of-levels factor supplies bit-counting for any signalling alphabet.
Information-theory pedagogy — the noiseless skeleton taught before the noisy Shannon–Hartley extension.
Channel-based substrates generally — wireline, wireless, optical, and storage channels, exact in each.

Clarity¶

The law makes information capacity a bounded quantity rather than an open-ended one, shifting the question from "how do we push more through?" to "what is this channel's ceiling, and which factor is binding?" It decomposes that ceiling into two independent contributions — sample rate (from bandwidth) and per-sample resolution (from M) — and exposes their asymmetry: bandwidth enters linearly, M only logarithmically.

Manages Complexity¶

Without the law, a channel's throughput is entangled with its whole apparatus — modulation, pulse shapes, coding, spectrum — reasoned through afresh for each substrate. Hartley collapses that sprawl to a single closed form governed by two factors: track only W and M, read the ceiling off their product, and exclude every "beat-the-capacity" scheme without examination.

Abstract Reasoning¶

The law licenses boundary-drawing — reading H = 2WT·log₂(M) as an impossibility result that rejects capacity-beating proposals on sight. It supports diagnostic factoring — attributing a throughput shortfall to whichever factor is binding. And it enables interventionist prediction — comparing widening bandwidth against raising modulation order via the linear-versus-logarithmic asymmetry.

Knowledge Transfer¶

As a theorem, Hartley's law transfers by direct instantiation: it applies exactly to any bandwidth-limited channel with well-defined levels — wireline, wireless, optical, storage — and the Shannon–Hartley extension inherits its skeleton by substituting log₂(1 + S/N) for log₂(M). Beyond communications, the genuinely portable content is not this formula but its structural parent — a bounded capacity that factors into rate × log-resolution — which recurs in working memory, psychophysics, and measurement.

Relationships to Other Abstractions¶

Current abstraction Hartley's Law Domain-specific

Parents (1) — outgoing typed relations

Hartley's Law is a kind of Channel Capacity Prime

Hartley's Law is Channel Capacity specialized to a noiseless bandwidth-limited channel whose ceiling is the product of signaling opportunities and the logarithm of distinguishable levels.

Hierarchy path (1) — routes to 1 parentless root

Hartley's Law → is a kind of Channel Capacity

Neighborhood in Abstraction Space¶

Hartley's Law sits in a sparse region of the domain-specific corpus (74^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2769 abstractions)

Nearest neighbors

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