跳到正文
cccskills
免费在 GitHub 公开

mfe-structure

Linear algebra and higher-dimensional thinking. Vectors, matrices, transformations — the architecture of mathematical space.

中文简介正在准备中。当前显示原文说明。

查看安装方法

包含的文件(1)

  • SKILL.md7.0 KB

SKILL.md(原文)

安装前可以查看交给 AI 代理的指令内容。

Structure

Summary

Structure (Part IV: Expanding) Chapters: 11, 12, 13, 14 Plane Position: (-0.3, 0.5) radius 0.4 Primitives: 51

Linear algebra and higher-dimensional thinking. Vectors, matrices, transformations — the architecture of mathematical space.

Key Concepts: Vector Definition, Vector Space Axioms, Dot Product (Inner Product), Matrix Definition and Operations, Linear Transformation

Key Primitives

Vector Definition (definition): A vector v in R^n is an ordered n-tuple v = (v_1, v_2, ..., v_n) where each v_i is a real number. Vectors represent both magnitude and direction in n-dimensional space.

  • I need to represent a quantity with both magnitude and direction
  • How do I work with points or directions in multiple dimensions
  • Describe a displacement or velocity in n-dimensional space

Vector Space Axioms (axiom): A vector space V over a field F is a set with two operations (addition, scalar multiplication) satisfying 8 axioms: closure under addition and scalar multiplication, commutativity and associativity of addition, existence of zero vector and additive inverses, and distributive laws connecting addition with scalar multiplication.

  • Is this set a vector space
  • Verify the axioms for a proposed vector space structure
  • What properties must a space have to support linear algebra

Dot Product (Inner Product) (definition): The dot product of u, v in R^n is u . v = sum_{i=1}^{n} u_i * v_i. Geometrically, u . v = ||u|| ||v|| cos(theta) where theta is the angle between u and v.

  • Find the angle between two vectors
  • Compute the projection of one vector onto another
  • Check if two vectors are perpendicular

Matrix Definition and Operations (definition): An m x n matrix A is a rectangular array of scalars with m rows and n columns: A = [a_{ij}] where 1 <= i <= m, 1 <= j <= n. Matrix addition is componentwise; scalar multiplication scales all entries.

  • Represent a linear system of equations in compact form
  • Store and manipulate tabular numerical data
  • Encode a linear transformation as a matrix

Linear Transformation (definition): A function T: V -> W between vector spaces is a linear transformation if T(u+v) = T(u)+T(v) and T(cv) = cT(v) for all u,v in V and scalars c. Equivalently, T(c_1v_1 + c_2v_2) = c_1T(v_1) + c_2T(v_2).

  • Define a function that preserves vector space structure
  • Represent a geometric transformation as a matrix
  • Map between different vector spaces while preserving linearity

Eigenvalue and Eigenvector (definition): A scalar lambda is an eigenvalue of a square matrix A if there exists a nonzero vector v such that Av = lambdav. The vector v is the corresponding eigenvector. The set of all eigenvectors for lambda (plus 0) is the eigenspace E_lambda = ker(A - lambdaI).

  • Find the directions that a transformation merely scales
  • Analyze the long-term behavior of a dynamical system
  • Diagonalize a matrix for easier computation

Gradient (definition): The gradient of a scalar field f: R^n -> R is the vector of partial derivatives: grad(f) = nabla f = (df/dx_1, df/dx_2, ..., df/dx_n). It points in the direction of steepest ascent and its magnitude is the rate of maximum increase.

  • Find the direction of steepest increase of a function
  • Compute the rate of change in an arbitrary direction via directional derivative
  • Set up optimization conditions: critical points where nabla f = 0

Analyticity (Holomorphic Function) (definition): A complex function f is analytic (holomorphic) at z_0 if f'(z_0) = lim_{h->0} (f(z_0+h)-f(z_0))/h exists, where h approaches 0 through complex values. f is entire if analytic on all of C. Analytic implies infinitely differentiable and equals its Taylor series.

  • Determine if a complex function is differentiable in the complex sense
  • Identify functions that have power series representations
  • Apply the powerful theorems of complex analysis to a function

Vector Addition and Scalar Multiplication (definition): For vectors u, v in R^n and scalar c in R: (u+v)_i = u_i + v_i (componentwise addition) and (cv)_i = c * v_i (scalar multiplication). These operations satisfy closure, commutativity, associativity, and distributivity.

  • How do I add or scale vectors
  • Combine forces or velocities acting on an object
  • Compute a linear combination of vectors

Vector Norm (Magnitude) (definition): The Euclidean norm of v in R^n is ||v|| = sqrt(v . v) = sqrt(sum_{i=1}^{n} v_i^2). It measures the length (magnitude) of the vector. A unit vector has ||v|| = 1.

  • Find the length or magnitude of a vector
  • Normalize a vector to unit length
  • Compute distance between two points in R^n

