<?xml version="1.0"?><rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:edm="http://www.europeana.eu/schemas/edm/" xmlns:wgs84_pos="http://www.w3.org/2003/01/geo/wgs84_pos" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:rdaGr2="http://rdvocab.info/ElementsGr2" xmlns:oai="http://www.openarchives.org/OAI/2.0/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:ore="http://www.openarchives.org/ore/terms/" xmlns:skos="http://www.w3.org/2004/02/skos/core#" xmlns:dcterms="http://purl.org/dc/terms/"><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-1VM3CMHE/-6c4a5-e142f010060-4fb01a9-6518643f6/PDF"><dcterms:extent>326 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-1VM3CMHE/8cf10323-30b8-48d1-b2c6-934b4a9f5970/TEXT"><dcterms:extent>53 KB</dcterms:extent></edm:WebResource><edm:TimeSpan rdf:about="2014-2024"><edm:begin xml:lang="en">2014</edm:begin><edm:end xml:lang="en">2024</edm:end></edm:TimeSpan><edm:ProvidedCHO rdf:about="URN:NBN:SI:doc-1VM3CMHE"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-OE00UKYR" /><dcterms:issued>2018</dcterms:issued><dc:creator>Zupančič, Žiga</dc:creator><dc:format xml:lang="sl">17 str.</dc:format><dc:format xml:lang="sl">številka:2</dc:format><dc:format xml:lang="sl">letnik:5</dc:format><dc:identifier>COBISSID_HOST:18454873</dc:identifier><dc:identifier>ISSN:2385-8567</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-1VM3CMHE</dc:identifier><dc:language>sl</dc:language><dc:publisher xml:lang="sl">Založba Fakultete za matematiko in fiziko Univerze v Ljubljani</dc:publisher><dcterms:isPartOf xml:lang="sl">Matrika</dcterms:isPartOf><dc:subject xml:lang="sl">aksiom izbire</dc:subject><dc:subject xml:lang="en">axiom of choice</dc:subject><dc:subject xml:lang="sl">delna urejenost</dc:subject><dc:subject xml:lang="sl">linearna urejenost</dc:subject><dc:subject xml:lang="sl">maksimalni element</dc:subject><dc:subject xml:lang="sl">matematika</dc:subject><dc:subject xml:lang="en">mathematics</dc:subject><dc:subject xml:lang="en">maximal element</dc:subject><dc:subject xml:lang="en">partial ordering</dc:subject><dc:subject xml:lang="en">total ordering</dc:subject><dc:subject xml:lang="en">Zorn lemma</dc:subject><dc:subject xml:lang="sl">Zornova lema</dc:subject><dcterms:temporal rdf:resource="2014-2024" /><dc:title xml:lang="sl">Zornova lema in njena uporaba|</dc:title><dc:description xml:lang="sl">In this article Zorn's lemma and some equivalent formulations are presented. An application in group theory is presented by proving that homomorphisms from subgroups of Abelian groups to divisible groups can be extended to the whole Abelian group. In ring theory Zorn's lemma implies the existence of maximal left ideals in rings. Also, it implies that the intersection of all prime ideals in a commutative ring is equal to the set of nilpotent elements of the ring. Cohen's theorem and it's generalization are also proved. Using Zorn's lemma, it is shown, that every nonzero module over a division ring has a basis. The consequence of that is that every vector space over a field has a basis. This corollary is used to prove that a group with more than two elements has a nontrivial automorphism. The use of Zorn's lemma in graph theory is shown when proving that every connected graph contains a spanning tree</dc:description><dc:description xml:lang="sl">V članku je predstavljena Zornova lema in nekaj ekvivalentnih formulacij. Prikazana je njena uporaba v teoriji grup, kjer je dokazano, da lahko homomorfizme iz podgrup Abelovih grup v deljive grupe razširimo na celotno Abelovo grupo. V teoriji kolobarjev je s pomočjo Zornove leme pokazano, da vsak kolobar vsebuje maksimalni levi ideal in da je presek vseh praidealov komutativnega kolobarja enak množici vseh nilpotentnih elementov kolobarja. Dokazan je Cohenov izrek in njegova posplošitev. V nadaljevanju je dokazan izrek, ki pravi, da ima vsak neničelni modul nad obsegom bazo. Njegova posledica pravi, da ima vsak vektorski prostor nad poljem bazo. S pomočjo te posledice je pokazano, da v grupi z več kot dvema elementoma obstaja netrivialni avtomorfizem. Primer uporabe v teoriji grafov pa je dokaz izreka, da vsak povezan graf vsebuje vpeto drevo</dc:description><edm:type>TEXT</edm:type><dc:type xml:lang="sl">znanstveno časopisje</dc:type><dc:type xml:lang="en">journals</dc:type><dc:type rdf:resource="http://www.wikidata.org/entity/Q361785" /></edm:ProvidedCHO><ore:Aggregation rdf:about="http://www.dlib.si/?URN=URN:NBN:SI:doc-1VM3CMHE"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-1VM3CMHE" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-1VM3CMHE/-6c4a5-e142f010060-4fb01a9-6518643f6/PDF" /><edm:rights rdf:resource="http://rightsstatements.org/vocab/InC/1.0/" /><edm:provider>Slovenian National E-content Aggregator</edm:provider><edm:dataProvider xml:lang="en">National and University Library of Slovenia</edm:dataProvider><edm:object rdf:resource="http://www.dlib.si/streamdb/URN:NBN:SI:doc-1VM3CMHE/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-1VM3CMHE" /></ore:Aggregation></rdf:RDF>