§1.2 (1.8): classical smoothed max-entropy AEP
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.classical_smooth_aepLet be a probability law on a finite nonempty alphabet . A code consists of an encoder into an alphabet of symbols and a decoder, and its error is the probability of recovering the wrong source symbol. Logs are binary, and is Shannon entropy. Introductory smooth max-entropy minimizes the order- Rényi entropy over normalized probability laws within variational distance .
For iid finite sources and fixed 0<εprime<1, normalized-distribution variational smoothing of the classical order-1/2 entropy has (1/n)Hmax^εprime(X^n)→H(Y).
This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
noncomputable section
open Filter
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P07
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J A B C D X Y Z : Type*}
variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]
variable [Fintype Z] [DecidableEq Z]
/-- NODE paper:1504.00233#1.classicalaep
§1.2 (1.8): classical smoothed max-entropy AEP, arXiv:1504.00233v5, PDF p.14. -/
theorem classical_smooth_aep [Nonempty X] (p : X → ℝ) (hp : paperProbability p) (e : ℝ) (he : 0 < e) (he1 : e < 1) :
Tendsto (fun n : ℕ => introSmoothMax (iidLaw p n) e/(n:ℝ)) atTop (nhds (paperShannon p)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite nonempty type, with decidable equality, let satisfy and , and fix . For any probability function on a finite type, define
With on , the real sequence converges, as natural , to . The smoothing radius remains the fixed number before division by . The sequence is also defined at , using the empty product and the convention that real division by zero is zero; the scalar logarithm also takes value zero at zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.