TNFR Logo
TheoryLearnSoftwareResearch

On this page

TNFR

Resonant Fractal Nature Theory — a mathematical framework for coherent patterns on graph-coupled networks.

About
  • Project history
  • Editorial policy
  • Contact
Resources
  • GitHub
  • PyPI
  • DOI · Zenodo
Legal
  • MIT License
  • Citation
© 2026 TNFR project — MIT licensed.DOI 10.5281/zenodo.17602860
docs
grammar
PHYSICS_VERIFICATION.md
API_CONTRACTS.mdCANONICAL_OZ_SEQUENCES.mdEMPIRICAL_CONFRONTATION_EEG.mdREADME.mdSTRUCTURAL_FIELDS_TETRAD.mdSTRUCTURAL_INTERFACE_THEORY.md
theory
APPLIED_STRUCTURAL_ANALYSIS.mdCATALOG_TYPE_HYGIENE_PROGRAMME.mdDISSIPATIVE_AND_OPEN_SYSTEMS.mdEMERGENT_ONTOLOGY.mdEXTENDED_FIELDS_AND_DERIVED_QUANTITIES.mdFUNDAMENTAL_THEORY.mdGAUGE_SYMMETRY_AND_UNIFICATION.mdGLOSSARY.mdMATHEMATICAL_DYNAMICS_BASIS.mdMINIMAL_STRUCTURAL_DEGREES.mdNUCLEUS_A_PRIME_LADDER_ATLAS.mdNUCLEUS_B_EQUIVARIANCE_OBSTRUCTIONS.mdPHYSICAL_REGIME_CORRESPONDENCES.mdREADME.mdREMESH_INFINITY_DERIVATION.mdSTRUCTURAL_CONSERVATION_THEOREM.mdSTRUCTURAL_OPERATORS.mdSTRUCTURAL_STABILITY_AND_DYNAMICS.mdTNFR_BSD_RESEARCH_NOTES.mdTNFR_HODGE_RESEARCH_NOTES.mdTNFR_NAVIER_STOKES_RESEARCH_NOTES.mdTNFR_NUMBER_THEORY.mdTNFR_P_VS_NP_RESEARCH_NOTES.mdTNFR_RIEMANN_RESEARCH_NOTES.mdTNFR_VARIATIONAL_PRINCIPLE.mdTNFR_YANG_MILLS_RESEARCH_NOTES.mdTNFR.pdfUNIFIED_GRAMMAR_RULES.md
factorization-lab
analysis
analyze_patterns.pycertificate_manifest.py
benchmarks
benchmark_analysis.pybenchmark_expansion_suite.pyfull_spectrum_factorization.pypaley_gap_extended.pypaley_gap_smoke.pytest_benchmark_suite.py
demos
experiment_contexts
exp_0b1663cd19b7.jsonexp_0bf0054b7474.jsonexp_75a4c8ca616a.jsonexp_848ee0fd1857.jsonexp_f6fe00562193.jsonexp_fdf3da424e1e.json
failure_telemetry_batch.pyfeedback_integration_demo.pyintegration_demo_snapshots.dbseed_management_integration_demo.pysnapshot_integration_demo.pytrajectory_143.jsontrajectory_77.jsontrajectory_89.jsontrajectory_91.jsontrajectory_97.json
docs
FACTORING_PLAYBOOK.mdFALSE_POSITIVE_TEST_SUITE.mdOPERATOR_CERTIFICATES.mdROADMAP.mdSPECTRAL_ROUTE.md
experiment_contexts
exp_cebe1d9e7d8e.json
notebooks
spectral_history.ipynb
scripts
run_false_positive_tests.py
tests
run_false_positive_test_suite.pytest_cli.pytest_false_positive_methodology.pytest_false_positive_verifier.pytest_feedback_integration.pytest_partitioning.pytest_seed_management.pytest_self_opt_support.pytest_snapshot_system.pytest_spectral_paley.pytest_verification_robustness.py
tnfr_factorization
__init__.pyapi.pycli.pyfailure_telemetry.pyfeedback_adapter.pyfeedback_integration.pypartitioning.pyself_opt_support.pyspectral_paley.py
demo_snapshots.dbLICENSE_SNAPSHOT.mdPACKAGE_SUMMARY.mdREADME.mdseed_management.pysnapshot_system.pytest_certificate_hashing.pytest_installation.pyverification_trajectory_77.json
benchmarks
analyze_tetrad_universality.pyb0star_alpha_canonical_product_graphs.pybenchmark_optimization_tracks.pybenchmark_utils.pyboundary_vibration.pybridge_primes_riemann.pychiral_involution.pycli_utils.pycoherence_projector_sense_index.pycommutant_bridge.pycomposition_arithmetic.pyconfinement_zones_test.pyconservation_law_validation.pydirected_paley_bridge.pyemergent_arithmetic_pulse.pyemergent_atom_dynamics.pyemergent_atomic_shells.pyemergent_base_dimension.pyemergent_dimension_dynamics.pyemergent_fractal_pulse.pyemergent_fractal_simplex_dimension.pyemergent_integers_symmetry.pyemergent_musical_nfr.pyemergent_nfr_geometry.pyemergent_nfr_where.pyemergent_rationals.pyemergent_rhythm.pyemergent_screening.pyemergent_shell_cardinals.pyemergent_shell_ordering.pyemergent_simplex_dimension.pyemergent_substrate_symmetry.pyequivariance_wall.pyexternal_phase_gate_validation.pyfield_methods_battery.pygolden_residue_remesh_bridge.pyintegrated_force_regime_study.pyinverse_spectrum_to_symmetry.pyk_phi_safety_demo.pykuramoto_farey_bridge.pymissing_piece_bridge.pymultichannel_interface_benchmark.pynavier_stokes_recipe_bridge.pynodal_propagator_residue_bridge.pyns_moment_hierarchy_cascade.pyoperational_irreducibility.pypaley_bridge.pyphase_curvature_investigation.pyphase_wall.pyphi_s_confinement_investigation.pyprimes_as_consequence.pypulse_phase_coherence_budget.pyREADME.mdremesh_infinity_riemann_baseline.pyremesh_infinity_riemann_composed.pyremesh_infinity_riemann_modified_graph.pyremesh_infinity_riemann_operator.pyremesh_infinity_riemann_spectral_basis.pyremesh_infinity_riemann_spectral_robustness.pyremesh_infinity_riemann_spectral.pyresidue_phase_vs_riemann.pystructural_interface_benchmark.pytemporal_interface_benchmark.pytetrad_results_aggregate.pyu2_destabilization_irreversibility.pyuniversality_clusters.pyxi_c_fast_experiment.py
primality-test
benchmarks
comprehensive_benchmark.py
docs
ADVANCED_INTEGRATION.mdmathematical_foundation.mdperformance_analysis.md
examples
advanced_examples.pybasic_usage.py
tnfr_primality
__init__.py__main__.pyadvanced_cli.pyadvanced_core.pycli.pyconstants.pycore.pyoptimized.py
MANIFEST.inPACKAGE_SUMMARY.mdREADME.mdRELEASE_NOTES_v1.0.mdsetup.pytest_installation.py
tests
core_physics
__init__.pytest_conservation_laws.pytest_delta_nfr_computation_paths.pytest_delta_nfr.pytest_dispersion_coherence_sign_invariance.pytest_emergent_constants_guard.pytest_lyapunov_operators.pytest_nodal_equation.pytest_structural_triad.py
data
replay_manifests
sample_run
_manifest_summary.json_manifest.json_partition_files.txt.gz
self_opt_validation
seed_alpha
paley.json
seed_beta
integration.json
seed_gamma
unknown.json
self_optimization
test_run
partitioned
test_run
test_run_p0.jsontest_run_p1.json
_manifest_summary.json_manifest.json
engines
test_pattern_discovery_manifest.pytest_self_optimization_engine.py
mathematics
__init__.pytest_autodiff.pytest_backends.pytest_dissipative_dynamics.pytest_epi.pytest_factory_patterns.pytest_metrics.pytest_navier_stokes_refounded.pytest_number_theory_canonical.pytest_operators.pytest_residue_networks.pytest_riemann_nodal_pulse.pytest_riemann_pulse_coherence.pytest_spaces.pytest_transforms.pytest_validator.py
operators
test_canonical_operators_modern.pytest_grammar_canon.pytest_grammar_canonical_consistency.pytest_grammar_dynamics.pytest_operator_contracts.pytest_operator_strategies.py
parallel
test_fractal_partition_manifest.py
physics
test_conservation_gauge_unification.pytest_dissipative_conservation.pytest_emergent_chemistry.pytest_field_cache_invalidation.pytest_gauge.pytest_phase_transition.pytest_signatures.pytest_spectral_conservation.pytest_structural_diffusion.pytest_structural_integrity.pytest_symplectic_substrate.pytest_tetrad_bounds.pytest_variational.pytest_yang_mills_closure.pytest_yang_mills_derivability.pytest_yang_mills_scaling.pytest_yang_mills_structural_gap.pytest_yang_mills_u6_sweep.py
scripts
test_run_self_opt_validation.pytest_run_self_optimization.py
sdk
__init__.pytest_simple_advanced.py
__init__.pyconftest.pyREADME.mdtest_breast_cancer_phase_gate_demo.pytest_classical_mechanics.pytest_distributed_fft.pytest_external_phase_gate_validation.pytest_factorization_entrypoint.pytest_multichannel_interface.pytest_nodal_optimizer.pytest_phase_gate_api.pytest_replay_register_manifest.pytest_signal_confrontation.pytest_structural_interface_api.pytest_structural_interface_baselines.pytest_structural_interface_benchmark.pytest_temporal_interface.pytest_vectorized_coherence_length_regression.pytest_wine_quality_phase_gate_demo.pyutils.py
examples
01_foundations
01_hello_world.py02_musical_resonance.py03_network_formation.py04_operator_sequences.py05_coherence_evolution.py06_network_topologies.py07_phase_transitions.py08_emergent_phenomena.py09_visualization_suite.py10_simplified_sdk_showcase.py
02_physics_regimes
11_classical_limit_comparison.py115_operator_contract_audit.py12_classical_mechanics_demo.py13_quantum_mechanics_demo.py14_uncertainty_and_interference.py15_train_crossing_demo.py17_conservation_law_demo.py26_gauge_structure_demo.py27_variational_principle_demo.py28_dissipative_systems_demo.py29_lyapunov_stability_demo.py30_self_optimization_demo.py31_mathematical_constants_basis.py33_complex_field_unification.py34_conservation_protocol_suite.py35_tetrad_irreducibility.py36_grammar_violation_detector.py37_operator_tetrad_synergy.py38_grammar_energy_landscape.py39_nodal_equation_decomposition.py
03_riemann_zeta
157_nodal_pulse_phase_attack.py41_von_mangoldt_zeta_demo.py42_riemann_zeros_as_resonances.py43_prime_ladder_hamiltonian_demo.py44_weil_explicit_formula_demo.py45_li_keiper_demo.py46_weil_tnfr_positivity_demo.py47_alpha_sweep_demo.py48_admissible_family_sweep_demo.py49_nodeaware_gauge_sweep_demo.py50_uniform_coercivity_demo.py51_adaptive_coercivity_demo.py52_paley_gap_coercivity_demo.py53_lyapunov_spectral_positivity_demo.py54_hilbert_polya_demo.py55_structural_zero_density_demo.py56_spectral_emergence_demo.py57_admissible_rescaling_demo.py58_oscillatory_correction_demo.py
04_riemann_L_twisted
59_dirichlet_l_function_demo.py60_dirichlet_l_continuation_demo.py61_dirichlet_l_hamiltonian_demo.py62_dirichlet_weil_explicit_formula_demo.py63_dirichlet_li_keiper_demo.py64_twisted_weil_positivity_demo.py65_twisted_alpha_sweep_demo.py66_twisted_admissible_family_sweep_demo.py67_twisted_nodeaware_gauge_sweep_demo.py68_twisted_hermite_family_demo.py69_twisted_coercivity_uniform_demo.py70_twisted_paley_gap_coercivity_demo.py71_twisted_lyapunov_spectral_demo.py72_twisted_hilbert_polya_demo.py73_twisted_structural_zero_density_demo.py74_twisted_spectral_emergence_demo.py75_twisted_admissible_rescaling_demo.py76_twisted_oscillatory_correction_demo.py
05_type_hygiene
77_remesh_infinity_residue_split_demo.py78_nuf_type_signature_demo.py79_epi_type_signature_demo.py80_phi_type_signature_demo.py81_dnfr_type_signature_demo.py82_remesh_window_type_signature_demo.py83_delta_phi_max_type_signature_demo.py84_coupling_weights_type_signature_demo.py85_tetrad_closure_signature_demo.py86_currents_closure_signature_demo.py87_aggregates_closure_signature_demo.py88_urules_consistency_signature_demo.py89_operator_catalog_discipline_signature_demo.py
06_navier_stokes
158_navier_stokes_two_face_refounded.py
07_number_theory
100_prime_families_orbits.py101_numbers_as_coupled_network.py102_nodal_flow_primes_equilibria.py116_nuf_emergent_prime_visibility.py146_primality_grammatical_inertness.py147_numbers_as_free_monoid_words.py148_capacity_arm_carries_von_mangoldt.py149_p14_is_the_capacity_arm_operator.py153_structural_frequency_rank_cyclotomy.py40_arithmetic_number_theory.py94_generative_number_construction.py95_primes_from_spectral_waves.py96_spectral_vibration_of_coherence.py97_goldbach_additive_multiplicative.pyemergent_chemistry_particles_demo.py
08_emergent_geometry
103_emergent_substrate_meets_riemann.py106_per_node_polarization_geometry.py107_orthogonal_structure_emergent_geometry.py108_emergent_field_generating_structure.py112_structure_predicts_coherence_flow.py113_overdamped_projection_bridge.py114_substrate_conserved_quantities.py117_emergent_geometry_residue_graph.py118_emergent_vs_classical_operator.py119_phase_sector_directed_residue.py120_symmetry_wall_substrate_vs_spectrum.py121_canonical_symmetry_break_negative.py122_factorization_phase_sector.py123_symmetry_sector_decomposition.py124_emergent_metric_fractal_consistency.py125_node_is_the_emergent_substrate.py126_two_layers_base_fiber.py127_base_is_emergent_not_imposed.py128_base_substrate_coemergence.py129_spectral_gap_base_fiber_clock.py130_operators_break_substrate_charges.py131_coemergent_loop_convergence.py132_geometric_phase_holonomy.py133_psi_topological_defects.py134_spectral_dimension_heat_kernel.py135_arrow_of_time_h_theorem.py136_heat_kernel_coefficients.py137_synchronization_transition.py138_structure_frequency_synchronization.py139_grammar_formal_language.py140_grammar_automaton.py141_grammar_rule_decomposition.py142_grammar_operator_quotient.py143_glyphic_function_sublanguage.py144_branching_combinator.py145_syntactic_monoid_starfree.py150_emergent_grammatical_pattern_parry.py151_grammar_in_emergent_geometry.py152_operator_contract_tetrahedron.py154_conductor_annotated_qr_spectrum.py155_ontological_position_of_numbers.py156_emergence_directness_law.py98_emergent_symplectic_substrate.py99_structural_diffusion.pyunified_fields_showcase.py
09_millennium
109_p_vs_np_coherence_synthesis.py110_bsd_rank_structural_pressure.py111_hodge_discrete_and_honest_gap.py
10_applications
159_empirical_confrontation_pipeline.py90_phase_gate_monitor_demo.py91_breast_cancer_phase_gate_demo.py92_wine_quality_phase_gate_demo.py93_structural_interface_demo.pypytorch_cuda_demo.py
README.md
scripts
replay
__init__.pyregister_manifest.py
__init__.pyREADME.mdrebuild_failure_manifest.pyrun_reproducible_benchmarks.pyrun_self_opt_validation.pyrun_self_optimization.pytnfr_is_prime.pyvalidate_conservation_law.pyverify_internal_references.py
src
core
__init__.pyevaluation.py
tnfr
backends
__init__.pyjax_backend.pynumpy_backend.pyoptimized_numpy.pyREADME.mdtorch_backend.py
cli
__init__.py__init__.pyiarguments.pyarguments.pyiexecution.pyexecution.pyiinteractive_validator.pyREADME.mdutils.pyutils.pyi
compat
__init__.pydataclass.pyjsonschema_stub.pymatplotlib_stub.pynumpy_stub.pyREADME.md
config
__init__.py__init__.pyiconstants.pyconstants.pyidefaults_core.pydefaults_init.pydefaults_metric.pydefaults.pyfeature_flags.pyfeature_flags.pyiglyph_constants.pyoperator_names.pyoperator_names.pyiphysics_derivation.pyprecision_modes.pypresets.pypresets.pyiREADME.mdsecurity.pythresholds.pytnfr_config.py
constants
__init__.py__init__.pyialiases.pyaliases.pyicanonical.pymetric.pymetric.pyioperational.py
core
__init__.pycontainer.pydefault_implementations.pyexceptions.pyinterfaces.pyREADME.md
dynamics
__init__.py__init__.pyiadaptation.pyadaptation.pyiadaptive_sequences.pyadaptive_sequences.pyiadelic.pyadvanced_cache_optimizer.pyadvanced_fft_arithmetic.pyaliases.pyaliases.pyibifurcation.pycache_aware_fft_engine.pycanonical.pycanonical.pyicomputational_hub.pycoordination.pycoordination.pyidistributed_fft.pydnfr.pydnfr.pyidynamic_limits.pyemergent_centralization.pyemergent_integration_engine.pyfeedback.pyfeedback.pyifft_backend.pyfft_cache_coordinator.pyfft_dispatchers.pyfft_engine.pyfft_workers.pyfused_dnfr.pyhomeostasis.pyhomeostasis.pyiintegrators.pyintegrators.pyilearning.pylearning.pyimetabolism.pymulti_modal_cache.pynbody_tnfr.pynbody.pynodal_optimizer.pyoptimization_orchestrator.pypropagation.pyREADME.mdruntime.pyruntime.pyisampling.pysampling.pyiselectors.pyselectors.pyiself_optimizing_engine.pyspectral_structural_fusion.pystructural_cache.pystructural_clip.pysymplectic.pyunified_backend.pyunified_mathematical_cache_orchestrator.py
engines
computation
__init__.pyfft_engine.pyunified_fft_engine.pyunified_gpu_system.py
constants
__init__.pycanonical.pyoperational.py
integration
__init__.pyemergent_integration.py
pattern_discovery
__init__.pymathematical_patterns.pymulti_modal_cache.py
self_optimization
__init__.pyengine.py
__init__.pyREADME.md
errors
__init__.pycontextual.py
factorization
__init__.py
flatten
README.md
gamma
README.md
glyph_history
README.md
glyph_runtime
README.md
immutable
README.md
initialization
README.md
io
README.md
math
__init__.pyfields_symbolic.pygrammar_validators.pyoptimizer.pyREADME.mdsymbolic.py
mathematics
__init__.pybackend.pybackend.pyidynamics.pydynamics.pyiepi.pyepi.pyigenerators.pygenerators.pyiliouville.pymetrics.pymetrics.pyinumber_theory.pyoperators_factory.pyoperators_factory.pyioperators.pyoperators.pyioptimized_primality.pyprojection.pyprojection.pyiREADME.mdruntime.pyruntime.pyispaces.pyspaces.pyispectral.pytransforms.pytransforms.pyiunified_cache.pyunified_numerical.pyzeta.py
metrics
__init__.py__init__.pyibuffer_cache.pybuffer_cache.pyicache_utils.pycoherence.pycoherence.pyicommon.pycommon.pyicore.pycore.pyidiagnosis.pydiagnosis.pyiemergence.pyexport.pyexport.pyiglyph_timing.pyglyph_timing.pyilearning_metrics.pylearning_metrics.pyilocal_coherence.pyphase_coherence.pyphase_compatibility.pyREADME.mdreporting.pyreporting.pyisense_index.pysense_index.pyitelemetry.pytetrad.pytrig_cache.pytrig_cache.pyitrig.pytrig.pyi
multiscale
__init__.pyhierarchical.pyREADME.md
navier_stokes
__init__.pyconservative_face.pyoperator.py
node
README.md
observers
README.md
operators
network_analysis
__init__.pysource_detection.py
postconditions
__init__.pymutation.py
preconditions
__init__.pycoherence.pydissonance.pyemission.pymutation.pyreception.pyresonance.py
strategies
__init__.pydefaults.pygpu_strategies.pystrategy.py
__init__.py__init__.pyialgebra.pycanonical_patterns.pycascade.pycoherence.pycontraction.pycoupling.pycycle_detection.pydefinitions_base.pydefinitions.pydefinitions.pyidissonance.pyemission.pyexpansion.pygrammar_application.pygrammar_canon.pygrammar_context.pygrammar_core.pygrammar_dynamics.pygrammar_error_factory.pygrammar_memoization.pygrammar_patterns.pygrammar_telemetry.pygrammar_types.pygrammar_u6.pygrammar_validate.pygrammar.pygrammar.pyihamiltonian.pyhealth_analyzer.pyintrospection.pyjitter.pyjitter.pyilifecycle.pymetabolism.pymetrics_basic.pymetrics_core.pymetrics_network.pymetrics_structural.pymetrics_u6.pymetrics.pymutation.pynodal_equation.pyoperator_contracts.pypattern_detection.pypatterns.pyREADME.mdreception.pyrecursivity.pyregistry.pyregistry.pyiremesh.pyremesh.pyiresonance.pyself_organization.pysilence.pystructural_units.pytransition.py
parallel
__init__.pyauto_scaler.pydistributed.pyengine.pymonitoring.pypartitioner.pyREADME.md
performance
guardrails.py
physics
__init__.py_helpers.pycalibration.pycanonical.pycell.pyclassical_mechanics.pyconservation_gauge_unification.pyconservation.pydissipative_conservation.pyemergent_chemistry.pyemergent_particles.pyextended.pyfields.pygauge.pyintegrity.pyinteractions.pylife.pylyapunov.pypatterns.pyphase_transition.pyquantum_mechanics.pyREADME.mdsignatures.pyspectral_conservation.pyspectral_metrics.pystructural_diffusion.pysymplectic_substrate.pytelemetry.pyunified.pyvariational.pyvectorized_ops.py
primality
__init__.py
recipes
__init__.pycookbook.pyREADME.md
riemann
__init__.pyadmissible_family_sweep.pyadmissible_rescaling.pyaggregates_closure_signature.pyalpha_sweep.pyanalytic_continuation_dirichlet.pyanalytic_continuation.pycoercivity_uniform.pycoupling_weights_type_signature.pycurrents_closure_signature.pydelta_phi_max_type_signature.pydirichlet_l.pydnfr_type_signature.pyepi_type_signature.pyhilbert_polya.pyli_keiper.pylyapunov_spectral_positivity.pynodal_pulse.pynodeaware_gauge_sweep.pynuf_type_signature.pyoperator_catalog_discipline_signature.pyoperator.pyoscillatory_correction.pypaley_gap_coercivity.pyphi_type_signature.pyprime_ladder_hamiltonian.pypulse_coherence.pyremesh_infinity_residue_split.pyremesh_window_type_signature.pyspectral_emergence.pystructural_zero_density.pytelemetry.pytetrad_closure_signature.pytwisted_admissible_family_sweep.pytwisted_admissible_rescaling.pytwisted_alpha_sweep.pytwisted_coercivity_uniform.pytwisted_hermite_family.pytwisted_hilbert_polya.pytwisted_li_keiper.pytwisted_lyapunov_spectral_positivity.pytwisted_nodeaware_gauge_sweep.pytwisted_oscillatory_correction.pytwisted_paley_gap_coercivity.pytwisted_prime_ladder_hamiltonian.pytwisted_spectral_emergence.pytwisted_structural_zero_density.pytwisted_weil_explicit_formula.pytwisted_weil_positivity.pyurules_consistency_signature.pyvon_mangoldt.pyweil_explicit_formula.pyweil_positivity.py
schemas
__init__.pygrammar.jsonREADME.md
sdk
__init__.py__init__.pyiadaptive_system.pyadaptive_system.pyibuilders.pybuilders.pyifluent.pyfluent.pyiREADME.mdself_opt.pysimple.pytemplates.pytemplates.pyiutils.py
security
__init__.pycrypto.pydatabase.pyREADME.mdsubprocess.pyvalidation.py
sequencing
__init__.pypatterns.pyREADME.md
services
__init__.pyorchestrator.pyREADME.md
sparse
__init__.pyREADME.mdrepresentations.py
structural
README.md
telemetry
__init__.pycache_metrics.pycache_metrics.pyiconstants.pynu_f.pynu_f.pyiREADME.mdunified_telemetry_system.pyverbosity.pyverbosity.pyi
tools
__init__.pydomain_templates.pyREADME.mdsequence_generator.pytnfr_is_prime_cli_optimized.pytnfr_is_prime_cli.py
topology
__init__.pyasymmetry.pyREADME.md
utils
cache_layers.pycache.pycache.pyicallbacks.pycallbacks.pyichunks.pychunks.pyidata.pydata.pyifast_diameter.pygraph.pygraph.pyiinit.pyinit.pyiio.pyio.pyinumeric.pynumeric.pyiREADME.mdtopology.pyunified_cache.py
validation
__init__.py__init__.pyiaggregator.pybase.pycompatibility.pycompatibility.pyiconfig.pygraph.pygraph.pyihealth.pyinput_validation.pyinterface_baselines.pyinvariants.pymultichannel_interface.pyphase_gate.pyREADME.mdrules.pyrules.pyiruntime.pyruntime.pyisequence_validator.pysignal_confrontation.pysoft_filters.pysoft_filters.pyispectral.pyspectral.pyistructural_interface.pytemporal_interface.pyunified_validation_system.pyvalidator.pywindow.pywindow.pyi
visualization
__init__.pycascade_viz.pyhierarchy.pyREADME.mdsequence_plotter.py
yang_mills
__init__.pyclosure.pyderivability.pyscaling.pystructural_gap.pyu6_sweep.py
__init__.py__init__.pyi_compat.py_version.py_version.pyialias.pyalias.pyibackend_config.pycache.pycache.pyiexecution.pyexecution.pyiflatten.pyflatten.pyigamma.pygamma.pyiglyph_history.pyglyph_history.pyiglyph_runtime.pyglyph_runtime.pyiimmutable.pyimmutable.pyiinitialization.pyinitialization.pyiio.pyio.pyilocking.pylocking.pyinode.pynode.pyiobservers.pyobservers.pyiontosim.pyontosim.pyipy.typedrng.pyrng.pyisecure_config.pyselector.pyselector.pyisense.pysense.pyistructural.pystructural.pyitokens.pytokens.pyitrace.pytrace.pyitypes.pytypes.pyiunits.pyunits.pyi
tetrad_evaluator.py
.pre-commit-config.yaml.semgrep.yaml.zenodo.jsonARCHITECTURE.mdbandit.yamlCHANGELOG.mdCITATION.cffCONTRIBUTING.mdEMERGENT_CANON_AUDIT.mdEMERGENT_DERIVATION_PLAN.mdLICENSE.mdMakefileMANIFEST.inpyproject.tomlpyrightconfig.jsonPYTORCH_CUDA_INTEGRATION.mdREADME.mdSECURITY.mdTESTING.mdTNFR_Website_Content_Brief.md
FILE: benchmarks/commutant_bridge.py

commutant_bridge.py

benchmarks/commutant_bridge.py

Camino 7 -- is the Yang-Mills U(1) -> non-Abelian gap the SAME obstruction as the Riemann S_n-breaking gap?

equivariance_wall.py (Camino 5) showed the Riemann residue lives in Fix(S_n)^perp, unreachable because every catalog operator f(A, L) commutes with the prime- relabelling group S_n. The TNFR-Yang-Mills programme (theory/...YANG_MILLS..., src/tnfr/yang_mills/derivability.py) stops at the SAME kind of place: the canonical gauge is U(1) (Abelian, scalar connection A_ij), and the non-Abelian sector needed for a mass gap requires NON-COMMUTING generators that are not derivable from the nodal equation (Y3 = OPEN_DERIVABILITY_GAP). This harness asks whether the two gaps are one structural fact: CONFINEMENT OF THE CATALOG TO A COMMUTANT.

THE CLAIM (one shape, two groups): The reachable set of the TNFR catalog is, in both programmes, the COMMUTANT of a group acting on the (possibly colour-lifted) graph space -- and each open target lives in the orthogonal complement that the commutant cannot reach from a symmetric / colour-singlet seed.

text
Riemann  (G = S_n permutation rep on V):
    reachable subset of  rho(S_n)' = commutant       (Schur block-diagonal)
    V = Fix(S_n)  (+)  Fix(S_n)^perp                  (trivial isotypic + rest)
    residue S(T) = (1/pi) arg zeta(1/2 + iT)  in  Fix(S_n)^perp.   G4 = RH OPEN.

Yang-Mills (gauge group U(d) on the colour-lifted space V (x) C^d):
    gauge acts as  I_V (x) U ;  its commutant is  End(V) (x) C.I_d
                                 (colour-scalar operators -- double commutant).
    C^(dxd) = C.I_d  (+)  su(d)                       (trivial isotypic + rest)
    non-Abelian curvature [A_mu, A_nu]  in  su(d) (traceless colour).  GAP OPEN.

The catalog produces only f(A, L): (i) it commutes with every automorphism P_s, so it sits in rho(S_n)'; (ii) lifted to the bundle it acts as f(A, L) (x) I_d, so it commutes with EVERY gauge transformation I_V (x) U and is colour-scalar. The two "rest" components (Fix(S_n)^perp ; su(d)-valued curvature) are the orthogonal complements the commutant cannot enter -- the same shape, two different groups.

ENGINE (known theorems -- independent ground truth, all pre-TNFR):

  • Schur / double-commutant: the commutant of a group representation is the algebra block-diagonal across isotypic components; the commutant of {I_V (x) U : U in U(d)} on V (x) C^d is exactly End(V) (x) C.I_d.
  • su(2): [sigma_a/2, sigma_b/2] = i eps_abc sigma_c/2 -- traceless, non-commuting; exp(i theta n.sigma) = cos(theta) I + i sin(theta) n.sigma is a genuine SU(2) element. Abelian (scalar) holonomies commute; SU(2) holonomies do not.
  • Trace inner product: C^(dxd) = C.I_d (+) su(d) is an orthogonal split; the traceless part of any commutator [X, Y] has zero C.I_d component.

TNFR reading (AGENTS.md + src/tnfr/yang_mills): canonical_gauge_group = "U(1)"; the complex geometric field Psi = K_phi + i.J_phi is a single complex scalar per node (internal rank 1) and the gauge connection / curvature are scalar. Y3 audits whether non-commuting generators are derivable from nodal data; the conservative verdict is OPEN_DERIVABILITY_GAP (has_noncommuting_generators = False on every route). This is the YM mirror of the RH escape being the non-derivable per-node diagonal P2 (Camino 5 negative control).

HONEST SCOPE -- this is the deepest path and its THESIS verdict is OPEN, not PASS: The structural CHECKS pass at machine precision: both reachable sets are commutants and both open targets are orthogonal complements -- exactly the same algebraic shape. That UNIFIES the two Millennium obstructions; it does NOT close either. Closing RH still needs the non-derivable P2 diagonal; closing the YM mass gap still needs non-Abelian generators whose derivation from dEPI/dt = nu_f.dNFR is exactly the open Y3 gap. This harness is finite toy-graph + su(2) linear algebra; it proves the obstructions COINCIDE in shape, not that TNFR proves Yang-Mills or RH. R (continuum) and pi remain assumed substrate.

Run: python benchmarks/commutant_bridge.py

Status: RESEARCH (commutant-bridge falsifier; Camino 7 of the unification map).

Source Code

python
"""
benchmarks/commutant_bridge.py

Camino 7 -- is the Yang-Mills U(1) -> non-Abelian gap the SAME obstruction as
the Riemann S_n-breaking gap?

equivariance_wall.py (Camino 5) showed the Riemann residue lives in Fix(S_n)^perp,
unreachable because every catalog operator f(A, L) commutes with the prime-
relabelling group S_n. The TNFR-Yang-Mills programme (theory/...YANG_MILLS...,
src/tnfr/yang_mills/derivability.py) stops at the SAME kind of place: the canonical
gauge is U(1) (Abelian, scalar connection A_ij), and the non-Abelian sector needed
for a mass gap requires NON-COMMUTING generators that are not derivable from the
nodal equation (Y3 = OPEN_DERIVABILITY_GAP). This harness asks whether the two
gaps are one structural fact: CONFINEMENT OF THE CATALOG TO A COMMUTANT.

THE CLAIM (one shape, two groups):
  The reachable set of the TNFR catalog is, in both programmes, the COMMUTANT of a
  group acting on the (possibly colour-lifted) graph space -- and each open target
  lives in the orthogonal complement that the commutant cannot reach from a
  symmetric / colour-singlet seed.

    Riemann  (G = S_n permutation rep on V):
        reachable subset of  rho(S_n)' = commutant       (Schur block-diagonal)
        V = Fix(S_n)  (+)  Fix(S_n)^perp                  (trivial isotypic + rest)
        residue S(T) = (1/pi) arg zeta(1/2 + iT)  in  Fix(S_n)^perp.   G4 = RH OPEN.

    Yang-Mills (gauge group U(d) on the colour-lifted space V (x) C^d):
        gauge acts as  I_V (x) U ;  its commutant is  End(V) (x) C.I_d
                                     (colour-scalar operators -- double commutant).
        C^(dxd) = C.I_d  (+)  su(d)                       (trivial isotypic + rest)
        non-Abelian curvature [A_mu, A_nu]  in  su(d) (traceless colour).  GAP OPEN.

  The catalog produces only f(A, L): (i) it commutes with every automorphism P_s,
  so it sits in rho(S_n)'; (ii) lifted to the bundle it acts as f(A, L) (x) I_d, so
  it commutes with EVERY gauge transformation I_V (x) U and is colour-scalar. The
  two "rest" components (Fix(S_n)^perp ; su(d)-valued curvature) are the orthogonal
  complements the commutant cannot enter -- the same shape, two different groups.

ENGINE (known theorems -- independent ground truth, all pre-TNFR):
  - Schur / double-commutant: the commutant of a group representation is the
    algebra block-diagonal across isotypic components; the commutant of
    {I_V (x) U : U in U(d)} on V (x) C^d is exactly End(V) (x) C.I_d.
  - su(2): [sigma_a/2, sigma_b/2] = i eps_abc sigma_c/2 -- traceless, non-commuting;
    exp(i theta n.sigma) = cos(theta) I + i sin(theta) n.sigma is a genuine SU(2)
    element. Abelian (scalar) holonomies commute; SU(2) holonomies do not.
  - Trace inner product: C^(dxd) = C.I_d (+) su(d) is an orthogonal split; the
    traceless part of any commutator [X, Y] has zero C.I_d component.

TNFR reading (AGENTS.md + src/tnfr/yang_mills): canonical_gauge_group = "U(1)";
the complex geometric field Psi = K_phi + i.J_phi is a single complex scalar per
node (internal rank 1) and the gauge connection / curvature are scalar. Y3 audits
whether non-commuting generators are derivable from nodal data; the conservative
verdict is OPEN_DERIVABILITY_GAP (has_noncommuting_generators = False on every
route). This is the YM mirror of the RH escape being the non-derivable per-node
diagonal P2 (Camino 5 negative control).

HONEST SCOPE -- this is the deepest path and its THESIS verdict is OPEN, not PASS:
  The structural CHECKS pass at machine precision: both reachable sets are
  commutants and both open targets are orthogonal complements -- exactly the same
  algebraic shape. That UNIFIES the two Millennium obstructions; it does NOT close
  either. Closing RH still needs the non-derivable P2 diagonal; closing the YM mass
  gap still needs non-Abelian generators whose derivation from dEPI/dt = nu_f.dNFR
  is exactly the open Y3 gap. This harness is finite toy-graph + su(2) linear
  algebra; it proves the obstructions COINCIDE in shape, not that TNFR proves
  Yang-Mills or RH. R (continuum) and pi remain assumed substrate.

Run:
    python benchmarks/commutant_bridge.py

Status: RESEARCH (commutant-bridge falsifier; Camino 7 of the unification map).
"""

from __future__ import annotations

import os
import sys

import networkx as nx
import numpy as np

sys.path.insert(0, os.path.dirname(os.path.abspath(__file__)))
# Robust fallback so the harness also runs without PYTHONPATH=src preset.
sys.path.insert(
    0, os.path.join(os.path.dirname(os.path.abspath(__file__)), "..", "src")
)
from composition_arithmetic import automorphism_matrices  # noqa: E402

# Optional: the canonical engine's own non-Abelian derivability verdict.
try:  # pragma: no cover - exercised only when the package is importable
    from tnfr.yang_mills import audit_nonabelian_derivability  # noqa: E402

    _HAVE_AUDIT = True
except Exception:  # pragma: no cover
    _HAVE_AUDIT = False

# Optional: the canonical adelic carrier (nu_f = log p). The RH escape diagonal P2
# is exactly this carrier's prime log-frequencies, read as IMPOSED input -- the same
# adelic discipline as phase_wall.py / boundary_vibration.py, and the RH-side mirror
# of the yang_mills audit cross-check used on the YM side in TEST 4.
try:  # pragma: no cover - exercised only when the package is importable
    from tnfr.dynamics.adelic import AdelicDynamics  # noqa: E402

    _HAVE_ADELIC = True
except Exception:  # pragma: no cover
    _HAVE_ADELIC = False

TOL = 1e-9
_TWO_PI = 2.0 * np.pi
PAULI = (
    np.array([[0, 1], [1, 0]], dtype=complex),
    np.array([[0, -1j], [1j, 0]], dtype=complex),
    np.array([[1, 0], [0, -1]], dtype=complex),
)


def _sieve(n):
    """Primes up to n (Sieve of Eratosthenes) -- fallback if adelic is absent."""
    flag = [True] * (n + 1)
    out = []
    for p in range(2, n + 1):
        if flag[p]:
            out.append(p)
            for k in range(p * p, n + 1, p):
                flag[k] = False
    return out


def canonical_per_node_diagonal(n):
    """The canonical RH escape diagonal P2 is the adelic carrier's prime log-
    frequencies nu_f = log p (distinct per node), which dEPI/dt = nu_f . dNFR reads
    as IMPOSED input -- the P2 = NodeIndexedCouplingWeights candidate that AGENTS.md
    (B0*-beta, S13sexagesima-sexta) shows is NOT nodal-derivable. Falls back to a
    prime sieve, then to diag(1..n); the escape conclusion is identical."""
    if _HAVE_ADELIC:
        eng = AdelicDynamics(max_prime=max(15, 4 * n))
        nu = np.asarray(eng.nu_f, dtype=float)[:n]
        if nu.size == n:
            return np.diag(nu), "nu_f = log p (canonical adelic carrier, IMPOSED)"
    primes = np.array(_sieve(max(15, 4 * n)), dtype=float)[:n]
    if primes.size == n:
        return np.diag(np.log(primes)), "nu_f = log p (sieve fallback, IMPOSED)"
    return np.diag(np.arange(1, n + 1, dtype=float)), "diag(1..n) (abstract per-node)"


# --------------------------------------------------------------------------- #
# Graph operators. The canonical discrete dNFR / phase-curvature operator is the
# emergent random-walk Laplacian L_rw = I - D^-1 W (symmetric twin L_sym); the
# combinatorial L = D - A below is its imposed cousin, sharing L_rw's eigenspaces
# (hence the same commutant) on the vertex-transitive graphs here (L_rw =
# (D - A)/deg on a d-regular graph).
# --------------------------------------------------------------------------- #
def adjacency_laplacian(G, nodes):
    """Return (A, L) with L = D - A the combinatorial Laplacian; on the
    vertex-transitive graphs here it shares the eigenspaces of the canonical
    emergent operator L_rw = I - D^-1 W, so its commutant is operator-invariant."""
    A = nx.to_numpy_array(G, nodelist=nodes)
    L = np.diag(A.sum(axis=1)) - A
    return A, L


def _matrix_function(S, f):
    """Apply scalar f to a symmetric matrix S via its spectral decomposition."""
    w, V = np.linalg.eigh(S)
    return (V * f(w)) @ V.T


def catalog_operators(A, L):
    """A representative slice of the TNFR catalog: every entry is a function of A
    and L only, so each is automorphism-equivariant and, once colour-lifted,
    colour-scalar. exp(-L/2) is the REMESH-inf smooth-half heat kernel."""
    return {
        "A": A,
        "L = D - A": L,
        "L^2": L @ L,
        "exp(-L/2)": _matrix_function(L, lambda x: np.exp(-0.5 * x)),
    }


def commutator_norm(M, N):
    """Frobenius norm ||M N - N M||."""
    return float(np.linalg.norm(M @ N - N @ M))


def symmetric_projector(mats):
    """Reynolds projector Pi = (1/|G|) sum_g P_g onto Fix(G) = V^G."""
    n = mats[0].shape[0]
    Pi = np.zeros((n, n))
    for M in mats:
        Pi += M
    return Pi / len(mats)


# --------------------------------------------------------------------------- #
# Colour bundle: lift, gauge action, su(2) generators, holonomy
# --------------------------------------------------------------------------- #
def su2_generators():
    """T_a = sigma_a / 2: traceless, Hermitian, [T_a, T_b] = i eps_abc T_c."""
    return [p / 2.0 for p in PAULI]


def su2_element(theta, axis):
    """exp(i theta n.sigma) = cos(theta) I + i sin(theta) n.sigma (genuine SU(2))."""
    axis = np.asarray(axis, dtype=float)
    axis = axis / np.linalg.norm(axis)
    nsig = axis[0] * PAULI[0] + axis[1] * PAULI[1] + axis[2] * PAULI[2]
    return np.cos(theta) * np.eye(2, dtype=complex) + 1j * np.sin(theta) * nsig


def u1_element(phase):
    """Canonical TNFR (Abelian) gauge element: scalar phase exp(i phase) . I_2."""
    return np.exp(1j * phase) * np.eye(2, dtype=complex)


def color_scalar_part(X):
    """Projection of a colour matrix onto C.I_d -- the reachable gauge commutant."""
    d = X.shape[0]
    return (np.trace(X) / d) * np.eye(d, dtype=complex)


def lift(M, d):
    """Colour-blind lift M (x) I_d -- how the scalar catalog acts on the bundle."""
    return np.kron(M, np.eye(d, dtype=complex))


def gauge_transform(n_sites, U):
    """Gauge transformation I_V (x) U on the colour-lifted space V (x) C^d."""
    return np.kron(np.eye(n_sites), U)


def holonomy(edge_unitaries):
    """Ordered product of edge unitaries around a loop."""
    H = np.eye(edge_unitaries[0].shape[0], dtype=complex)
    for U in edge_unitaries:
        H = H @ U
    return H


# --------------------------------------------------------------------------- #
# TEST 1 -- Riemann: the catalog is trapped in the S_n commutant
# --------------------------------------------------------------------------- #
def test_rh_commutant_wall():
    print("=" * 78)
    print("TEST 1 -- RIEMANN: the catalog is trapped in the S_n COMMUTANT")
    print("=" * 78)
    G = nx.complete_graph(5)  # prime-relabelling symmetry S_5
    nodes = list(G.nodes())
    n = len(nodes)
    mats = automorphism_matrices(G, nodes)
    A, L = adjacency_laplacian(G, nodes)
    ops = catalog_operators(A, L)
    eye = np.eye(n)

    # (a) catalog subset of the commutant rho(S_n)'
    e_worst = max(commutator_norm(M, P) for M in ops.values() for P in mats)
    # (b) V = Fix(S_n) (+) Fix(S_n)^perp ; residue unreachable from symmetric seed
    Pi = symmetric_projector(mats)
    fix_dim = int(round(np.trace(Pi)))
    perp_dim = n - fix_dim
    v = Pi @ eye[:, 0]  # symmetric (colour-singlet analogue) seed
    leak = max(float(np.linalg.norm((eye - Pi) @ (M @ v))) for M in ops.values())
    w = (eye - Pi) @ eye[:, 0]  # residue target in Fix(S_n)^perp
    overlap = max(abs(float(w @ (M @ v))) for M in ops.values())

    ok = e_worst < TOL and leak < TOL and overlap < TOL and perp_dim >= 1
    print(f"  (a) catalog in commutant : max ||[f(A,L), P_s]|| = {e_worst:.2e}")
    print(
        f"  (b) V split              : dim Fix(S_n) = {fix_dim}, "
        f"dim Fix(S_n)^perp = {perp_dim}"
    )
    print(f"      symmetric seed leak  : max ||(I-Pi) M v|| = {leak:.2e}")
    print(f"      residue overlap      : max |<w, M v>| = {overlap:.2e}")
    print(
        f"  VERDICT: {'PASS' if ok else 'FAIL'} -- reachable = S_n commutant; "
        "S(T) in Fix(S_n)^perp unreachable"
    )
    print()
    return ok


# --------------------------------------------------------------------------- #
# TEST 2 -- Yang-Mills: the colour-lifted catalog is trapped in the gauge
#           commutant (colour-scalar); non-Abelian curvature is orthogonal
# --------------------------------------------------------------------------- #
def test_ym_commutant_wall():
    print("=" * 78)
    print("TEST 2 -- YANG-MILLS: the colour-lifted catalog is trapped in the GAUGE")
    print("           COMMUTANT (colour-scalar); non-Abelian curvature is orthogonal")
    print("=" * 78)
    d = 2  # SU(2) colour
    G = nx.cycle_graph(6)
    nodes = list(G.nodes())
    n = len(nodes)
    A, L = adjacency_laplacian(G, nodes)
    ops = catalog_operators(A, L)
    rng = np.random.default_rng(7)

    # (a) lifted catalog f(A,L) (x) I_d commutes with EVERY gauge transf I_V (x) U
    g_worst = 0.0
    for _ in range(8):
        U = su2_element(rng.uniform(0.3, 1.2), rng.normal(size=3))
        Ug = gauge_transform(n, U)
        g_worst = max(
            g_worst, max(commutator_norm(lift(M, d), Ug) for M in ops.values())
        )
    ab_ok = g_worst < TOL

    # (b) canonical U(1) gauge: scalar phases -> holonomies COMMUTE (Abelian)
    u1_P = holonomy([u1_element(rng.uniform(0, _TWO_PI)) for _ in range(4)])
    u1_Q = holonomy([u1_element(rng.uniform(0, _TWO_PI)) for _ in range(4)])
    u1_comm = commutator_norm(u1_P, u1_Q)
    u1_ok = u1_comm < TOL

    # (c) SU(2) gauge: non-Abelian -> holonomies DON'T commute, and the field-
    #     strength commutator [T_a, T_b] is TRACELESS -> zero colour-scalar part
    tx, ty, _tz = su2_generators()
    f_na = tx @ ty - ty @ tx  # [A_mu, A_nu] non-Abelian curvature term
    f_scalar = color_scalar_part(f_na)  # projection onto the reachable commutant
    f_norm = float(np.linalg.norm(f_na))
    f_reach = float(np.linalg.norm(f_scalar))
    su2_P = holonomy(
        [su2_element(rng.uniform(0.3, 1.2), rng.normal(size=3)) for _ in range(4)]
    )
    su2_Q = holonomy(
        [su2_element(rng.uniform(0.3, 1.2), rng.normal(size=3)) for _ in range(4)]
    )
    su2_comm = commutator_norm(su2_P, su2_Q)
    na_ok = su2_comm > 1e-3 and f_norm > 1e-3 and f_reach < TOL

    ok = ab_ok and u1_ok and na_ok
    print(
        f"  (a) lifted catalog in gauge commutant : "
        f"max ||[f(A,L)(x)I, I(x)U]|| = {g_worst:.2e}  (colour-blind, all U)"
    )
    print(
        f"  (b) canonical U(1) holonomies commute : "
        f"||[H_P, H_Q]|| = {u1_comm:.2e}  (Abelian -- the canonical gauge)"
    )
    print(
        f"  (c) SU(2) holonomies do NOT commute   : " f"||[H_P, H_Q]|| = {su2_comm:.3f}"
    )
    print(
        f"      non-Abelian curvature [T_a,T_b]   : ||F|| = {f_norm:.3f}, "
        f"colour-scalar part ||P(F)|| = {f_reach:.2e}  (traceless -> unreachable)"
    )
    print(
        f"  VERDICT: {'PASS' if ok else 'FAIL'} -- reachable = colour-scalar "
        "commutant; su(d) curvature orthogonal"
    )
    print()
    return ok


