satisfies_geodetic_product_condition
def
A sequence c : Fin d → ℕ satisfies the geodesic product condition for bound K if for every index i : Fin d, the product of c(j) over all j ≤ i is at most K.
Statement
def satisfies_geodetic_product_condition (d : ℕ) (c : Fin d → ℕ) (K : ℕ) : Prop
- Defined in
- arXiv:2611.05762, Eq. (1) & Problem 9.2.1
- Verified
- 05 Nov 2026
- Axioms
- none listed
- Built on 2
- TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder.
- TotalPreorderA total preorder: a preorder where
- Used by 3
- 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…
- satisfies_geodetic_product_condition_const_oneFor any diameter d and any bound K ≥ 1, the constant sequence c = 1 satisfies the geodesic product condition for K.
Read back from the Lean
For a given dimension/length d : ℕ, a sequence c : Fin d → ℕ, and a bound K : ℕ, the property asserts that for every index i : Fin d, the product of c j over all j : Fin d with j ≤ i (the closed interval Finset.Iic i) is at most 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 geodesic product condition: for each distance index i, the product of c_j for j ≤ i is at most K. -/ def satisfies_geodetic_product_condition (d : ℕ) (c : Fin d → ℕ) (K : ℕ) : Prop := ∀ (i : Fin d), ∏ j ∈ Finset.Iic i, c j ≤ K