Composition Patterns

  • Vector Definition + structure-vector-addition -> Vector arithmetic in R^n (sequential)
  • Vector Addition and Scalar Multiplication + structure-vector-definition -> Complete vector arithmetic system (parallel)
  • Vector Space Axioms + structure-linear-transformation -> Theory of linear maps between vector spaces (sequential)
  • Dot Product (Inner Product) + structure-vector-norm -> Angle measurement between vectors: cos(theta) = (u.v)/(||u|| ||v||) (sequential)
  • Cross Product + structure-dot-product -> Scalar triple product: u . (v x w) = volume of parallelepiped (sequential)
  • Vector Norm (Magnitude) + structure-vector-definition -> Distance metric in R^n: d(u,v) = ||u-v|| (sequential)
  • Orthogonality and Projection + structure-span-basis -> Gram-Schmidt orthogonalization: convert any basis to orthogonal basis (sequential)
  • Linear Independence + structure-span-basis -> Dimension of a vector space: size of any basis (sequential)
  • Span and Basis + structure-linear-transformation -> Matrix representation of a linear map with respect to chosen bases (sequential)
  • Triangle Inequality for Vectors + structure-vector-norm -> Metric space structure on R^n with triangle inequality as key axiom (parallel)

Cross-Domain Links

  • perception: Compatible domain for composition and cross-referencing
  • change: Compatible domain for composition and cross-referencing
  • reality: Compatible domain for composition and cross-referencing
  • foundations: Compatible domain for composition and cross-referencing
  • mapping: Compatible domain for composition and cross-referencing
  • synthesis: Compatible domain for composition and cross-referencing

Activation Patterns

  • vector
  • matrix
  • linear
  • space
  • dimension
  • basis
  • eigenvalue
  • transformation
  • determinant

评价

还没有评价。欢迎分享你的使用感受。

评论

无需登录即可发表。欢迎分享使用感受、提问,或说明在哪些环境下无法运行。

还没有评论。来写第一条吧。

提交后会立即公开。请勿填写邮箱、电话等个人信息。URL 最多 2 个。

0 / 1000 字

此表单受 reCAPTCHA 保护,适用 Google 的隐私权政策和服务条款。

同一仓库的技能

Provides web accessibility best practices for semantic HTML, ARIA, keyboard navigation, color contrast, and screen reader patterns. Use when building UI components, reviewing accessibility, or when user mentions 'a11y', 'accessibility', 'ARIA', 'screen reader', 'keyboard navigation', 'WCAG'.

中文简介正在准备中。当前显示原文说明。

Tibsfox/gsd-skill-creator712026年7月20日 更新

Active listening techniques for effective communication. Covers attending behaviors, paraphrasing, reflective listening, clarifying questions, empathic response, barriers to listening, listening in conflict, and cross-cultural listening. Use when building listening skills, improving understanding in conversation, mediating disputes, or analyzing communication breakdowns.

中文简介正在准备中。当前显示原文说明。

Tibsfox/gsd-skill-creator712026年7月20日 更新

Adversarial spec-compliance PR review — cross-references diffs against approved specs, verifies runtime claims against source, detects competing PRs, audits scope/convention compliance. Use before merging.

中文简介正在准备中。当前显示原文说明。

Tibsfox/gsd-skill-creator712026年7月20日 更新

Provides best practices for AI agent orchestration including MCP servers, A2A protocol, multi-agent coordination, and swarm architectures. Use when designing agent systems, configuring MCP servers, setting up agent teams, or when user mentions 'MCP', 'A2A', 'agent orchestration', 'multi-agent', 'swarm', 'agent team', 'LangGraph', 'CrewAI', 'AutoGen'.

中文简介正在准备中。当前显示原文说明。

Tibsfox/gsd-skill-creator712026年7月20日 更新

Symbolic manipulation, equation solving, and algebraic structures for mathematical reasoning. Covers distributive law, factoring, completing the square, linear through polynomial equation solving, systems of equations (substitution, elimination, Gaussian elimination, matrix methods), algebraic structures (groups, rings, fields), modular arithmetic, polynomial theory, and inequalities. Use when solving equations, simplifying expressions, working with algebraic structures, or performing symbolic manipulation.

中文简介正在准备中。当前显示原文说明。

Tibsfox/gsd-skill-creator712026年7月20日 更新

Understanding how algorithmic systems shape what users see, know, and do -- from recommendation feeds to search ranking to credit scoring to hiring software. Covers the mechanics of recommendation systems, algorithmic bias and its sources, personalization's effects on information diets, opacity and accountability, AI limitations (hallucination, confident wrongness), and the human-in-the-loop question. Use when a learner needs to think critically about why particular content reached them.

中文简介正在准备中。当前显示原文说明。

Tibsfox/gsd-skill-creator712026年7月20日 更新

查看 Tibsfox 的全部技能

报告此技能的问题