Lax Lean Archive

While this submission is a draft, it cannot be used by other submissions.

A uniform linear bound on merge costs

Lax755887.MergeCost · concepts/Lax755887/MergeCost.lean · lax-755887

open

Loading review…

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural Language Statement

    Theorem

    At input size 2k2^k, the work is k2kk 2^k. The assertion of a uniform linear bound is deliberately false. It is the axiom used by the imported-dependency example.

    Concept map
    1 concept
    100%
    Open claimThis concept
    Evidence

    Each proof establishes this claim relative to its assumptions.

    No proof in the archive yet — this claim is open.

    Lean source view on GitHub

    1
    2
    3/-!
    4---
    5title: A uniform linear bound on merge costs
    6type: theorem
    7---
    8At input size 2k2^k, the work is k2kk 2^k. The assertion of a uniform linear bound is deliberately false. It is the axiom used by the imported-dependency example.
    9-/
    10
    11namespace Lax755887.MergeCost
    12
    13axiom linearMergeCost : ∃ C : Nat, ∀ k : Nat, k * 2 ^ k ≤ C * 2 ^ k
    14
    15end Lax755887.MergeCost
    16
    Builds on

    none

    Used by

    none

    From Mathlib

    none

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…