|
| 1 | +"""Integration tests for REMESH operator with all 13 canonical operators. |
| 2 | +
|
| 3 | +Tests verify that REMESH integrates properly with each operator according to |
| 4 | +the physical relationships documented in remesh.py module docstring. |
| 5 | +""" |
| 6 | + |
| 7 | +import pytest |
| 8 | +import networkx as nx |
| 9 | + |
| 10 | +from tnfr.operators.definitions import ( |
| 11 | + Emission, Reception, Coherence, Dissonance, Coupling, |
| 12 | + Resonance, Silence, Expansion, Contraction, SelfOrganization, |
| 13 | + Mutation, Transition, Recursivity |
| 14 | +) |
| 15 | +from tnfr.operators.remesh import ( |
| 16 | + StructuralIdentity, |
| 17 | + structural_similarity, |
| 18 | + compute_global_coherence, |
| 19 | +) |
| 20 | +from tnfr.alias import get_attr, set_attr |
| 21 | +from tnfr.constants import inject_defaults |
| 22 | +from tnfr.constants.aliases import ALIAS_EPI, ALIAS_VF, ALIAS_DNFR, ALIAS_THETA |
| 23 | +from tnfr.structural import run_sequence |
| 24 | + |
| 25 | + |
| 26 | +class TestREMESHOperatorIntegration: |
| 27 | + """Test REMESH integration with all 13 canonical operators.""" |
| 28 | + |
| 29 | + def test_remesh_with_IL_hierarchical(self): |
| 30 | + """REMESH → IL (hierarchical stabilization).""" |
| 31 | + G = nx.DiGraph() |
| 32 | + G.add_node(1) |
| 33 | + inject_defaults(G) |
| 34 | + |
| 35 | + set_attr(G.nodes[1], ALIAS_EPI, 0.5) |
| 36 | + set_attr(G.nodes[1], ALIAS_VF, 1.0) |
| 37 | + set_attr(G.nodes[node if "node" in locals() else 1], ALIAS_THETA, 1.0) |
| 38 | + set_attr(G.nodes[1], ALIAS_THETA, 1.0) |
| 39 | + |
| 40 | + # Capture identity before |
| 41 | + identity_before = StructuralIdentity.capture_from_node(G.nodes[1]) |
| 42 | + |
| 43 | + # Apply REMESH → IL sequence |
| 44 | + run_sequence(G, 1, [Recursivity(), Coherence()]) |
| 45 | + |
| 46 | + # Verify coherence increased (IL effect) |
| 47 | + coherence = compute_global_coherence(G) |
| 48 | + assert coherence > 0.5 # Should be stabilized |
| 49 | + |
| 50 | + # Verify identity preserved |
| 51 | + assert identity_before.matches(G.nodes[1], tolerance=0.2) |
| 52 | + |
| 53 | + def test_remesh_with_SHA_latent_memory(self): |
| 54 | + """SHA → REMESH (frozen latent memory propagation).""" |
| 55 | + G = nx.DiGraph() |
| 56 | + G.add_node(1) |
| 57 | + inject_defaults(G) |
| 58 | + |
| 59 | + set_attr(G.nodes[1], ALIAS_EPI, 0.6) |
| 60 | + set_attr(G.nodes[1], ALIAS_VF, 1.0) |
| 61 | + set_attr(G.nodes[node if "node" in locals() else 1], ALIAS_THETA, 1.0) |
| 62 | + |
| 63 | + # Apply SHA to freeze |
| 64 | + run_sequence(G, 1, [Silence()]) |
| 65 | + |
| 66 | + # Capture frozen identity |
| 67 | + identity_frozen = StructuralIdentity.capture_from_node( |
| 68 | + G.nodes[1], |
| 69 | + is_sha_frozen=True |
| 70 | + ) |
| 71 | + |
| 72 | + assert identity_frozen.frozen_by_sha is True |
| 73 | + |
| 74 | + # Apply REMESH on frozen state |
| 75 | + run_sequence(G, 1, [Recursivity()]) |
| 76 | + |
| 77 | + # Identity should still match (frozen state propagated) |
| 78 | + assert identity_frozen.matches(G.nodes[1], tolerance=0.2) |
| 79 | + |
| 80 | + def test_remesh_with_VAL_expansion(self): |
| 81 | + """VAL → REMESH (fractal growth).""" |
| 82 | + G = nx.DiGraph() |
| 83 | + G.add_node(1) |
| 84 | + inject_defaults(G) |
| 85 | + |
| 86 | + set_attr(G.nodes[1], ALIAS_EPI, 0.4) |
| 87 | + set_attr(G.nodes[1], ALIAS_VF, 0.9) |
| 88 | + set_attr(G.nodes[node if "node" in locals() else 1], ALIAS_THETA, 1.0) |
| 89 | + |
| 90 | + epi_before = get_attr(G.nodes[1], ALIAS_EPI) |
| 91 | + |
| 92 | + # Apply VAL → REMESH |
| 93 | + run_sequence(G, 1, [Expansion(), Recursivity()]) |
| 94 | + |
| 95 | + epi_after = get_attr(G.nodes[1], ALIAS_EPI) |
| 96 | + |
| 97 | + # EPI should have changed (expansion + recursion) |
| 98 | + # Note: exact behavior depends on implementation |
| 99 | + assert epi_after is not None |
| 100 | + |
| 101 | + def test_remesh_with_OZ_rhizomatic(self): |
| 102 | + """OZ → REMESH (distributed bifurcation).""" |
| 103 | + G = nx.DiGraph() |
| 104 | + G.add_node(1) |
| 105 | + inject_defaults(G) |
| 106 | + |
| 107 | + set_attr(G.nodes[1], ALIAS_EPI, 0.5) |
| 108 | + set_attr(G.nodes[1], ALIAS_VF, 1.0) |
| 109 | + set_attr(G.nodes[node if "node" in locals() else 1], ALIAS_THETA, 1.0) |
| 110 | + |
| 111 | + # Apply OZ → REMESH (rhizomatic mode) |
| 112 | + run_sequence(G, 1, [Dissonance(), Recursivity()]) |
| 113 | + |
| 114 | + # Should complete without error |
| 115 | + assert G.nodes[1] is not None |
| 116 | + |
| 117 | + def test_remesh_with_THOL_self_organization(self): |
| 118 | + """THOL → REMESH (recursive self-organization).""" |
| 119 | + G = nx.DiGraph() |
| 120 | + G.add_node(1) |
| 121 | + inject_defaults(G) |
| 122 | + |
| 123 | + set_attr(G.nodes[1], ALIAS_EPI, 0.6) |
| 124 | + set_attr(G.nodes[1], ALIAS_VF, 1.1) |
| 125 | + set_attr(G.nodes[node if "node" in locals() else 1], ALIAS_THETA, 1.0) |
| 126 | + |
| 127 | + # Apply THOL → REMESH |
| 128 | + run_sequence(G, 1, [SelfOrganization(), Recursivity()]) |
| 129 | + |
| 130 | + # Should complete without error |
| 131 | + assert G.nodes[1] is not None |
| 132 | + |
| 133 | + def test_remesh_with_RA_fractal_harmonic(self): |
| 134 | + """REMESH → RA (multi-scale resonance).""" |
| 135 | + G = nx.DiGraph() |
| 136 | + G.add_nodes_from([1, 2]) |
| 137 | + G.add_edge(1, 2) |
| 138 | + inject_defaults(G) |
| 139 | + |
| 140 | + set_attr(G.nodes[1], ALIAS_EPI, 0.5) |
| 141 | + set_attr(G.nodes[1], ALIAS_VF, 1.0) |
| 142 | + set_attr(G.nodes[node if "node" in locals() else 1], ALIAS_THETA, 1.0) |
| 143 | + set_attr(G.nodes[2], ALIAS_EPI, 0.52) |
| 144 | + set_attr(G.nodes[2], ALIAS_VF, 0.98) |
| 145 | + set_attr(G.nodes[2], ALIAS_THETA, 1.0) |
| 146 | + set_attr(G.nodes[node if "node" in locals() else 1], ALIAS_THETA, 1.0) |
| 147 | + |
| 148 | + # Apply REMESH → RA |
| 149 | + run_sequence(G, 1, [Recursivity(), Resonance()]) |
| 150 | + |
| 151 | + # Should complete without error |
| 152 | + assert G.nodes[1] is not None |
| 153 | + |
| 154 | + def test_remesh_with_AL_fractal_emission(self): |
| 155 | + """AL → REMESH (fractal emission).""" |
| 156 | + G = nx.DiGraph() |
| 157 | + G.add_node(1) |
| 158 | + inject_defaults(G) |
| 159 | + |
| 160 | + set_attr(G.nodes[1], ALIAS_EPI, 0.1) # Low EPI (emission will increase) |
| 161 | + set_attr(G.nodes[1], ALIAS_VF, 0.5) # Positive νf required |
| 162 | + set_attr(G.nodes[1], ALIAS_THETA, 1.0) |
| 163 | + |
| 164 | + # Apply AL → REMESH |
| 165 | + run_sequence(G, 1, [Emission(), Recursivity()]) |
| 166 | + |
| 167 | + # EPI should increase after emission |
| 168 | + epi_after = get_attr(G.nodes[1], ALIAS_EPI) |
| 169 | + assert epi_after >= 0.1 # Should not decrease |
| 170 | + |
| 171 | + def test_remesh_with_NAV_transition(self): |
| 172 | + """NAV → REMESH (fractal attractor transition).""" |
| 173 | + G = nx.DiGraph() |
| 174 | + G.add_node(1) |
| 175 | + inject_defaults(G) |
| 176 | + |
| 177 | + set_attr(G.nodes[1], ALIAS_EPI, 0.5) |
| 178 | + set_attr(G.nodes[1], ALIAS_VF, 1.0) |
| 179 | + set_attr(G.nodes[node if "node" in locals() else 1], ALIAS_THETA, 1.0) |
| 180 | + |
| 181 | + # Apply NAV → REMESH |
| 182 | + run_sequence(G, 1, [Transition(), Recursivity()]) |
| 183 | + |
| 184 | + # Should complete without error |
| 185 | + assert G.nodes[1] is not None |
| 186 | + |
| 187 | + def test_remesh_with_EN_reception(self): |
| 188 | + """EN → REMESH (symmetric multi-scale reception).""" |
| 189 | + G = nx.DiGraph() |
| 190 | + G.add_nodes_from([1, 2]) |
| 191 | + G.add_edge(2, 1) # Node 2 influences node 1 |
| 192 | + inject_defaults(G) |
| 193 | + |
| 194 | + set_attr(G.nodes[1], ALIAS_EPI, 0.5) |
| 195 | + set_attr(G.nodes[1], ALIAS_VF, 1.0) |
| 196 | + set_attr(G.nodes[node if "node" in locals() else 1], ALIAS_THETA, 1.0) |
| 197 | + set_attr(G.nodes[2], ALIAS_EPI, 0.6) |
| 198 | + set_attr(G.nodes[2], ALIAS_VF, 1.0) |
| 199 | + set_attr(G.nodes[2], ALIAS_THETA, 1.0) |
| 200 | + set_attr(G.nodes[node if "node" in locals() else 1], ALIAS_THETA, 1.0) |
| 201 | + |
| 202 | + # Apply EN → REMESH |
| 203 | + run_sequence(G, 1, [Reception(), Recursivity()]) |
| 204 | + |
| 205 | + # Should complete without error |
| 206 | + assert G.nodes[1] is not None |
| 207 | + |
| 208 | + def test_remesh_with_NUL_contraction(self): |
| 209 | + """NUL → REMESH (hierarchical compression).""" |
| 210 | + G = nx.DiGraph() |
| 211 | + G.add_node(1) |
| 212 | + inject_defaults(G) |
| 213 | + |
| 214 | + set_attr(G.nodes[1], ALIAS_EPI, 0.7) |
| 215 | + set_attr(G.nodes[1], ALIAS_VF, 1.0) |
| 216 | + set_attr(G.nodes[node if "node" in locals() else 1], ALIAS_THETA, 1.0) |
| 217 | + |
| 218 | + # Apply NUL → REMESH |
| 219 | + run_sequence(G, 1, [Contraction(), Recursivity()]) |
| 220 | + |
| 221 | + # Should complete without error |
| 222 | + assert G.nodes[1] is not None |
| 223 | + |
| 224 | + def test_remesh_with_UM_coupling(self): |
| 225 | + """REMESH → UM (multi-scale coupling).""" |
| 226 | + G = nx.DiGraph() |
| 227 | + G.add_nodes_from([1, 2]) |
| 228 | + inject_defaults(G) |
| 229 | + |
| 230 | + set_attr(G.nodes[1], ALIAS_EPI, 0.5) |
| 231 | + set_attr(G.nodes[1], ALIAS_VF, 1.0) |
| 232 | + set_attr(G.nodes[node if "node" in locals() else 1], ALIAS_THETA, 1.0) |
| 233 | + set_attr(G.nodes[1], ALIAS_THETA, 0.5) |
| 234 | + |
| 235 | + set_attr(G.nodes[2], ALIAS_EPI, 0.52) |
| 236 | + set_attr(G.nodes[2], ALIAS_VF, 0.98) |
| 237 | + set_attr(G.nodes[2], ALIAS_THETA, 1.0) |
| 238 | + set_attr(G.nodes[node if "node" in locals() else 1], ALIAS_THETA, 1.0) |
| 239 | + set_attr(G.nodes[2], ALIAS_THETA, 0.52) |
| 240 | + |
| 241 | + # Apply REMESH → UM |
| 242 | + run_sequence(G, 1, [Recursivity(), Coupling()]) |
| 243 | + |
| 244 | + # Should complete without error |
| 245 | + assert G.nodes[1] is not None |
| 246 | + |
| 247 | + def test_remesh_zhir_indirect_relationship(self): |
| 248 | + """ZHIR operates post-recursion (indirect relationship).""" |
| 249 | + G = nx.DiGraph() |
| 250 | + G.add_node(1) |
| 251 | + inject_defaults(G) |
| 252 | + |
| 253 | + set_attr(G.nodes[1], ALIAS_EPI, 0.5) |
| 254 | + set_attr(G.nodes[1], ALIAS_VF, 1.0) |
| 255 | + set_attr(G.nodes[node if "node" in locals() else 1], ALIAS_THETA, 1.0) |
| 256 | + |
| 257 | + # ZHIR requires prior IL + recent destabilizer (U4b grammar) |
| 258 | + # Apply: IL → OZ → REMESH → ZHIR |
| 259 | + run_sequence(G, 1, [ |
| 260 | + Coherence(), # Prior IL (base stability) |
| 261 | + Dissonance(), # Recent destabilizer |
| 262 | + Recursivity(), # REMESH propagates variations |
| 263 | + Mutation() # ZHIR transforms post-recursion |
| 264 | + ]) |
| 265 | + |
| 266 | + # Should complete without error |
| 267 | + assert G.nodes[1] is not None |
| 268 | + |
| 269 | + |
| 270 | +class TestOperatorSequenceGrammar: |
| 271 | + """Test that REMESH respects grammar rules with various operators.""" |
| 272 | + |
| 273 | + def test_remesh_as_generator_U1a(self): |
| 274 | + """REMESH can initiate sequences (generator).""" |
| 275 | + G = nx.DiGraph() |
| 276 | + G.add_node(1) |
| 277 | + inject_defaults(G) |
| 278 | + |
| 279 | + set_attr(G.nodes[1], ALIAS_EPI, 0.5) |
| 280 | + set_attr(G.nodes[1], ALIAS_VF, 1.0) |
| 281 | + set_attr(G.nodes[node if "node" in locals() else 1], ALIAS_THETA, 1.0) |
| 282 | + |
| 283 | + # REMESH as first operator (generator) |
| 284 | + run_sequence(G, 1, [Recursivity()]) |
| 285 | + |
| 286 | + assert G.nodes[1] is not None |
| 287 | + |
| 288 | + def test_remesh_as_closure_U1b(self): |
| 289 | + """REMESH can close sequences (closure).""" |
| 290 | + G = nx.DiGraph() |
| 291 | + G.add_node(1) |
| 292 | + inject_defaults(G) |
| 293 | + |
| 294 | + set_attr(G.nodes[1], ALIAS_EPI, 0.5) |
| 295 | + set_attr(G.nodes[1], ALIAS_VF, 1.0) |
| 296 | + set_attr(G.nodes[node if "node" in locals() else 1], ALIAS_THETA, 1.0) |
| 297 | + |
| 298 | + # REMESH as last operator (closure) |
| 299 | + run_sequence(G, 1, [Emission(), Recursivity()]) |
| 300 | + |
| 301 | + assert G.nodes[1] is not None |
| 302 | + |
| 303 | + def test_remesh_with_destabilizer_requires_stabilizer_U2(self): |
| 304 | + """REMESH + destabilizers require stabilizers (U2 convergence).""" |
| 305 | + G = nx.DiGraph() |
| 306 | + G.add_node(1) |
| 307 | + inject_defaults(G) |
| 308 | + |
| 309 | + set_attr(G.nodes[1], ALIAS_EPI, 0.5) |
| 310 | + set_attr(G.nodes[1], ALIAS_VF, 1.0) |
| 311 | + set_attr(G.nodes[node if "node" in locals() else 1], ALIAS_THETA, 1.0) |
| 312 | + |
| 313 | + # REMESH + VAL (destabilizer) → requires IL (stabilizer) |
| 314 | + run_sequence(G, 1, [ |
| 315 | + Recursivity(), |
| 316 | + Expansion(), # Destabilizer |
| 317 | + Coherence() # Stabilizer (required by U2) |
| 318 | + ]) |
| 319 | + |
| 320 | + assert G.nodes[1] is not None |
| 321 | + |
| 322 | + def test_remesh_phase_verification_U3(self): |
| 323 | + """REMESH with coupling operators requires phase compatibility (U3).""" |
| 324 | + G = nx.DiGraph() |
| 325 | + G.add_nodes_from([1, 2]) |
| 326 | + inject_defaults(G) |
| 327 | + |
| 328 | + # Set compatible phases |
| 329 | + set_attr(G.nodes[1], ALIAS_EPI, 0.5) |
| 330 | + set_attr(G.nodes[1], ALIAS_VF, 1.0) |
| 331 | + set_attr(G.nodes[node if "node" in locals() else 1], ALIAS_THETA, 1.0) |
| 332 | + set_attr(G.nodes[1], ALIAS_THETA, 1.0) |
| 333 | + |
| 334 | + set_attr(G.nodes[2], ALIAS_EPI, 0.52) |
| 335 | + set_attr(G.nodes[2], ALIAS_VF, 0.98) |
| 336 | + set_attr(G.nodes[2], ALIAS_THETA, 1.0) |
| 337 | + set_attr(G.nodes[node if "node" in locals() else 1], ALIAS_THETA, 1.0) |
| 338 | + set_attr(G.nodes[2], ALIAS_THETA, 1.05) # Compatible phase |
| 339 | + |
| 340 | + # Apply REMESH with RA (requires phase compatibility) |
| 341 | + run_sequence(G, 1, [Recursivity(), Resonance()]) |
| 342 | + |
| 343 | + # Verify phase compatibility maintained |
| 344 | + identity = StructuralIdentity.capture_from_node(G.nodes[1]) |
| 345 | + assert identity.phase_pattern is not None |
| 346 | + |
| 347 | + |
| 348 | +class TestStructuralSimilarityIntegration: |
| 349 | + """Test structural similarity with real operator sequences.""" |
| 350 | + |
| 351 | + def test_similar_patterns_after_same_sequence(self): |
| 352 | + """Nodes with same sequence should have similar EPIs.""" |
| 353 | + G = nx.DiGraph() |
| 354 | + G.add_nodes_from([1, 2]) |
| 355 | + inject_defaults(G) |
| 356 | + |
| 357 | + # Start with similar states |
| 358 | + for node in [1, 2]: |
| 359 | + set_attr(G.nodes[node], ALIAS_EPI, 0.5) |
| 360 | + set_attr(G.nodes[node], ALIAS_VF, 1.0) |
| 361 | + set_attr(G.nodes[node], ALIAS_THETA, 1.0) |
| 362 | + |
| 363 | + # Apply same sequence to both |
| 364 | + for node in [1, 2]: |
| 365 | + run_sequence(G, node, [Coherence(), Recursivity()]) |
| 366 | + |
| 367 | + epi1 = get_attr(G.nodes[1], ALIAS_EPI) |
| 368 | + epi2 = get_attr(G.nodes[2], ALIAS_EPI) |
| 369 | + |
| 370 | + similarity = structural_similarity(epi1, epi2) |
| 371 | + assert similarity > 0.8 # Should remain similar |
0 commit comments