four_block_concat
The four-block concatenation four_block_concat of four Boolean functions f0, f1, f2, f3 : (Fin m → ZMod 2) → ZMod 2 is the Boolean function on Fin (m + 2) → ZMod 2 that sends v to (1 + y1) * (1 + y2) * f0 x + y1 * (1 + y2) * f1 x + (1 + y1) * y2 * f2 x + y1 * y2 * f3 x, where x = fun i => v (Fin.castAdd 2 i), y1 = v (Fin.natAdd m 0), and y2 = v (Fin.natAdd m 1).
Statement
def four_block_concat {m : ℕ} (f0 f1 f2 f3 : (Fin m → ZMod 2) → ZMod 2) :
(Fin (m + 2) → ZMod 2) → ZMod 2- Defined in
- arXiv:2610.29807, Section 2.3
- Verified
- 26 Oct 2026
- Axioms
- none listed
- Used by 3
- four_block_concat_zeroFor any natural number m, the four-block concatenation four_block_concat 0 0 0 0 of four zero Boolean functions on Fin m → ZMod 2 equals…
- reed_muller_four_block_concat_degree_sevenLet g0 and g3 be Boolean functions on Fin 12 in the Reed-Muller code reed_muller_code 5 12, and let g1 and g2 be Boolean functions on Fin…
- four_block_concat_reducedFor any natural number m and Boolean functions g0, g1, g2, g3 on Fin m → ZMod 2, the four-block concatenation four_block_concat g0 g1 g2…
Read back from the Lean
For a natural number m and four functions f0, f1, f2, f3 : (Fin m → ZMod 2) → ZMod 2, four_block_concat defines the function (Fin (m + 2) → ZMod 2) → ZMod 2 that takes an input vector v : Fin (m + 2) → ZMod 2 and returns:
(1 + y1) * (1 + y2) * f0 x + y1 * (1 + y2) * f1 x + (1 + y1) * y2 * f2 x + y1 * y2 * f3 x,
where:
- x : Fin m → ZMod 2 is given by x i = v (Fin.castAdd 2 i) (the restriction of v to the first m coordinates),
- y1 : ZMod 2 is v (Fin.natAdd m 0) (the coordinate of v at index m), and
- y2 : ZMod 2 is v (Fin.natAdd m 1) (the coordinate of v at index m + 1).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- Four-block concatenation of m-variable Boolean functions with block order 00, 10, 01, 11 into an (m+2)-variable Boolean function. -/ def four_block_concat {m : ℕ} (f0 f1 f2 f3 : (Fin m → ZMod 2) → ZMod 2) : (Fin (m + 2) → ZMod 2) → ZMod 2 := fun v => let x : Fin m → ZMod 2 := fun i => v (Fin.castAdd 2 i) let y1 : ZMod 2 := v (Fin.natAdd m 0) let y2 : ZMod 2 := v (Fin.natAdd m 1) (1 + y1) * (1 + y2) * f0 x + y1 * (1 + y2) * f1 x + (1 + y1) * y2 * f2 x + y1 * y2 * f3 x