b-mehta / b-mehta/combinatorics

More usable form of KK (and relatives)

Open
#1 0 comments 0 reactions 0 assignees View on GitHub
enhancement
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

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.