AFTD Auto-Formalizing Theoretical Domains

submodular_base_polytope

def

The base polytope B(f) of a set function f on Finset (Fin m) is the set of vectors z in ℝ^m such that the sum of z over every subset S is at most f(S), and the total sum over all coordinates equals 1.

Statement

def submodular_base_polytope {m : ℕ} (f : Finset (Fin m) → ℝ) : Set (Fin m → ℝ)
Defined in
arXiv:2610.35433:220
Verified
31 Oct 2026
Axioms
none listed
Used by 3
  • observable_upper_bound_base_polytopeFor any vector a whose values are sorted non-decreasingly by permutation π, and any point z in the base polytope of C, the inner product ∑…
  • thermally_reachable_subset_base_polytopeFor any surjective block-assignment map proj : Fin n → Fin m and vectors γ, x : Fin n → ℝ, thermally_reachable_block_populations proj γ x…
  • target_population_le_capacityFor any natural number n, target population vector y in stdSimplex ℝ (Fin n), Gibbs vector γ in stdSimplex ℝ (Fin n) with strictly…

Read back from the Lean

For a given natural number m and a function f : Finset (Fin m) → ℝ, submodular_base_polytope f is defined as the set of all functions z : Fin m → ℝ satisfying: 1. For every finite subset S ⊆ Fin m, ∑_{k ∈ S} z(k) ≤ f(S), and 2. The total sum over all k : Fin m of z(k) equals 1.

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 base polytope B(f) of a normalized set function consists of vectors whose subset sums are bounded by f and whose grand total is 1. -/
def submodular_base_polytope {m : ℕ} (f : Finset (Fin m) → ℝ) : Set (Fin m → ℝ) := { z | (∀ S : Finset (Fin m), ∑ k ∈ S, z k ≤ f S) ∧ ∑ k : Fin m, z k = 1 }
See it in the graphDiscuss this resultChallenge it