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

Contradiction from the merge-cost bound

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

open

Loading review…

Sign in with ORCID

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

    A constant CC cannot bound every exponent kk. The contradiction is conditional on the false cost contract.

    Concept map
    1 concept
    100%
    Open claimThis concept
    Evidence

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1
    2
    3/-!
    4---
    5title: Contradiction from the merge-cost bound
    6type: theorem
    7---
    8A constant CC cannot bound every exponent kk. The contradiction is conditional on the false cost contract.
    9-/
    10
    11namespace Lax755887.MergeClaim
    12
    13axiom cost_axiom_is_inconsistent : False
    14
    15end Lax755887.MergeClaim
    16
    Show Proof Attempt
    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…