How to Automatise Proofs of Operator Statements: Moore–Penrose Inverse; A Case Study
From MaRDI portal
Publication:6496593
DOI10.1007/978-3-031-41724-5_3MaRDI QIDQ6496593
Georg Regensburger, Clemens Hofstadler, Unnamed Author
Publication date: 3 May 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Categories as algebra: An essential ingredient in the theory of monoids
- Reverse order law for the Moore-Penrose inverse
- The reverse order law revisited
- The Moore-Penrose inverse of a morphism with factorization
- Computer assistance for ``discovering formulas in system engineering and operator theory
- Signature Gröbner bases, bases of syzygies and cofactor reconstruction in the free algebra
- Formally verifying proofs for algebraic identities of matrices
- Formal proofs of operator identities by a single formal computation
- Algebraic proof methods for identities of matrices and operators: improvements of Hartwig's triple reverse order law
- Computing elements of certain form in ideals to prove properties of operators
- A Proof Method for Quantification Theory: Its Justification and Realization
- Solving Polynomial Equation Systems
- Standard Gröbner-Shirshov Bases of Free Algebras Over Rings, I
- Computer simplification of formulas in linear systems theory
- Letterplace
- On Majorization, Factorization, and Range Inclusion of Operators on Hilbert Space
- Certifying operator identities via noncommutative Gröbner bases
- On Herbrand's theorem
This page was built for publication: How to Automatise Proofs of Operator Statements: Moore–Penrose Inverse; A Case Study
