Positive cutoff certificate for the nonstep residual row
Definitionerdos390_analytic_nonstep_certificatenumber-theory
If a cutoff is at least two and W is at least that cutoff, then W is greater than one. This closed arithmetic certificate supplies a named proof argument for the nonstep residual-row proposition.
Definition code
import Definitions.Def_erdos390_analytic_foundations_007
universe u_1
theorem Erdos390.Full.PaperBridgeFit.BridgeData.exists_global_cutoff_eventually_canonical_nonstepSlowResidualRow_le._proof_1 :
∀ (W₀ : Nat),
LE.le.{0} 2 W₀ →
∀ (W : Nat),
LE.le.{0} W₀ W →
∀ {delta eta : Real} (M : Erdos390.Full.RegularRelativeMesh.Mesh delta eta) {Head : Type u_1}
[inst : Fintype.{u_1} Head] [inst_1 : DecidableEq.{u_1 + 1} Head]
(I : Erdos390.Full.PaperGuardCensus.PhysicalIntervals) (n : Nat)
(B :
Erdos390.Full.PaperBridgeFit.BridgeData.{u_1, 0} Head
(Fin (HAdd.hAdd.{0, 0, 0} (Erdos390.Full.RegularRelativeMesh.Mesh.cellCount M) 1))),
Eq.{1}
(Erdos390.Full.PaperBridgeFit.StructuredSampleData.W.{u_1}
(Erdos390.Full.PaperBridgeFit.BridgeData.sampleData.{u_1, 0} B))
W →
Not (LT.lt.{0} 1 W) → False := by intros; omega
Source