YukonModule.ProximityPrize.SubmissionLower.RelativeWeightIntervals.part0
DefinitionYukon_f60f8771f49612b2e4c0149ebetter-codes
Source module ProximityPrize.SubmissionLower.RelativeWeightIntervals.
Definition code
import Definitions.Def_Yukon_2e408f73c84aa0b97341dc8e
set_option backward.isDefEq.respectTransparency.types false
namespace ProximityPrize.SubmissionLower.RelativeBounded6814
open scoped BigOperators
open RCN100
set_option autoImplicit false
set_option maxHeartbeats 2000000
/-- Increasing the code cutoff enlarges the coefficient box. This identity
is proved about the original finite sum, not an unverified fast evaluator. -/
theorem coefficientCount_mono_cutoff (w L s : ℕ) :
Monotone (fun D => coefficientCount D w L s) := by
intro D1 D2 hD
unfold coefficientCount
apply Finset.sum_le_sum
intro i _
apply Finset.sum_le_sum
intro j _
apply Nat.mul_le_mul_left
exact Nat.sub_le_sub_right (Nat.sub_le_sub_right hD _) _
theorem profile_rows_mono_weight {D w L s T R B N alpha beta lo nu : ℕ}
(hnu : lo ≤ nu)
(hrows : ∀ mu ≤ B+R, coefficientCount (D-lo) w (L-T) (s-R) +
N*profileRowRank alpha beta L s T R mu < coefficientCount D w L s) :
∀ mu ≤ B+R, coefficientCount (D-nu) w (L-T) (s-R) +
N*profileRowRank alpha beta L s T R mu < coefficientCount D w L s := by
intro mu hmu
have hcoef := coefficientCount_mono_cutoff w (L-T) (s-R)
(Nat.sub_le_sub_left hnu D)
exact (Nat.add_le_add_right hcoef _).trans_lt (hrows mu hmu)
end ProximityPrize.SubmissionLower.RelativeBounded6814
Source