Lax Lean Archive

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

No uniform linear bound on merge costs

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

proven

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

    Taking k=C+1k=C+1 refutes the proposed uniform bound without assuming the cost contract.

    Concept map
    1 concept
    100%
    Proven claimThis concept
    Evidence

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1
    2
    3/-!
    4---
    5title: No uniform linear bound on merge costs
    6type: theorem
    7---
    8Taking k=C+1k=C+1 refutes the proposed uniform bound without assuming the cost contract.
    9-/
    10
    11namespace Lax755887.MergeControl
    12
    13axiom no_linear_bound : ¬ ∃ C : Nat, ∀ k : Nat, k * 2 ^ k ≤ C * 2 ^ k
    14
    15end Lax755887.MergeControl
    16
    Show Proof
    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…