Documentation

LeanPool.Superdiffusion.Algsuperdiff.Section3.Provider.Multiscale.SimplexDomains

SimplexDomains #

Ported from scottnarmstrong/Superdiffusion at 7f20476385d4af418f110303085ad0740c9eba46. Module imports, support namespace and local option directives adapted for Lean Pool.

The cells of SW(□_m) as Chapter 2 domains #

This module is the measure-theoretic layer that the proved simplex partition d.simplex.partition (Provider/Whitney/SimplexPartition.lean) explicitly leaves open, and that the subadditive decomposition of p.bfA.multiscalebound (e.sum-of-a-decomp) needs in order to feed SW(□_m) to l.subadd.betterer (Provider/Whitney/SubadditivityCountable.lean):

Why the open realization #

l.subadd.betterer is stated for a family of Ch02.Domains — open bounded convex nonempty sets — because the variational class L²_pot,0(U) × L²_sol,0(U) of e.variational.mu.U.P is only defined there. The manuscript's simplices are open, and the exact half-open partition of SimplexPartition.lean is the bookkeeping device that makes the covering statement exact; the passage between them is the null-boundary fact proved here. No face-to-face or simplicial-complex property is used or asserted.

References #

Countability #

KuhnCell d is countable: a cell is a triadic cube together with a permutation of Fin d.

The open cell is a Chapter 2 domain #

The barycentric-type interior point of a Kuhn cell: the k-th coordinate is placed at height (rank(k) + 1)/(d + 1) of the support cube, where rank is the position of k in the cell's order.

Equations
  • One or more equations did not get rendered due to their size.
Instances For

    The open simplex △ as a Chapter 2 domain. This is the carrier at which l.subadd.betterer reads the cells of SW(□_m).

    Equations
    Instances For

      The half-open cell exceeds the open one by a null set #

      The half-open cell is contained in the closure of the open one: sliding a point of the half-open cell towards the interior point makes every weak inequality strict.

      The open cells cover the root cube up to a null set #

      The hcover input of l.subadd.betterer at SW(□_m). The open cells of the simplex partition exhaust the open root cube up to a Lebesgue null set: the half-open cells exhaust it exactly (iUnion_carrier_simplexPartition_eq_openCubeSet) and each half-open cell exceeds its open cell by a null set.