[Merged by Bors] - feat(LinearAlgebra/Transvection): the determinant of a transvection is equal to 1.#32757
Closed
AntoineChambert-Loir wants to merge 160 commits intoleanprover-community:masterfrom
Closed
Conversation
…r/mathlib4 into ACL-QuadraticAlgebra
3 tasks
alreadydone
reviewed
Jan 10, 2026
Contributor
alreadydone
left a comment
There was a problem hiding this comment.
Is it easier to use Matrix.det_of_upperTriangular?
Collaborator
Author
|
Over a field, that's essentially what is done. But that wouldn't suffice over a ring. |
Contributor
|
Oh, I see, it's because |
Collaborator
Author
|
Exactly! |
Open
10 tasks
eric-wieser
reviewed
Jan 13, 2026
11 tasks
Co-authored-by: Eric Wieser <[email protected]>
ocfnash
approved these changes
Jan 23, 2026
Contributor
ocfnash
left a comment
There was a problem hiding this comment.
Thanks for this lovely work and also for your extraordinary patience!
bors d+
Contributor
|
✌️ AntoineChambert-Loir can now approve this pull request. To approve and merge a pull request, simply reply with |
Collaborator
Author
|
bors r+ |
mathlib-bors bot
pushed a commit
that referenced
this pull request
Jan 23, 2026
…s equal to 1. (#32757) Prove that the determinant of a transvection is equal to 1 The proof goes by showing that the determinant of `LinearMap.transvection f v` is `1 + f v` (even if `f v` is nonzero). I first treat the case of a field, distinguishing whether `f v = 0` (so that we get a transvection) or not (so that we have a dilation). Then, by base change to the field of fractions, I can handle the case of a domain. Finally, the general case is treated by base change from the “universal case” where the base ring is the ring of polynomials in $$2n$$ indeterminates corresponding to the coefficients of $$f$$ and $$v$$. Co-authored-by: pre-commit-ci-lite[bot] <117423508+pre-commit-ci-lite[bot]@users.noreply.github.com>
Contributor
|
Pull request successfully merged into master. Build succeeded: |
goliath-klein
pushed a commit
to PrParadoxy/mathlib4
that referenced
this pull request
Jan 24, 2026
…s equal to 1. (leanprover-community#32757) Prove that the determinant of a transvection is equal to 1 The proof goes by showing that the determinant of `LinearMap.transvection f v` is `1 + f v` (even if `f v` is nonzero). I first treat the case of a field, distinguishing whether `f v = 0` (so that we get a transvection) or not (so that we have a dilation). Then, by base change to the field of fractions, I can handle the case of a domain. Finally, the general case is treated by base change from the “universal case” where the base ring is the ring of polynomials in $$2n$$ indeterminates corresponding to the coefficients of $$f$$ and $$v$$. Co-authored-by: pre-commit-ci-lite[bot] <117423508+pre-commit-ci-lite[bot]@users.noreply.github.com>
YellPika
pushed a commit
to YellPika/mathlib4
that referenced
this pull request
Feb 3, 2026
…s equal to 1. (leanprover-community#32757) Prove that the determinant of a transvection is equal to 1 The proof goes by showing that the determinant of `LinearMap.transvection f v` is `1 + f v` (even if `f v` is nonzero). I first treat the case of a field, distinguishing whether `f v = 0` (so that we get a transvection) or not (so that we have a dilation). Then, by base change to the field of fractions, I can handle the case of a domain. Finally, the general case is treated by base change from the “universal case” where the base ring is the ring of polynomials in $$2n$$ indeterminates corresponding to the coefficients of $$f$$ and $$v$$. Co-authored-by: pre-commit-ci-lite[bot] <117423508+pre-commit-ci-lite[bot]@users.noreply.github.com>
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.
Prove that the determinant of a transvection is equal to 1
The proof goes by showing that the determinant of
LinearMap.transvection f vis1 + f v(even iff vis nonzero).I first treat the case of a field, distinguishing whether
f v = 0(so that we geta transvection) or not (so that we have a dilation).
Then, by base change to the field of fractions, I can handle the case of a domain. Finally, the general case is treated by base change from the “universal case” where the base ring is the ring of polynomials in$$2n$$ indeterminates corresponding to the coefficients of $$f$$ and $$v$$ .