Document absolute factorization and absolute irreducibility over QQbar #41485
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.
This PR documents SageMath’s existing support for absolute factorization and absolute irreducibility of polynomials via factorization over
QQbarandAA.Although Sage already supports factorization over the algebraic closure of the rationals (using Singular’s
absfactlibrary for multivariate polynomials), this functionality was not explicitly documented or linked to the standard terminology used in the literature. As a result, it was difficult for users to discover via the documentation or search engines.This change adds a dedicated section to the polynomial rings reference, including clear explanations and examples demonstrating absolute factorization and absolute irreducibility testing.
Fixes #41484.
📝 Checklist
⌛ Dependencies
None.