Skip to content

docs: mark SimpleGraph.ball upstreamed in Mathlib #36443 #14

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
Navi Bot (project-navi-bot) merged 1 commit into from
May 13, 2026
Merged

docs: mark SimpleGraph.ball upstreamed in Mathlib #36443 #14

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -44,7 +44,7 @@ This is the ground truth formula that [navi-fractal](https://github.com/Project-

| Declaration | File | Topic | Mathlib status |
|-------------|------|-------|----------------|
| `SimpleGraph.ball` + 7 core lemmas | `GraphBall` | Open metric ball via `edist` (8 core + 6 convenience lemmas) | No `SimpleGraph.ball` in Mathlib; PR ready to open |
| `SimpleGraph.ball` + 7 core lemmas | `GraphBall` | Open metric ball via `edist` (8 core + 6 convenience lemmas) | Merged: [Mathlib #36443](https://github.com/leanprover-community/mathlib4/pull/36443) (2026-04-19, via bors) |
Comment thread
project-navi-bot marked this conversation as resolved.
| `pathGraph_edist`, `pathGraph_dist` + 2 corollaries | `PathGraphDist` | Distance in path graphs = index difference | No distance lemmas for `pathGraph` in Mathlib |

## Axiom boundary
Expand All @@ -71,7 +71,7 @@ lake build --wfail # fail on any sorry or warning

```
FdFormal/
GraphBall.lean — SimpleGraph.ball (open ball via edist), 8 core + 6 convenience lemmas (upstream candidate)
GraphBall.lean — SimpleGraph.ball (open ball via edist), 8 core + 6 convenience lemmas (upstreamed: Mathlib #36443)
FlowerGraph.lean — Hub vertices and structural helpers
FlowerCounts.lean — Exact edge/vertex count formulas, bounds, monotonicity
FlowerDiameter.lean — Hub-distance scaling L_g = u^g, cast identities
Expand Down
Loading