ies/music-topos/.codex/skills/bidirectional-navigator/SKILL.md
# Bidirectional Navigator **Category**: Proof Navigation + Caching **Type**: Graph Index Structure **Language**: Julia **Status**: Production Ready **Version**: 1.0.0 **Date**: December 22, 2025 ## Overview Safe proof ↔ theorem navigation with non-backtracking constraint. Implements Friedman's B operator to enable linear homotopy type theory (LHoTT) resource-aware evaluation where proofs are consumed exactly once. ## Key Data Structures ```julia struct Theorem id::Int name::String e
npx skillsauth add plurigrid/asi ies/music-topos/.codex/skills/bidirectional-navigatorInstall this skill globally with one command. Works with Claude Code, Cursor, and Windsurf.
3 of 9 scanners reported clean
Some scanners were skipped, did not run, or reported a non-clean status. Review each row below.
Category: Proof Navigation + Caching Type: Graph Index Structure Language: Julia Status: Production Ready Version: 1.0.0 Date: December 22, 2025
Safe proof ↔ theorem navigation with non-backtracking constraint. Implements Friedman's B operator to enable linear homotopy type theory (LHoTT) resource-aware evaluation where proofs are consumed exactly once.
struct Theorem
id::Int
name::String
end
struct Proof
id::Int
theorem_id::Int
name::String
end
struct BidirectionalMap
forward::Dict{Int, Int} # Proof ID → Theorem ID
backward::Dict{Int, Vector{Int}} # Theorem ID → [Proof IDs]
non_backtracking_ok::Bool
end
create_index(theorems, proofs): Build bidirectional mappingevaluate_forward(index, proof_id): O(1) proof → theorem lookupevaluate_backward(index, theorem_id): Cached theorem → proofs lookupcheck_non_backtracking(): Verify B operator constraint (no u→v→u)linear_evaluation_possible(): Check LHoTT compatibilityFriedman's Non-Backtracking Operator (B)
No u→v→u cycles ⟺ Linear resource-aware evaluation possible
Enables:
using BidirectionalIndex
# Create index
index = create_index(theorems, proofs)
# Forward navigation (Proof → Theorem)
theorem_id = evaluate_forward(index, proof_42)
# Backward navigation (Theorem → Proofs)
related_proofs = evaluate_backward(index, theorem_5)
# Verify constraints
if check_non_backtracking(index)
println("✓ B operator satisfied, linear evaluation ok")
end
development
BDD-Driven Mathematical Content Verification Skill Combines Behavior-Driven Development with mathematical formula extraction, verification, and transformation using: - Cucumber/Gherkin for specification - RSpec for implementation verification - mathpix-gem for LaTeX/mathematical content extraction - Pattern matching on syntax trees for formula validation Enables iterative discovery and verification of mathematical properties through executable specifications.
tools
Meta-skill that generates domain-specific AI skills from tool documentation
development
Code Query with AI-enhanced deterministic analysis via SplitMix ternary classification
development
Directed Yoneda lemma as directed path induction. Riehl-Shulman's key insight for synthetic ∞-categories.