M12 — Non-vacuity witness
DisprovedVathekProof.M12_witness_two_tileThe hypotheses of the equivalence theorems are satisfiable with nonzero content, witnessed explicitly. For the concrete graft (bridge into frozen donor , targets and , weights and , pre-update parameter ):
- a full derivative-certificate package exists for the frame — the shared derivative is and the per-occurrence data is the concrete values, zero direct gradients, and cotangents ;
- the two-tile partition is valid;
- the tiled gradient evaluates to and genuinely is the gradient of the monolithic objective at ;
- it is nonzero, and the rate- SGD step from it lands at ;
- the accumulated direct contributions alone are — a schedule that detaches the frozen donor's input would falsely report a zero bridge gradient.
Clause (5) shows the hypothesis structure has teeth: dropping the shared cotangent changes the computed gradient, so the equivalence theorems do not hold vacuously for any evaluator whatsoever.
import Definitions.Def_VathekFrame import Definitions.Def_VathekState import Definitions.Def_VathekAdamW import Definitions.Def_VathekWitness
namespace VathekProof
/-- **M12 — Non-vacuity witness** (white paper §5.3). The two-tile, two-occurrence
witness: a genuine derivative-certificate package exists for the concrete graft
(bridge `×3` into frozen donor `×2`, targets `1` and `4`, weights `1/4` and `3/4`, at
`θ = 2`), the partition `[{1}, {0}]` is valid, the tiled gradient evaluates to the
nonzero `105/2` and is the mathematical gradient of the monolithic objective, the
single rate-`1/100` SGD step from it lands at `59/40` — and the accumulated *direct*
contributions alone are `0`, so a schedule that detaches the frozen donor's input
would falsely report a zero bridge gradient. The hypotheses of the equivalence
theorems are therefore satisfiable with nonzero content. -/
theorem M12_witness_two_tile :
∃ D : FrameDeriv 1 1 (Fin 2) ⟨witnessH, witnessF, witnessAlpha, Finset.univ⟩ witnessW₀,
IsTilePartition (Finset.univ : Finset (Fin 2))
[({1} : Finset (Fin 2)), {0}]
∧ D.h' = (6 : ℝ) • ContinuousLinearMap.id ℝ (EuclideanSpace ℝ (Fin 1))
∧ D.direct = witnessDirect
∧ D.shared = witnessShared
∧ D.val = witnessVal
∧ tiledGrad witnessAlpha D.val D.direct D.shared D.h'
[({1} : Finset (Fin 2)), {0}]
= WithLp.toLp 2 (fun _ => (105 / 2 : ℝ))
∧ HasGradientAt (frameLoss witnessH witnessF witnessAlpha Finset.univ)
(WithLp.toLp 2 (fun _ => (105 / 2 : ℝ))) witnessW₀
∧ (WithLp.toLp 2 (fun _ => (105 / 2 : ℝ)) : EuclideanSpace ℝ (Fin 1)) ≠ 0
∧ (WithLp.toLp 2 (fun _ => (2 : ℝ))
- (1 / 100) • WithLp.toLp 2 (fun _ => (105 / 2 : ℝ))
: EuclideanSpace ℝ (Fin 1))
= WithLp.toLp 2 (fun _ => (59 / 40 : ℝ))
∧ (tileAccum witnessAlpha D.val D.direct D.shared
[({1} : Finset (Fin 2)), {0}]).direct = 0 := by sorry
end VathekProofRead-back
What the Lean code literally says, in plain math · glm-5.3 (independent auditor subagent)
{'text': '{\n "readback": "What the theorem asserts. There exists an object — a complete derivative-certificate package for one fixed, fully concrete training frame, taken at one fixed point — such that ten further conditions hold. The statement has no hypotheses and no quantifiers other than this leading existential.\n\nThe frame (fixed inline in 's type). The parameter space is and the shared-state space is , both with the Euclidean norm and inner product; a vector is written for the element of whose single coordinate is . The occurrence index set has exactly two elements , and the occurrence set is all of it. The four frame components are:\n\n- shared computation: (scalar multiplication by on );\n- per-occurrence losses: with the Euclidean norm, targets and ;\n- reduction weights , ;\n- occurrence set .\n\nAll certificates are taken at the pre-update point , so .\n\nWhat the existence of itself comprises. The package bundles four data fields — a continuous linear map h\' : \\\\mathbb{R}^1 \\\\to \\\\mathbb{R}^1, and three families indexed by occurrences: values , direct gradients , shared cotangents — together with five certificate fields that must satisfy merely by its type:\n\n- h\' really is the Fréchet derivative of at ;\n- for every ;\n- is the Euclidean gradient of at , for every ;\n- is the Euclidean gradient of at the point , for every ;\n- each is differentiable at the point .\n\nThus the existential claims that genuine mathematical values/derivatives, with certificates, exist for exactly the data pinned down below — not merely that some uninterpreted data satisfies the displayed equations.\n\nThe ten conjuncts, in the stated order.\n\n1. Tile partition. The two-element tile list is a valid tile partition of in the following sense: the union of the tiles, folded from the empty set, equals , and distinct tiles of the list are disjoint — here . (The definition would also tolerate empty or unevenly sized tiles; in this instance both tiles are singletons.)\n\n2. Shared derivative. 's map h\' is exactly times the identity on , i.e. .\n\n3. Direct gradients. 's family is the constant-zero family: for .\n\n4. Shared cotangents. 's family is ; numerically and .\n\n5. Values. 's family is ; numerically and .\n\n6. Tiled gradient equals . Unfolded: the tiled gradient first runs a streaming accumulator over the tile list and then outputs (accumulated direct) h\'^{\\\\top}(accumulated shared), where h\'^{\\\\top} is the adjoint (transpose) of h\'. The accumulator starts at and, for each tile in list order (first , then ), adds , , and to the three slots. Concretely: after tile , and ; after tile , and (the loss slot becomes ; it is not used in the output). Since the adjoint of is again , the conjunct asserts\n
\\\\mathrm{direct} + h\'^{\\\\top}(\\\\mathrm{shared}) = (0) + 6\\\\cdot\\\\tfrac{35}{4} = \\\\left(\\\\tfrac{105}{2}\\\\right).\n\n7. Monolithic gradient. The monolithic objective, unfolded, is\n
\nand the conjunct asserts that has Euclidean gradient at — the Riesz representation of its derivative there. (Arithmetically, , which at gives .) This pins the same numerical vector as conjunct 6, but asserted independently; no general equivalence between the two is invoked.\n\n8. Nonvanishing. The vector is not the zero vector of .\n\n9. One explicit update step. Subtracting one-hundredth of the gradient vector from gives\n
\nan equality of vectors in (note and ).\n\n10. Direct accumulator is zero. The direct slot of the very same folded accumulator as in conjunct 6 (over the tiles , with the same , , , ) equals the zero vector — that is, the total weighted direct contributions alone, with no reverse pass through h\', sum to zero.\n\nFine print. All norms are the Euclidean norm on , i.e. the absolute value of the single coordinate. Every vector displayed as is the element of whose single coordinate is ; conjuncts 6–9 are equalities/inequalities between such concrete vectors. The only binding construct in the whole statement is the leading existential over ; every certificate condition listed above rides along with that existential, and conjuncts 2–5 additionally force 's data fields to the specific values shown, so the statement is the claim that certified genuine derivatives exist for exactly these numbers."\n}', 'details': {'resolvedPath': '/home/ajax/.omp/agent/sessions/-math/2026-09-22T19-31-08-510Z_01a0ca99-be5e-7000-93c6-dac7c74cc004/RB2-M12.md', 'contentType': 'text/markdown', 'totalLines': 3, 'displayContent': {'text': '{\n "readback": "What the theorem asserts. There exists an object — a complete derivative-certificate package for one fixed, fully concrete training frame, taken at one fixed point — such that ten further conditions hold. The statement has no hypotheses and no quantifiers other than this leading existential.\n\nThe frame (fixed inline in 's type). The parameter space is and the shared-state space is , both with the Euclidean norm and inner product; a vector is written for the element of whose single coordinate is . The occurrence index set has exactly two elements , and the occurrence set is all of it. The four frame components are:\n\n- shared computation: (scalar multiplication by on );\n- per-occurrence losses: with the Euclidean norm, targets and ;\n- reduction weights , ;\n- occurrence set .\n\nAll certificates are taken at the pre-update point , so .\n\nWhat the existence of itself comprises. The package bundles four data fields — a continuous linear map h\' : \\\\mathbb{R}^1 \\\\to \\\\mathbb{R}^1, and three families indexed by occurrences: values , direct gradients , shared cotangents — together with five certificate fields that must satisfy merely by its type:\n\n- h\' really is the Fréchet derivative of at ;\n- for every ;\n- is the Euclidean gradient of at , for every ;\n- is the Euclidean gradient of at the point , for every ;\n- each is differentiable at the point .\n\nThus the existential claims that genuine mathematical values/derivatives, with certificates, exist for exactly the data pinned down below — not merely that some uninterpreted data satisfies the displayed equations.\n\nThe ten conjuncts, in the stated order.\n\n1. Tile partition. The two-element tile list is a valid tile partition of in the following sense: the union of the tiles, folded from the empty set, equals , and distinct tiles of the list are disjoint — here . (The definition would also tolerate empty or unevenly sized tiles; in this instance both tiles are singletons.)\n\n2. Shared derivative. 's map h\' is exactly times the identity on , i.e. .\n\n3. Direct gradients. 's family is the constant-zero family: for .\n\n4. Shared cotangents. 's family is ; numerically and .\n\n5. Values. 's family is ; numerically and .\n\n6. Tiled gradient equals . Unfolded: the tiled gradient first runs a streaming accumulator over the tile list and then outputs (accumulated direct) h\'^{\\\\top}(accumulated shared), where h\'^{\\\\top} is the adjoint (transpose) of h\'. The accumulator starts at and, for each tile in list order (first , then ), adds , , and to the three slots. Concretely: after tile , and ; after tile , and (the loss slot becomes ; it is not used in the output). Since the adjoint of is again , the conjunct asserts\n
\\\\mathrm{direct} + h\'^{\\\\top}(\\\\mathrm{shared}) = (0) + 6\\\\cdot\\\\tfrac{35}{4} = \\\\left(\\\\tfrac{105}{2}\\\\right).\n\n7. Monolithic gradient. The monolithic objective, unfolded, is\n
\nand the conjunct asserts that has Euclidean gradient at — the Riesz representation of its derivative there. (Arithmetically, , which at gives .) This pins the same numerical vector as conjunct 6, but asserted independently; no general equivalence between the two is invoked.\n\n8. Nonvanishing. The vector is not the zero vector of .\n\n9. One explicit update step. Subtracting one-hundredth of the gradient vector from gives\n
\nan equality of vectors in (note and ).\n\n10. Direct accumulator is zero. The direct slot of the very same folded accumulator as in conjunct 6 (over the tiles , with the same , , , ) equals the zero vector — that is, the total weighted direct contributions alone, with no reverse pass through h\', sum to zero.\n\nFine print. All norms are the Euclidean norm on , i.e. the absolute value of the single coordinate. Every vector displayed as is the element of whose single coordinate is ; conjuncts 6–9 are equalities/inequalities between such concrete vectors. The only binding construct in the whole statement is the leading existential over ; every certificate condition listed above rides along with that existential, and conjuncts 2–5 additionally force 's data fields to the specific values shown, so the statement is the claim that certified genuine derivatives exist for exactly these numbers."\n}', 'startLine': 1, 'lineNumbers': [1, 2, 3]}, 'meta': {'source': {'type': 'internal', 'value': 'agent://RB2-M12'}}}}
Confirmed by the mission captain (proposal self-audit).