theorem
proved
two_cube_pair_64
show as:
view math explainer →
open explainer
Generate a durable explainer page for this declaration.
open lean source
IndisputableMonolith.CrossDomain.TwoCubeUniversality on GitHub at line 68.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
used by
formal source
65
66/-- A 2³ cube squared: 64 = 2^6 (the six faces squared? No, 2^(2·3) — the
67 product of two cube-8 structures). -/
68theorem two_cube_pair_64
69 {A B : Type} [Fintype A] [Fintype B]
70 (hA : HasTwoCubeCount A) (hB : HasTwoCubeCount B) :
71 Fintype.card (A × B) = 64 := by
72 unfold HasTwoCubeCount at hA hB
73 simp [Fintype.card_prod, hA, hB]
74
75/-- Power set of a 2³-cube has size 2^8 = 256. -/
76theorem two_cube_powerset_256
77 {A : Type} [Fintype A] [DecidableEq A] (hA : HasTwoCubeCount A) :
78 Fintype.card (Finset A) = 256 := by
79 rw [Fintype.card_finset, hA]; decide
80
81/-- DFT modes and Q₃ vertices are equinumerous. -/
82theorem dft_q3_equicardinal :
83 Fintype.card DFTMode = Fintype.card Q3Vertex :=
84 two_cube_equicardinal dft_has_2cube q3_has_2cube
85
86/-- Pauli group and tick phases are equinumerous (both 8 = 2³). -/
87theorem pauli_tick_equicardinal :
88 Fintype.card PauliElement = Fintype.card TickPhase :=
89 two_cube_equicardinal pauli_has_2cube tick_has_2cube
90
91/-- DFT-8 × Q₃ = 64 (product of two 2³-cubes). -/
92theorem dft_q3_product :
93 Fintype.card (DFTMode × Q3Vertex) = 64 :=
94 two_cube_pair_64 dft_has_2cube q3_has_2cube
95
96/-- 64 = 8² and 64 = 2^6. Both identities. -/
97theorem sixtyfour_identities : 64 = 8 * 8 ∧ 64 = 2^6 := by decide
98