[Merged by Bors] - feat(RingTheory/Finiteness): Improve fg_induction#37484
Closed
martinwintermath wants to merge 4 commits intoleanprover-community:masterfrom
Closed
[Merged by Bors] - feat(RingTheory/Finiteness): Improve fg_induction#37484martinwintermath wants to merge 4 commits intoleanprover-community:masterfrom
fg_induction#37484martinwintermath wants to merge 4 commits intoleanprover-community:masterfrom
Conversation
PR summary e5c478fa82Import changes for modified filesNo significant changes to the import graph Import changes for all files
Declarations diff
You can run this locally as follows## summary with just the declaration names:
./scripts/pr_summary/declarations_diff.sh <optional_commit>
## more verbose report:
./scripts/pr_summary/declarations_diff.sh long <optional_commit>The doc-module for No changes to technical debt.You can run this locally as
|
Collaborator
chrisflav
reviewed
Apr 14, 2026
Member
chrisflav
left a comment
There was a problem hiding this comment.
Thanks for fixing this. Could you please mention the fact that this change enables usage of induction with this lemma in the PR description?
|
🚀 Pull request has been placed on the maintainer queue by chrisflav. |
mathlib-bors bot
pushed a commit
that referenced
this pull request
Apr 14, 2026
- include the FG-hypothesis into motive for `fg_induction`. This is necessary, since it might be that `P (M₁ ⊔ M₂)` is only provable from `P M₁`and `P M₂` if we can use that `M₁` and `M₂` are FG. Also, `M₁.FG` and `M₂.FG` are not provable from `(M₁ ⊔ M₂).FG` in general. This also enables the use of the `induction` tactic with `fg_induction`. - add `fg_sup_span_induction` that adds one 1-dimensional submodule at a time. - give expressive names to the induction start and induction step hypotheses. Co-authored-by: Martin Winter <martin.winter.math@gmail.com>
Contributor
|
Pull request successfully merged into master. Build succeeded: |
fg_inductionfg_induction
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
fg_induction. This is necessary, since it might be thatP (M₁ ⊔ M₂)is only provable fromP M₁andP M₂if we can use thatM₁andM₂are FG. Also,M₁.FGandM₂.FGare not provable from(M₁ ⊔ M₂).FGin general. This also enables the use of theinductiontactic withfg_induction.fg_sup_span_inductionthat adds one 1-dimensional submodule at a time.