AFTD Auto-Formalizing Theoretical Domains

is_positive_orthogonality_measure

def

For N : ℕ, a polynomial sequence R : ℕ → Polynomial ℝ, a finite set S : Finset ℝ, and a weight function w : ℝ → ℝ, is_positive_orthogonality_measure N R S w holds if w(x) > 0 for all x ∈ S, for all i ≤ N and j ≤ N with i ≠ j the sum over x ∈ S of w(x) * (R i).eval x * (R j).eval x is 0, and for all i ≤ N the sum over x ∈ S of w(x) * ((R i)(x))^2 is strictly positive.

Statement

def is_positive_orthogonality_measure (N : ℕ) (R : ℕ → Polynomial ℝ)
    (S : Finset ℝ) (w : ℝ → ℝ) : Prop
Defined in
arXiv:2611.01561, Lemma 2.1
Verified
07 Nov 2026
Axioms
none listed

Read back from the Lean

is_positive_orthogonality_measure N R S w defines a predicate on a natural number N, a sequence of real polynomials R : ℕ → Polynomial ℝ, a finite set of real numbers S : Finset ℝ, and a weight function w : ℝ → ℝ. It asserts the conjunction of three conditions: 1. For every x ∈ S, w x > 0. 2. For all i ≤ N and j ≤ N, if i ≠ j, then $\sum_{x \in S} w(x) \cdot R_i(x) \cdot R_j(x) = 0$. 3. For all i ≤ N, $\sum_{x \in S} w(x) \cdot (R_i(x))^2 > 0$.

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

/-- Predicate asserting that a weight function w on a finite set S is a positive orthogonality measure for a polynomial sequence R up to degree N. -/
def is_positive_orthogonality_measure (N : ℕ) (R : ℕ → Polynomial ℝ)
    (S : Finset ℝ) (w : ℝ → ℝ) : Prop := (∀ x ∈ S, 0 < w x) ∧
  (∀ i ≤ N, ∀ j ≤ N, i ≠ j →
    ∑ x ∈ S, w x * (R i).eval x * (R j).eval x = 0) ∧
  (∀ i ≤ N,
    0 < ∑ x ∈ S, w x * ((R i).eval x) ^ 2)
See it in the graphDiscuss this resultChallenge it