Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $n$ be a positive integer. How can I show that the relation $R$ on the set of all polynomials with real–valued coefficients consisting of all pairs $(f, g)$ such that $f^{(n)}(x) = g^{(n)}(x)$ is an equivalence relation. Note that $f^{(n)}$ and $g^{(n)}$ are the $n$-th derivative of $f(x)$.

share|cite|improve this question
Show us what you tried...reflexivity, simmetry, transitivity – UrošSlovenija Apr 5 '13 at 8:12
Everything is really just dead obvious. Write down the definitions, and you should see immediately that they hold. – Asaf Karagila Apr 5 '13 at 8:15

There is a general principle, that says that any relation $R$ expressed in terms of $f R g$ if and only if $f$ and $g$ have the same (whatever) is an equivalence relation. Just spell aloud the three properties, and you'll see what I mean

More formally, if $A, C$ are sets, with $A \ne \emptyset$, and $\varphi: A \to C$ is a map, then the relation $R$ on $A$ defined, for $a, b \in A$, by $$ \text{$a R b$ if and only if $\varphi(a) = \varphi(b)$} $$ is an equivalence relation.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.