How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Unscaled Minkowski embedding
Definition
Let be a number field (Number field) of degree and signature , so that and the field has real embeddings and complex-conjugate pairs of nonreal embeddings from which one representative is chosen; the notation and the count are those of Archimedean embeddings and signature. The unscaled Minkowski embedding of is the injective map
composed with the identification that sends to the pair of real coordinates. This exhibits as a map into .
No factor is inserted in the complex coordinates: each complex coordinate contributes the two coordinates and with equal weight. Thus the Euclidean norm of a complex block is , and the complex block of has norm . All volumes, covolumes and determinants on this item use this unscaled convention.
Remarks
Injectivity and linearity. Since , at least one of the listed embeddings exists. If , every listed embedding sends to zero; any one of them is injective, so . This also covers the case , when there are no complex representatives. Each embedding is -linear, as is the real-coordinate identification, so is -linear. Injectivity alone does not imply that the images of a -basis are linearly independent over ; that fact follows from the determinant calculation below.
Relation to the all-complex embedding determinant. Let be a -basis of and let be the matrix of all complex embeddings. By Embedding determinant formula, and . Reorder its rows so that each complex-conjugate pair is adjacent. For a pair , the old rows are obtained from the real rows by the transition matrix whose determinant is , of modulus . Replacing all such pairs by their real and imaginary rows therefore gives the real matrix with columns and
In particular, the images of every -basis form a real basis of . This factor is responsible for the covolume formula proved later in this development.
Depends on
Used by
- Mixing scaled and unscaled Minkowski covolumes fails Counterexample
- Archimedean product region, volume and norm bound Lemma
- Bounded primitive integral element for Hermite-Minkowski Lemma
- Covolume of an integral ideal lattice Theorem
- Number-field integer rings and ideals are full lattices Theorem
- Small nonzero element in a number-field ideal Theorem
- The logarithmic unit image is a full lattice Theorem
Dependency tree · two levels
8 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- J. S. Milne, Algebraic Number Theory v3.08 (standard reference, not scraped)
- William A. Stein, Algebraic Number Theory: A Computational Approach (standard reference, not scraped)