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
- geodetic_c_condition_iff_product_condition_twoLet d ≥ 1 and let c : Fin d → ℕ be a monotone nondecreasing sequence with c(0) = 1. Then c satisfies the geodesic product condition for K…
- geodetic_c_condition_iff_product_condition_threeLet d ≥ 1 and let c : Fin d → ℕ be a monotone nondecreasing sequence with c(0) = 1. Then c satisfies the geodesic product condition for K…
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)