partial_assignment_le
def
A partial assignment β is extended by γ (written β ≼ γ) if for every element e and boolean value b, β(e) = some b implies γ(e) = some b.
Statement
def partial_assignment_le {E : Type*} (β γ : E → Option Bool) : Prop
- Defined in
- scout/2610-40844-stochastic-minimum-spanning-tree-identification-with-binary.md:262
- Verified
- 06 Nov 2026
- Axioms
- none listed
- Used by 6
- mst_certificate_monotoneIf a partial realization β is an MST identification certificate for G (is_mst_certificate G β), and β is extended by γ…
- is_submodular_goal_functionA function g : (G.edgeSet → Option Bool) → ℕ is a submodular goal function with goal value Q for G if: g evaluates to 0 on the empty…
- spr_minimax_sign_deletion_monotonicityIn the sign-preservation-with-reuse game, the minimax value is monotone under adding existing signs: for every number n of ordered cells,…
- spr_minimax_sign_deletion_monotonicity_two_twoOn two cells with horizon two, the minimax value is monotone under sign deletion: for any boards b, b' : Fin 2 → Option Bool with…
- tree_submodular_goal_value_zeroFor every finite simple graph G on a vertex type V that is a tree (G.IsTree), the submodular goal value…
- spr_value_zero_monoAt horizon 0, the sign-preservation-with-reuse game value equals the sign count, which is monotone under sign deletion: if b' is a…
Read back from the Lean
Given a type E and two functions β, γ : E → Option Bool, partial_assignment_le β γ is defined as the proposition that for every e : E and every b : Bool, if β e = some b, then γ e = some b (i.e., γ extends β as a partial assignment).
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
/-- A partial assignment is extended by another if every defined edge value is preserved. -/ def partial_assignment_le {E : Type*} (β γ : E → Option Bool) : Prop := ∀ e b, β e = some b → γ e = some b