lemma

Proves, disproves, and verifies mathematical claims with step-by-step justified derivations.

1|Updated Jun 1, 2026
One-click install
npx skills add https://github.com/kridaydave/My_Skills --skill lemma-kridaydave
Or copy as Structured Prompt for Agent▼
Please help me install this Agent Skill.
Skill: lemma
Source: https://github.com/kridaydave/My_Skills/tree/main/lemma
Command: npx skills add https://github.com/kridaydave/My_Skills --skill lemma-kridaydave

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve? Mathematical arguments often contain hidden gaps — circular steps, one-directional inequalities, unjustified assumptions — that license false conclusions with the authority of math. This Skill rigorously proves or disproves claims, checks proofs for gaps, and pins down the exact conditions under which results hold. ## Core Features & Use Cases - Proof construction and verification: Works through derivations step by step, with every step justified by a named rule, definition, or cited theorem, and flags any step it cannot close. - Counterexample hunting: Attempts to falsify claims before asserting truth, producing concrete counterexamples when a claim is false along with the corrected statement. - Condition and tightness analysis: States the exact hypotheses a result needs and checks whether bounds are tight or loose, including equality conditions. - Use Case: A user claims their divide-and-conquer algorithm is O(n log n). The Skill walks the recurrence, catches that the merge step was miscounted as O(1) instead of O(n), applies the Master theorem, and confirms the bound with correct reasoning. ## Quick Start Ask the assistant to check whether your derivation or complexity bound is mathematically correct and to show each justified step.

Frequently Asked Questions about lemma

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I check if my mathematical proof is correct?▼

Present the claim and your proof, and each step will be verified against definitions, hypotheses, and cited theorems. Any unjustified step, circular reasoning, or hidden assumption is flagged, and gaps are reported honestly rather than papered over.

How to verify a Big-O complexity bound for an algorithm?▼

State the recurrence or step-counting argument, and it will be walked line by line — for example applying the Master theorem to T(n)=2T(n/2)+O(n). Tightness is checked by looking for a matching lower bound or worst-case input.

What happens when a mathematical claim is false?▼

A concrete counterexample is produced showing exactly where the claim fails and why. The corrected statement is then given, including the additional assumption under which the original claim does hold.

Can informal or imprecise mathematical arguments be formalized?▼

Yes, but the claim is pinned down first — quantifiers, domain, and assumptions are made precise before any proof begins. If the truth of the claim flips on an unstated condition, one clarifying question is asked before proceeding.

When does Var(X+Y) equal Var(X) plus Var(Y)?▼

The identity holds only when X and Y are uncorrelated; otherwise the cross term 2·Cov(X,Y) must be included. Assuming independence when variables share a data source understates variance, which is a common error in estimator analysis.