theorem
proved
area_quantization
show as:
view math explainer →
open explainer
Generate a durable explainer page for this declaration.
open lean source
IndisputableMonolith.Quantum.AreaQuantization on GitHub at line 73.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
-
H -
of -
ell0 -
ell0 -
H -
of -
A -
is -
of -
is -
of -
is -
of -
A -
is -
A -
AreaOperator -
H_AreaQuantization -
is_ledger_eigenstate -
RSHilbertSpace
used by
formal source
70/-- **THEOREM (GROUNDED)**: Area Quantization
71 The eigenvalues of the area operator are restricted to integer multiples of \ell_0^2.
72 This follows from the discrete nature of recognition bits on the ledger. -/
73theorem area_quantization (h : H_AreaQuantization H A ψ) (H : Type*) [RSHilbertSpace H] (A : AreaOperator H) (ψ : H) :
74 is_ledger_eigenstate H ψ → ∃ n : ℕ, ⟪ψ, A.op ψ⟫_ℂ = (n : ℂ) * (Complex.ofReal (ell0^2)) := by
75 intro he
76 exact h he
77
78/-- **THEOREM: Minimal Area Eigenvalue**
79 The minimal non-zero eigenvalue of the area operator is exactly \ell_0^2. -/
80theorem minimal_area_eigenvalue (h : H_AreaQuantization H A ψ) (H : Type*) [RSHilbertSpace H] (A : AreaOperator H) :
81 ∃ (a_min : ℝ), a_min = ell0^2 ∧
82 (∀ ψ : H, is_ledger_eigenstate H ψ →
83 let eigenvalue := (⟪ψ, A.op ψ⟫_ℂ).re;
84 eigenvalue ≠ 0 → eigenvalue ≥ a_min) := by
85 use ell0^2
86 constructor
87 · rfl
88 · intro ψ h_eigen eigenvalue h_nz
89 -- Use the quantization theorem to show ⟨ψ, Aψ⟩ = n * ell0^2
90 obtain ⟨n, h_quant⟩ := area_quantization h H A ψ h_eigen
91 have h_val : eigenvalue = n * ell0^2 := by
92 unfold eigenvalue
93 rw [h_quant]
94 simp only [Complex.mul_re, Complex.natCast_re, Complex.natCast_im,
95 zero_mul, sub_zero, Complex.ofReal_re]
96 -- Since eigenvalue ≠ 0 and n is Nat, n must be ≥ 1
97 have h_n_nz : n ≠ 0 := by
98 intro h_zero
99 subst h_zero
100 simp [h_val] at h_nz
101 have h_n_pos : 1 ≤ n := Nat.pos_of_ne_zero h_n_nz
102 -- n * ell0^2 ≥ 1 * ell0^2
103 have h_ell0_sq_pos : 0 < ell0^2 := pow_pos lambda_rec_pos 2