Touching sets covering an interval
ProvedQAlgorithms.Papers.Independent.Support50.P44.touching_interval_setsprove2quantum
Let satisfy , , and . For every ,
Neither closedness, disjointness nor measurability is assumed. In particular is permitted at an intersection; this supplies nearby parameters from the two covering sets.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P44
Formal statement
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P44
open QAlgorithms.Papers.Independent.Dependency50.P13 (IsTraceClass compression)
open QAlgorithms.Papers.Independent.Dependency50.P21 (marginalAB)
open QAlgorithms.Papers.Independent.Renew46.P37 (classicalKL)
open Filter
open scoped ENNReal ComplexOrder Matrix
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
variable {A B C E G : Type*}
/-- PDF p.26, Lemma D.1: arbitrary covering sets, without closedness,
disjointness or measurability. An intersection permits u = v. -/
theorem touching_interval_sets (K0 K1 : Set ℝ) (hcover : K0 ∪ K1 = Set.Icc 0 1)
(hzero : 0 ∈ K0) (hone : 1 ∈ K1) (delta : ℝ) (hdelta : 0 < delta) :
∃ u ∈ K0, ∃ v ∈ K1, 0 ≤ v - u ∧ v - u ≤ delta := by sorry
end QAlgorithms.Papers.Independent.Support50.P44
end
Source
Universal recovery map for approximate Markov chains, arXiv:1504.07251v3, PDF p. 26, Lemma D.1
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For any subsets satisfying , , and , and every real , there exist and such that
Neither set is assumed closed, open, or disjoint. The conclusion permits .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.