OAI/Combinatorics/ProgressionColoring/AdaptiveMeshBreakpoints.lean
11 declarations, 0 contain sorry, 0 declared as axioms
Literal three-way breakpoint factorization. All sets below are the actual
endpoint/threshold sets from AdaptiveMeshCounting. In particular an equality
at a truncation threshold keeps the original half-open label.
- theorem
OAI.QuantitativeVanDerWaerden.continuous_rholine 14 - theorem
OAI.QuantitativeVanDerWaerden.no_breakpoint_of_same_signsline 21Source documentation
Equal ternary signs exclude every closed-interval breakpoint when the two evaluation points are distinct. Equality signs are essential here.
theorem no_breakpoint_of_same_signs {B : Finset ℝ} {x y : ℝ} (hxy : x < y) (hs : ∀ b ∈ B, ternarySign (x - b) = ternarySign (y - b)) : ∀ b ∈ B, ¬ (x ≤ b ∧ b ≤ y) := by … - theorem
OAI.QuantitativeVanDerWaerden.AdaptiveMesh.meshLabel_eq_of_no_endpointline 38 - theorem
OAI.QuantitativeVanDerWaerden.AdaptiveMesh.endpoints_determine_labelline 52 - def
OAI.QuantitativeVanDerWaerden.AdaptiveMesh.truncatedLabelline 71 - theorem
OAI.QuantitativeVanDerWaerden.AdaptiveMesh.truncatedLabel_eq_none_iffline 75 - theorem
OAI.QuantitativeVanDerWaerden.AdaptiveMesh.truncatedLabel_add_intline 80 - theorem
OAI.QuantitativeVanDerWaerden.AdaptiveMesh.mem_thresholdPoints_of_rho_eqline 85 - theorem
OAI.QuantitativeVanDerWaerden.AdaptiveMesh.truncatedBreakpoints_determine_labelline 101 - theorem
OAI.QuantitativeVanDerWaerden.AdaptiveMesh.stationary_breakpoint_factorizationline 159Source documentation
A fixed 49-point breakpoint set for the closed neighborhood of an anchor cell. It is chosen before either free affine parameter is selected.
theorem stationary_breakpoint_factorization (i : A.Label) (z : ℤ) : ∃ B : Finset ℝ, B.card ≤ 49 ∧ ∀ x y : ℝ, A.left i + z - A.width i ≤ x ∧ x ≤ A.right i + z + A.width i → A.left i + z - A.width i ≤ y ∧ y ≤ A.right i + z + A.width i → (∀ b ∈ B, ternarySign (x - b) = ternarySign (y - b)) → A.meshLabel x = A.meshLabel y := by … - theorem
OAI.QuantitativeVanDerWaerden.AdaptiveMesh.rotating_breakpoint_factorizationline 172Source documentation
The rotating-coordinate bound is uniform in the location of the target interval, including intervals crossing the circle cut.
theorem rotating_breakpoint_factorization (D : ℕ) (hD : 0 < D) (u v : ℝ) (huv : u ≤ v) (hlen : v - u ≤ 4 * A.H) : ∃ B : Finset ℝ, B.card ≤ 16004 * D ∧ ∀ x y : ℝ, u ≤ x ∧ x ≤ v → u ≤ y ∧ y ≤ v → (∀ b ∈ B, ternarySign (x - b) = ternarySign (y - b)) → A.truncatedLabel (1 / (1000 * (D : ℝ))) x = A.truncatedLabel (1 / (1000 * (D : ℝ))) y := by …