AFTD Auto-Formalizing Theoretical Domains

matroid_tutte_eval

def

The real-valued evaluation of the Tutte polynomial matroid_tutte_eval M x y : ℝ of a finite matroid M with instance [M.Finite] at real numbers x and y, defined as the sum over all subsets A of the ground set in M.ground_finite.toFinset.powerset of (x - 1) ^ (M.eRank.toNat - (M.eRk (A : Set α)).toNat) * (y - 1) ^ (A.card - (M.eRk (A : Set α)).toNat).

Statement

noncomputable def matroid_tutte_eval {α : Type*} (M : Matroid α) [M.Finite] (x y : ℝ) : ℝ
Defined in
arXiv:2610.27706, Eq. (3)
Verified
21 Oct 2026
Axioms
none listed
Used by 4
  • matroid_tauThe real-valued evaluation matroid_tau M : ℝ of the Tutte polynomial of a finite matroid M with instance [M.Finite], defined as…
  • matroid_tau_nonnegFor every finite matroid M, the Tutte evaluation T_M(1,1) is non-negative. (This is the number of bases of M, but here it is just the…
  • matroid_alpha_starThe real-valued evaluation matroid_alpha_star M : ℝ of the Tutte polynomial of a finite matroid M with instance [M.Finite], defined as…
  • matroid_alphaThe real-valued evaluation matroid_alpha M : ℝ of the Tutte polynomial of a finite matroid M with instance [M.Finite], defined as…

Read back from the Lean

Given a type α, a finite matroid M on α (via [M.Finite]), and real numbers x and y, matroid_tutte_eval M x y is the real number defined by the sum over all subsets A of the ground set of M (as a Finset α) of: (x - 1) ^ (M.eRank.toNat - (M.eRk A).toNat) * (y - 1) ^ (A.card - (M.eRk A).toNat) where M.eRank.toNat is the rank of M as a natural number, (M.eRk A).toNat is the rank of A as a natural number, A.card is the cardinality of A, the subtractions are natural number subtraction, and the powers are natural number exponentiation on ℝ.

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

/-- Evaluation of the Tutte polynomial of a finite matroid at real parameters (x, y). -/
noncomputable def matroid_tutte_eval {α : Type*} (M : Matroid α) [M.Finite] (x y : ℝ) : ℝ := ∑ A ∈ M.ground_finite.toFinset.powerset,
    (x - 1) ^ (M.eRank.toNat - (M.eRk (A : Set α)).toNat) *
    (y - 1) ^ (A.card - (M.eRk (A : Set α)).toNat)
See it in the graphDiscuss this resultChallenge it