math / data /lean /OAI /NumberTheory /PiExponent /Approximation /FibreWeightSeparation.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
1.18 kB
import OAI.NumberTheory.PiExponent.Jets.NormalBasisProducts
namespace OAI
noncomputable section
open scoped BigOperators
namespace PiExponent.FibreWeightSeparation
theorem positive_indices {m : β„•} (w cost : Fin (m+1) β†’ ℝ) (C : ℝ)
(hsep : βˆ€ A B : Finset (Fin (m+1)), A.card = B.card β†’
βˆ€ i, i β‰  0 β†’ i ∈ A β†’ i βˆ‰ B β†’
(βˆ€ j, i < j β†’ (j ∈ A ↔ j ∈ B)) β†’
C * (∏ j ∈ B, cost j) < ∏ j ∈ A, w j) :
βˆ€ A B : Finset (Fin m), A.card = B.card β†’
βˆ€ i, i ∈ A β†’ i βˆ‰ B β†’ (βˆ€ j, i < j β†’ (j ∈ A ↔ j ∈ B)) β†’
C * (∏ j ∈ B, cost j.succ) < ∏ j ∈ A, w j.succ := by
intro A B hcard i hiA hiB hlarge
have h := hsep (A.map (Fin.succEmb m)) (B.map (Fin.succEmb m))
(by simpa only [Finset.card_map] using hcard) i.succ (Fin.succ_ne_zero i)
(by simpa using hiA) (by simpa using hiB) (by
intro j hij
cases j using Fin.cases with
| zero => exact (not_lt_of_ge (Fin.zero_le _) hij).elim
| succ j => simpa using hlarge j (Fin.succ_lt_succ_iff.mp hij))
simpa only [Finset.prod_map, Fin.coe_succEmb] using h
end PiExponent.FibreWeightSeparation
end
end OAI