Skip to content
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.

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

feat: Defining Greedoid #10186

Open
wants to merge 212 commits into
base: master
Choose a base branch
from
Open

feat: Defining Greedoid #10186

wants to merge 212 commits into from

Conversation

qawbecrdtey
Copy link
Collaborator

@qawbecrdtey qawbecrdtey commented Feb 2, 2024


Open in Gitpod

The working old branch for this project is greedoid-defs. This branch does not contain all features of the working old branch, and is for real contribution to Mathlib.

The current branch have three files Accessible.lean, Exchange.lean and Basic.lean.

Before greedoid is properly defined, it defines two concepts on set systems, namely ExchangeProperty in Exchange.lean and AccessibleProperty and Accessible in Accessible.lean.

Greedoid is a structure of set systems containing empty set, which satisfies an ExchangeProperty, and is defined in Basic.lean.

  • Edit(4de12f4): Removed Basic.lean (will be added later), changed pull request title.
  • Edit(31f8297): Restored Basic.lean, but removed theorems related to exchangeProperty and accessibleProperty. Removed theorems are likely to be added in the next commit.
  • Edit(9494d7b): Splitted into three files (Accessible/Exchange/Basic). Now Greedoid uses Finset α → Prop as a feasible set. ground_set is present as there are some appearance of minors in the literature.

@github-actions github-actions bot added the t-data Data (lists, quotients, numbers, etc) label Oct 2, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
t-combinatorics Combinatorics t-data Data (lists, quotients, numbers, etc) WIP Work in progress
Projects
None yet
Development

Successfully merging this pull request may close these issues.

6 participants