AFTD Auto-Formalizing Theoretical Domains

dephased_tree_prob

def

For a finite simple graph T on vertex type V, a noise parameter function q : V → ℝ, a subset S : Finset V, and an additive character χ : AddChar (tree_submatrix_ker T S) ℝ, dephased_tree_prob T q S χ is 2^(-d_S) * ∑_{x ∈ K_S} χ(x) * ∏_{i ∈ S, x_i = 1} q(i), where d_S = tree_submatrix_dim T S.

Statement

noncomputable def dephased_tree_prob {V : Type*} [Fintype V] [DecidableEq V]
    (T : SimpleGraph V) [DecidableRel T.Adj] (q : V → ℝ) (S : Finset V)
    (χ : AddChar (tree_submatrix_ker T S) ℝ) : ℝ
Defined in
Fuentes et al., arXiv:2511.19585; OP-827
Verified
02 Nov 2026
Axioms
none listed
Built on 2
  • 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…
Used by 1
  • dephased_tree_entropyFor 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 -…

Read back from the Lean

dephased_tree_prob defines a real number given: - a finite type V with decidable equality, - a simple graph T on V with decidable adjacency, - a weight function q : V → ℝ, - a vertex subset S : Finset V, - an additive character χ : AddChar (tree_submatrix_ker T S) ℝ. The value is computed as: $(1/2)^{\dim_{\mathbb{F}_2} \ker(A_{S^c, S})} \sum_{x \in \ker(A_{S^c, S})} \left( \chi(x) \cdot \prod_{i \in S, x_i = 1} q(i) \right)$, where: - $A_{S^c, S}$ is the submatrix of the $\mathbb{F}_2$-adjacency matrix of $T$ with rows indexed by the complement $S^c$ and columns indexed by $S$, - $\ker(A_{S^c, S})$ is the kernel of this matrix over $\mathbb{F}_2 = \mathbb{Z}/2\mathbb{Z}$ (viewed as a subspace of $\mathbb{F}_2^S$), - $\dim_{\mathbb{F}_2} \ker(A_{S^c, S})$ is its dimension as an $\mathbb{F}_2$-vector space, - the inner product is over all elements $i \in S$ for which the coordinate $x_i = 1 \in \mathbb{Z}/2\mathbb{Z}$.

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

/-- Probability of character chi under local Z noise on tree graph state subsystem S. -/
noncomputable def dephased_tree_prob {V : Type*} [Fintype V] [DecidableEq V]
    (T : SimpleGraph V) [DecidableRel T.Adj] (q : V → ℝ) (S : Finset V)
    (χ : AddChar (tree_submatrix_ker T S) ℝ) : ℝ := open scoped Classical BigOperators in
  (1 / 2 : ℝ) ^ (tree_submatrix_dim T S) *
    ∑ x : tree_submatrix_ker T S,
      χ x * ∏ i ∈ Finset.univ.filter (fun (i : ↥S) => x.1 i = 1), q (i : V)
See it in the graphDiscuss this resultChallenge it