Box intersected with the ordered simplex
DefinitionLL_Decomp587j_domainFor and vectors , indexed by , the set of that are monotone, meaning whenever , and satisfy for every .
import Mathlib
open Real Set MeasureTheory
open scoped Classical
namespace LL_Decomp587j
def domain {n : ℕ} (lo hi : Fin n → ℝ) : Set (Fin n → ℝ) :=
{x | Monotone x ∧ ∀ j, lo j ≤ x j ∧ x j ≤ hi j}
end LL_Decomp587jRead-back
What the Lean code literally says, in plain math · claude-haiku
Read-back of LL_Decomp587j.domain
This is a definition of a subset of . For a natural number and two vectors (coordinates indexed by ), it defines
The first condition, Lean Monotone x, is non-decreasing order: consecutive coordinates may be equal. It is not strict. The second condition is a coordinatewise box constraint with lower bound and upper bound , both inclusive.
Notes for the auditor: the definition imports nothing beyond Mathlib, and it unfolds no other custom definition. The set is empty whenever some , because then no satisfies both bounds. For the coordinate space has one point and the monotonicity condition is vacuous, so the set is that single point. The set is not all of the box, since the monotonicity restriction cuts it down to the nondecreasing tuples inside the box. No concern of vacuity or triviality was found beyond the empty-box case, which is the expected behaviour of such a box.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.