Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Perron–Frobenius theorem
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
====Lemma==== Given a non-negative ''A'', assume there exists ''m'', such that ''A<sup>m</sup>'' is positive, then ''A''<sup>''m''+1</sup>, ''A''<sup>''m''+2</sup>, ''A''<sup>''m''+3</sup>,... are all positive. ''A''<sup>''m''+1</sup> = ''AA''<sup>''m''</sup>, so it can have zero element only if some row of ''A'' is entirely zero, but in this case the same row of ''A<sup>m</sup>'' will be zero. Applying the same arguments as above for primitive matrices, prove the main claim.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)