Unverified50% confidenceFactExact time
The classic proofs of the universal approximation theorem (such as Cybenko 1989, Hornik 1991) rely on the activation function satisfying conditions such as being non-polynomial and bounded, and both Sigmoid and ReLU satisfy them.
1
Sources
50%
Confidence
Long-term
Relevance
10/20/2026
First Seen
Sources
Related Entities
Related Claims
VerifiedThe universal approximation theorem was rigorously proven by mathematician Cybenko in 1989 for the Sigmoid activation function.79% similarUnverifiedIn 1991, Kurt Hornik generalized the universal approximation theorem to almost all nonlinear activation functions.71% similarUnverifiedHardy、Benedicks、Amrein-Berthier等人证明了函数及其傅里叶变换的支撑集不能同时具有有限测度（除非函数为零）65% similarUnverifiedThe core strategy of Wiles's proof is to prove a special case of the Taniyama–Shimura conjecture (the modularity theorem), namely that every semistable elliptic curve is a modular form.61% similarVerifiedTerence Tao collaborated with Ben Green to prove the Green-Tao theorem, which states that the prime numbers contain arbitrarily long arithmetic progressions.61% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1077969API
curl https://kongchang.com/api/v1/knowledge/claims/1077969MCP
get_claim(id=1077969)