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.
This commit is contained in:
1 parent
bd5b3c885c
commit
efd1b323e7
4 files changed
+47
-6
No files matched your search
+7
-2
@@ -4,8 +4,8 @@ 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 theorem with a placeholder proof; `lake comparator` compares this
|
||||
statement against the proof in `Solution.lean`.
|
||||
headline theorems with placeholder proofs; `lake comparator` compares these
|
||||
statements against the proofs in `Solution.lean`.
|
||||
-/
|
||||
|
||||
namespace Statement
|
||||
@@ -15,4 +15,9 @@ namespace Statement
|
||||
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
|
||||
Reference in new issue
Block a user