Documentation

LeanPool.HighContrastHomogenization.Provider.PolynomialHomogenization.Root.CorrectorComposition.SelectedReferenceResidue

High-contrast homogenization: #

Provider.PolynomialHomogenization.Root.CorrectorComposition.SelectedReferenceResidue

Imported from the Apache-2.0 HighContrastHomogenization development at commit 7a13dbcd8d6609264a713373f5c69ceeac870472.

The selected-reference residue, reduced to one pointwise identity #

The corrector-family hypothesis RootPushCanonicalFamily of the decay and Liouville clauses reduces to a selected-reference identity, a conjunction of

  1. a pointwise normalized-root coefficient identity for the selected corrector datum's reference family, on every triadic cube; and
  2. a natural delay ∃ L : ℕ, (selected …).start ≤ triadicCeilingIndex x + L.

Clause 2 is free: it is the statement that an integer is below k + L for some natural L, which the Archimedean property of ℤ settles. This module proves that, so the residue is clause 1 alone — a single pointwise coefficient identity, with no delay, no order, no tolerance and no estimate.

Why clause 1 is not provable in this form, and what the minimal repair is #

The obstruction is a data-structure defect, not an analytic gap, and it is worth recording exactly.

Minimal repair (an interface item for the stationary corrector family clause module, not applied here): index the corrector datum by the exact coefficient field it represents — add exactField : CoeffField d together with coeffExact : ∀ Q, (aFin.coeffOn Q).toCoeffField = exactField to RootCorrectorData, and pin the exact field in RootCorrectorEvent's index rather than leaving it to Classical.choice. The single constructor rootCorrectorEvent_of_goodTail then gains one hypothesis, which the supply site discharges directly with the converter's own witness. Adding the field without pinning the index does not work: two data with a.e.-equal exact fields are both inhabitants, and the choice may return either.

Nothing in this file assumes clause 1. It is carried as a named hypothesis.

The delay clause is free #

theorem HCPolySupport.HighContrast.Root.exists_natDelay_ge (n : ℤ) (k : ℕ) :
∃ (L : ℕ), n ≤ ↑(k + L)

Every integer lies below k + L for some natural L.

The residue without the delay #