When we say that two algebraic expressions, [tex]f(x_1,x_2,\cdots

[dalcde]

When we say that two algebraic expressions, f(x_1,x_2,\cdots x_n), g(x_1,x_2,\cdots x_n) are identical, or
f(x_1,x_2,\cdots x_n)\equiv g(x_1,x_2,\cdots x_n), we mean (according to my textbook) that \forall x_1,x_2,\cdots x_n: f(x_1,x_2,\cdots x_n)=g(x_1,x_2,\cdots x_n)
However, does that mean that
x^2+x\equiv0
in Z^2?

If not, does it mean that
f(x_1,x_2,\cdots x_n)\equiv g(x_1,x_2,\cdots x_n)\Leftrightarrow\forall\phi: \phi(f(x_1,x_2,\cdots x_n))=\phi(g(x_1,x_2,\cdots x_n))

 

[chiro]

When we say that two algebraic expressions, f(x_1,x_2,\cdots x_n), g(x_1,x_2,\cdots x_n) are identical, or
f(x_1,x_2,\cdots x_n)\equiv g(x_1,x_2,\cdots x_n), we mean (according to my textbook) that \forall x_1,x_2,\cdots x_n: f(x_1,x_2,\cdots x_n)=g(x_1,x_2,\cdots x_n)
However, does that mean that
x^2+x\equiv0
in Z^2?

If not, does it mean that
f(x_1,x_2,\cdots x_n)\equiv g(x_1,x_2,\cdots x_n)\Leftrightarrow\forall\phi: \phi(f(x_1,x_2,\cdots x_n))=\phi(g(x_1,x_2,\cdots x_n))

Are you talking about number theoretic congruences? If so you need a modulus to be defined if this is the case.

Assuming this is the case I imagine that under congruences the strength of your phi relation may not hold in general.

Take for example mod 10. 3 Mod 10 = 3 and phi(3) = 2. 13 Mod 10 = 3 but phi(13) = 12 (since both are primes).

Is this what you mean? Maybe it isn't though, so some feedback would be appreciated.

 

[dalcde]

I'm talking about the identities in the simple high-school sense, in case that's what you are asking.

My \phis are propositional functions, which return a true or false answer. For example, \phi(f(x)) might be the statement "f(x) is a polynomial with degree 2", in which it is true for x^2+x but not 0. I got that notation from Principia Mathematica (by the way, I surrendered after reading less than half a volume - it was too tough). Please tell me if my notation is too outdated.

 

[chiro]

I'm talking about the identities in the simple high-school sense, in case that's what you are asking.

My \phis are propositional functions, which return a true or false answer. For example, \phi(f(x)) might be the statement "f(x) is a polynomial with degree 2", in which it is true for x^2+x but not 0. I got that notation from Principia Mathematica (by the way, I surrendered after reading less than half a volume - it was too tough). Please tell me if my notation is too outdated.

Ohh ok no worries. I'm doing a cryptography course at the moment so phi's to me are the Euler totient function and I put your post in the context of number theory due to your congruence symbols.

I'm not really qualified to answer your question since I'm unfamiliar with the notation. The principia is an old document though. But if liebniz notation has survived this long, maybe the notation in the principia has a chance :)

 

[AlephZero]

However, does that mean that
x^2+x\equiv0

in Z^2?

Yes, by your textbook definition.

If not, does it mean that
f(x_1,x_2,\cdots x_n)\equiv g(x_1,x_2,\cdots x_n)\Leftrightarrow\forall\phi: \phi(f(x_1,x_2,\cdots x_n))=\phi(g(x_1,x_2,\cdots x_n))

You need to understand the difference between a function \phi whose arguments are the values of f (i.e. all possible values, depending on the values of x_1,x_2,\cdots x_n), and a function whose argument is the function f itself.

IIRC Principia uses the different notations

\phi f and

\hat\phi f

when the difference is important.