AFTD Auto-Formalizing Theoretical Domains

is_p_star_kappa

def

A square real matrix M belongs to the class P*(κ) for a parameter κ ≥ 0 if for all x, the sum (1 + 4κ) ∑_{i: x_i (Mx)_i > 0} x_i (Mx)_i + ∑_{i: x_i (Mx)_i < 0} x_i (Mx)_i is nonnegative.

Statement

def is_p_star_kappa (n : ℕ) (M : Matrix (Fin n) (Fin n) ℝ) (κ : ℝ) : Prop
Defined in
arXiv:2611.07815 Section 1 (equation 1)
Verified
06 Nov 2026
Axioms
none listed
Used by 5
  • p_star_transpose_handicap_invarianceFor every natural number n and every real n-by-n matrix M indexed by Fin n in the class P*, its transpose M.transpose belongs to the class…
  • identity_is_p_starFor every dimension n : ℕ, the n-by-n real identity matrix indexed by Fin n belongs to the class P*.
  • identity_is_p_star_zeroFor every dimension n, the n-by-n real identity matrix belongs to P*(0).
  • handicap_numberThe handicap number of a matrix M is the infimum of all κ ≥ 0 such that M belongs to P*(κ).
  • is_p_starA real n-by-n matrix M indexed by Fin n belongs to the class P* if there exists a real number κ ≥ 0 such that is_p_star_kappa n M κ holds.

Read back from the Lean

For a natural number $n$, an $n \times n$ real matrix $M$, and a real number $\kappa$, is_p_star_kappa n M κ asserts that: 1. $0 \le \kappa$, and 2. For every vector $x \in \mathbb{R}^n$, $$0 \le (1 + 4\kappa) \sum_{\substack{i \in \{0, \dots, n-1\} \\ x_i (Mx)_i > 0}} x_i (Mx)_i + \sum_{\substack{i \in \{0, \dots, n-1\} \\ x_i (Mx)_i < 0}} x_i (Mx)_i$$ where $(Mx)_i = \sum_{j \in \text{Fin } n} M_{i, j} x_j$ is the $i$-th component of the matrix-vector product $Mx$.

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

/-- A square real matrix belongs to P*(κ) if (1 + 4κ) times its positive coordinate products plus its negative coordinate products is nonnegative for all vectors. -/
def is_p_star_kappa (n : ℕ) (M : Matrix (Fin n) (Fin n) ℝ) (κ : ℝ) : Prop := 0 ≤ κ ∧ ∀ x : Fin n → ℝ,
    0 ≤ (1 + 4 * κ) * (∑ i ∈ Finset.univ.filter (fun i => 0 < x i * (Matrix.mulVec M x) i), x i * (Matrix.mulVec M x) i) +
      (∑ i ∈ Finset.univ.filter (fun i => x i * (Matrix.mulVec M x) i < 0), x i * (Matrix.mulVec M x) i)
See it in the graphDiscuss this resultChallenge it