Files
conflict-range/Challenge.lean
T
andrew efd1b323e7 Prove minimality is unique and add it to the headlines
- Define `ConflictRange.toSet`, the set of keys lying in a range
- Add the headline `MinimalUnique`: any two minimal sound ranges for the
  same read and result denote the same set of keys
- Transport `FormalConflictRange.Minimal.toSet_eq` across the bridge; the
  statement is unconditional, since `Minimal` already carries soundness
- State `Statement.minimalUnique` in the challenge and add it to the
  comparator's `theorem_names`

`lake build` is warning-free and `lake comparator` accepts both headlines.
2026-11-17 11:39:52 -05:00

24 lines
701 B
Lean4

import Statement
/-!
# Challenge: minimality of the conflict-range closed form
This file is the trusted statement side of the comparator check. It states the
headline theorems with placeholder proofs; `lake comparator` compares these
statements against the proofs in `Solution.lean`.
-/
namespace Statement
/-- **The closed form is minimal.** For every readable read/result pair,
`closedForm r res` is a minimal sound conflict range. -/
theorem closedFormMinimal : ClosedFormMinimal := by
sorry
/-- **Minimality is unique.** Any two minimal sound conflict ranges for the same
read and result denote the same set of keys. -/
theorem minimalUnique : MinimalUnique := by
sorry
end Statement