AFTD Auto-Formalizing Theoretical Domains

dephased_tree_entropy

def

For a finite simple graph T on vertex type V, noise profile q : V → ℝ, and subset S : Finset V, dephased_tree_entropy T q S is |S| - d_S - ∑_χ P_S(χ) log_2(P_S(χ)) with 0 log 0 = 0, where d_S = tree_submatrix_dim T S and P_S(χ) = dephased_tree_prob T q S χ.

Statement

noncomputable def dephased_tree_entropy {V : Type*} [Fintype V] [DecidableEq V]
    (T : SimpleGraph V) [DecidableRel T.Adj] (q : V → ℝ) (S : Finset V) : ℝ
Defined in
Fuentes et al., arXiv:2511.19585; OP-827
Verified
02 Nov 2026
Axioms
none listed
Built on 3
  • tree_submatrix_kerFor a finite simple graph T on vertex type V and a subset S : Finset V, tree_submatrix_ker T S is the kernel over ZMod 2 of the submatrix…
  • tree_submatrix_dimFor a finite simple graph T on vertex type V and a subset S : Finset V, tree_submatrix_dim T S is the dimension (finrank) over ZMod 2 of…
  • dephased_tree_probFor a finite simple graph T on vertex type V, a noise parameter function q : V → ℝ, a subset S : Finset V, and an additive character χ :…
Used by 1
  • dephased_tree_tripartite_infoFor a finite simple graph T on vertex type V, noise profile q : V → ℝ, and subsets A, B, C : Finset V, dephased_tree_tripartite_info T q A…

Read back from the Lean

The definition dephased_tree_entropy assigns a real number to a finite type V (with decidable equality), a simple graph T on V (with decidable adjacency), a vertex weight function q : V → ℝ, and a finite subset S : Finset V. The value is defined as: |S| - dim - ∑ χ, (if p(χ) = 0 then 0 else p(χ) * log₂ p(χ)) where: 1. dim is tree_submatrix_dim T S, the dimension (as a vector space over ZMod 2) of the kernel tree_submatrix_ker T S of the linear map (S → ZMod 2) →ₗ[ZMod 2] (Sᶜ → ZMod 2) given by the submatrix of the adjacency matrix of T (over ZMod 2) with rows indexed by Sᶜ (the complement of S in V) and columns indexed by S. 2. The summation is over all additive characters χ : AddChar (tree_submatrix_ker T S) ℝ (group homomorphisms from the additive group of the kernel to the multiplicative reals). 3. For each character χ, p(χ) is dephased_tree_prob T q S χ, defined by: p(χ) = (1/2)^dim * ∑ x : tree_submatrix_ker T S, (χ x * ∏ i ∈ S with x(i) = 1, q i). 4. log₂ is the base-2 logarithm (Real.logb 2). In other words, it computes |S| - dim + H, where H = - ∑_χ p(χ) log₂ p(χ) is the Shannon entropy (with the convention 0 log₂ 0 = 0) of the distribution given by dephased_tree_prob.

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

/-- Subsystem von Neumann entropy of an inhomogeneously dephased tree graph state. -/
noncomputable def dephased_tree_entropy {V : Type*} [Fintype V] [DecidableEq V]
    (T : SimpleGraph V) [DecidableRel T.Adj] (q : V → ℝ) (S : Finset V) : ℝ := open scoped Classical BigOperators in
  (S.card : ℝ) - (tree_submatrix_dim T S : ℝ) -
    ∑ χ : AddChar (tree_submatrix_ker T S) ℝ,
      let p := dephased_tree_prob T q S χ
      if p = 0 then 0 else p * Real.logb 2 p
See it in the graphDiscuss this resultChallenge it