Contravening geometric realizations
DefinitionKepler_GeometricRealizationWork in Euclidean . A packing has distance at least between distinct members. Put , , and for finite sets . A finite hypermap consists of a natural number , darts and permutations with for every dart. Let be its edge, node and face permutation-cycle orbits, including , and let be the finite sets of distinct such orbits. Let be the finite set of distinct components reachable by zero or more applications of . Incident faces at are the distinct sets . Write for those incident faces of size , size , and size at least , respectively, and . The condition called tame requires ; ; ; for every dart; ; ; and ; at least three distinct faces; and for every dart; ; and, whenever , both and . It further requires a real function on all finite subsets of the dart set with for every dart, when , when , and . The face constants are , with otherwise. In the order , the exceptional values of are ; every other pair has value . Values of away from actual faces are unrestricted. An empty hypermap is a permitted structure but cannot be tame. For put , using total division, and let be the unoriented Euclidean angle between and . Define if or either projection is zero; otherwise it is when and otherwise, including zero determinant with nonzero projections. For a finite set , standard neighbors of a member are , and contact neighbors are ; a point outside has no neighbors. For either relation, the successor of around is if the neighbor set is exactly ; otherwise it is a chosen neighbor minimizing among neighbors other than . If no such neighbor exists the choice has no specified property; minimizers need not be unique. The dart angle is when has more than one neighbor and otherwise. Being surrounded means that membership in implies a nonempty neighbor set and a dart angle strictly less than at every neighbor. Outside this implication is vacuous. A contravening configuration is a finite set of pairwise separated points in the closed annulus , with score , and with score at least that of every finite packing in that annulus, without restricting competitors' cardinality. It must also have , or members; every member must be surrounded for standard neighbors; and every member must either be surrounded for contact neighbors or have norm exactly . A placement of is any map from darts into , with center set , counting distinct images once. It realizes the standard fan when , each is a standard neighbor of , every ordered standard-neighbor pair in comes from exactly one dart with , , and equals the chosen standard successor of around . A contravening realization is a standard-fan realization whose center set is a contravening configuration; it does not additionally assume tameness or an involutive edge permutation on darts. A realization dart angle is its standard-fan dart angle. Its face weight at dart is the signed quantity , where and for and otherwise. This is a signed value, with no absolute value. Contravention extraction means that existence of any finite packing in the annulus with score strictly greater than implies existence of a contravening configuration, including its global score-maximality, cardinality and surrounding conditions. Tame realization means that for every contravening configuration there exist a finite hypermap and placement whose image center set is exactly , which realizes the standard fan and for which satisfies all the tame requirements. The existential hypermap and placement may depend on , with no uniqueness, canonical labels or separate prescribed weight function. All the displayed geometry functions are total: division by zero is , so , while the azimuth definition explicitly returns when its axis is zero. The extraction and realization statements are defined propositions, with implications vacuous when their stated counterexample hypotheses have no witness; the bundle does not assert that either proposition holds.
Source and scope. Primary §4.2 pp.8–10 and §§7–8; Blueprint Theorem8.41; FCDJDOT/YXISOKH/MQMSMAB. Unchanged local configurations, standard-fan realization and extraction interfaces.
/-
Flyspeck source material is reproduced and adapted under this license:
MIT License
Copyright (c) 2014 Thomas C. Hales
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
-/
import Definitions.Def_Kepler_PackingModel
import Definitions.Def_Kepler_TameArchive
import Mathlib.Geometry.Euclidean.Angle.Unoriented.Basic
set_option autoImplicit false
open scoped BigOperators
namespace KeplerMission
/-- Projection onto the plane perpendicular to `axis`, as in `Sphere.projection`.
The relevant annulus axes have norm at least 2. -/
noncomputable def axisProjection (axis v : Space) : Space :=
v - ((∑ i, v i * axis i) / (∑ i, axis i ^ 2)) • axis
/-- The oriented scalar triple product in the standard orientation of real three-space. -/
def scalarTriple (u v w : Space) : ℝ :=
u 0 * (v 1 * w 2 - v 2 * w 1) -
u 1 * (v 0 * w 2 - v 2 * w 0) + u 2 * (v 0 * w 1 - v 1 * w 0)
/-- Azimuth about the ray through `axis`, using values in `[0, 2π)`. Degenerate
triples return zero, as in HOL Light `Multivariate/flyspeck.ml:azim_def`. -/
noncomputable def geometricAzimuth (axis u v : Space) : ℝ := by
classical
let uperp := axisProjection axis u
let vperp := axisProjection axis v
let a := InnerProductGeometry.angle uperp vperp
exact if axis = 0 ∨ uperp = 0 ∨ vperp = 0 then 0
else if scalarTriple axis u v < 0 then 2 * Real.pi - a else a
inductive FanEdgeKind where
| standard
| contact
deriving DecidableEq
/-- `ESTD` and `ECTC` neighbors: standard edges have length at most 2.52;
contact edges have length exactly 2. Source: `tame/tame_defs.hl`. -/
noncomputable def fanNeighbors (s : Finset Space) (kind : FanEdgeKind) (v : Space) :
Finset Space := by
classical
exact if v ∈ s then s.filter (fun w ↦ w ≠ v ∧ match kind with
| .standard => dist v w ≤ (63 : ℝ) / 25
| .contact => dist v w = 2) else ∅
/-- Exact finite-set form of `fan/fan_defs.hl:sigma_fan`: minimum azimuth among
other neighbors, with a singleton exception. Choice does not assert any estimate. -/
noncomputable def fanSuccessor (s : Finset Space) (kind : FanEdgeKind)
(v w : Space) : Space := by
classical
let neighbors := fanNeighbors s kind v
exact if neighbors = {w} then w else Classical.epsilon fun u ↦
u ∈ neighbors ∧ u ≠ w ∧
∀ q ∈ neighbors, q ≠ w → geometricAzimuth v w u ≤ geometricAzimuth v w q
/-- `fan/fan_defs.hl:azim_fan`; a node with at most one neighbor has full-turn angle. -/
noncomputable def fanDartAzimuth (s : Finset Space) (kind : FanEdgeKind)
(v w : Space) : ℝ := by
classical
exact if 1 < (fanNeighbors s kind v).card then
geometricAzimuth v w (fanSuccessor s kind v w) else 2 * Real.pi
/-- Finite form of `Tame_defs.surrounded_node`. The isolated-node dart has angle 2π,
so the source predicate is false at an isolated center and vacuous outside `s`. -/
def SurroundedNode (s : Finset Space) (kind : FanEdgeKind) (v : Space) : Prop :=
v ∈ s → (fanNeighbors s kind v).Nonempty ∧
∀ w ∈ fanNeighbors s kind v, fanDartAzimuth s kind v w < Real.pi
noncomputable def annulusScore (s : Finset Space) : ℝ :=
∑ v ∈ s, annulusWeight ‖v‖
/-- Source `Tame_defs.contravening`; Blueprint FCDJDOT/YXISOKH. This describes a
maximizing local counterexample, not a packing structure or an assumed impossibility. -/
def ContraveningConfiguration (s : Finset Space) : Prop :=
IsPacking (s : Set Space) ∧ (↑s : Set Space) ⊆ annulus ∧ 12 < annulusScore s ∧
(∀ t : Finset Space, IsPacking (t : Set Space) → (↑t : Set Space) ⊆ annulus →
annulusScore t ≤ annulusScore s) ∧
(s.card = 13 ∨ s.card = 14 ∨ s.card = 15) ∧
(∀ v ∈ s, SurroundedNode s .standard v) ∧
(∀ v ∈ s, SurroundedNode s .contact v ∨ ‖v‖ = 2)
/-- Node positions are ordinary Euclidean coordinates; validity is a separate predicate. -/
abbrev GeometricPlacement (H : FiniteHypermap) := Fin H.dartCount → Space
noncomputable def realizationCenters (H : FiniteHypermap) (p : GeometricPlacement H) :
Finset Space := by
classical
exact Finset.univ.image p
/-- Explicit realization of `hypermap_of_fan (V, ESTD V)` on a finite dart carrier.
Darts are in bijection with directed short edges, node cycles follow geometric azimuth,
and the edge permutation reverses each directed edge. No estimate is a structure field. -/
def RealizesStandardFan (H : FiniteHypermap) (p : GeometricPlacement H) : Prop :=
(∀ d e, p d = p e ↔ e ∈ H.nodeOrbit d) ∧
(∀ d, p (H.edge d) ∈ fanNeighbors (realizationCenters H p) .standard (p d)) ∧
(∀ v ∈ realizationCenters H p,
∀ w ∈ fanNeighbors (realizationCenters H p) .standard v,
∃! d, p d = v ∧ p (H.edge d) = w) ∧
(∀ d, p (H.edge (H.edge d)) = p d) ∧
(∀ d, p (H.edge (H.node d)) =
fanSuccessor (realizationCenters H p) .standard (p d) (p (H.edge d)))
/-- The concrete configuration space associated to an oriented archive hypermap.
Blueprint Chapter 8, Linear Programs, `CalV_H`; orientation is handled by the archive
obligation using both a hypermap and its opposite. -/
def ContraveningRealization (H : FiniteHypermap) (p : GeometricPlacement H) : Prop :=
RealizesStandardFan H p ∧ ContraveningConfiguration (realizationCenters H p)
noncomputable def realizationDartAngle (H : FiniteHypermap) (p : GeometricPlacement H)
(d : Fin H.dartCount) : ℝ :=
fanDartAzimuth (realizationCenters H p) .standard (p d) (p (H.edge d))
/-- `Pack_defs.sol0`, the solid angle of a regular tetrahedron. -/
noncomputable def regularTetrahedronSolidAngle : ℝ :=
3 * Real.arccos (1 / 3) - Real.pi
/-- `Pack_defs.lmfun (t/2)`, including the source cutoff outside the annulus. -/
noncomputable def sourceRadialWeight (t : ℝ) : ℝ := by
classical
exact if t ≤ (63 : ℝ) / 25 then annulusWeight t else 0
/-- Exact `Tame_defs.tauVEF` sum on a represented face orbit. -/
noncomputable def realizationFaceWeight (H : FiniteHypermap) (p : GeometricPlacement H)
(d : Fin H.dartCount) : ℝ :=
(∑ a ∈ H.faceOrbit d, realizationDartAngle H p a *
(1 + (regularTetrahedronSolidAngle / Real.pi) * (1 - sourceRadialWeight ‖p a‖))) +
(Real.pi + regularTetrahedronSolidAngle) * (2 - ((H.faceOrbit d).card : ℝ))
/-- Source extraction lemma FCDJDOT, recorded as an unproved proposition type. -/
def ContraventionExtractionStatement : Prop :=
(∃ s : Finset Space, IsPacking (s : Set Space) ∧ (↑s : Set Space) ⊆ annulus ∧
12 < annulusScore s) → ∃ s : Finset Space, ContraveningConfiguration s
/-- Source `MQMSMAB`: a contravening configuration has a tame standard-fan hypermap.
The nonlinear estimates needed for a proof belong in the milestone dependencies. -/
def TameRealizationStatement : Prop :=
∀ s : Finset Space, ContraveningConfiguration s →
∃ (H : FiniteHypermap) (p : GeometricPlacement H),
realizationCenters H p = s ∧ RealizesStandardFan H p ∧ H.IsTame
end KeplerMission
Read-back
What the Lean code literally says, in plain math · gpt-6
Work in Euclidean . A packing has distance at least between distinct members. Put , , and for finite sets . A finite hypermap consists of a natural number , darts and permutations with for every dart. Let be its edge, node and face permutation-cycle orbits, including , and let be the finite sets of distinct such orbits. Let be the finite set of distinct components reachable by zero or more applications of . Incident faces at are the distinct sets . Write for those incident faces of size , size , and size at least , respectively, and . The condition called tame requires ; ; ; for every dart; ; ; and ; at least three distinct faces; and for every dart; ; and, whenever , both and . It further requires a real function on all finite subsets of the dart set with for every dart, when , when , and . The face constants are , with otherwise. In the order , the exceptional values of are ; every other pair has value . Values of away from actual faces are unrestricted. An empty hypermap is a permitted structure but cannot be tame. For put , using total division, and let be the unoriented Euclidean angle between and . Define if or either projection is zero; otherwise it is when and otherwise, including zero determinant with nonzero projections. For a finite set , standard neighbors of a member are , and contact neighbors are ; a point outside has no neighbors. For either relation, the successor of around is if the neighbor set is exactly ; otherwise it is a chosen neighbor minimizing among neighbors other than . If no such neighbor exists the choice has no specified property; minimizers need not be unique. The dart angle is when has more than one neighbor and otherwise. Being surrounded means that membership in implies a nonempty neighbor set and a dart angle strictly less than at every neighbor. Outside this implication is vacuous. A contravening configuration is a finite set of pairwise separated points in the closed annulus , with score , and with score at least that of every finite packing in that annulus, without restricting competitors' cardinality. It must also have , or members; every member must be surrounded for standard neighbors; and every member must either be surrounded for contact neighbors or have norm exactly . A placement of is any map from darts into , with center set , counting distinct images once. It realizes the standard fan when , each is a standard neighbor of , every ordered standard-neighbor pair in comes from exactly one dart with , , and equals the chosen standard successor of around . A contravening realization is a standard-fan realization whose center set is a contravening configuration; it does not additionally assume tameness or an involutive edge permutation on darts. A realization dart angle is its standard-fan dart angle. Its face weight at dart is the signed quantity , where and for and otherwise. This is a signed value, with no absolute value. Contravention extraction means that existence of any finite packing in the annulus with score strictly greater than implies existence of a contravening configuration, including its global score-maximality, cardinality and surrounding conditions. Tame realization means that for every contravening configuration there exist a finite hypermap and placement whose image center set is exactly , which realizes the standard fan and for which satisfies all the tame requirements. The existential hypermap and placement may depend on , with no uniqueness, canonical labels or separate prescribed weight function. All the displayed geometry functions are total: division by zero is , so , while the azimuth definition explicitly returns when its axis is zero. The extraction and realization statements are defined propositions, with implications vacuous when their stated counterexample hypotheses have no witness; the bundle does not assert that either proposition holds.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.