Exact decomposition of the reference sharp row into graph and errors
ProvedErdos390.Full.PaperBridgeFit.BridgeData.referenceSharpRow_eq_primeGraph_add_errorsanalytic-number-theoryerdos-390erdos390-source-construction
Write , , , and . Let be a bridge with finite head and band sets, and write , for harmonic band masses, for band centers, and for the band of . Let be its squarefree Poisson–Dickman reference entry, , and its tilted law. For every real band vector and every band , let be the reference sharp row and let be the graph operator of the compressed prime graph. With the source row-residual error and diagonal and kernel centering errors ,
This exact identity separates graph coercivity from the three arithmetic approximation errors.
Preamble
import Mathlib import Definitions.Def_erdos390_source_bank_interface import Definitions.Def_erdos390_dickman_step_function import Theorems.Thm_MediumPNT import Definitions.Def_erdos390_analytic_foundations_001 import Theorems.Thm_Erdos390_Full_DickmanBasic_kernel_product_bound import Theorems.Thm_Erdos390_Full_DickmanBasic_rho_pos_on_zero_five import Theorems.Thm_Erdos390_Full_DickmanBasic_kernel_secondDerivative_first_bound import Definitions.Def_erdos390_analytic_foundations_002 import Definitions.Def_erdos390_analytic_foundations_003 import Definitions.Def_erdos390_analytic_foundations_004 import Definitions.Def_erdos390_analytic_foundations_005 universe u_1 u_2
Formal statement
theorem Erdos390.Full.PaperBridgeFit.BridgeData.referenceSharpRow_eq_primeGraph_add_errors :
∀ {Head : Type u_1} {Band : Type u_2} [inst : Fintype.{u_1} Head] [inst_1 : DecidableEq.{u_1 + 1} Head]
[inst_2 : Fintype.{u_2} Band] [inst_3 : DecidableEq.{u_2 + 1} Band]
(B : Erdos390.Full.PaperBridgeFit.BridgeData.{u_1, u_2} Head Band) (x : Band → Real) (i : Band),
Eq.{1}
(Erdos390.Full.SquarefreeSharpBandTransfer.referenceSharpRow.{u_2}
(Erdos390.Full.PaperBridgeFit.BridgeData.partition.{u_1, u_2} B) x i)
(HAdd.hAdd.{0, 0, 0}
(HAdd.hAdd.{0, 0, 0}
(HAdd.hAdd.{0, 0, 0}
(Erdos390.Full.FiniteGraphQuotientInverse.graphOperator.{u_2}
(Erdos390.Full.PaperBridgeFit.BridgeData.compressedPrimeGraphEdge.{u_1, u_2} B) x i)
(Erdos390.Full.PaperBridgeFit.BridgeData.referenceResidualError.{u_1, u_2} B x i))
(Erdos390.Full.PaperBridgeFit.BridgeData.referenceCenteringDiagonal.{u_1, u_2} B x i))
(Erdos390.Full.PaperBridgeFit.BridgeData.referenceCenteringKernel.{u_1, u_2} B x i)) := by sorry
Source