Compatibility of source Euclidean states and recorded checks with the original analytic execution.
@[instance_reducible]
Classical proposition decisions used locally in the source semantics proof.
Equations
Instances For
theorem
V7.Stage1E03.minimizer_gradient_zero
{d : ℕ}
{x0 : Point d}
(inst : PositiveInstance 2 d x0)
{xstar : Point d}
(hxstar : xstar ∈ MinimizerSet inst.oracle)
:
noncomputable def
V7.Stage1E03.legacyInstance
{d : ℕ}
{x0 : Point d}
(inst : PositiveInstance 2 d x0)
(eps : ℝ)
(heps : 0 < eps)
(hG : eps < lpNorm 2 (inst.oracle.gradient x0))
:
The current positive instance expressed in the original admissible-instance interface.
Equations
- One or more equations did not get rendered due to their size.
Instances For
@[simp]
theorem
V7.Stage1E03.legacyInstance_oracle
{d : ℕ}
{x0 : Point d}
(inst : PositiveInstance 2 d x0)
(eps : ℝ)
(heps : 0 < eps)
(hG : eps < lpNorm 2 (inst.oracle.gradient x0))
:
@[simp]
theorem
V7.Stage1E03.legacyInstance_L
{d : ℕ}
{x0 : Point d}
(inst : PositiveInstance 2 d x0)
(eps : ℝ)
(heps : 0 < eps)
(hG : eps < lpNorm 2 (inst.oracle.gradient x0))
:
@[simp]
theorem
V7.Stage1E03.legacyInstance_eps
{d : ℕ}
{x0 : Point d}
(inst : PositiveInstance 2 d x0)
(eps : ℝ)
(heps : 0 < eps)
(hG : eps < lpNorm 2 (inst.oracle.gradient x0))
:
@[simp]
theorem
V7.Stage1E03.legacyInstance_x0
{d : ℕ}
{x0 : Point d}
(inst : PositiveInstance 2 d x0)
(eps : ℝ)
(heps : 0 < eps)
(hG : eps < lpNorm 2 (inst.oracle.gradient x0))
:
@[simp]
theorem
V7.Stage1E03.legacyInstance_radius
{d : ℕ}
{x0 : Point d}
(inst : PositiveInstance 2 d x0)
(eps : ℝ)
(heps : 0 < eps)
(hG : eps < lpNorm 2 (inst.oracle.gradient x0))
:
theorem
V7.Stage1E03.sourceEstimateState_eq_legacy
{d : ℕ}
{x0 : Point d}
(inst : PositiveInstance 2 d x0)
(eps M : ℝ)
(heps : 0 < eps)
(hG : eps < lpNorm 2 (inst.oracle.gradient x0))
(k : ℕ)
:
sourceEstimateState inst.oracle M x0 k = O3.euclideanEstimateState (legacyInstance inst eps heps hG) M k
theorem
V7.Stage1E03.check_eq_exact_of_observations
{d : ℕ}
(oracle : PairOracle d)
(check : ObservableGuardCheck d)
(hx : check.xPair = O3.PairOracle.observe oracle check.xPair.point)
(hy : check.yPair = O3.PairOracle.observe oracle check.yPair.point)
:
theorem
V7.Stage1E03.not_guardFails_of_checkHolds
{d : ℕ}
(p M : ℝ)
(oracle : PairOracle d)
(check : ObservableGuardCheck d)
(hx : check.xPair = O3.PairOracle.observe oracle check.xPair.point)
(hy : check.yPair = O3.PairOracle.observe oracle check.yPair.point)
(hcheck : CheckHolds p M check)
:
¬GuardFails p M oracle check.failure
theorem
V7.Stage1E03.guardFails_of_not_checkHolds
{d : ℕ}
(p M : ℝ)
(oracle : PairOracle d)
(check : ObservableGuardCheck d)
(hx : check.xPair = O3.PairOracle.observe oracle check.xPair.point)
(hy : check.yPair = O3.PairOracle.observe oracle check.yPair.point)
(hcheck : ¬CheckHolds p M check)
:
GuardFails p M oracle check.failure