Skip to content
This repository was archived by the owner on Jul 24, 2024. It is now read-only.

feat(combinatorics/simple graph/connectivity): lemmas about connectivity of subgraphs and induced graphs#18454

Closed
bottine wants to merge 21 commits intomasterfrom
bottine/combinatorics.simple_graph.connectivity/connectivity_of_induced_graphs
Closed

feat(combinatorics/simple graph/connectivity): lemmas about connectivity of subgraphs and induced graphs#18454
bottine wants to merge 21 commits intomasterfrom
bottine/combinatorics.simple_graph.connectivity/connectivity_of_induced_graphs

Conversation

@bottine
Copy link
Copy Markdown
Collaborator

@bottine bottine commented Feb 16, 2023

Co-authored-by: Kyle Miller kmill31415@gmail.com


Open in Gitpod

@bottine bottine requested a review from a team as a code owner February 16, 2023 09:48
@bottine bottine added awaiting-review The author would like community review of the PR t-combinatorics Combinatorics labels Feb 16, 2023
@bottine bottine requested a review from YaelDillies February 16, 2023 13:27
Copy link
Copy Markdown
Collaborator

@kmill kmill left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I've left some suggestions up until induce_walk_support_connected.

In general, I think we need these results to be generalized to apply to subgraphs, where they're more naturally stated. We also need a bit more development on simple_graph.walk.to_subgraph.

Note that for the code I wrote I didn't think too hard about naming or implicit/explicit arguments.

@bottine
Copy link
Copy Markdown
Collaborator Author

bottine commented Feb 17, 2023

I started a rewrite according to your input @kmill:

  • I've put everything in a new file connectivity/subgraph.lean because I think the connectivity.lean file is becoming too large for comfortable editing.
  • I still haven't converted induce_sUnion_connected_of_pairwise_not_disjoint to subgraph, but will come to it later today.

Is that looking better?

@bottine
Copy link
Copy Markdown
Collaborator Author

bottine commented Feb 17, 2023

OK, I've cleaned things up a bit, but since I actually don't need the subgraph version of induce_sUnion_connected_of_pairwise_not_disjoint and I got hurt because bounded Sups don't unfold nicely, I'd rather not do it in this PR.
The signature would be :

lemma subgraph.sUnion_connected_of_pairwise_not_disjoint {S : set G.subgraph} (Sn : S.nonempty)
  (Snd : ∀ {s : G.subgraph}, s ∈ S → ∀ {t : G.subgraph}, t ∈ S → (s ⊓ t).verts.nonempty)
  (Sc : ∀ {s : G.subgraph}, s ∈ S → s.connected) :
  (⨆ (s ∈ S), s).connected := sorry

I'll probably remove the complete lattice definitions for subgraph since they are not needed anymore, except if someone cares to prove that stubbed lemma.

OK I've removed the "complete_lattice" definitions and the subgraph version of the of_patches lemma, since I don't need it, and its use in general is maybe not obvious.

@bottine bottine requested review from YaelDillies and kmill February 17, 2023 15:29
@bottine bottine changed the title feat(combinatorics/simple graph/connectivity): lemmas about connectivity of induced graphs feat(combinatorics/simple graph/connectivity): lemmas about connectivity of subgraphs and induced graphs Feb 17, 2023
import combinatorics.simple_graph.connectivity
import combinatorics.simple_graph.subgraph
/-!
# Connectivity of subgraphs
Copy link
Copy Markdown
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
# Connectivity of subgraphs
# Connectivity of subgraphs and induced graphs

Could you also move everything that's specifically about induced graphs (not induced subgraphs) to a section at the end?

It would also be good to arrange other things more thematically, like putting walk.to_subgraph_connected right after its two supporting lemmas.

Copy link
Copy Markdown
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

It would also be good to arrange other things more thematically, like putting walk.to_subgraph_connected right after its two supporting lemmas.

Not sure exactly how to do that, since walk.to_subgraph_connected the dependencies of lemmas aren't really linear starting with .sup, but I tried.

@bottine bottine removed the merge-conflict Please `git merge origin/master` then a bot will remove this label. label Mar 2, 2023
@bottine bottine requested a review from kmill March 2, 2023 05:48
@kim-em kim-em added the modifies-synchronized-file This PR touches a files that has already been ported to mathlib4, and may need a synchronization PR. label Mar 28, 2023
@eric-wieser eric-wieser added the not-too-late This PR was ready at the point mathlib3 was frozen: we will try to merge it and port it to mathlib4 label Jul 15, 2023
@kmill
Copy link
Copy Markdown
Collaborator

kmill commented Jul 15, 2023

This is now replaced by a mathlib4 PR: leanprover-community/mathlib4#5927

@kmill kmill closed this Jul 15, 2023
@YaelDillies YaelDillies deleted the bottine/combinatorics.simple_graph.connectivity/connectivity_of_induced_graphs branch July 15, 2023 15:47
bors bot pushed a commit to leanprover-community/mathlib4 that referenced this pull request Aug 12, 2023
(Replaces [mathlib#18454](leanprover-community/mathlib3#18454).)

Co-authored-by: Rémi Bottinelli <remi.bottinelli@bluewin.ch>
bors bot pushed a commit to leanprover-community/mathlib4 that referenced this pull request Aug 14, 2023
(Replaces [mathlib#18454](leanprover-community/mathlib3#18454).)

Co-authored-by: Rémi Bottinelli <remi.bottinelli@bluewin.ch>
kim-em pushed a commit to leanprover-community/mathlib4 that referenced this pull request Aug 15, 2023
(Replaces [mathlib#18454](leanprover-community/mathlib3#18454).)

Co-authored-by: Rémi Bottinelli <remi.bottinelli@bluewin.ch>
kim-em pushed a commit to leanprover-community/mathlib4 that referenced this pull request Aug 15, 2023
(Replaces [mathlib#18454](leanprover-community/mathlib3#18454).)

Co-authored-by: Rémi Bottinelli <remi.bottinelli@bluewin.ch>
kim-em pushed a commit to leanprover-community/mathlib4 that referenced this pull request Aug 17, 2023
(Replaces [mathlib#18454](leanprover-community/mathlib3#18454).)

Co-authored-by: Rémi Bottinelli <remi.bottinelli@bluewin.ch>
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.

Labels

awaiting-review The author would like community review of the PR modifies-synchronized-file This PR touches a files that has already been ported to mathlib4, and may need a synchronization PR. not-too-late This PR was ready at the point mathlib3 was frozen: we will try to merge it and port it to mathlib4 t-combinatorics Combinatorics

Projects

None yet

Development

Successfully merging this pull request may close these issues.

5 participants