Download data/lean/OAI/Combinatorics/Crossing/BalancedAxisIntervals.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 2.71 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/Crossing/BalancedAxisIntervals.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Combinatorics/Crossing/BalancedAxisIntervals.lean
-
curl -L -o BalancedAxisIntervals.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/Crossing/BalancedAxisIntervals.lean
2.71 kB
| import OAI.Combinatorics.Crossing.AxisGenericPositions | |
| namespace OAI | |
| noncomputable section | |
| namespace Zarankiewicz | |
| def axisIntervalLo (r : β) (i : Fin r) : β := if i.val < r/2 then 2*(i.val : β)+1 else -(2*(i.val : β)+2) | |
| def axisIntervalHi (r : β) (i : Fin r) : β := if i.val < r/2 then 2*(i.val : β)+2 else -(2*(i.val : β)+1) | |
| theorem axisInterval_nonempty (r : β) (i : Fin r) : axisIntervalLo r i < axisIntervalHi r i := by | |
| unfold axisIntervalLo axisIntervalHi | |
| split_ifs <;> linarith | |
| theorem axisInterval_abs_bounds (r : β) (i : Fin r) (x : β) | |
| (hx : x β Set.Ioo (axisIntervalLo r i) (axisIntervalHi r i)) : | |
| 2*(i.val : β)+1 < |x| β§ |x| < 2*(i.val : β)+2 := by | |
| have hi : 0 β€ (i.val : β) := Nat.cast_nonneg _ | |
| by_cases h : i.val < r/2 | |
| Β· simp only [axisIntervalLo,axisIntervalHi,ite_eq_left h,Set.mem_Ioo] at hx | |
| rw [abs_of_pos (by linarith [hx.1])] | |
| exact hx | |
| Β· simp only [axisIntervalLo,axisIntervalHi,ite_eq_right h,Set.mem_Ioo] at hx | |
| rw [abs_of_neg (by linarith [hx.2])] | |
| constructor <;> linarith [hx.1,hx.2] | |
| theorem axisInterval_sign (r : β) (i : Fin r) (x : β) | |
| (hx : x β Set.Ioo (axisIntervalLo r i) (axisIntervalHi r i)) : | |
| (0 < x β i.val < r/2) β§ (x < 0 β r/2 β€ i.val) := by | |
| have hi : 0 β€ (i.val : β) := Nat.cast_nonneg _ | |
| by_cases h : i.val < r/2 | |
| Β· simp only [axisIntervalLo,axisIntervalHi,ite_eq_left h,Set.mem_Ioo] at hx | |
| have hp : 0 < x := by linarith [hx.1] | |
| simp [hp,h,not_lt_of_ge hp.le,Nat.not_le.mpr h] | |
| Β· simp only [axisIntervalLo,axisIntervalHi,ite_eq_right h,Set.mem_Ioo] at hx | |
| have hn : x < 0 := by linarith [hx.2] | |
| simp [hn,h,not_lt_of_ge hn.le,Nat.le_of_not_gt h] | |
| theorem axisInterval_ne_zero (r : β) (i : Fin r) (x : β) | |
| (hx : x β Set.Ioo (axisIntervalLo r i) (axisIntervalHi r i)) : x β 0 := by | |
| have hh := (axisInterval_abs_bounds r i x hx).1 | |
| intro he | |
| rw [he,abs_zero] at hh | |
| have hi : 0 β€ (i.val : β) := Nat.cast_nonneg _ | |
| linarith | |
| theorem axisInterval_abs_strictMono (r : β) (x : Fin r β β) | |
| (hx : β i, x i β Set.Ioo (axisIntervalLo r i) (axisIntervalHi r i)) : | |
| StrictMono (fun i => |x i|) := by | |
| intro i k hik | |
| have hi := (axisInterval_abs_bounds r i (x i) (hx i)).2 | |
| have hk := (axisInterval_abs_bounds r k (x k) (hx k)).1 | |
| have hik' : (i.val : β)+1 β€ (k.val : β) := by exact_mod_cast (Nat.succ_le_of_lt hik) | |
| linarith | |
| theorem axisInterval_injective (r : β) (x : Fin r β β) | |
| (hx : β i, x i β Set.Ioo (axisIntervalLo r i) (axisIntervalHi r i)) : Function.Injective x := by | |
| intro i k hik | |
| exact (axisInterval_abs_strictMono r x hx).injective (congrArg abs hik) | |
| end Zarankiewicz | |
| end | |
| end OAI | |