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

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

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n9http://dbpedia.org/resource/File:
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n15http://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Minkowski's_theorem
rdfs:label
Minkowski's theorem
rdfs:comment
In mathematics, Minkowski's theorem is the statement that every convex set in which is symmetric with respect to the origin and which has volume greater than contains a non-zero integer point (meaning a point in that is not the origin). The theorem was proved by Hermann Minkowski in 1889 and became the foundation of the branch of number theory called the geometry of numbers. It can be extended from the integers to any lattice and to any symmetric convex set with volume greater than , where denotes the covolume of the lattice (the absolute value of the determinant of any of its bases).
owl:sameAs
yago-res:Minkowski's_theorem freebase:m.0f073
dbp:wikiPageUsesTemplate
dbt:Multiple_issues dbt:Math dbt:Collapse_top dbt:Collapse_bottom dbt:No_footnotes dbt:Springer dbt:Short_description dbt:Page_numbers_needed dbt:Refbegin dbt:Refend dbt:Cite_book dbt:=
dct:subject
dbc:Geometry_of_numbers dbc:Theorems_in_number_theory dbc:Articles_containing_proofs dbc:Convex_analysis dbc:Hermann_Minkowski
gold:hypernym
dbr:Statement
prov:wasDerivedFrom
n15:Minkowski's_theorem?oldid=1053790896&ns=0
dbo:wikiPageID
53455
dbo:wikiPageLength
18857
dbo:wikiPageRevisionID
1053790896
dbo:wikiPageWikiLink
dbc:Geometry_of_numbers dbr:Hermann_Minkowski dbr:Dual_lattice dbr:Geometry_of_numbers n9:Mconvexe.png dbr:Fermat's_theorem_on_sums_of_two_squares dbr:Number_theory dbr:Pick's_theorem dbr:Lattice_(group) dbc:Hermann_Minkowski dbr:Integer dbr:Fractional_ideal dbr:Plane_(geometry) dbr:Minkowski's_bound dbr:Determinant dbr:Lenstra–Lenstra–Lovász_lattice_basis_reduction_algorithm dbr:Minkowski's_second_theorem dbr:Blichfeldt's_theorem dbr:Lattice_problem dbr:Convex_set dbr:Wolfgang_M._Schmidt dbr:Hermite_constant dbr:Dirichlet's_unit_theorem dbr:Mathematics dbr:Origin_(mathematics) dbr:TFNP dbr:Ideal_class_group dbc:Theorems_in_number_theory dbc:Articles_containing_proofs dbr:Vector_space dbr:Volume dbr:Injective_function dbc:Convex_analysis dbr:List_of_mathematical_jargon dbr:Algebraic_number_field dbr:Hypercube dbr:Area dbr:Lagrange's_four-square_theorem dbr:Dirichlet's_approximation_theorem dbr:Danzer_set dbr:Integer_lattice dbr:Field_norm
dbo:abstract
In mathematics, Minkowski's theorem is the statement that every convex set in which is symmetric with respect to the origin and which has volume greater than contains a non-zero integer point (meaning a point in that is not the origin). The theorem was proved by Hermann Minkowski in 1889 and became the foundation of the branch of number theory called the geometry of numbers. It can be extended from the integers to any lattice and to any symmetric convex set with volume greater than , where denotes the covolume of the lattice (the absolute value of the determinant of any of its bases).
foaf:isPrimaryTopicOf
n15:Minkowski's_theorem