Set . Inductively, replace each component interval of by its two closed end intervals, each of length . The current component length is . Because , the removed central gap has positive length
This is a generalized Cantor set construction. The three required properties are checked in parts i, ii and iii.
The sets are closed, measurable, decreasing, and contained in , which has finite Lebesgue measure. By continuity from above of a measure,
This limit exists because is a bounded decreasing monotone sequence. To exclude a nondegenerate interval , note that its connectedness forces it into a single component interval of every : crossing two components would cross a removed gap. Its length would therefore be at most for every , which is impossible for a positive-length interval. Thus contains no nondegenerate interval, even when its Lebesgue measure is positive.
Near zero, , so is comparable to . The power integral test shows that the integral near zero is finite exactly when .
For the tail, proves integrability when . To prove necessity, take the disjoint intervals
On each, , and . Therefore with . The p-series diverges when , proving that the absolute tail integral diverges in that range.
Combining the two conditions,
For , the tail improper integral converges conditionally by the Dirichlet test for improper integrals, but that does not give Lebesgue integrability.
On , the integrand is bounded by one. For , , since every positive power grows faster than the natural logarithm. Thus eventually. The comparison test for integrals proves Lebesgue integrability.
To prove joint continuity, fix with both coordinates positive. In a sufficiently small parameter rectangle, and . For every parameter pair in this rectangle,
The first argument shows that is integrable. Along any parameter sequence tending to , the integrands converge pointwise, and the same dominates their eventual tail. The dominated convergence theorem gives . The sequential criterion for continuity proves the required joint continuity throughout the positive quadrant.
For comparison, the change of variables identifies the value with a gamma function:
The domination argument establishes continuity directly, without needing a separate theorem about parameter dependence of the gamma function.
Extend the integrand by zero to all of :
For each fixed , eventually the indicator function is one and . Hence pointwise. On its support, , so for gives
The final bound is Lebesgue integrable on and independent of . The dominated convergence theorem therefore gives
The last integral follows from the antiderivative .
Use the standard deterministic channel encoder and channel decoder, with message labels and code rate . The Fano's inequality hint printed here replaces by , which is false in general: take uniform on and in the common alphabet . The error probability is one and its binary entropy is zero, so the proposed bound asserts . The correct Fano's inequality alone gives , which does not immediately give the requested additive . The following erasure-pattern counting bound for maximal decoding error proves the displayed claim directly.
The case is immediate because . Suppose , put , and let be the message that the channel decoder returns on the all-erased output. Choose uniformly among the other messages. Every one of these messages is decoded correctly with probability at least , by the assumed maximal decoding error probability bound.
Let be the random set of unerased coordinates and . For each fixed with , at most output words are possible. A deterministic channel decoder can correctly identify at most one message per output word, so its conditional success probability, averaged over these messages, is at most . When , success is zero because was excluded.
For every integer ,
If , this is immediate. If , write . The elementary inequality for gives
where the middle inequality is . This proves the needed scalar bound.
Taking the expectation over erasure patterns, and using , yields
Consequently the requested bound is valid:
The use of maximal decoding error probability matters: excluding one message preserves the lower bound on success. The deterministic channel decoder convention also matters; allowing independent randomized guessing would invalidate this particular finite-length claim at .
The specified transition law is a binary erasure channel. For an input bit with , its Shannon entropy is the binary entropy . A non-erased output determines , whereas the erasure symbol leaves its probability distribution unchanged because the erasure event is independent of . Thus
Maximizing the mutual information over the input probability distribution, with equality at , gives
This includes , a noiseless binary channel, and , a completely erased channel with zero channel capacity.
First, the binary translation of a quaternary prefix code is still a prefix code: every translated codeword length is even, and a binary prefix relation would split into complete two-bit blocks, giving a prefix relation between the original quaternary codewords. Binary Huffman coding is optimal among binary prefix codes, so
For the other direction, let and round these binary codeword lengths to quaternary lengths . The Kraft inequality gives
The quaternary converse of the Kraft inequality supplies a quaternary prefix code with lengths . Optimality of the quaternary Huffman code then implies
Thus binary translation of an optimal quaternary code costs at most one extra bit per source symbol:
The quaternary Huffman code uses the usual adjustment of adding zero-weight dummy leaves when needed. If the alphabet has one symbol, both optimal codes may use the empty codeword, giving the trivial endpoint.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact