Agent Skills by bneb
Showing 30 vetted skills indexed across 1 GitHub repositories.
maximality_zorns_lemma
Apply Zorn's Lemma to deduce maximal elements in Lean 4 proofs.
double_counting
Prove combinatorial identities by counting incidences in finite bipartite relations.
spectral_graph_bounds
Bound Ramsey-type graph parameters using spectral eigenvalue bounds.
git-commit
Write git commit messages to a file and commit with git -F.
schur-partition-search
Run simulated-annealing searches for Schur partition problems from algebraic seeds.
bijections_and_isomorphisms
Construct bijections or isomorphisms between algebraic and combinatorial structures in Lean 4.
algebraic_graph_construction
Construct Cayley and Paley graphs from finite group generators and quadratic residues.
duality_arguments
NLP-based grammar and style correction for your writing, available as a VS Code extension and/or standalone Python library.
polynomial_time_reductions
Formulate polynomial-time reductions with Lean 4 correctness proof templates.
epsilon_delta_bounding
Construct explicit δ(ε) or N witnesses for Lean 4 / mathlib4 limit proofs.
pigeonhole_principle
Prove guaranteed collisions when distributing more items than containers.
proof_by_contraposition
Convert implications to their contrapositive in Lean 4 proofs.
forcing_set_theory_independence
...
direct_proof
Construct direct proofs in Lean 4 by applying definitions and inference rules.
explicit_construction
Prove existence statements with concrete witnesses in Lean 4.
razborov_flag_algebras
Compute lower bounds on subgraph densities using Razborov's flag algebra method.
proof_by_contradiction
Derive proofs by contradiction in Lean 4 using by_contra and absurd.
fixed_point_arguments
Determine fixed-point existence using Banach, Brouwer, or Tarski theorems.
cantors_diagonalization
Construct diagonal elements to prove non-enumerability in Lean 4.
probabilistic_method
Prove combinatorial object existence via probability spaces and the Lovász Local Lemma.
geometric_flow_homotopy
Generate structural V3 and/or V4 of a document from plain text input.
invariants_and_monovariants
Identify invariant and monovariant properties for reachability and termination proofs.
proof_by_exhaustion
Partition finite domains into cases and verify each with Lean 4 tactics.
homological_cohomological_arguments
Compute homology and cohomology invariants using Lean 4 templates and mathlib4.