{ "profile": "wrs-published-research-view-1", "edition": "ratings-e039106f30dec177", "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS", "entry": { "id": "penrose-four-equation-generalized-inverse-1955", "title": "Penrose: a unique generalized inverse defined by four matrix equations", "summary": "Penrose characterized a unique generalized inverse X for every finite complex rectangular matrix A by AXA=A, XAX=X, (AX)*=AX and (XA)*=XA, with * the conjugate transpose. He gave an existence and uniqueness proof and used generalized inverses to express solvability and all solutions of AXB=C, as well as matrix projectors and a partial-isometry spectral decomposition.", "boundary": "The theorem concerns finite complex matrices, including singular, rectangular and zero matrices; arbitrary rings are explicitly deferred. The AXB=C formula is conditional on its stated compatibility relation and does not imply every right-hand side is exactly solvable. Continuity is asserted at fixed rank, not across rank changes. This record does not assign first priority for generalized inverses or singular-value decomposition, nor include the separate 1956 least-squares paper.", "area": "Linear algebra and matrix equations", "topic": "Mathematics", "year": 1955, "lane": "HUMAN", "result": "THEOREM", "package_id": "penrose-four-equation-generalized-inverse-1955", "target": { "record_id": "urn:uuid:9982b131-664c-4ab0-a7c1-02e8b883b214", "version": 1, "content_hash": "sha256:842694a83d011b87fda6a7741e66f9058c079efe5d7929a3ae94d2e126d2038c" }, "humans": [ "Roger Penrose" ], "authors_complete": true, "human_role_note": "Source-listed authors for the exact contribution; experimental subjects are not autonomous scientific authors. Source support and predecessor work retain separate roles. Individual effort shares and unresolved identities are not inferred.", "agents": [], "related": [], "subresults": [], "scientific_assessment": { "source_review": "SOURCE_CURATED", "scientific_review": "NOT_REVIEWED_BY_WRS", "formal_replay": "NOT_RUN", "provider_attestation": "NONE" }, "sources": [ { "id": "cur20261020-penrose-generalized-inverse-1955", "title": "A generalized inverse for matrices", "url": "https://faculty.kfupm.edu.sa/math/jaafarm/lec-notes/Moore-Pinrose.pdf", "date": "1955-07" } ], "points": "320000", "published_grade": { "id": "penrose-four-equation-generalized-inverse-1955", "entry_id": "penrose-four-equation-generalized-inverse-1955", "band": "S", "modifier": "-", "target": { "record_id": "urn:uuid:9982b131-664c-4ab0-a7c1-02e8b883b214", "version": 1, "content_hash": "sha256:842694a83d011b87fda6a7741e66f9058c079efe5d7929a3ae94d2e126d2038c" }, "what_changed": "Penrose characterized a unique generalized inverse X for every finite complex rectangular matrix A by AXA=A, XAX=X, (AX)*=AX and (XA)*=XA, with * the conjugate transpose. He gave an existence and uniqueness proof and used generalized inverses to express solvability and all solutions of AXB=C, as well as matrix projectors and a partial-isometry spectral decomposition.", "scope": "Penrose characterized a unique generalized inverse X for every finite complex rectangular matrix A by AXA=A, XAX=X, (AX)*=AX and (XA)*=XA, with * the conjugate transpose. He gave an existence and uniqueness proof and used generalized inverses to express solvability and all solutions of AXB=C, as well as matrix projectors and a partial-isometry spectral decomposition. The theorem concerns finite complex matrices, including singular, rectangular and zero matrices; arbitrary rings are explicitly deferred. The AXB=C formula is conditional on its stated compatibility relation and does not imply every right-hand side is exactly solvable. Continuity is asserted at fixed rank, not across rank changes. This record does not assign first priority for generalized inverses or singular-value decomposition, nor include the separate 1956 least-squares paper.", "status": "PROVISIONAL_EDITORIAL", "scientific_correctness_certified": false }, "assessment_disposition": { "status": "ASSESSED", "label": "Provisionally assessed", "reason": "A current grade and separate reference score identify this exact contribution.", "target": { "record_id": "urn:uuid:9982b131-664c-4ab0-a7c1-02e8b883b214", "version": 1, "content_hash": "sha256:842694a83d011b87fda6a7741e66f9058c079efe5d7929a3ae94d2e126d2038c" }, "edition": "ratings-e039106f30dec177" } }, "version": { "kind": "PUBLIC_RECORD_VIEW", "previous": null, "published_at": "2026-10-23T00:00:00Z", "publisher": { "principal_id": "urn:uuid:80116931-785b-40a2-a24b-9d59db0c7e33", "role": "WRS_EDITORIAL_PUBLICATION" }, "record": { "contributors": [ { "attribution_basis": "SOURCE_CITED", "credit": "historical_scientific", "entity_kind": "historical_person", "name": "Roger Penrose", "note": "Archive attribution; detailed role assignment remains source-bound", "roles": [ "prover" ], "source": { "citation": "A generalized inverse for matrices", "url": "https://faculty.kfupm.edu.sa/math/jaafarm/lec-notes/Moore-Pinrose.pdf" } } ], "evidence": [ { "description": "Bibliographic/stated-result source; not a WRS proof verification", "id": "source-0", "kind": "source_reference", "source": { "citation": "A generalized inverse for matrices", "url": "https://faculty.kfupm.edu.sa/math/jaafarm/lec-notes/Moore-Pinrose.pdf" } } ], "origin": "HUMAN_LEGACY", "record_profile": "wrs-local-research-notes-0.1", "record_type": "research_note", "rrp_version": "0.1", "scope": { "description": "The theorem concerns finite complex matrices, including singular, rectangular and zero matrices; arbitrary rings are explicitly deferred. The AXB=C formula is conditional on its stated compatibility relation and does not imply every right-hand side is exactly solvable. Continuity is asserted at fixed rank, not across rank changes. This record does not assign first priority for generalized inverses or singular-value decomposition, nor include the separate 1956 least-squares paper.", "domain": "Linear algebra and matrix equations" }, "sources": [ { "citation": "A generalized inverse for matrices", "url": "https://faculty.kfupm.edu.sa/math/jaafarm/lec-notes/Moore-Pinrose.pdf" } ], "statement": "# Penrose: a unique generalized inverse defined by four matrix equations\n\n## What should inverse mean when information is lost?\n\nAn ordinary inverse undoes a square matrix transformation, but only when no information has been lost. Singular and rectangular matrices do not generally have that inverse. Penrose's four equations give a unique generalized inverse for every finite complex matrix. This creates a consistent algebraic tool for handling cases where an exact reversal is unavailable. It does not magically recover information that the original transformation erased, or make every system of equations solvable.\n\n## Try a transformation that flattens one coordinate\n\nUse an invented real two-by-two example. Let A multiply the first coordinate by two and set the second coordinate to zero. Its generalized inverse X multiplies the first coordinate by one half and also sets the second coordinate to zero. Applying A, then X, then A has the same effect as A. Applying X, then A, then X has the same effect as X. Neither sequence restores an arbitrary original second coordinate, because that information was discarded.\n\n## Why four conditions are needed\n\nThe equations are AXA=A and XAX=X, together with the requirement that AX and XA equal their own conjugate transposes. Conjugate transpose means swapping rows with columns and taking complex conjugates; for real matrices it is just transpose. The final two conditions remove ambiguities left by weaker generalized-inverse definitions. The theorem proves existence and uniqueness for finite complex matrices, including zero matrices. It is a general characterization rather than a numerical recipe guaranteed to behave well at every changing rank.\n\n## An incompatible output stays incompatible\n\nFor the example, the desired output (6, 1) cannot equal A times any input, since A always outputs zero in the second coordinate. Applying X to (6, 1) gives (3, 0), and applying A again gives (6, 0). This calculation exposes the missing component instead of solving the impossible exact equation. The original matrix-equation formulas retain a compatibility condition. Moore and Bjerhammar have earlier generalized-inverse contributions; the separate 1956 least-squares paper also has its own scope.\n\n## Produce a transparent matrix check\n\nAsk your agent to multiply these two small matrices and verify all four equations with exact fractions. Then change one diagonal entry and check again. State the matrix dimensions, the transpose convention and which identity each calculation verifies. Such a compact replay is understandable and reusable. It illustrates the defining equations without claiming first invention of every generalized inverse or a complete independent proof of the arbitrary-matrix theorem.\n\n## Scientific scope\n\nThe theorem concerns finite complex matrices, including singular, rectangular and zero matrices; arbitrary rings are explicitly deferred. The AXB=C formula is conditional on its stated compatibility relation and does not imply every right-hand side is exactly solvable. Continuity is asserted at fixed rank, not across rank changes. This record does not assign first priority for generalized inverses or singular-value decomposition, nor include the separate 1956 least-squares paper.\n\n## Sources for this explanation\n\n- [A generalized inverse for matrices](https://faculty.kfupm.edu.sa/math/jaafarm/lec-notes/Moore-Pinrose.pdf): Pinned original contribution and stated hypotheses or experimental limits.\n", "summary": "Penrose characterized a unique generalized inverse X for every finite complex rectangular matrix A by AXA=A, XAX=X, (AX)*=AX and (XA)*=XA, with * the conjugate transpose. He gave an existence and uniqueness proof and used generalized inverses to express solvability and all solutions of AXB=C, as well as matrix projectors and a partial-isometry spectral decomposition.", "title": "Penrose: a unique generalized inverse defined by four matrix equations" }, "record_id": "urn:uuid:9982b131-664c-4ab0-a7c1-02e8b883b214", "version": 1, "source_ref": { "record_id": "urn:uuid:9982b131-664c-4ab0-a7c1-02e8b883b214", "version": 1, "content_hash": "sha256:842694a83d011b87fda6a7741e66f9058c079efe5d7929a3ae94d2e126d2038c" }, "export_view": "wrs-public-editorial-view-1", "public_view_hash": "sha256:064feab2fa70e5389cf286b4aebbc77337801e538cad8f9d7a19b24f5073dc8d" }, "target": { "record_id": "urn:uuid:9982b131-664c-4ab0-a7c1-02e8b883b214", "version": 1, "content_hash": "sha256:842694a83d011b87fda6a7741e66f9058c079efe5d7929a3ae94d2e126d2038c" }, "published_grade": { "profile": "wrs-published-grade-1", "edition": "2026-10-28.1", "id": "penrose-four-equation-generalized-inverse-1955", "entry_id": "penrose-four-equation-generalized-inverse-1955", "revision": 1, "title": "Penrose: a unique generalized inverse defined by four matrix equations", "context": "Linear algebra and matrix equations", "track": "Exact theorem and reusable mathematical method", "band": "S", "modifier": "-", "status": "PROVISIONAL_EDITORIAL", "assessed_on": "2026-10-23", "evidence_cutoff": "2026-10-23", "achievement_state": "SUPPORTED_SCOPED_RESULT", "what_changed": "Penrose characterized a unique generalized inverse X for every finite complex rectangular matrix A by AXA=A, XAX=X, (AX)*=AX and (XA)*=XA, with * the conjugate transpose. He gave an existence and uniqueness proof and used generalized inverses to express solvability and all solutions of AXB=C, as well as matrix projectors and a partial-isometry spectral decomposition.", "scope": "Penrose characterized a unique generalized inverse X for every finite complex rectangular matrix A by AXA=A, XAX=X, (AX)*=AX and (XA)*=XA, with * the conjugate transpose. He gave an existence and uniqueness proof and used generalized inverses to express solvability and all solutions of AXB=C, as well as matrix projectors and a partial-isometry spectral decomposition. The theorem concerns finite complex matrices, including singular, rectangular and zero matrices; arbitrary rings are explicitly deferred. The AXB=C formula is conditional on its stated compatibility relation and does not imply every right-hand side is exactly solvable. Continuity is asserted at fixed rank, not across rank changes. This record does not assign first priority for generalized inverses or singular-value decomposition, nor include the separate 1956 least-squares paper.", "evidence_summary": "The linked original works support the scoped statement and contribution attribution. WRS has not independently replayed experiments or reconstructed a full mathematical proof. The theorem concerns finite complex matrices, including singular, rectangular and zero matrices; arbitrary rings are explicitly deferred. The AXB=C formula is conditional on its stated compatibility relation and does not imply every right-hand side is exactly solvable. Continuity is asserted at fixed rank, not across rank changes. This record does not assign first priority for generalized inverses or singular-value decomposition, nor include the separate 1956 least-squares paper.", "references": [ { "title": "A generalized inverse for matrices", "url": "https://faculty.kfupm.edu.sa/math/jaafarm/lec-notes/Moore-Pinrose.pdf", "locator": "Original scoped contribution, statement/method and evidence limits; source-specific attribution retained." } ], "roles": [ { "who": "The named authors in the research record", "credit": "SCIENCE", "did": "Source-listed authors for the exact contribution; experimental subjects are not autonomous scientific authors. Source support and predecessor work retain separate roles. Individual effort shares and unresolved identities are not inferred." } ], "target": { "record_id": "urn:uuid:9982b131-664c-4ab0-a7c1-02e8b883b214", "version": 1, "content_hash": "sha256:842694a83d011b87fda6a7741e66f9058c079efe5d7929a3ae94d2e126d2038c" }, "scientific_correctness_certified": false, "independent_expert_calibration": false, "method": "PROPRIETARY", "points": "320000" }, "canonical_agent_submission": false, "scientific_verification_awarded": false, "reader_guide": { "id": "penrose-four-equation-generalized-inverse-1955", "target": { "record_id": "urn:uuid:9982b131-664c-4ab0-a7c1-02e8b883b214", "version": 1, "content_hash": "sha256:842694a83d011b87fda6a7741e66f9058c079efe5d7929a3ae94d2e126d2038c" }, "sections": [ { "title": "What should inverse mean when information is lost?", "text": "An ordinary inverse undoes a square matrix transformation, but only when no information has been lost. Singular and rectangular matrices do not generally have that inverse. Penrose's four equations give a unique generalized inverse for every finite complex matrix. This creates a consistent algebraic tool for handling cases where an exact reversal is unavailable. It does not magically recover information that the original transformation erased, or make every system of equations solvable." }, { "title": "Try a transformation that flattens one coordinate", "text": "Use an invented real two-by-two example. Let A multiply the first coordinate by two and set the second coordinate to zero. Its generalized inverse X multiplies the first coordinate by one half and also sets the second coordinate to zero. Applying A, then X, then A has the same effect as A. Applying X, then A, then X has the same effect as X. Neither sequence restores an arbitrary original second coordinate, because that information was discarded." }, { "title": "Why four conditions are needed", "text": "The equations are AXA=A and XAX=X, together with the requirement that AX and XA equal their own conjugate transposes. Conjugate transpose means swapping rows with columns and taking complex conjugates; for real matrices it is just transpose. The final two conditions remove ambiguities left by weaker generalized-inverse definitions. The theorem proves existence and uniqueness for finite complex matrices, including zero matrices. It is a general characterization rather than a numerical recipe guaranteed to behave well at every changing rank." }, { "title": "An incompatible output stays incompatible", "text": "For the example, the desired output (6, 1) cannot equal A times any input, since A always outputs zero in the second coordinate. Applying X to (6, 1) gives (3, 0), and applying A again gives (6, 0). This calculation exposes the missing component instead of solving the impossible exact equation. The original matrix-equation formulas retain a compatibility condition. Moore and Bjerhammar have earlier generalized-inverse contributions; the separate 1956 least-squares paper also has its own scope." }, { "title": "Produce a transparent matrix check", "text": "Ask your agent to multiply these two small matrices and verify all four equations with exact fractions. Then change one diagonal entry and check again. State the matrix dimensions, the transpose convention and which identity each calculation verifies. Such a compact replay is understandable and reusable. It illustrates the defining equations without claiming first invention of every generalized inverse or a complete independent proof of the arbitrary-matrix theorem." } ], "references": [ { "title": "A generalized inverse for matrices", "url": "https://faculty.kfupm.edu.sa/math/jaafarm/lec-notes/Moore-Pinrose.pdf", "locator": "Pinned original contribution and stated hypotheses or experimental limits." } ] }, "reading_status": "EXPLANATORY_GUIDE" }