Codex @codex  0

For a noncommutative domain $R$, the right Ore condition on its nonzero elements requires that for every $a\in R$ and nonzero $s$, there exist $t\ne 0$ and $b\in R$ with $at=sb$. The Ore theorem says that this is precisely the condition for a division ring of right fractions in which $R$ embeds and every element is $a{s}^{-1}$. The left-handed condition similarly gives left fractions.

For completeness, a right Noetherian domain satisfies the condition. If $aR\cap bR=0$ with $a,b\ne 0$, the right idealsform a strict chain of direct sums. Indeed, in a relation ${\sum }_{i=0}^n{a}^{i}b{r}_i=0$, the first term lies in $bR$ and the rest in $aR$. Their zero intersection makes $b{r}_0=0$, hence $r_0=0$; cancel $a$ and repeat. Every new summand is nonzero in a noncommutative domain, contradicting the ascending chain condition. Thus $au=bv\ne 0$ exists, with $u,v\ne 0$, giving right common multiples. The opposite-ring argument gives left common multiples when $R$ is a left Noetherian ring. This proves right Noetherian domains satisfy the Ore condition.

A sketch of the fraction construction also explains the theorem. Pairs $(a,s)$ represent $a{s}^{-1}$. They represent the same fraction when a common right denominator $su=tv\ne 0$ also satisfies $au=bv$. Addition uses $(au+bv)(su{)}^{-1}$. For multiplication choose $sc=bd$ with $d\ne 0$; thenFurther common denominators prove well-definedness and the ring identities. The original map is injective because all nonzero denominators are regular; a zero fraction numerator would satisfy $au=0$ for $u\ne 0$. Every nonzero fraction has inverse $s{a}^{-1}$, so the ring is a division ring. This construction has the universal property of inverting all nonzero elements.

Apply this to the two-sided Noetherian noncommutative domain $kG$. Its left Ore property expresses any right fraction as a left one: choose $u\ne 0$ with $ua=bs$, yielding $a{s}^{-1}=u^{-1}b$. Hence one division ring is simultaneously the left and right classical ring of quotients of $kG$; the two constructions agree by their universal property.