structure
definition
WeightedLedgerGraph
show as:
view math explainer →
open explainer
Read the cached plain-language explainer.
open lean source
IndisputableMonolith.Foundation.SimplicialLedger.ContinuumBridge on GitHub at line 98.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
used by
-
ContinuumBridgeCert -
discrete_laplacian -
FieldCurvatureBridge -
flat_is_vacuum -
induced_regge_action -
JCostToEFE -
laplacian_action -
stationarity_iff_laplacian_zero -
bridge_chain_complete -
ContinuumFieldCurvatureCert -
field_curvature_identity_einstein -
flat_regge_sum_zero -
CubicFieldCurvatureCert -
cubicHinges -
cubic_linearization_discharge -
field_curvature_identity_cubic -
laplacian_action_as_prod_sum -
regge_sum_cubicHinges -
CubicSimplicialInvarianceCert -
refinement_calibrated -
refinement_discharge_inherits -
EdgeLengthFromPsiCert -
field_curvature_identity_under_linearization -
laplacian_action_flat -
ReggeDeficitLinearizationHypothesis -
regge_sum_flat_under_linearization -
exact_decomposition -
exact_flat_agrees_with_linearized -
exactJCostAction -
exactJCostAction_flat -
exactJCostAction_nonneg -
exactJCostAction_via_Jcost -
jcost_stationarity_to_regge_nonlinear -
laplacian_action_prod_form -
nonlinear_field_curvature_identity -
NonlinearJCostReggeCert -
NonlinearReggeJCostIdentity -
quarticRemainder -
quarticRemainder_nonneg -
CalibratedAgainstGraph
formal source
95This is the standard graph Laplacian energy. -/
96
97/-- A weighted simplicial graph representing the ledger. -/
98structure WeightedLedgerGraph (n : ℕ) where
99 weight : Fin n → Fin n → ℝ
100 weight_nonneg : ∀ i j, 0 ≤ weight i j
101 weight_symm : ∀ i j, weight i j = weight j i
102
103/-- The discrete Laplacian action (= quadratic J-cost) on the graph. -/
104def laplacian_action {n : ℕ} (G : WeightedLedgerGraph n) (ε : Fin n → ℝ) : ℝ :=
105 (1 / 2) * ∑ i : Fin n, ∑ j : Fin n, G.weight i j * (ε i - ε j) ^ 2
106
107/-- The discrete Laplacian of ε at vertex i:
108 (Δε)_i = Σ_j w_ij · (ε_i − ε_j) -/
109def discrete_laplacian {n : ℕ} (G : WeightedLedgerGraph n) (ε : Fin n → ℝ) (i : Fin n) : ℝ :=
110 ∑ j : Fin n, G.weight i j * (ε i - ε j)
111
112/-- Stationarity of the Laplacian action implies the discrete Laplacian vanishes.
113 This is: δS/δε_i = 0 ⟺ (Δε)_i = 0 for all i. -/
114theorem stationarity_iff_laplacian_zero {n : ℕ} (G : WeightedLedgerGraph n) (ε : Fin n → ℝ) :
115 (∀ i, discrete_laplacian G ε i = 0) →
116 ∀ i, ∑ j : Fin n, G.weight i j * (ε i - ε j) = 0 := by
117 intro h i
118 exact h i
119
120/-! ## Regge Action Identification
121
122The Regge action on a simplicial complex is:
123 S_Regge = (1/κ) Σ_h δ_h · A_h
124
125where δ_h is the deficit angle at hinge h and A_h is its area.
126
127For small deficit angles (weak field), δ_h ≈ Σ_σ∋h (ε_σ − ε_σ') · geometry_factor.
128