AFTD Auto-Formalizing Theoretical Domains

ccz_renyi_entropy

deforiginal

For a real order α and a simple graph G on a finite type V, ccz_renyi_entropy α G is the order-α Rényi entropy of the CCZ induced-edge distribution for α ≠ 1, and the Shannon (von Neumann) entropy when α = 1.

Statement

noncomputable def ccz_renyi_entropy {V : Type*} [Fintype V] [DecidableEq V]
    (α : ℝ) (G : SimpleGraph V) [DecidableRel G.Adj] : ℝ
Related work
arXiv:2610.01024
Verified
09 Nov 2026
Axioms
none listed
Built on 3
  • ccz_edge_distributionFor a simple graph G on a finite type V with decidable equality and decidable adjacency, and an edge subset F, ccz_edge_distribution G F…
  • shannon_entropyshannon_entropy P is the Shannon entropy of a discrete distribution P on a finite type Y, defined as ∑_y Real.negMulLog (P y).
  • renyi_entropyFor a real parameter α and a probability distribution P on a finite type Y, renyi_entropy α P is the Rényi entropy (log(∑_y P(y)^α)) / (1…

Read back from the Lean

Given a finite type V with decidable equality, a real parameter α : ℝ, and a simple graph G on V with decidable adjacency, ccz_renyi_entropy α G is defined as: * if α = 1, the Shannon entropy shannon_entropy of the edge distribution ccz_edge_distribution G; * if α ≠ 1, the Rényi entropy of order α (renyi_entropy α) of the edge distribution ccz_edge_distribution G.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The order-α Rényi entropy (or von Neumann entropy when α = 1) of the CCZ edge reduced state of G. -/
noncomputable def ccz_renyi_entropy {V : Type*} [Fintype V] [DecidableEq V]
    (α : ℝ) (G : SimpleGraph V) [DecidableRel G.Adj] : ℝ :=
  if α = 1 then
    shannon_entropy (ccz_edge_distribution G)
  else
    renyi_entropy α (ccz_edge_distribution G)
See it in the graphDiscuss this resultChallenge it