Coprime-factorization lower bound for a quadratic-form class number (source code)

= Coprime-factorization lower bound for a quadratic-form class number

Let $d$ be a positive <odd integer> with $k\geq1$ distinct <prime factors>. Then
$$
h(-4d)\geq2^{k-1},
$$
where $h$ is the <class number of a negative discriminant>.

Assign each complete <prime power> in the <prime factorization> of $d$ to one of two factors $a,c$. There are $2^k$ ordered <integer factorizations> $d=ac$ with <coprime> factors. Interchanging $a$ and $c$ pairs them without a fixed pair, because $d>1$ and <coprime> equal factors would both be one. Thus there are $2^{k-1}$ unordered pairs.

Each pair gives the <primitive binary quadratic form> $[\min(a,c),0,\max(a,c)]$ of <discriminant of a binary quadratic form> $-4d$. It is a <reduced positive definite binary quadratic form>, so distinct pairs give distinct <equivalence classes> under <proper equivalence> by uniqueness of the <reduced positive definite binary quadratic form>. This proves the <lower bound>. For the excluded case $d=1$, the separate value $h(-4)=1$ also satisfies the weaker numerical inequality $1\geq2^{-1}$.