{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "frobenius-irreducible-nonnegative-matrix-spectrum-1912",
    "title": "Frobenius: irreducible nonnegative matrices and their peripheral spectral cycle",
    "summary": "Frobenius extends positive-matrix spectral theory to finite irreducible nonnegative matrices. The positive spectral radius is a simple eigenvalue with strictly positive left and right eigenvectors, while all eigenvalues on its spectral circle are simple and are the radius times a full cycle of roots of unity. The primitive case is characterized by a positive matrix power; sufficiently high powers are then positive. The same paper develops cyclic block structure and reduction into irreducible parts.",
    "boundary": "Finite real entrywise-nonnegative matrices, not arbitrary signed matrices or infinite-dimensional positive operators. The positive-radius statement concerns nontrivial irreducible matrices, excluding the exceptional1×1zero matrix. Irreducibility alone does not make the positive eigenvalue uniquely largest in modulus: imprimitive matrices have a peripheral cycle. Strictly positive eigenvectors and simplicity cannot be transferred unchanged to arbitrary reducible matrices. This is the 1912 extension, not sole invention of all Perron–Frobenius antecedents or later stochastic-mixing bounds.",
    "area": "Linear algebra and spectral theory",
    "topic": "Mathematics",
    "year": 1912,
    "lane": "HUMAN",
    "result": "THEOREM",
    "package_id": "frobenius-irreducible-nonnegative-matrix-spectrum-1912",
    "target": {
      "record_id": "urn:uuid:dcc43508-b31d-45f1-a478-c1f982824172",
      "version": 1,
      "content_hash": "sha256:80930c5d94a0490e508f81f9e86c8a4fe592bbd7b7d9e4eb24ec376073b041f7"
    },
    "humans": [
      "G. Frobenius"
    ],
    "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-frobenius-nonnegative-matrices-1912",
        "title": "Über Matrizen aus nicht negativen Elementen (original456–477)",
        "url": "https://upload.wikimedia.org/wikipedia/commons/4/44/Ueber_Matrizen_aus_nicht_negativen_Elementen.pdf",
        "date": "1912"
      }
    ],
    "points": "330000",
    "published_grade": {
      "id": "frobenius-irreducible-nonnegative-matrix-spectrum-1912",
      "entry_id": "frobenius-irreducible-nonnegative-matrix-spectrum-1912",
      "band": "S",
      "modifier": "-",
      "target": {
        "record_id": "urn:uuid:dcc43508-b31d-45f1-a478-c1f982824172",
        "version": 1,
        "content_hash": "sha256:80930c5d94a0490e508f81f9e86c8a4fe592bbd7b7d9e4eb24ec376073b041f7"
      },
      "what_changed": "Frobenius extends positive-matrix spectral theory to finite irreducible nonnegative matrices. The positive spectral radius is a simple eigenvalue with strictly positive left and right eigenvectors, while all eigenvalues on its spectral circle are simple and are the radius times a full cycle of roots of unity. The primitive case is characterized by a positive matrix power; sufficiently high powers are then positive. The same paper develops cyclic block structure and reduction into irreducible parts.",
      "scope": "Frobenius extends positive-matrix spectral theory to finite irreducible nonnegative matrices. The positive spectral radius is a simple eigenvalue with strictly positive left and right eigenvectors, while all eigenvalues on its spectral circle are simple and are the radius times a full cycle of roots of unity. The primitive case is characterized by a positive matrix power; sufficiently high powers are then positive. The same paper develops cyclic block structure and reduction into irreducible parts. Finite real entrywise-nonnegative matrices, not arbitrary signed matrices or infinite-dimensional positive operators. The positive-radius statement concerns nontrivial irreducible matrices, excluding the exceptional1×1zero matrix. Irreducibility alone does not make the positive eigenvalue uniquely largest in modulus: imprimitive matrices have a peripheral cycle. Strictly positive eigenvectors and simplicity cannot be transferred unchanged to arbitrary reducible matrices. This is the 1912 extension, not sole invention of all Perron–Frobenius antecedents or later stochastic-mixing bounds.",
      "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:dcc43508-b31d-45f1-a478-c1f982824172",
        "version": 1,
        "content_hash": "sha256:80930c5d94a0490e508f81f9e86c8a4fe592bbd7b7d9e4eb24ec376073b041f7"
      },
      "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": "G. Frobenius",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "prover"
          ],
          "source": {
            "citation": "Über Matrizen aus nicht negativen Elementen (original456–477)",
            "url": "https://upload.wikimedia.org/wikipedia/commons/4/44/Ueber_Matrizen_aus_nicht_negativen_Elementen.pdf"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Über Matrizen aus nicht negativen Elementen (original456–477)",
            "url": "https://upload.wikimedia.org/wikipedia/commons/4/44/Ueber_Matrizen_aus_nicht_negativen_Elementen.pdf"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "Finite real entrywise-nonnegative matrices, not arbitrary signed matrices or infinite-dimensional positive operators. The positive-radius statement concerns nontrivial irreducible matrices, excluding the exceptional1×1zero matrix. Irreducibility alone does not make the positive eigenvalue uniquely largest in modulus: imprimitive matrices have a peripheral cycle. Strictly positive eigenvectors and simplicity cannot be transferred unchanged to arbitrary reducible matrices. This is the 1912 extension, not sole invention of all Perron–Frobenius antecedents or later stochastic-mixing bounds.",
        "domain": "Linear algebra and spectral theory"
      },
      "sources": [
        {
          "citation": "Über Matrizen aus nicht negativen Elementen (original456–477)",
          "url": "https://upload.wikimedia.org/wikipedia/commons/4/44/Ueber_Matrizen_aus_nicht_negativen_Elementen.pdf"
        }
      ],
      "statement": "# Frobenius: irreducible nonnegative matrices and their peripheral spectral cycle\n\n## A positive long-run pattern can still oscillate\n\nSuppose a system moves quantities between several locations using a table of nonnegative weights. Multiplying by that matrix describes one update. A leading eigenvalue measures a possible growth factor, while an eigenvector describes a pattern that keeps its shape under updating. Frobenius's 1912 work clarifies what can be concluded when the locations communicate through an irreducible nonnegative matrix. Irreducible means that the dependency network cannot be split into an isolated one-way block arrangement.\n\n## Two locations expose an important trap\n\nHere is an invented two-location example. The update swaps the quantities: the first location receives the second, and the second receives the first. Starting from (1, 0), successive states are (0, 1), then (1, 0), then (0, 1). Both locations communicate, yet the process never settles. Its matrix has eigenvalues 1 and minus 1, with the same absolute value. A positive eigenvalue therefore need not be the unique eigenvalue of largest magnitude.\n\n## What the theorem adds\n\nFor a nontrivial finite irreducible nonnegative matrix, the spectral radius is a simple positive eigenvalue with positive left and right eigenvectors. Spectral radius means the largest absolute value of an eigenvalue. Other eigenvalues on that circle can form a cyclic pattern. The primitive case removes this peripheral cycle: some matrix power is strictly positive, and all sufficiently high powers are positive. These are structural conclusions about a class of matrices, not just observations from a computer simulation.\n\n## Do not erase the hypotheses or the predecessors\n\nNonnegative means every entry is at least zero; positive means every entry is strictly greater than zero. Those are different classes. Reducible matrices, signed entries and infinite-dimensional operators need separate statements. The exceptional one-by-one zero matrix also requires care. Perron's earlier positive-matrix result and Frobenius's own earlier papers are part of the history. This record describes the 1912 extension, rather than assigning the whole lineage to a single publication.\n\n## Compare a swap with an average\n\nNow change the invented update so both locations receive half of each current quantity. From (1, 0), one step gives (one half, one half), which remains fixed. Ask your agent to calculate the next three steps of both systems and explain the difference. Keep the examples separate from a general mixing-time claim. This is a useful way to learn why connectivity alone does not guarantee convergence without oscillation.\n\n## Scientific scope\n\nFinite real entrywise-nonnegative matrices, not arbitrary signed matrices or infinite-dimensional positive operators. The positive-radius statement concerns nontrivial irreducible matrices, excluding the exceptional1×1zero matrix. Irreducibility alone does not make the positive eigenvalue uniquely largest in modulus: imprimitive matrices have a peripheral cycle. Strictly positive eigenvectors and simplicity cannot be transferred unchanged to arbitrary reducible matrices. This is the 1912 extension, not sole invention of all Perron–Frobenius antecedents or later stochastic-mixing bounds.\n\n## Sources for this explanation\n\n- [Über Matrizen aus nicht negativen Elementen (original456–477)](https://upload.wikimedia.org/wikipedia/commons/4/44/Ueber_Matrizen_aus_nicht_negativen_Elementen.pdf): Pinned original contribution and stated hypotheses or experimental limits.\n",
      "summary": "Frobenius extends positive-matrix spectral theory to finite irreducible nonnegative matrices. The positive spectral radius is a simple eigenvalue with strictly positive left and right eigenvectors, while all eigenvalues on its spectral circle are simple and are the radius times a full cycle of roots of unity. The primitive case is characterized by a positive matrix power; sufficiently high powers are then positive. The same paper develops cyclic block structure and reduction into irreducible parts.",
      "title": "Frobenius: irreducible nonnegative matrices and their peripheral spectral cycle"
    },
    "record_id": "urn:uuid:dcc43508-b31d-45f1-a478-c1f982824172",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:dcc43508-b31d-45f1-a478-c1f982824172",
      "version": 1,
      "content_hash": "sha256:80930c5d94a0490e508f81f9e86c8a4fe592bbd7b7d9e4eb24ec376073b041f7"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:b1d59a1c921294033b955f2ef624a75c9931ca9f9c432a901905117f76afb0f8"
  },
  "target": {
    "record_id": "urn:uuid:dcc43508-b31d-45f1-a478-c1f982824172",
    "version": 1,
    "content_hash": "sha256:80930c5d94a0490e508f81f9e86c8a4fe592bbd7b7d9e4eb24ec376073b041f7"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "frobenius-irreducible-nonnegative-matrix-spectrum-1912",
    "entry_id": "frobenius-irreducible-nonnegative-matrix-spectrum-1912",
    "revision": 1,
    "title": "Frobenius: irreducible nonnegative matrices and their peripheral spectral cycle",
    "context": "Linear algebra and spectral theory",
    "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": "Frobenius extends positive-matrix spectral theory to finite irreducible nonnegative matrices. The positive spectral radius is a simple eigenvalue with strictly positive left and right eigenvectors, while all eigenvalues on its spectral circle are simple and are the radius times a full cycle of roots of unity. The primitive case is characterized by a positive matrix power; sufficiently high powers are then positive. The same paper develops cyclic block structure and reduction into irreducible parts.",
    "scope": "Frobenius extends positive-matrix spectral theory to finite irreducible nonnegative matrices. The positive spectral radius is a simple eigenvalue with strictly positive left and right eigenvectors, while all eigenvalues on its spectral circle are simple and are the radius times a full cycle of roots of unity. The primitive case is characterized by a positive matrix power; sufficiently high powers are then positive. The same paper develops cyclic block structure and reduction into irreducible parts. Finite real entrywise-nonnegative matrices, not arbitrary signed matrices or infinite-dimensional positive operators. The positive-radius statement concerns nontrivial irreducible matrices, excluding the exceptional1×1zero matrix. Irreducibility alone does not make the positive eigenvalue uniquely largest in modulus: imprimitive matrices have a peripheral cycle. Strictly positive eigenvectors and simplicity cannot be transferred unchanged to arbitrary reducible matrices. This is the 1912 extension, not sole invention of all Perron–Frobenius antecedents or later stochastic-mixing bounds.",
    "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. Finite real entrywise-nonnegative matrices, not arbitrary signed matrices or infinite-dimensional positive operators. The positive-radius statement concerns nontrivial irreducible matrices, excluding the exceptional1×1zero matrix. Irreducibility alone does not make the positive eigenvalue uniquely largest in modulus: imprimitive matrices have a peripheral cycle. Strictly positive eigenvectors and simplicity cannot be transferred unchanged to arbitrary reducible matrices. This is the 1912 extension, not sole invention of all Perron–Frobenius antecedents or later stochastic-mixing bounds.",
    "references": [
      {
        "title": "Über Matrizen aus nicht negativen Elementen (original456–477)",
        "url": "https://upload.wikimedia.org/wikipedia/commons/4/44/Ueber_Matrizen_aus_nicht_negativen_Elementen.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:dcc43508-b31d-45f1-a478-c1f982824172",
      "version": 1,
      "content_hash": "sha256:80930c5d94a0490e508f81f9e86c8a4fe592bbd7b7d9e4eb24ec376073b041f7"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "330000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": {
    "id": "frobenius-irreducible-nonnegative-matrix-spectrum-1912",
    "target": {
      "record_id": "urn:uuid:dcc43508-b31d-45f1-a478-c1f982824172",
      "version": 1,
      "content_hash": "sha256:80930c5d94a0490e508f81f9e86c8a4fe592bbd7b7d9e4eb24ec376073b041f7"
    },
    "sections": [
      {
        "title": "A positive long-run pattern can still oscillate",
        "text": "Suppose a system moves quantities between several locations using a table of nonnegative weights. Multiplying by that matrix describes one update. A leading eigenvalue measures a possible growth factor, while an eigenvector describes a pattern that keeps its shape under updating. Frobenius's 1912 work clarifies what can be concluded when the locations communicate through an irreducible nonnegative matrix. Irreducible means that the dependency network cannot be split into an isolated one-way block arrangement."
      },
      {
        "title": "Two locations expose an important trap",
        "text": "Here is an invented two-location example. The update swaps the quantities: the first location receives the second, and the second receives the first. Starting from (1, 0), successive states are (0, 1), then (1, 0), then (0, 1). Both locations communicate, yet the process never settles. Its matrix has eigenvalues 1 and minus 1, with the same absolute value. A positive eigenvalue therefore need not be the unique eigenvalue of largest magnitude."
      },
      {
        "title": "What the theorem adds",
        "text": "For a nontrivial finite irreducible nonnegative matrix, the spectral radius is a simple positive eigenvalue with positive left and right eigenvectors. Spectral radius means the largest absolute value of an eigenvalue. Other eigenvalues on that circle can form a cyclic pattern. The primitive case removes this peripheral cycle: some matrix power is strictly positive, and all sufficiently high powers are positive. These are structural conclusions about a class of matrices, not just observations from a computer simulation."
      },
      {
        "title": "Do not erase the hypotheses or the predecessors",
        "text": "Nonnegative means every entry is at least zero; positive means every entry is strictly greater than zero. Those are different classes. Reducible matrices, signed entries and infinite-dimensional operators need separate statements. The exceptional one-by-one zero matrix also requires care. Perron's earlier positive-matrix result and Frobenius's own earlier papers are part of the history. This record describes the 1912 extension, rather than assigning the whole lineage to a single publication."
      },
      {
        "title": "Compare a swap with an average",
        "text": "Now change the invented update so both locations receive half of each current quantity. From (1, 0), one step gives (one half, one half), which remains fixed. Ask your agent to calculate the next three steps of both systems and explain the difference. Keep the examples separate from a general mixing-time claim. This is a useful way to learn why connectivity alone does not guarantee convergence without oscillation."
      }
    ],
    "references": [
      {
        "title": "Über Matrizen aus nicht negativen Elementen (original456–477)",
        "url": "https://upload.wikimedia.org/wikipedia/commons/4/44/Ueber_Matrizen_aus_nicht_negativen_Elementen.pdf",
        "locator": "Pinned original contribution and stated hypotheses or experimental limits."
      }
    ]
  },
  "reading_status": "EXPLANATORY_GUIDE"
}