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.
A nonstationary independent source with no entropy-rate limit
Example
Constructs independent binary coordinates whose block entropy per symbol has subsequences tending to zero and one by alternating super-exponentially long deterministic and fair-coin blocks.
Facts & Assumptions
Given: Independent binary variables and finite-block entropy as in Finite-block information and entropy in bits.
Finite-block information and entropy in bits: entropy is computed from the finite joint law.
Information rate of a general finite-alphabet process: a general process need not be stationary, and its block information rate is defined by the limit of when it exists.
Verification
Given: The independent coordinates and block convention below.
Partition the coordinates into consecutive blocks of lengths for . In odd-numbered blocks set deterministically; in even-numbered blocks let the be fair independent bits. Independence gives the block law . Expanding its finite entropy sum over positive-probability words and using yields since each other coordinate probability sums to one. Thus the entropy contribution is zero on odd blocks and one bit per coordinate on even blocks.
Let be the endpoint of block . For , , so Thus the previous blocks contribute a vanishing fraction of . Therefore along odd and tends to along even . The block entropy per symbol has no limit, so the process has no entropy rate in the sense of [F2].
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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
- Robert M. Gray, Entropy and Information Theory, corrected edition (standard reference, not scraped)