Updated post with better context:
I can do what I need to do using words. I am just trying to understand if there's notation I could use instead that would communicate this concept conclusively. The metric should be: There should be no doubt about what is being said. Words meet that metric perfectly.
You have two angle of attack sensors for a navigation system. Their readings go into $a$ and $b$. Because of errors, failures and other real-world factors, the values in $a$ and $b$ are not always equal. To smooth things out, the sensor data is passed through a set of convolution filters, error detection, failure mitigation and voting logic.
I am looking for notation that, as I said, symbolically communicates the very start of this process:
$$ Given \space that: \space a \space is \space not \space always \space equal \space to \space b \implies ... $$
The set of numbers $a$ and $b$ are in does not matter (assume $\mathbb{R}$ if it helps). The idea is to replace the words "not always equal" with one or more symbols.
This is what I have so far:
$$a \space\neg\forall= b$$
I read it as "not" "for all" "equal". That's the closest I think I have gotten to something symbolic that might be read as "a is not always equal to b". Not sure.
The use of $\not\equiv$ has been suggested. I can't see how this would ever be interpreted as "sometimes not equal" or, for that matter "sometimes equal" (which are equivalent characterizations). I don't think the distinction between equivalence and "sometimes equal/not-equal" is subtle at all.
Original post.
This is what most comments and answers referred to. It seems to have been confusing to some. Left here for context.
$$ \pm 2 \neq \pm 2 $$
This doesn't seem to cover it. Half the time $a$ and $b$ are equal. Is there a way to say "not always"? Or, alternatively, is the fact that $a$ and $b$ are not always equal enough to make $\neq$ tell the story accurately?
OK, let me see if I can concoct an example:
In proving that a function is injective you might start here:
$$ \forall a \forall b(f(a) = f(b) \implies a = b) $$
As you substitute the simplify the equation for, say $x^2 + 1$ you eventually end-up with $\pm a = \pm b$, which, of course, isn't always true. I am trying to understand how to say these are not always equal, therefore the function isn't injective.
Hope that helps.
EDIT:
The closest I think I've gotten after talking to someone IRL is something like:
$+a = +b$
$-a = -b$
$+a \neq -b$
$-a \neq +b$
And yet I still think one has to say "and therefore,..." to convey what needs to be communicated.
Or followed by
$$ \implies \forall a \forall b, a \neq b $$