Polish release docs and add CI checks

- Correct stale references and headline-path wording in READMEs and Lean docstrings
- Document build steps, comparator requirements, sweep scope, and coverage
- Unify Apache headers across Lean and C++ sources
- Add a bwrap-free axiom audit for the headline theorems
- Add a Gitea workflow running lake build, the axiom audit, C++ tests, and coverage
- Match LLVM coverage tool versions to the compiler and recreate stale build dirs
This commit is contained in:
andrew committed 2026-11-17 21:29:16 -05:00
1 parent 73e371fb40
commit 273ad72f0c
34 files changed
+431 -133

No files matched your search

+7 -6
View File
@@ -79,7 +79,7 @@ conjoins its argument.
* `hullRanges`, `collectReadOff`, `sound_collectReadOff` — the concrete computable
read-off (hull of the required boundary `emptyValue`s and the bracket/core supports)
and its **unconditional** soundness, for any realizable read/result with nonempty
ascending reported keys. It validates on the old counterexample `ceRead`, whose
ascending reported keys. It validates on an earlier counterexample whose
`completeRange` was unsound.
* `sound_congr_toSet`, `minimal_congr_toSet`, `minimal_collectReadOff_of_subrange` —
soundness/minimality depend on a range only through its key set, so the read-off is
@@ -99,14 +99,15 @@ conjoins its argument.
it contained in the minimal range; `minimal_inter_collectReadOff_of_minimal` is the
wrapper for the read-off, and `minimal_inter_collectReadOff_truncated_fwd`/`_rev` (+ the
overshoot variant) apply it to the truncated branch, where the read-off alone overshoots
(`Counterexample.ct_collectReadOff_not_minimal`).
(an explicit truncated witness).
* `reported_keys_bounds`, `subrange_collectReadOff_canonical`,
`collectReadOff_toSet_eq_canonical`, `minimal_collectReadOff_canonical` — the
canonical-region containment, proved. For a complete nonempty realizable pair in
`1 ≤ begin.offset ∧ end_.offset ≤ 1`, every reported key lies in `[begin.key, end.key)`,
so each boundary `emptyValue` and bracket/core support is contained in the canonical
range; the read-off is contained in it and, being sound, shares its key set. Thus
`collectReadOff` is minimal there, extending end-to-end minimality beyond `ceRead`.
`collectReadOff` is minimal there, extending end-to-end minimality beyond the earlier
counterexamples.
* `subrange_collectReadOff_topRange`, `minimal_collectReadOff_topRange` — the
overshoot-region containment, proved. For a complete nonempty realizable pair in
`1 ≤ begin.offset ∧ 2 ≤ end.offset` with every reported key below `end.key`, the
@@ -483,7 +484,7 @@ theorem shortGap_not_le (db : DB) {g : ℕ} {lo hi : WithTop Key} (hfin : lo ≤
/-- The constraints a complete nonempty result exposes, in difference form. `B`
and `E` are the selector keys, `oB`/`oE` their offsets, `L` the reported keys.
The binding directions are chosen from the bridge analysis of the main notes,
The binding directions are chosen from the bridge analysis of the main development,
displayed in the single normal form `ρ hi − ρ lo ≤ n` (`ge` is `le` with the
endpoints swapped and the bound negated):
@@ -2723,7 +2724,7 @@ theorem collectReadOff_toSet_eq_canonical {r : RangeRead} {res : Result}
/-- **Minimality of the concrete read-off in the canonical region.** For a complete
nonempty realizable read/result pair with `1 ≤ begin.offset` and `end_.offset ≤ 1`, the
computable hull `collectReadOff` is a minimal sound conflict range. This extends
end-to-end minimality beyond the counterexample `ceRead`. -/
end-to-end minimality beyond the earlier counterexamples. -/
theorem minimal_collectReadOff_canonical {r : RangeRead} {res : Result}
(hread : Readable r res) (hmore : res.more = false) (hne : res.keys ≠ [])
(hbegin : 1 ≤ r.begin.offset) (hend : r.end_.offset ≤ 1) :
@@ -2922,7 +2923,7 @@ theorem minimal_collectReadOff_complete_general {r : RangeRead} {res : Result}
/-! ### The truncated branch through the meet
The read-off over-collects on a truncated result (`Counterexample.ct_collectReadOff_not_minimal`),
The read-off over-collects on a truncated result (an explicit truncated witness),
but its meet with the algorithm's proven-minimal truncated value is still minimal
(`minimal_inter_of_sound_of_minimal`): the meet is sound, so it sits inside the minimal
range, and being a subrange of it (the minimal range is itself a subrange of the