How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
A univariate ReLU network with H hidden layers has a product bound on affine intervals
Statement
Let a scalar-input ReLU network have hidden layers of widths and an affine output. On any interval, its output is affine on at most subintervals. In particular, if it has hidden units, the number of affine intervals is at most for , and is when .
Statement references
Facts & Assumptions
Given: A scalar-input ReLU network as in ReLU feedforward networks and complexity conventions, hidden widths , and an interval .
Every hidden unit applies ReLU to an affine combination of earlier values, and the final output is affine (ReLU feedforward networks and complexity conventions).
Proof
Before any hidden layer, the input is affine on . Suppose all values through layer are affine on each of subintervals. On any one such interval, every preactivation in layer is affine, and each has at most one zero unless it is identically zero. The at most zeros divide that interval into at most subintervals on each of which all ReLU outputs are affine.
Induction over the hidden layers gives at most intervals; the affine output adds no breakpoints. For , AM–GM gives . With no hidden layer the output is affine on the entire interval.
Depends on
Used by
Dependency tree · two levels
2 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Matus Telgarsky, Representation Benefits of Deep Feedforward Networks, Lemma 2.1 (standard reference, not scraped)
- Dmitry Yarotsky, Error bounds for approximations with deep ReLU networks, proof of Theorem 6 (standard reference, not scraped)
- Matus Telgarsky, Deep learning theory lecture notes, Chapter 5 (standard reference, not scraped)