§3.2, Lemma lerP
ProvedQAlgorithms.Papers.Independent.Dependency50.P27.lerPLet be a discrete totally ordered integral domain, with order compatible with its ring operations. For , the indexed comparison view has constructors from at and from at . The simultaneous Boolean comparisons satisfy
This supplies the source's dependent two-branch comparison view. At equality the first constructor applies.
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P27
namespace QAlgorithms.Papers.Independent.Dependency50.P27
noncomputable section
open Polynomial
/-- Source PDF p. 13, lerP, with the displayed constructor indices. -/
theorem lerP {R : Type*} [CommRing R] [IsDomain R]
[LinearOrder R] [IsStrictOrderedRing R] (x y : R) :
LerXorGtr x y (decide (x ≤ y)) (decide (y < x)) := by sorry
end
end QAlgorithms.Papers.Independent.Dependency50.P27
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every commutative integral domain equipped with a linear order making it a strictly ordered ring, and every , let be the Boolean truth value of and the Boolean truth value of . The theorem asserts that either with , or with . These are precisely the two permitted cases of the defined indexed proposition; neither pair with equal Boolean entries is permitted. Equality is included in the first case.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.