Local Validity Checker #
A computable, pure-ℚ checker that verifies whether a decision-tree row
satisfies the preconditions of the rational local theorem. Everything
here is computable — no noncomputable keyword.
@[reducible, inline]
Equations
Instances For
@[reducible, inline]
Equations
Instances For
Assertion that a row constitutes a valid application of the rational global theorem.
- exists_symmetry : ∃ (s : TriangleSymmetry), s.applicable row.Qi ∧ ∀ (i : Fin 3), row.Pi i = s.apply (row.Qi i)
Instances For
theorem
Noperthedron.Solution.Row.validLocal_iff
(row : Row)
:
row.ValidLocal ↔ row.nodeType = 2 ∧ row.interval.centerPose ∈ fourInterval ℚ ∧ (∃ (s : TriangleSymmetry), s.applicable row.Qi ∧ ∀ (i : Fin 3), row.Pi i = s.apply (row.Qi i)) ∧ (∀ (i : Fin 3), sqrt_twoℚ * row.epsilon + 3 * κQ < row.X₁.transpose.mulVec (pythonVertex (row.Pi i)) 0) ∧ (∀ (i : Fin 3),
sqrt_twoℚ * row.epsilon + 3 * κQ < (-1) ^ ↑row.sigma_Q * row.X₂.transpose.mulVec (pythonVertex (row.Qi i)) 0) ∧ (∀ (i : Fin 3),
2 * row.epsilon * (sqrt_twoℚ + row.epsilon) + 6 * κQ < rot90.mulVec (row.M₁_.mulVec (pythonVertex (row.Pi i))) ⬝ᵥ row.M₁_.mulVec (pythonVertex (row.Pi (i + 1)))) ∧ ∀ (i : Fin 3),
2 * row.epsilon * (sqrt_twoℚ + row.epsilon) + 6 * κQ < rot90.mulVec (row.M₂_.mulVec (pythonVertex (row.Qi i))) ⬝ᵥ row.M₂_.mulVec (pythonVertex (row.Qi (i + 1)))
@[implicit_reducible]
Equations
- One or more equations did not get rendered due to their size.
Smoke test #
Row 245 from data/solution_tree_300.csv — the first local leaf.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- One or more equations did not get rendered due to their size.