File size: 1,454 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 | 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
|