def
definition
SphereAdmitsCircleLinking
show as:
view math explainer →
open explainer
Read the cached plain-language explainer.
open lean source
IndisputableMonolith.Foundation.AlexanderDuality on GitHub at line 129.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
-
H -
nontrivial -
H -
circle_reduced_cohomology_iff -
CircleReducedCohomologyNontrivial -
identity -
is -
is -
is -
is -
S -
identity
used by
-
alexander_duality_circle_linking -
circle_linking_forces_D3 -
D3_admits_circle_linking -
no_circle_linking_high_dim -
no_circle_linking_low_dim -
physical_eight_tick -
spinor_eight_tick_forces_D3 -
SupportsNontrivialLinking -
AlexanderDualityForCircleHypothesis -
constraintS_iff_D3 -
LinkingInvariantHypothesis -
robustness_of_D3_signature
formal source
126This replaces the previous tautological definition `D = 3` with a
127definition grounded in cohomology. The equivalence with D = 3 is now
128a genuine theorem (`alexander_duality_circle_linking`), not `Iff.rfl`. -/
129def SphereAdmitsCircleLinking (D : ℕ) : Prop :=
130 CircleReducedCohomologyNontrivial ((D : ℤ) - 2)
131
132/-! ## Theorem: Linking Characterizes D = 3 -/
133
134/-- **Alexander Duality Applied to Circle Linking** (Hatcher, Thm 3.44).
135
136Non-trivial closed-curve linking in S^D exists iff D = 3.
137
138**Proof structure**:
1391. By definition, `SphereAdmitsCircleLinking D` ↔ H̃^{D-2}(S¹) nontrivial
1402. By `circle_reduced_cohomology_iff`, this holds iff D - 2 = 1
1413. For D : ℕ, (D : ℤ) - 2 = 1 iff D = 3
142
143This is a genuine theorem requiring the S¹ cohomology axiom, not a
144definitional identity. -/
145theorem alexander_duality_circle_linking (D : ℕ) :
146 SphereAdmitsCircleLinking D ↔ D = 3 := by
147 unfold SphereAdmitsCircleLinking
148 rw [circle_reduced_cohomology_iff]
149 constructor <;> intro h <;> omega
150
151/-! ## Derived Facts -/
152
153/-- D = 3 admits circle linking (forward direction). -/
154theorem D3_admits_circle_linking : SphereAdmitsCircleLinking 3 :=
155 (alexander_duality_circle_linking 3).mpr rfl
156
157/-- Circle linking forces D = 3 (reverse direction). -/
158theorem circle_linking_forces_D3 (D : ℕ) :
159 SphereAdmitsCircleLinking D → D = 3 :=
papers checked against this theorem (showing 9 of 9)
-
Multilayer networks model interdependencies across real systems
"Multilayer networks allow researchers to capture the rich, interconnected structure of systems where multiple types of interactions, temporal dynamics, or functional interdependencies coexist."
-
5D black holes survive to explain all dark matter
"the spacetime geometry of a higher-dimensional black hole... Myers-Perry black hole... n=1"
-
Polar flow matching adapts graphs while preserving topology
"we embed graphs into a Riemannian manifold. By adopting polar coordinates, we explicitly disentangle structure (radius) from semantics (angle). ... flow matching ... along geodesic paths"
-
Partition logic translates to Prolog rules that generate visual forms
"Greechie-style hypergraph... two three-atomic contexts C1={a,b,c}, C2={c,d,e}"
-
One-var loop termination decided in poly time under Collatz conjecture
"rec(R) = nonneg(v1,v2) ... I+, I−, Δ+, Δ− ... self-avoiding trace"
-
Sponge networks are disordered single-gyroids
"every loop of DG is catenated by loops of the other network, while no loops of the amorphous networks we analyzed are threaded or linked by another tubular PDMS domain"
-
3-torsion fields solve cyclotomic Galois embedding problems infinitely often
"isomorphism Φ : S4 → PGL2(F3) … subgroups eGi ≅ GL2(F3), SD16, D6, D4, C2²"
-
Robot planner cuts path bending by 91 percent on average
"A visibility cone is formed at the goal x_g by the vectors pointing from x_g to the vertices of the shared face S. The region R∪Δ_T is star-shaped if the vector v_new−x_g lies strictly inside this cone."
-
New bound tighteners and Givens lex cuts speed MINLPs with distance constraints
"sphere packing problem, kissing number problem, obnoxious facility location problem ... d∈{1,...,5} for MINLP, d=2 for OFL, d∈{2,3} for GEOM"