Documentation

Complexitylib.Algebraic.LowerBound.Cutwidth.Extractor.Strong.Block.Recursion.NearHalving.Defs

The recursive extractor with a near-halving entropy schedule #

Start with the original Boolean input as a single block, with a trivial initial seed. Every internal level uses the actual paired condenser at rate 16*(h+1), its scheduled entropy, and its current rounded width. The final one-shot extractor is shared by all leaves. The complete tuple retains every fresh field seed and the final independent seed pair once.

This specifies the semantic construction. Its numerical budgets, extraction guarantee, Boolean seed representation, and evaluator are separate layers.

@[reducible, inline]

The fresh field seed at one internal level of the near-halving recursion.

Equations
  • One or more equations did not get rendered due to their size.
Instances For
    @[reducible, inline]

    The final condenser and hash seeds, shared across every leaf.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For
      @[reducible, inline]

      All retained seeds, with no random bits spent on the identity initialization.

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For
        noncomputable def Algebraic.Cutwidth.Extractor.nearHalvingBlockStep (n h Q E i : ℕ) (x : Fin (nearHalvingBlockWidth n h Q E i) → Bool) (seed : NearHalvingBlockLevelSeed n h Q E i) :
        (Fin (nearHalvingBlockWidth n h Q E (i + 1)) → Bool) × (Fin (nearHalvingBlockWidth n h Q E (i + 1)) → Bool)

        The actual paired condenser for one near-halving level.

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

          The actual near-halving recursion followed by shared extraction at its leaves.

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