YukonModule.ProximityPrize.SubmissionLower.MovingFiberSources6814C.part0
DefinitionYukon_96b80b3faf18ce02278d0935better-codes
Source module ProximityPrize.SubmissionLower.MovingFiberSources6814C.
Definition code
import Definitions.Def_Yukon_32ffc3bd2d664fb5668caa78
set_option backward.isDefEq.respectTransparency.types false
set_option Elab.async false
set_option maxRecDepth 100000
set_option maxHeartbeats 8000000
namespace ProximityPrize.SubmissionLower.MovingFiberSources6814.P12
open SecondJetRelaxedGlobalIndex SecondJetRelaxedGlobalCounts
noncomputable section
set_option autoImplicit false
def m : ℕ := 142
def B : ℕ := 59
def s : ℕ := 27
def U : ℕ := 193
def L : ℕ := 2567
def k : ℕ := 6
def n0 : ℕ := 9
theorem coefficient_count :
coefficientCount (MovingFiberInterpolation6814.cutoff m k n0) 131071 L B s U =
4145546152271179 := by decide +kernel
theorem local_rank : SecondJetRelaxedCounts.rankBound m L B s U = 15813996073 := by decide +kernel
theorem cutoff_caps : ∀ h : Fin (s+1),
U ≤ (MovingFiberInterpolation6814.cutoff m k n0 h.val+B-1)/131071 := by decide +kernel
theorem source_card :
Fintype.card (Index (MovingFiberInterpolation6814.cutoff m k n0) 131071 L B s U) = 4145546152271179 := by
rw [card_index_closed _ _ _ _ _ _ (by decide +kernel),coefficient_count]
theorem exact_rank :
SecondJetRelaxedGlobalMap.rankBound m L B s U
(fun h => (MovingFiberInterpolation6814.cutoff m k n0 h+B-1)/131071) = 15813996073 := by
rw [SecondJetRelaxedCounts.rankBound_eq_closed _ _ _ _ _ _ (by decide +kernel)
(by decide +kernel) (by decide +kernel) (by decide +kernel)
(fun h hh => cutoff_caps ⟨h,by omega⟩),local_rank]
theorem dimension_gap : 262144*15813996073 < 4145546152271179 := by decide +kernel
theorem exists_interpolant {K I : Type} [Field K] [Fintype I]
(nodes : I ↪ K) (u0 u1 : I → K) (hI : Fintype.card I = 262144) :
∃ P, MovingFiberInterpolation6814.Interpolant m B s U L k n0 nodes u0 u1 P := by
apply MovingFiberInterpolation6814.exists_of_dimension m B s U L k n0
(by decide +kernel) (by decide +kernel) hI nodes u0 u1
rw [exact_rank,source_card]
exact dimension_gap
end
end ProximityPrize.SubmissionLower.MovingFiberSources6814.P12
namespace ProximityPrize.SubmissionLower.MovingFiberSources6814.P13
open SecondJetRelaxedGlobalIndex SecondJetRelaxedGlobalCounts
noncomputable section
set_option autoImplicit false
def m : ℕ := 158
def B : ℕ := 69
def s : ℕ := 32
def U : ℕ := 214
def L : ℕ := 2555
def k : ℕ := 7
def n0 : ℕ := 8
theorem coefficient_count :
coefficientCount (MovingFiberInterpolation6814.cutoff m k n0) 131071 L B s U =
6773972815498018 := by decide +kernel
theorem local_rank : SecondJetRelaxedCounts.rankBound m L B s U = 25840640133 := by decide +kernel
theorem cutoff_caps : ∀ h : Fin (s+1),
U ≤ (MovingFiberInterpolation6814.cutoff m k n0 h.val+B-1)/131071 := by decide +kernel
theorem source_card :
Fintype.card (Index (MovingFiberInterpolation6814.cutoff m k n0) 131071 L B s U) = 6773972815498018 := by
rw [card_index_closed _ _ _ _ _ _ (by decide +kernel),coefficient_count]
theorem exact_rank :
SecondJetRelaxedGlobalMap.rankBound m L B s U
(fun h => (MovingFiberInterpolation6814.cutoff m k n0 h+B-1)/131071) = 25840640133 := by
rw [SecondJetRelaxedCounts.rankBound_eq_closed _ _ _ _ _ _ (by decide +kernel)
(by decide +kernel) (by decide +kernel) (by decide +kernel)
(fun h hh => cutoff_caps ⟨h,by omega⟩),local_rank]
theorem dimension_gap : 262144*25840640133 < 6773972815498018 := by decide +kernel
theorem exists_interpolant {K I : Type} [Field K] [Fintype I]
(nodes : I ↪ K) (u0 u1 : I → K) (hI : Fintype.card I = 262144) :
∃ P, MovingFiberInterpolation6814.Interpolant m B s U L k n0 nodes u0 u1 P := by
apply MovingFiberInterpolation6814.exists_of_dimension m B s U L k n0
(by decide +kernel) (by decide +kernel) hI nodes u0 u1
rw [exact_rank,source_card]
exact dimension_gap
end
end ProximityPrize.SubmissionLower.MovingFiberSources6814.P13
namespace ProximityPrize.SubmissionLower.MovingFiberSources6814.P14
open SecondJetRelaxedGlobalIndex SecondJetRelaxedGlobalCounts
noncomputable section
set_option autoImplicit false
def m : ℕ := 146
def B : ℕ := 58
def s : ℕ := 27
def U : ℕ := 198
def L : ℕ := 2651
def k : ℕ := 6
def n0 : ℕ := 9
theorem coefficient_count :
coefficientCount (MovingFiberInterpolation6814.cutoff m k n0) 131071 L B s U =
4459000666326089 := by decide +kernel
theorem local_rank : SecondJetRelaxedCounts.rankBound m L B s U = 17009725449 := by decide +kernel
theorem cutoff_caps : ∀ h : Fin (s+1),
U ≤ (MovingFiberInterpolation6814.cutoff m k n0 h.val+B-1)/131071 := by decide +kernel
theorem source_card :
Fintype.card (Index (MovingFiberInterpolation6814.cutoff m k n0) 131071 L B s U) = 4459000666326089 := by
rw [card_index_closed _ _ _ _ _ _ (by decide +kernel),coefficient_count]
theorem exact_rank :
SecondJetRelaxedGlobalMap.rankBound m L B s U
(fun h => (MovingFiberInterpolation6814.cutoff m k n0 h+B-1)/131071) = 17009725449 := by
rw [SecondJetRelaxedCounts.rankBound_eq_closed _ _ _ _ _ _ (by decide +kernel)
(by decide +kernel) (by decide +kernel) (by decide +kernel)
(fun h hh => cutoff_caps ⟨h,by omega⟩),local_rank]
theorem dimension_gap : 262144*17009725449 < 4459000666326089 := by decide +kernel
theorem exists_interpolant {K I : Type} [Field K] [Fintype I]
(nodes : I ↪ K) (u0 u1 : I → K) (hI : Fintype.card I = 262144) :
∃ P, MovingFiberInterpolation6814.Interpolant m B s U L k n0 nodes u0 u1 P := by
apply MovingFiberInterpolation6814.exists_of_dimension m B s U L k n0
(by decide +kernel) (by decide +kernel) hI nodes u0 u1
rw [exact_rank,source_card]
exact dimension_gap
end
end ProximityPrize.SubmissionLower.MovingFiberSources6814.P14
namespace ProximityPrize.SubmissionLower.MovingFiberSources6814.P15
open SecondJetRelaxedGlobalIndex SecondJetRelaxedGlobalCounts
noncomputable section
set_option autoImplicit false
def m : ℕ := 98
def B : ℕ := 41
def s : ℕ := 19
def U : ℕ := 133
def L : ℕ := 2498
def k : ℕ := 4
def n0 : ℕ := 6
theorem coefficient_count :
coefficientCount (MovingFiberInterpolation6814.cutoff m k n0) 131071 L B s U =
967281016668795 := by decide +kernel
theorem local_rank : SecondJetRelaxedCounts.rankBound m L B s U = 3689882571 := by decide +kernel
theorem cutoff_caps : ∀ h : Fin (s+1),
U ≤ (MovingFiberInterpolation6814.cutoff m k n0 h.val+B-1)/131071 := by decide +kernel
theorem source_card :
Fintype.card (Index (MovingFiberInterpolation6814.cutoff m k n0) 131071 L B s U) = 967281016668795 := by
rw [card_index_closed _ _ _ _ _ _ (by decide +kernel),coefficient_count]
theorem exact_rank :
SecondJetRelaxedGlobalMap.rankBound m L B s U
(fun h => (MovingFiberInterpolation6814.cutoff m k n0 h+B-1)/131071) = 3689882571 := by
rw [SecondJetRelaxedCounts.rankBound_eq_closed _ _ _ _ _ _ (by decide +kernel)
(by decide +kernel) (by decide +kernel) (by decide +kernel)
(fun h hh => cutoff_caps ⟨h,by omega⟩),local_rank]
theorem dimension_gap : 262144*3689882571 < 967281016668795 := by decide +kernel
theorem exists_interpolant {K I : Type} [Field K] [Fintype I]
(nodes : I ↪ K) (u0 u1 : I → K) (hI : Fintype.card I = 262144) :
∃ P, MovingFiberInterpolation6814.Interpolant m B s U L k n0 nodes u0 u1 P := by
apply MovingFiberInterpolation6814.exists_of_dimension m B s U L k n0
(by decide +kernel) (by decide +kernel) hI nodes u0 u1
rw [exact_rank,source_card]
exact dimension_gap
end
end ProximityPrize.SubmissionLower.MovingFiberSources6814.P15
namespace ProximityPrize.SubmissionLower.MovingFiberSources6814.P16
open SecondJetRelaxedGlobalIndex SecondJetRelaxedGlobalCounts
noncomputable section
set_option autoImplicit false
def m : ℕ := 150
def B : ℕ := 60
def s : ℕ := 28
def U : ℕ := 204
def L : ℕ := 2411
def k : ℕ := 6
def n0 : ℕ := 9
theorem coefficient_count :
coefficientCount (MovingFiberInterpolation6814.cutoff m k n0) 131071 L B s U =
4543470768695360 := by decide +kernel
theorem local_rank : SecondJetRelaxedCounts.rankBound m L B s U = 17331952492 := by decide +kernel
theorem cutoff_caps : ∀ h : Fin (s+1),
U ≤ (MovingFiberInterpolation6814.cutoff m k n0 h.val+B-1)/131071 := by decide +kernel
theorem source_card :
Fintype.card (Index (MovingFiberInterpolation6814.cutoff m k n0) 131071 L B s U) = 4543470768695360 := by
rw [card_index_closed _ _ _ _ _ _ (by decide +kernel),coefficient_count]
theorem exact_rank :
SecondJetRelaxedGlobalMap.rankBound m L B s U
(fun h => (MovingFiberInterpolation6814.cutoff m k n0 h+B-1)/131071) = 17331952492 := by
rw [SecondJetRelaxedCounts.rankBound_eq_closed _ _ _ _ _ _ (by decide +kernel)
(by decide +kernel) (by decide +kernel) (by decide +kernel)
(fun h hh => cutoff_caps ⟨h,by omega⟩),local_rank]
theorem dimension_gap : 262144*17331952492 < 4543470768695360 := by decide +kernel
theorem exists_interpolant {K I : Type} [Field K] [Fintype I]
(nodes : I ↪ K) (u0 u1 : I → K) (hI : Fintype.card I = 262144) :
∃ P, MovingFiberInterpolation6814.Interpolant m B s U L k n0 nodes u0 u1 P := by
apply MovingFiberInterpolation6814.exists_of_dimension m B s U L k n0
(by decide +kernel) (by decide +kernel) hI nodes u0 u1
rw [exact_rank,source_card]
exact dimension_gap
end
end ProximityPrize.SubmissionLower.MovingFiberSources6814.P16
namespace ProximityPrize.SubmissionLower.MovingFiberSources6814.P17
open SecondJetRelaxedGlobalIndex SecondJetRelaxedGlobalCounts
noncomputable section
set_option autoImplicit false
def m : ℕ := 162
def B : ℕ := 71
def s : ℕ := 33
def U : ℕ := 218
def L : ℕ := 2464
def k : ℕ := 7
def n0 : ℕ := 8
theorem coefficient_count :
coefficientCount (MovingFiberInterpolation6814.cutoff m k n0) 131071 L B s U =
7235430139742482 := by decide +kernel
theorem local_rank : SecondJetRelaxedCounts.rankBound m L B s U = 27600921376 := by decide +kernel
theorem cutoff_caps : ∀ h : Fin (s+1),
U ≤ (MovingFiberInterpolation6814.cutoff m k n0 h.val+B-1)/131071 := by decide +kernel
theorem source_card :
Fintype.card (Index (MovingFiberInterpolation6814.cutoff m k n0) 131071 L B s U) = 7235430139742482 := by
rw [card_index_closed _ _ _ _ _ _ (by decide +kernel),coefficient_count]
theorem exact_rank :
SecondJetRelaxedGlobalMap.rankBound m L B s U
(fun h => (MovingFiberInterpolation6814.cutoff m k n0 h+B-1)/131071) = 27600921376 := by
rw [SecondJetRelaxedCounts.rankBound_eq_closed _ _ _ _ _ _ (by decide +kernel)
(by decide +kernel) (by decide +kernel) (by decide +kernel)
(fun h hh => cutoff_caps ⟨h,by omega⟩),local_rank]
theorem dimension_gap : 262144*27600921376 < 7235430139742482 := by decide +kernel
theorem exists_interpolant {K I : Type} [Field K] [Fintype I]
(nodes : I ↪ K) (u0 u1 : I → K) (hI : Fintype.card I = 262144) :
∃ P, MovingFiberInterpolation6814.Interpolant m B s U L k n0 nodes u0 u1 P := by
apply MovingFiberInterpolation6814.exists_of_dimension m B s U L k n0
(by decide +kernel) (by decide +kernel) hI nodes u0 u1
rw [exact_rank,source_card]
exact dimension_gap
end
end ProximityPrize.SubmissionLower.MovingFiberSources6814.P17
Source