Greatest common divisor of algebraic integers I have several questions concerning some properties of algebraic numbers. The first concerns the folowing statement: 
Given algebraic integers $\alpha$ and $\beta$ they have a unique greatest common divisor modulo asociates. ie there is an algebraic integer $\delta$ with $\delta \vert \alpha$ and $\delta \vert \beta$ and such that for any other integer $\gamma$ such that $\gamma \vert \alpha$ and $\gamma \vert \beta$ we also have $\gamma \vert \delta$; any other algebraic integer with the same properties is an associate of $\delta$.
This result has a simple proof using class field theory, ie if $H$ is the Hilbert class field of $\mathbb{Q}[\alpha,\beta]$, then by the principal ideal theorem, the ideal $(\alpha,\beta)$ becomes principal in $H$ say $\alpha {\mathcal O}_H + \beta {\mathcal O}_H = \delta {\mathcal O}_H$. 
I have been looking for a simpler proof in several books in the subject, the nearest I found is theorem 98 in  Hecke's Lectures ..., but I think it is not enough: it finds an integer $A$ such that the set of multiples of $A$ in $\mathbb Q[\alpha,\beta]$ coincides with the ideal $(\alpha,\beta)$ but it does not follow that the same is true in the bigger field $\mathbb Q[\alpha,\beta,A]$. So my question is: 

Is there a proof of the statement not using class field theory?

My "ideal" proof will only use elementary properties of algebraic numbers so the statement could be proved just after the introduction of algebraic integers and units in a classical introduction to the subject, but I fear I'm asking too much.
 A: The proofs of the statement more or less all go like this: let $A$ denote the ideal generated by $\alpha$ and $\beta$ in the ring of integers of a number field $K$, and set $A^h = (\mu)$, where the exponent $h$ of the ideal class of $A$ divides the class number of the field $K$.
Then $A$ becomes principal in $L = K(\gamma)$ with $\gamma^h = \mu$ since $A {\mathcal O}_L = (\gamma)$. 
As for solving the Bezout equation $\alpha \rho + \beta \sigma = \gamma$, dividing through
by $\gamma$ shows that we have to solve  $\alpha_1 \rho + \beta_1 \sigma = 1$ in ${\mathcal O}_L$. Over the rationals this is done by the Euclidean algorithm, which we do not have in general number fields. One option I can see is the following: factor $\beta_1$ into prime ideals and compute Euler's Phi function $m = \Phi(\beta_1)$; then $\rho = \alpha_1^{m-1}$ has the property that $\alpha_1\rho-1$ is divisibly by $\beta$. To keep the size of $\rho$ under control you can always reduce the coefficients of $\rho$ with respect to an integral basis by $N(\beta)$. 
A: I give a proof of this result -- actually the stronger result that the GCD of any two algebraic integers may be expressed as a linear combination -- in $\S 23.4$ of these commutative algebra notes.
The required input from algebraic number theory is nontrivial -- namely that the ideal class group of (the ring of integers of) a number field is finite -- but is much less than that of class field theory.
Note though that one could get away with knowing that these ideal class groups are torsion abelian groups, which is, a priori, a more structural and thus possibly easier to prove result.  I have been racking my brains trying to come up with a more fundamentally commutative algebraic proof of this fact, thus far without success.
