YukonModule.ProximityPrize.SubmissionLower.PureFlagSliceBudget6807.part0
DefinitionYukon_9d89c768274d20327591ec1dbetter-codes
Source module ProximityPrize.SubmissionLower.PureFlagSliceBudget6807.
Definition code
import Definitions.Def_Yukon_0bbabd56aca9bc076824eff5
/-
UNCOMPILED. Pure-flag budgets for slice components, using the actual pinned
AdaptiveUnitProjectionFamily. No surface moving class is introduced.
-/
set_option backward.isDefEq.respectTransparency.types false
namespace ProximityPrize.SubmissionLower.PureFlagSliceBudget6807
open scoped Classical BigOperators WithZero
open RCN002 RCN005 RCN006 RCN026 RCN046 RCN084 RCN095 RCN114
open RCN204 RCN234 RCN237 RCN264 RCN340 RCN341
noncomputable section
set_option autoImplicit false
set_option maxHeartbeats 3000000
set_option maxRecDepth 30000
variable {E : Type} [Field E] [IsAlgClosed E]
{G T H : MvPolynomial (Fin 3) E} {p q : FlagDegree}
{base : ∀ C : RegularComponent E G T H, SeparableLiteralCoordinate C.1}
/-- These are the SAME three integer costs as the old prime budget. -/
theorem sum_flagPole_le (U : AdaptiveUnitPoleBudget base p q)
(C : RegularComponent E G T H) (r : FlagDegree)
(W : Finset (Place E (CoordinateField E C.1))) :
(∑ v ∈ W, flagPole v.val (coordinate E C.1) r) ≤
(U.toPrimeFlagBudgetFamily.weightedCost r C : ℤ) := by
have hz := U.zPole C W
have hy := U.yzPole C W
have ha := U.allPole C W
simp only [exponentSetPoleWeight_unitZ] at hz
simp only [exponentSetPoleWeight_unitYZ] at hy
simp only [exponentSetPoleWeight_unitAll] at ha
have h := add_le_add (add_le_add
(mul_le_mul_of_nonneg_left hz (Int.natCast_nonneg r.zOnly))
(mul_le_mul_of_nonneg_left hy (Int.natCast_nonneg r.yz)))
(mul_le_mul_of_nonneg_left ha (Int.natCast_nonneg r.all))
simpa only [flagPole, Finset.sum_add_distrib, ← Finset.mul_sum,
PrimeFlagBudgetFamily.weightedCost,
AdaptiveUnitPoleBudget.toPrimeFlagBudgetFamily, Nat.cast_add, Nat.cast_mul] using h
theorem weightedCost_add_smul (U : AdaptiveUnitPoleBudget base p q)
(C : RegularComponent E G T H) (d w : ℕ) (J V : FlagDegree) :
U.toPrimeFlagBudgetFamily.weightedCost (d • J + w • V) C =
d * U.toPrimeFlagBudgetFamily.weightedCost J C +
w * U.toPrimeFlagBudgetFamily.weightedCost V C := by
simp only [PrimeFlagBudgetFamily.weightedCost]
change (d*J.zOnly+w*V.zOnly)*U.zCost C +
(d*J.yz+w*V.yz)*U.yzCost C + (d*J.all+w*V.all)*U.allCost C = _
dsimp only [AdaptiveUnitPoleBudget.toPrimeFlagBudgetFamily]
ring
/-- Sum over actual active geometric factors using cumulative flag budgets.
It does not assume the three difference coordinates are separately additive. -/
theorem all_active_slice_costs_le (F N R : MvPolynomial (Fin 3) E)
(hF : F ≠ 0) (p q r : FlagDegree) (hFp : PolynomialInFlag p F)
(base : ∀ g : ↥(activeFactors F N), ∀ C : RegularComponent E g.1 N R,
SeparableLiteralCoordinate C.1)
(U : ∀ g : ↥(activeFactors F N), AdaptiveUnitPoleBudget (base g) (exactFlag g.1) q) :
(∑ g : ↥(activeFactors F N), ∑ C : RegularComponent E g.1 N R,
(U g).toPrimeFlagBudgetFamily.weightedCost r C) ≤ flagMixed p q r := by
exact (Finset.sum_le_sum (fun g _ =>
(U g).toPrimeFlagBudgetFamily.sum_weightedCost_le r)).trans
(activeFactors_mixed_sum_le F N hF p q r hFp)
end
end ProximityPrize.SubmissionLower.PureFlagSliceBudget6807
Source