{"entities":{"Q2616617":{"pageid":2627360,"ns":120,"title":"Item:Q2616617","lastrevid":44491797,"modified":"2025-11-23T08:06:34Z","type":"item","id":"Q2616617","labels":{"en":{"language":"en","value":"An elementary proof of the theorem that the most general matrix commutative with a given \\(n\\)-rowed square matrix involves at least \\(n\\) arbitrary parameters."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2537164"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2616617$48F22880-7F8C-4692-ABA9-975B4EBFE8DD","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"0edac9550888f5028ba6c1df82edf75f86e1bb14","datavalue":{"value":{"text":"An elementary proof of the theorem that the most general matrix commutative with a given \\(n\\)-rowed square matrix involves at least \\(n\\) arbitrary parameters.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2616617$4BFC10FA-B402-44DA-8999-C530B9BC3C72","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"a8494dfbbc36871804c0194a6314f3b50be71d98","datavalue":{"value":"60.0053.02","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2616617$9D935C76-CA1A-45D6-AC7E-6D4C90870A9A","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"cc45e6b9322bed7360e4aac2a42f8c73614b44f3","datavalue":{"value":{"entity-type":"item","numeric-id":1787138,"id":"Q1787138"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2616617$0BCC5217-2CBA-4B06-B7EC-FB7E10EAD75E","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"3567d56fd97802dfe54efcd2cd7c1fc3353c22fe","datavalue":{"value":{"entity-type":"item","numeric-id":559496,"id":"Q559496"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2616617$790DF1AE-514D-45C8-A9D4-DE361731F7EB","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"0545e869d8296a0b0654ccbe2e3181b7f2652da8","datavalue":{"value":{"time":"+1934-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2616617$10F01AD3-DC5A-4158-BA0C-4338880C6A76","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"97b6a4c26bb351fc70b11b24ae7e9d5e568d9679","datavalue":{"value":"Der im Titel der Arbeit angegebene Satz wird elementar bewiesen, d. h. nur unter Anwendung rationaler Operationen auf die Koeffizienten der vorgegebenen Matrix. Der Grundgedanke ist folgender: Die Vertauschbarkeitsbedingung f\u00fchrt auf ein System von \\(n^2\\) linearen Gleichungen; es wird dann gezeigt, da\u00df der Rang dieses Systems \\(n^2-n\\) nicht \u00fcberschreiten kann, was offenbar mit der Behauptung gleichwertig ist.","type":"string"},"datatype":"string"},"type":"statement","id":"Q2616617$F0D5B739-9020-4381-A043-2F6FC5317FC5","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"d2d83e4383ccc911ae3047e3f1c648db0503d8a6","datavalue":{"value":"2537164","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2616617$EF02A678-9C15-4B2E-B436-F98D4BD5E237","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2616617$176527F5-7E78-4C3D-A7E1-B1E1244F07EC","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:2616617","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:2616617"}}}}}