A simpler proof of Sternfeld's Theorem

Abstract

In Sternfeld's work on Kolmogorov's Superposition Theorem appeared the combinatorial-geometric notion of a basic set and a certain kind of arrays. A subset X ⊂ Rn is basic if any continuous function X R could be represented as the sum of compositions of continuous functions R R and projections to the coordinate axes. The definition of a Sternfeld array will be presented in the paper. Sternfeld's Arrays Theorem. If a closed bounded subset X ⊂ R2n contains Sternfeld arrays of arbitrary large size then X is not basic. The paper provides a simpler proof of this theorem.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…