mobius-path-filter

Möbius path filtering identifies tangled geodesics in proof graphs via Möbius inversion, classifying paths by prime factorization to isolate cycles and redundant dependencies for theorem verification.

Möbius inversion computes weights across paths in dependency graphs, distinguishing linear chains from tangled paths to reveal structural problems in theorem proofs and their prerequisites.

Use enumerate_paths to extract all routes through an adjacency matrix, then apply mobius_weight and filter_tangled_paths to compute Möbius weights and isolate problematic versus optimal dependency chains.

Yes. Generate a human-readable analysis report via generate_filter_report to identify cycles, classify paths by prime factorization, and produce actionable rewrites for dependency auditing and theorem verification.

Provide an adjacency matrix representing your proof dependency graph. The Skill enumerates paths, applies Möbius weights, and outputs classification results and integration-compatible reports.