YukonModule.ProximityPrize.SubmissionLower.ActualFirstCutPole6807.part0
DefinitionYukon_1a73be96c34fef79c5d93dc9better-codes
Source module ProximityPrize.SubmissionLower.ActualFirstCutPole6807.
Definition code
/-
UNCOMPILED. Actual refined-coefficient interface for the first rational cut.
Copy FirstCutValuation6807.lean into ProximityPrize/SubmissionLower/ first.
This theorem has no first-tail-zero premise and does not manufacture a graph.
-/
import Definitions.Def_Yukon_553273187de1434da3936a72
import Definitions.Def_Yukon_043883ce6ed32260483e0ffb
set_option backward.isDefEq.respectTransparency.types false
namespace ProximityPrize.SubmissionLower.ActualFirstCutPole6807
open scoped BigOperators
open RCN055 RCN057 RCN095 RCN136 RCN156 RCN204 RCN234 RCN313
open BoundaryTailAlgebra FirstCutValuation6807
set_option autoImplicit false
noncomputable section
variable {K Ω L : Type} [Field K] [Field Ω] [Field L]
/-- Includes zero-valued terms: logarithms are not applied as if they were units. -/
theorem pole_le_of_value_le
(V : Valuation L (WithZero (Multiplicative ℤ)))
(a : L) (bound : ℤ) (hb : 0 ≤ bound)
(ha : V a ≤ WithZero.exp bound) : RCN187.poleOrder V a ≤ bound := by
unfold RCN187.poleOrder
apply max_le hb
by_cases hz : V a = 0
· simpa [hz] using hb
· simpa only [WithZero.log_exp] using
(WithZero.log_le_log hz WithZero.exp_ne_zero).mpr ha
end
end ProximityPrize.SubmissionLower.ActualFirstCutPole6807
Source