AgentSkillsCN

math-tutor

具备数学学科专长,擅长撰写学习笔记、解答疑难问题并进行深入讲解。涵盖代数、微积分、统计学、线性代数与离散数学等内容。提供公式、证明策略以及分步求解方法。当您学习数学相关主题、整理数学笔记、解决数学问题,或需要阐释数学概念时,可灵活运用此技能。触发条件包括:数学答疑、代数、微积分、导数、积分、统计学、线性代数、证明、方程等。

SKILL.md
--- frontmatter
name: math-tutor
description: Mathematics subject expertise for study notes, problem-solving, and explanations. Covers algebra, calculus, statistics, linear algebra, and discrete math. Provides formulas, proof strategies, and step-by-step solutions. Use when studying math topics, creating math notes, solving math problems, or explaining mathematical concepts. Triggers - math help, algebra, calculus, derivatives, integrals, statistics, linear algebra, proofs, equations.

Mathematics Subject Expert

Specialized knowledge for mathematics studying, problem-solving, and note creation.

Topic Coverage

mermaid
mindmap
  root((Mathematics))
    Algebra
      Equations
      Polynomials
      Functions
      Inequalities
    Calculus
      Limits
      Derivatives
      Integrals
      Series
    Statistics
      Descriptive
      Probability
      Inference
      Distributions
    Linear Algebra
      Matrices
      Vectors
      Eigenvalues
      Transformations
    Discrete Math
      Logic
      Sets
      Combinatorics
      Graph Theory

Quick Reference Links


Problem-Solving Framework

General Steps

  1. Read carefully - Identify what's given and what's asked
  2. Draw/visualize - Sketch graphs, diagrams
  3. Choose strategy - Direct, substitution, contradiction, etc.
  4. Execute - Show all steps clearly
  5. Verify - Check answer makes sense

Common Proof Strategies

StrategyWhen to UseExample
Direct ProofShow P → Q directly"If n is even, n² is even"
ContradictionAssume ¬Q, derive contradictionProving √2 is irrational
ContrapositiveProve ¬Q → ¬P insteadLogical equivalence
InductionStatements about all n ∈ ℕSum formulas
CasesDifferent scenariosPiecewise functions

Mathematical Induction Template

code
Claim: P(n) is true for all n ≥ 1

Base Case: Show P(1) is true.
[Verify for n = 1]

Inductive Step:
Assume P(k) is true for some k ≥ 1. (Inductive Hypothesis)
Show P(k+1) is true.
[Derive P(k+1) using P(k)]

Therefore, by induction, P(n) is true for all n ≥ 1. ∎

Notation Reference

SymbolMeaning
For all
There exists
Element of
Proper subset
Subset or equal
Union
Intersection
Natural numbers {1,2,3,...}
Integers {...,-1,0,1,...}
Rational numbers
Real numbers
Complex numbers
Infinity
Therefore
Because
QED (proof complete)

Function Analysis Checklist

  1. Domain - What x values work?
  2. Range - What y values result?
  3. Intercepts - Where x=0, y=0?
  4. Symmetry - Even f(-x)=f(x)? Odd f(-x)=-f(x)?
  5. Asymptotes - Vertical, horizontal, oblique?
  6. Critical points - Where f'(x)=0 or undefined?
  7. Intervals - Increasing/decreasing?
  8. Concavity - Where f''(x) > 0 or < 0?
  9. Inflection points - Where concavity changes?

Common Mistakes to Avoid

  1. Dividing by zero - Check denominator ≠ 0
  2. Square root of negative - Consider domain
  3. Forgetting ± when taking square roots
  4. Chain rule errors in derivatives
  5. Forgetting +C in indefinite integrals
  6. Incorrect limit laws for 0/0, ∞/∞ forms