Intereting Posts

How to reparametrize curves in terms of arc length when arc-length evaluation cannot be computed analytically
Proving a relation between inradius ,circumradius and exradii in a triangle
How can I prove $\sup(A+B)=\sup A+\sup B$ if $A+B=\{a+b\mid a\in A, b\in B\}$
Prove that projection operator is non-expansive
Curve in $\mathbb{A}^3$ that cannot be defined by 2 equations
Proof of dividing fractional expressions
How big can a separable Hausdorff space be?
Solving (quadratic) equations of iterated functions, such as $f(f(x))=f(x)+x$
Does $A^{-1}A=G$ imply that $AA^{-1}=G$?
Correct spaces for quantum mechanics
Why is $\frac{d^n}{dx^n}(y(x))$ the notation for the $n$th derivative of $y(x)$, instead of $\frac{d^n}{d^nx}(y(x))$?
Book about the foundation of math?
Is a vector of coprime integers column of a regular matrix?
If $A, B, C$ are sets prove that $(A\setminus B)\setminus C\subseteq A\setminus(B\setminus C)$
How can I find the distribution of a stochastic variable X^2 if X is normal standard distributed?

Let $ax^2 + bxy + cy^2$ be a binary quadratic form over $\mathbb{Z}$.

Let $D = b^2 – 4ac$ be its discriminant.

It is easy to see that $D \equiv 0$ (mod $4$) or $D \equiv 1$ (mod $4$).

Conversely suppose $D$ is a non-square integer such that $D \equiv 0$ (mod $4$) or $D \equiv 1$ (mod $4$). Then there exists the principal form of discriminant $D$(see this question).

Let $K$ be an algebraic number field of degree $n$.

An order of $K$ is a subring $R$ of $K$ such that $R$ is a free $\mathbb{Z}$-module of rank $n$.

Let $\alpha_1, \cdots, \alpha_n$ be a basis of $R$ as a $\mathbb{Z}$-module.

Let $d = det(Tr_{K/\mathbb{Q}}(\alpha_i\alpha_j))$.

It is easy to see that $d$ is independent of a choice of a basis of $R$.

We call $d$ the discriminant of $R$.

- Elements of cyclotomic fields whose powers are rational
- Show that $x^2 + x + 12 = 3y^5$ has no integer solutions.
- Euclidean domain $\mathbb{Z}$
- Significance of the Riemann hypothesis to algebraic number theory?
- Relationship between wild ramification and restriction in Galois extension
- Is there an efficient algorithm to compute a minimal polynomial for the root of a polynomial with algebraic coefficients?

Is the following proposition true?

If yes, how do we prove it?

**Proposition**

Let $D$ be a non-square integer such that $D \equiv 0$ (mod $4$) or $D \equiv 1$ (mod $4$).

Then there exists an order $R$ of a quadratic number field $K$ such that the discriminant of $R$ is $D$.

$K$ and $R$ are uniquely determined by $D$.

Conversely let $R$ be an order of a quadratic number field $K$.

Let $D$ be the discriminant of $R$.

Then $D$ is a non-square integer such that $D \equiv 0$ (mod $4$) or $D \equiv 1$ (mod $4$).

- Find the last $4$ digits of $2016^{2016}$
- What is known about the sum $\sum\frac1{p^p}$ of reciprocals of primes raised to themselves?
- Proving whether ideals are prime in $\mathbb{Z}$
- Find $ord_m b^2$ if $ord_m a = 10$ and $ab\equiv 1\pmod m$
- Solution to exponential congruence
- Are there infinitely many Mersenne primes?
- Continued fraction for $\frac{1}{e-2}$
- Which number fields can appear as subfields of a finite-dimensional division algebra over Q with center Q?
- Is it possible to cover $\{1,2,…,100\}$ with $20$ geometric progressions?
- minimal polynomial of power of algebraic number

By my answer to this question, $D$ can be written uniquely as $D = f^2 d$, where $f \gt 0$ is an integer and $d$ is the discriminant of a unique quadratic number field $K$.

By my answer to this question, there exists a unique order $R$ of $K$ such that $f$ is the order of the group $\mathcal{O}_K/R$ and its discriminant is $D = f^2d$.

It remains to prove the last assertion.

Let $1, \omega$ be the canonical integral basis of $K$(see the definition in my answer to this question).

Let $f$ be the order of the group $\mathcal{O}_K/R$.

By my answer to this question, $D = f^2 d$.

By Lemma 8 in my answer to this question, $d$ is a non-square integer.

Hence $D$ is a non-square integer.

By Lemma 7 in my answer to this question, $d \equiv 0$ (mod $4$) or $d \equiv 1$ (mod $4$).

Since $f^2 \equiv 0$ (mod $4$) or $f^2 \equiv 1$ (mod $4$), $D \equiv 0$ (mod $4$) or $D \equiv 1$ (mod $4$) as desired.

- Probability describing how many adjacent hexagons overlap a circle of a given radius
- Zero divisor in $R$
- Does rapid decay of Fourier coefficients imply smoothness?
- Relative entropy is non-negative
- Binary quadratic forms over Z and class numbers of quadratic ﬁelds.
- To evaluate integral using Beta function – Which substitution should i use?
- Tangent space to circle
- Detail in Conditional expectation on more than one random variable
- Advice for Self-Study
- Books for maths olympiad
- Solving a recurrence of polynomials
- What books to use to start studying Mathematical Logic?
- An element of a group $G$ is not conjugate to its inverse if $\lvert G\rvert$ is odd
- Equivalence of knots: ambient isotopy vs. homeomorphism
- Derivative of the power tower