How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The finite wiretap auxiliary has cardinality at most |X|
Statement
For every finite joint law on a finite wiretap channel with input alphabet , where means , there is another finite auxiliary with whose value of is at least . Consequently
is a maximum and may be restricted to . For each input law , the single-letter objective is continuous on the finite probability simplex.
Facts & Assumptions
Given: A finite wiretap channel, a finite auxiliary , and a joint law with the stated Markov factorization.
Finite discrete memoryless wiretap channel and code model: the input alphabet and both output alphabets are finite; conditional on , the marginals and use the finite DMCs and .
Finite mutual information: mutual information is the finite joint-law KL sum in nats.
Finite entropy and mutual-information chain rules: for finite variables.
Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line: every closed bounded subset of finite-dimensional Euclidean space , , is compact.
A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value: a continuous real-valued function on a nonempty compact metric space attains its maximum.
Proof
If , then is constant and both mutual informations in the objective are zero, so suffices. Assume . For a probability vector on , let By [F2]–[F4] and the finite entropy identity in [F3], The maps and are finite linear maps. On , set ; [F5] gives . Hence extends continuously to with value , so finite entropy and are continuous on the simplex .
Write , , and , omitting zero-mass . The chain rule [F3] gives Indeed, expanding the right side by the entropy formula in step 1.1 leaves ; the linear conditional-on- terms cancel because , and the remaining expression is the left side.
Suppose the current posterior mixture has positive weights. The vectors lie in , so there are coefficients , not all zero, with and for . Since each sums to one, the same relation holds for the last coordinate . The coefficients include both signs. Therefore the weights remain nonnegative on a bounded interval with ; at either endpoint at least one weight is zero, while the total weight and posterior average stay fixed. The average is affine in , so at least one endpoint has : otherwise zero, a convex combination of and , would have a smaller value than both endpoints. Choose that endpoint and delete its zero weights. This keeps fixed and does not decrease the wiretap objective in step 2.1.
Repeating step 3.1 finitely many times reduces any finite auxiliary to at most positive weights, preserving and not decreasing . Thus every finite auxiliary is dominated by one with .
The parameter space of weights and posterior laws is a nonempty closed bounded subset of , since it is described by finitely many coordinate inequalities and coordinate-sum equalities. It is compact by [F6]. By step 1.1 the objective is continuous there, including zero weights, so it attains a maximum by [F7]. Step 4.1 shows this maximum equals the supremum over all finite auxiliaries.
Depends on
- Finite discrete memoryless wiretap channel and code model
- Finite mutual information
- Finite entropy and mutual-information chain rules
- Finite distributions, entropy, divergence, and stochastic matrices
- The natural logarithm is bounded above by its positive argument minus one
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value
Used by
Dependency tree · two levels
58 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Abbas El Gamal and Young-Han Kim, Network Information Theory, arXiv:1001.3404v3 (standard reference, not scraped)
- Paul Cuff, Princeton ELE 538: Information Theoretic Security, Lecture 12 (standard reference, not scraped)