This HTML5 document contains 29 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n10https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Division_lattice
rdfs:label
Division lattice
rdfs:comment
The division lattice is an infinite complete bounded distributive lattice whose elements are the natural numbers ordered by divisibility. Its least element is 1, which divides all natural numbers, while its greatest element is 0, which is divisible by all natural numbers. The meet operation is greatest common divisor while the join operation is least common multiple. The prime numbers are precisely the atoms of the division lattice, namely those natural numbers divisible only by themselves and 1.
dcterms:subject
dbc:Prime_numbers dbc:Boolean_algebra dbc:Lattice_theory
dbo:wikiPageID
65394145
dbo:wikiPageRevisionID
1089469862
dbo:wikiPageWikiLink
dbc:Lattice_theory dbc:Boolean_algebra dbr:Sublattice dbr:Distributive_lattice dbr:Least_common_multiple dbr:Square-free dbr:Atom_(order_theory) dbr:Divisibility dbr:Natural_numbers dbr:Boolean_algebra dbr:Cambridge_University_Press dbr:Greatest_common_divisor dbr:Prime_numbers dbc:Prime_numbers
owl:sameAs
n10:FP5SU wikidata:Q104858452
dbp:wikiPageUsesTemplate
dbt:Citation dbt:More_footnotes
dbo:abstract
The division lattice is an infinite complete bounded distributive lattice whose elements are the natural numbers ordered by divisibility. Its least element is 1, which divides all natural numbers, while its greatest element is 0, which is divisible by all natural numbers. The meet operation is greatest common divisor while the join operation is least common multiple. The prime numbers are precisely the atoms of the division lattice, namely those natural numbers divisible only by themselves and 1. For any square-free number n, its divisors form a Boolean algebra that is a sublattice of the division lattice. The elements of this sublattice are representable as the subsets of the set of prime factors of n. The converse also holds, namely that every sublattice of the division lattice that forms a Boolean algebra is the lattice of divisors of a square-free number.
prov:wasDerivedFrom
wikipedia-en:Division_lattice?oldid=1089469862&ns=0
dbo:wikiPageLength
1336
foaf:isPrimaryTopicOf
wikipedia-en:Division_lattice