YukonModule.ProximityPrize.SubmissionLower.MovingFiberSources6814D.part0
DefinitionYukon_dc1f37daf166378f215b7cc0better-codes
Source module ProximityPrize.SubmissionLower.MovingFiberSources6814D.
Definition code
import Definitions.Def_Yukon_96b80b3faf18ce02278d0935
set_option backward.isDefEq.respectTransparency.types false
set_option Elab.async false
set_option maxRecDepth 100000
set_option maxHeartbeats 8000000
namespace ProximityPrize.SubmissionLower.MovingFiberSources6814.P18
open SecondJetRelaxedGlobalIndex SecondJetRelaxedGlobalCounts
noncomputable section
set_option autoImplicit false
def m : ℕ := 114
def B : ℕ := 47
def s : ℕ := 22
def U : ℕ := 155
def L : ℕ := 2962
def k : ℕ := 5
def n0 : ℕ := 7
theorem coefficient_count :
coefficientCount (MovingFiberInterpolation6814.cutoff m k n0) 131071 L B s U =
2023785352879684 := by decide +kernel
theorem local_rank : SecondJetRelaxedCounts.rankBound m L B s U = 7720121186 := 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) = 2023785352879684 := 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) = 7720121186 := 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*7720121186 < 2023785352879684 := 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.P18
namespace ProximityPrize.SubmissionLower.MovingFiberSources6814.P19
open SecondJetRelaxedGlobalIndex SecondJetRelaxedGlobalCounts
noncomputable section
set_option autoImplicit false
def m : ℕ := 166
def B : ℕ := 66
def s : ℕ := 31
def U : ℕ := 226
def L : ℕ := 2820
def k : ℕ := 7
def n0 : ℕ := 10
theorem coefficient_count :
coefficientCount (MovingFiberInterpolation6814.cutoff m k n0) 131071 L B s U =
7855104749586596 := by decide +kernel
theorem local_rank : SecondJetRelaxedCounts.rankBound m L B s U = 29964804726 := 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) = 7855104749586596 := 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) = 29964804726 := 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*29964804726 < 7855104749586596 := 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.P19
namespace ProximityPrize.SubmissionLower.MovingFiberSources6814.P20
open SecondJetRelaxedGlobalIndex SecondJetRelaxedGlobalCounts
noncomputable section
set_option autoImplicit false
def m : ℕ := 174
def B : ℕ := 76
def s : ℕ := 36
def U : ℕ := 237
def L : ℕ := 2878
def k : ℕ := 8
def n0 : ℕ := 9
theorem coefficient_count :
coefficientCount (MovingFiberInterpolation6814.cutoff m k n0) 131071 L B s U =
11189443904593904 := by decide +kernel
theorem local_rank : SecondJetRelaxedCounts.rankBound m L B s U = 42684287055 := 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) = 11189443904593904 := 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) = 42684287055 := 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*42684287055 < 11189443904593904 := 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.P20
namespace ProximityPrize.SubmissionLower.MovingFiberSources6814.P21
open SecondJetRelaxedGlobalIndex SecondJetRelaxedGlobalCounts
noncomputable section
set_option autoImplicit false
def m : ℕ := 111
def B : ℕ := 46
def s : ℕ := 22
def U : ℕ := 151
def L : ℕ := 3434
def k : ℕ := 5
def n0 : ℕ := 7
theorem coefficient_count :
coefficientCount (MovingFiberInterpolation6814.cutoff m k n0) 131071 L B s U =
2142188083989050 := by decide +kernel
theorem local_rank : SecondJetRelaxedCounts.rankBound m L B s U = 8171795275 := 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) = 2142188083989050 := 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) = 8171795275 := 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*8171795275 < 2142188083989050 := 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.P21
namespace ProximityPrize.SubmissionLower.MovingFiberSources6814.P22
open SecondJetRelaxedGlobalIndex SecondJetRelaxedGlobalCounts
noncomputable section
set_option autoImplicit false
def m : ℕ := 189
def B : ℕ := 83
def s : ℕ := 39
def U : ℕ := 256
def L : ℕ := 3309
def k : ℕ := 9
def n0 : ℕ := 10
theorem coefficient_count :
coefficientCount (MovingFiberInterpolation6814.cutoff m k n0) 131071 L B s U =
17988089899832322 := by decide +kernel
theorem local_rank : SecondJetRelaxedCounts.rankBound m L B s U = 68619053311 := 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) = 17988089899832322 := 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) = 68619053311 := 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*68619053311 < 17988089899832322 := 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.P22
namespace ProximityPrize.SubmissionLower.MovingFiberSources6814.P23
open SecondJetRelaxedGlobalIndex SecondJetRelaxedGlobalCounts
noncomputable section
set_option autoImplicit false
def m : ℕ := 114
def B : ℕ := 45
def s : ℕ := 20
def U : ℕ := 155
def L : ℕ := 3382
def k : ℕ := 5
def n0 : ℕ := 7
theorem coefficient_count :
coefficientCount (MovingFiberInterpolation6814.cutoff m k n0) 131071 L B s U =
2147578068607419 := by decide +kernel
theorem local_rank : SecondJetRelaxedCounts.rankBound m L B s U = 8192358200 := 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) = 2147578068607419 := 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) = 8192358200 := 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*8192358200 < 2147578068607419 := 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.P23
Source