ND0233

AlternatingSignedUnit(n,z)

The actual signed code of (-1)^n from parity: even exponents give code 2 (+1), odd exponents code 1 (-1).

Conservative notation; not a theorem, primitive, or axiom.

Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.

Definition in prerequisite notation

Even(n) ∧ z = 2 ∨ Odd(n) ∧ z = 1

Only definitions earlier in this acyclic notation graph are used here.

Hygienic expanded first-order definition
(((exists mv_even_half_bottomlayereven. ((n)) = 2 * mv_even_half_bottomlayereven) /\ (((z)) = 2))) \/ (((exists mv_odd_half_bottomlayerodd. ((n)) = 2 * mv_odd_half_bottomlayerodd + 1) /\ (((z)) = 1)))

The unchanged native kernel never receives this surface symbol. Binder-safe expansion produces only its existing first-order syntax.

Direct definition dependencies

Definitions depending on this notation

Checked theorems using this definition