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

Persistent queues — false conclusion

Lax755887.PersistentQueueClaim · concepts/Lax755887/PersistentQueueClaim.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

    This deliberately false application claim is derived only from the unchecked contract. A checked conditional derivation must not mark this statement proven.

    Concept map
    2 concepts
    100%
    Open claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax755887.PersistentQueue
    2
    3/-!
    4---
    5title: Persistent queues — false conclusion
    6type: theorem
    7---
    8This deliberately false application claim is derived only from the unchecked contract. A checked conditional derivation must not mark this statement proven.
    9-/
    10
    11namespace Lax755887.PersistentQueueClaim
    12
    13open Lax755887.PersistentQueue
    14
    15axiom repeated_dequeue_linear :
    16 ∃ C : ℕ, ∀ n, totalWork (List.replicate (n + 1) (dequeue n)) ≤ C * (n + 1)
    17
    18end Lax755887.PersistentQueueClaim
    19
    Show Proof Attempt
    Builds on
    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…