AFTD Auto-Formalizing Theoretical Domains

satisfies_geodetic_c_condition

def

A sequence c : Fin d → ℕ satisfies the arithmetic geodetic condition for bound K if c(i) = 1 for all i with i.val + 1 < d, and c(i) ≤ K for the final index i with i.val + 1 = d.

Statement

def satisfies_geodetic_c_condition (d : ℕ) (c : Fin d → ℕ) (K : ℕ) : Prop
Defined in
arXiv:2611.05762, Sec. 4.2 & Sec. 4.3
Verified
05 Nov 2026
Axioms
none listed
Used by 2

Read back from the Lean

A definition stating that a natural number d, a sequence c : Fin d → ℕ, and a natural number K satisfy satisfies_geodetic_c_condition d c K if and only if both: 1. For every i : Fin d, if i.val + 1 < d (i.e., for all indices except the last), c i = 1. 2. For every i : Fin d, if i.val + 1 = d (i.e., for the last index), c i ≤ K.

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

/-- The arithmetic c-condition for K-geodeticity: c_j = 1 for all j < d-1 and c_{d-1} ≤ K. -/
def satisfies_geodetic_c_condition (d : ℕ) (c : Fin d → ℕ) (K : ℕ) : Prop := (∀ (i : Fin d), i.val + 1 < d → c i = 1) ∧ (∀ (i : Fin d), i.val + 1 = d → c i ≤ K)
See it in the graphDiscuss this resultChallenge it