Composition Study Guide

📖 Core Concepts Composition (general) – arranging parts to create a unified whole, whether in art, language, music, or technical fields. Function composition – combining two functions so the output of one becomes the input of the other, producing a single new function. Binary function / law of composition – a rule that takes two elements and returns a third element. Composition in combinatorics – expressing a positive integer as an ordered sum of positive integers (e.g., 4 = 1 + 3 = 3 + 1). Composition of relations – linking two relations to form a new relation (if a is related to b and b to c, then a is related to c). Digital compositing – stitching together still images or video frames digitally to form a seamless picture. Chemical composition – the relative amounts of each element that make up a substance. Fallacy of composition – assuming that what is true of the parts must be true of the whole. --- 📌 Must Remember Function composition notation: \( (f \circ g)(x) = f(g(x)) \). Binary function: takes two inputs → one output; central to algebraic structures. Combinatorial composition: order matters (1 + 3 ≠ 3 + 1). Relation composition: \(R \circ S = \{(a,c) \mid \exists b\,(aRb \land bSc)\}\). Digital compositing: used in film/animation to blend layers, masks, and effects. Fallacy of composition: whole‑property ≠ sum of part‑properties (e.g., “every brick is light, therefore the wall is light”). --- 🔄 Key Processes Building a function composition: Identify inner function \(g\). Identify outer function \(f\). Substitute \(g(x)\) into \(f\). Result is a new function \(h = f \circ g\). Creating a combinatorial composition of \(n\): Choose a first summand \(k\) (where \(1 \le k \le n\)). Write \(n = k + (n-k)\). Recursively compose the remainder \(n-k\) until only 1’s remain. Digital compositing workflow: Import source layers (images/video). Align/scale layers as needed. Apply masks and blending modes. Render final composite. --- 🔍 Key Comparisons Function composition vs. Object composition Function: combines outputs/inputs of functions → new function. Object: combines simpler data types or function calls into a more complex type. Binary function vs. General composition Binary: strictly two inputs → one output (law of composition). General: may involve multiple steps or structures (e.g., relation composition). Digital compositing vs. Traditional collage Digital: performed with software, allows precise masking & blending. Traditional: physical cut‑and‑paste; limited editing flexibility. --- ⚠️ Common Misunderstandings “Composition = addition” – In combinatorics, composition is ordered addition, not simple summation. “If parts are light, the whole is light” – This is the fallacy of composition; properties don’t always transfer. “Function composition is the same as multiplication” – They are distinct operations; composition nests functions, multiplication scales values. --- 🧠 Mental Models / Intuition “Pipeline” model for function composition – Imagine water flowing through a series of pipes; each function is a pipe that reshapes the flow before it reaches the next. “Lego blocks” for object composition – Smaller, reusable pieces snap together to build a larger structure. “Recipe steps” for combinatorial composition – Each summand is an ingredient added in a specific order to reach the final dish (the integer). --- 🚩 Exceptions & Edge Cases Non‑associative binary functions – Some laws of composition (e.g., subtraction) are not associative; order of grouping matters. Empty composition in combinatorics – Not allowed; a composition requires at least one positive integer. Digital compositing with mismatched color spaces – Leads to color shift; must convert to a common space first. --- 📍 When to Use Which Use function composition when you need to apply transformations sequentially (e.g., data preprocessing → model prediction). Use object composition to build complex data structures without inheritance (favoring “has‑a” over “is‑a”). Use combinatorial composition to count ordered partitions of a number (useful in probability and counting problems). Use digital compositing for visual effects, background replacement, or merging multiple video layers. --- 👀 Patterns to Recognize Repeated “output‑to‑input” arrows in problem statements → indicates function composition. Ordered sums of the same total → look for combinatorial composition counting. Layered visual description (foreground, middle ground, background) → signals a digital compositing scenario. Statements about whole vs. parts → potential fallacy of composition trap. --- 🗂️ Exam Traps Distractor: “All bricks are heavy, therefore the wall is heavy.” – This is the fallacy of composition; the wall may be heavy for other reasons. Distractor: Treating binary function as associative without checking; e.g., assuming \((a - b) - c = a - (b - c)\). Distractor: Confusing composition of relations with simple set intersection; the former chains connections, the latter just overlaps them. Distractor: Assuming order doesn’t matter in integer compositions; remember that 1 + 3 ≠ 3 + 1. ---