b-mehta / b-mehta/combinatorics
More usable form of KK (and relatives)
- Dominant language
- Lean
- Stars
- 27
- Forks
- 0
- PR merge metrics
- No merged PRs in 30d
Description
It would be nice to have
```lean
theorem kruskal_katona' {r : β} {π π : finset (finset β)}
(hβ : all_sized π r) (hβ : π.card = π.card) (hβ : is_init_seg_of_colex π r) :
(βπ).card β€ (βπ).card :=
begin
```
Note how the types of `π` and `π` are changed to `finset (finset β)`, instead of `finset (finset (fin n))`.
Mathematically, this isn't any harder, but there's a couple of details to take care of to formalise. Some of the commented out code around line 200 in `kruskal_katona.lean` might help with this.
Contributor guide
No contributing guide indexed for this repository
Research direction
Open kruskal_katona.lean and inspect the commented-out code around line 200; it may show how the existing finite-universe theorem can be adapted. Work toward the requested kruskal_katona' statement using finset (finset β), and verify that the theorem and its supporting details typecheck.
Written by the indexing model from the issue text.
Assessment
- Domain
- tooling
- Issue type
- Feature
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 45/100