# --------------------------------------------------------------------------- #
# TEST 3 -- the bridge: one shape (trivial isotypic (+) rest), two groups
# --------------------------------------------------------------------------- #
def test_one_shape_two_groups():
    print("=" * 78)
    print("TEST 3 -- THE BRIDGE: one shape (trivial isotypic (+) rest), two groups")
    print("=" * 78)
    # Riemann: V = Fix(S_n) (+) Fix(S_n)^perp under the S_n permutation rep
    G = nx.complete_graph(5)
    nodes = list(G.nodes())
    n = len(nodes)
    mats = automorphism_matrices(G, nodes)
    Pi = symmetric_projector(mats)
    rh_fix = int(round(np.trace(Pi)))
    rh_rest = n - rh_fix
    rh_orth = float(np.linalg.norm(Pi @ (np.eye(n) - Pi)))  # blocks orthogonal

    # Yang-Mills: C^(dxd) = C.I_d (+) su(d) under U(d) conjugation
    d = 2
    tx, ty, tz = su2_generators()
    rest_basis = [tx, ty, tz]  # su(2): traceless, dim d^2 - 1 = 3
    i_d = np.eye(d, dtype=complex)
    ym_fix = 1  # dim C.I_d
    ym_rest = d * d - ym_fix  # dim of the traceless colour part
    ym_orth = max(abs(complex(np.trace(i_d.conj().T @ T))) for T in rest_basis)

    ok = (
        rh_rest >= 1
        and ym_rest >= 1
        and rh_orth < TOL
        and ym_orth < TOL
        and ym_rest == len(rest_basis)
    )
    print("  Riemann   (G = S_n)  : V        = Fix(S_n) (+) Fix(S_n)^perp")
    print(
        f"                         dims     = {rh_fix} (+) {rh_rest}   "
        f"block orthogonality ||Pi(I-Pi)|| = {rh_orth:.2e}"
    )
    print("                         residue  = S(T) in Fix(S_n)^perp   [G4 = RH OPEN]")
    print("  Yang-Mills (G = U(d)): C^(dxd)  = C.I_d (+) su(d)")
    print(
        f"                         dims     = {ym_fix} (+) {ym_rest}   "
        f"block orthogonality max|<I_d, T_a>| = {ym_orth:.2e}"
    )
    print(
        "                         curvature= [A_mu,A_nu] in su(d)     [mass gap OPEN]"
    )
    print(
        f"  VERDICT: {'PASS' if ok else 'FAIL'} -- same shape (trivial isotypic "
        "(+) rest), two groups (S_n / U(d))"
    )
    print()
    return ok


# --------------------------------------------------------------------------- #
# TEST 4 -- honest OPEN: the escape ingredient is non-derivable in BOTH
# --------------------------------------------------------------------------- #
def test_nonderivable_escape_contrast():
    print("=" * 78)
    print("TEST 4 -- HONEST OPEN: the escape ingredient is NON-DERIVABLE in BOTH")
    print("=" * 78)
    # RH escape: per-node diagonal P2 (NodeIndexedCouplingWeights) breaks S_n,
    # but is not nodal-equation-derivable (no per-node slot).
    G = nx.complete_graph(5)
    nodes = list(G.nodes())
    n = len(nodes)
    mats = automorphism_matrices(G, nodes)
    Pi = symmetric_projector(mats)
    eye = np.eye(n)
    # The canonical RH escape diagonal P2 is the adelic carrier's prime log-
    # frequencies nu_f = log p (distinct per node), read by the engine as IMPOSED
    # input -- not produced by dEPI/dt = nu_f . dNFR. Fallback: sieve / diag(1..n).
    p2, p2_label = canonical_per_node_diagonal(n)
    rh_break = max(commutator_norm(p2, P) for P in mats)
    rh_leak = float(np.linalg.norm((eye - Pi) @ (p2 @ (Pi @ eye[:, 0]))))
    rh_escapes = rh_break > 1e-3 and rh_leak > 1e-3

    # YM escape: non-commuting generators break the colour-scalar commutant, but
    # Y3 audits them as not derivable from nodal data.
    tx, ty, _tz = su2_generators()
    ym_break = commutator_norm(tx, ty)  # [T_x,T_y] != 0 -> leaves C.I_d
    ym_escapes = ym_break > 1e-3

    verdict_line = "OPEN_DERIVABILITY_GAP (canonical default; package not imported)"
    canon_ok = True
    if _HAVE_AUDIT:
        try:
            report = audit_nonabelian_derivability()
            any_noncomm = any(c.has_noncommuting_generators for c in report.candidates)
            verdict_line = (
                f"{report.verdict} ; gauge = "
                f"{report.canonical_gauge_group} ; "
                f"non-commuting generators on any route = {any_noncomm}"
            )
            canon_ok = report.verdict == "OPEN_DERIVABILITY_GAP" and not any_noncomm
        except Exception as exc:  # pragma: no cover
            verdict_line = f"(canonical audit unavailable: {exc})"

    ok = rh_escapes and ym_escapes and canon_ok
    print(f"  RH escape : P2 = diag({p2_label})")
    print(
        f"              breaks S_n (||[P2,P_s]|| = {rh_break:.2f}, leak = "
        f"{rh_leak:.2f}) -- but P2 is NOT nodal-derivable (B0*-beta, no per-node"
    )
    print("              slot in dEPI/dt; the adelic engine reads nu_f = log p as")
    print("              IMPOSED input -- the RH mirror of the YM audit below).")
    print(
        "  YM escape : non-commuting generators [T_x,T_y] != 0 "
        f"(||[T_x,T_y]|| = {ym_break:.3f}) leave the colour-scalar commutant"
    )
    print("              -- but their derivation from dEPI/dt = nu_f.dNFR is the")
    print(f"              open Y3 gap. Canonical audit: {verdict_line}")
    print(
        f"  VERDICT: {'PASS' if ok else 'FAIL'} -- both escapes exist but neither "
        "is nodal-equation-derivable"
    )
    print()
    return ok


def main():
    print(__doc__)
    t1 = test_rh_commutant_wall()
    t2 = test_ym_commutant_wall()
    t3 = test_one_shape_two_groups()
    t4 = test_nonderivable_escape_contrast()

    print("=" * 78)
    print("SUMMARY")
    print("=" * 78)
    print(f"  TEST 1 RH commutant wall (S_n)          : {'PASS' if t1 else 'FAIL'}")
    print(f"  TEST 2 YM commutant wall (U(d) colour)  : {'PASS' if t2 else 'FAIL'}")
    print(f"  TEST 3 one shape, two groups (bridge)   : {'PASS' if t3 else 'FAIL'}")
    print(f"  TEST 4 non-derivable escape (both)      : {'PASS' if t4 else 'FAIL'}")
    structural = t1 and t2 and t3 and t4
    print()
    print(f"  STRUCTURAL CHECKS: {'ALL PASS' if structural else 'SOME FAIL'}")
    print()
    print("  THESIS VERDICT: OPEN / PARTIAL (by design -- the deepest path).")
    print("  The two Millennium obstructions COINCIDE in shape: in both programmes")
    print("  the reachable set is the COMMUTANT of a group acting on the (colour-")
    print("  lifted) graph, and each open target lives in the orthogonal complement")
    print("  (Fix(S_n)^perp for Riemann ; su(d)-valued curvature for Yang-Mills).")
    print("  This UNIFIES the obstruction; it does NOT close it. The escape in each")
    print("  case -- the per-node diagonal P2 (RH) and non-commuting generators")
    print("  (YM) -- is exactly the ingredient that is NOT derivable from the nodal")
    print("  equation. HONEST SCOPE: finite toy-graph + su(2) algebra; nothing here")
    print("  proves RH, the Yang-Mills mass gap, or closes G4. R and pi")
    print("  remain assumed substrate.")
    return 0 if structural else 1


if __name__ == "__main__":
    raise SystemExit(main())