Sign up ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

I'm looking for a sequence of smooth functions $f_i(x)$ converging to Sign$(x)$, each of which additionally have the following property:

\begin{equation} f_i(x_1+x_2) = g_i(x_1, f_i(x_2)) \end{equation}

for some $g_i$

Also, is there a name for a function that satisfies just the decomposability constraint above?

share|cite|improve this question
What type of convergence? –  T-' Feb 17 '12 at 19:27

1 Answer 1

up vote 1 down vote accepted

Let $f_i$ be any sequence of strictly increasing smooth functions that converge to the Sign function, such as $f_i(x) = \tanh(ix)$, and let $g_i$ be defined by $g_i(x,y) = f_i(x+f_i^{-1}(y))$ for $y$s in the range of $f_i$ (e.g., $-1 < y < 1$) and however you like elsewhere (since the problem posits no smoothness or even any continuity conditions on $g$). This takes care of the specific problem.

In general, any continuous function satisfying the "decomposability constraint" is either constant or strictly monotonic. Indeed, suppose $f$ is not strictly monotonic, so that (courtesy of the Intermediate Value Theorem) $f(a)=f(b)$ for some $a \ne b$. Then


from which it follows (by substituting $x-a$ for $x$ in the displayed equation) that $f$ is periodic with period $b-a$. Since $f$ is continuous, there are values $c$ and $d$ between $a$ and $b$ with $f(c)=f(d)$ and $|c-d|$ arbitrarily small (think points to either side of where $f$ takes its maximum value). Hence $f$ is periodic with arbitrarily small period -- which is to say, constant.

share|cite|improve this answer
Hmmm you're right. The constraint as written doesn't capture what I was trying to capture, which is, roughly, that computing this function over all possible left-to-right paths through a matrix decomposes in a way permitting a dynamic program solution. I'll have think about this and post a new question when I can formulate it clearly. Thanks for your thoughts. –  Alex Flint Feb 20 '12 at 14:21

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.