#What does it mean for something to be reducible over Q or Z?
1 messages · Page 1 of 1 (latest)
- Ask your question and show the work you've done so far. If you've posted a screenshot of a question, specify which part you need help with.
- Wait patiently for a helper to come along.
- Once someone helps you, say thank you and close the thread with:
+close - Feel free to nominate the person for helper of the week in #helper-nominations
- Do not ping the mods, unless someone is breaking the rules.
- If you're happy with the help you got here, and the server overall, you can contribute financially as well:
In what context?
it usually refers to a polynomial, where a polynomial P, isn’t reducible. Like $x^2+1$ that polynomial is irreducible over the rationals and integers. a polynomial
$f(x)∈Q[x]$ is reducible if f can be expressed as a product of two functions (factors if you may) Such that g(x) and h(x) are non constant polynomials of Q and for Z you basically can reduce the polynomial P to integer factors.
ビジヨン
Compile Error! Click the
reaction for more information.
(You may edit your message to recompile.)
ビジヨン
the cubic $x^3-6x-9$ Is reducible over both Q and Z as one of its roots it 3 thus giving $(x-3)(x^2+3x+3)$ now the quadratic, is it reducible over Q and Z?
ビジヨン
A polynomial $A(x)$ is reducible over some field $\mathbb F$ if it can be expressed as $B(x)C(x)$ where $B, C$ are also polynomial over that field and $\deg B, \deg C <\deg A$.
Coffey
For example
$X^2+1$ is irreducible over $\bZ, \bQ, \bR$ but it's reducible over $\bC$ as, $$X^2+1=(X-i)(X+i)$$
Coffey
also check out "Gauss' lemma on reduciblity"
+close