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).

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.

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) — more general patterns this builds on

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 → Channel Capacity

Neighborhood in Abstraction Space¶

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

Family — Unclustered & Miscellaneous (309 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-07-12