Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 width-n ReLU block makes n+1 full folds

Statement

For every integer n≥3, there is a scalar-input standard adjacent-layer ReLU block with one hidden layer of width n whose output is continuous and piecewise affine on [0,1], has exactly n interior breakpoints, and maps each of the resulting n+1 intervals bijectively onto [0,1]. Composing blocks of widths n1,…,nL≥3 yields ∏ℓ=1L(nℓ+1) full-dimensional activation regions in one input dimension.

Illustrative plot

For n=3, the fold is the piecewise-affine graph through (0,0), (1/7,1), (3/7,0), (5/7,1), and (1,0). The horizontal axis is the normalized input x∈[0,1] and the vertical axis is the block output. The marked interior vertices are exactly the breakpoints ti=(2i−1)/7; the graph shows each of the four subintervals mapping bijectively onto [0,1]. The proof verifies the hinge representation algebraically; this plot is illustrative.

\begin{tikzpicture}[x=5cm,y=2cm] \draw[->] (-0.04,0) -- (1.08,0) node[right] {x}; \draw[->] (0,-0.08) -- (0,1.18) node[above] {F3(x)}; \draw[thick,blue] (0,0) -- (1/7,1) -- (3/7,0) -- (5/7,1) -- (1,0); \fill (1/7,1) circle (1.2pt) node[above right] {1/7}; \fill (3/7,0) circle (1.2pt) node[below] {3/7}; \fill (5/7,1) circle (1.2pt) node[above right] {5/7}; \node[below left] at (0,0) {0}; \node[below right] at (1,0) {1}; \node[left] at (0,1) {1}; \end{tikzpicture}

Facts & Assumptions

Given: The ReLU network convention in ReLU feedforward networks and complexity conventions and an integer n≥3.

[F1]

A ReLU network may use affine skip connections and a final affine output, with depth counting input and output layers (ReLU feedforward networks and complexity conventions).

Proof

1.1givenconstructalgebra

Set t0=0, tn+1=1, and ti=(2i−1)/(2n+1) for 1≤i≤n. Put yi=0 for even i and yi=1 for odd i, and define si=(yi+1−yi)/(ti+1−ti) for 0≤i≤n. The piecewise-affine interpolant through (ti,yi) maps every interval bijectively onto [0,1]. Its first slope is s0=2n+1, while s2=(2n+1)/2 and s3=−(2n+1)/2, so s3−s2=−s0.

2.1step 1.1F1constructalgebra

Use hidden units hi(x)=ρ(x−ti) for i≠3 and h3(x)=ρ(t3−x). Give unit i output coefficient ai=si−si−1, including a3=s3−s2=−s0, and set output bias d=−a3t3. Before t1 only h3 is active, so the output is d+a3(t3−x)=s0x. At every ti, the slope changes by ai: for i≠3 this is the right-facing ReLU slope jump, and for i=3 it is the left-facing ReLU slope jump. Thus the network output has the same initial value and slope jumps as the interpolant in step 1.1, so it equals that interpolant on [0,1]. This uses exactly n hidden ReLU units and one affine output.

3.1step 2.1induction∎

Each fold block's output is affine in the current hidden layer, so it can be substituted into the affine preactivations of the next adjacent layer without adding an intervening layer. At each knot ti, exactly the corresponding hidden unit changes activation, so the n+1 intervals have distinct activation patterns. Each existing interval is cut into nℓ+1+1 subintervals, each mapped bijectively onto [0,1]; the new layer's patterns distinguish these subintervals, while earlier layer patterns distinguish their parent intervals. Induction over the blocks gives ∏ℓ=1L(nℓ+1) intervals, each a distinct full-dimensional activation region.

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