math / data /lean /OAI /Combinatorics /Crossing /AxisGenericPositions.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
1.45 kB
import OAI.Combinatorics.Crossing.AxisConcurrency
namespace OAI
noncomputable section
namespace Zarankiewicz
variable {m n : β„•}
def AxisIndependentTriple (e f g : BipartiteEdge m n) : Prop :=
e.1 β‰  f.1 ∧ e.1 β‰  g.1 ∧ f.1 β‰  g.1 ∧ e.2 β‰  f.2 ∧ e.2 β‰  g.2 ∧ f.2 β‰  g.2
theorem exists_axis_generic_positions (lo hi : BipartiteVertex m n β†’ ℝ)
(hinterval : βˆ€ j, lo j < hi j) :
βˆƒ x : BipartiteVertex m n β†’ ℝ, (βˆ€ j, x j ∈ Set.Ioo (lo j) (hi j)) ∧
βˆ€ e f g : BipartiteEdge m n, AxisIndependentTriple e f g β†’
axisConcurrency (x (Sum.inl e.1)) (x (Sum.inr e.2)) (x (Sum.inl f.1)) (x (Sum.inr f.2))
(x (Sum.inl g.1)) (x (Sum.inr g.2)) β‰  0 := by
classical
let P : (BipartiteEdge m n Γ— BipartiteEdge m n Γ— BipartiteEdge m n) β†’ MvPolynomial (BipartiteVertex m n) ℝ :=
fun t => if AxisIndependentTriple t.1 t.2.1 t.2.2 then axisConcurrencyPolynomial t.1 t.2.1 t.2.2 else 1
have hP : βˆ€ t, P t β‰  0 := by
intro t
dsimp only [P]
split_ifs with h
Β· exact axisConcurrencyPolynomial_ne_zero _ _ _ h.1 (Ne.symm h.2.2.1)
(Ne.symm h.2.2.2.1) (Ne.symm h.2.2.2.2.1)
Β· exact one_ne_zero
obtain ⟨x,hx,havoid⟩ := exists_box_avoiding_polynomials P hP lo hi hinterval
refine ⟨x,hx,?_⟩
intro e f g htriple
have hh := havoid (e,f,g)
simpa only [P,ite_eq_left htriple,axisConcurrencyPolynomial_eval] using hh
end Zarankiewicz
end
end OAI