A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Flatness

Research Depth 91 in the knowledge graph I know this Set as goal
1topic build on this
454prerequisites beneath it
See this on the map →
Exact Sequences of ModulesTensor Products of Modules+1 moreHomological Dimension
flat-module faithful-flatness flatness-criterion tor base-change going-down

Core Idea

An R-module M is flat if tensoring with M preserves exact sequences -- that is, M ⊗_R - is an exact functor. Flatness is weaker than freeness or projectivity but is the "right" condition for many purposes: flat base change preserves kernels, localizations are always flat, and flat morphisms in algebraic geometry correspond to families with continuously varying fibers. Faithful flatness (flat plus tensoring detects zero) is even more powerful, enabling descent arguments and guaranteeing the going down property for the associated ring map.

Explainer

Flatness is one of the most important and subtle concepts in commutative algebra. An R-module M is flat if for every injective homomorphism of R-modules A → B, the induced map A ⊗_R M → B ⊗_R M is also injective. Equivalently, the functor M ⊗_R - is exact (it automatically preserves surjections and cokernels; flatness adds preservation of injectivity and kernels). Free modules are flat, projective modules are flat, and localizations S-1R are flat over R. In general, flatness is strictly weaker than projectivity.

Over specific classes of rings, flatness has elegant characterizations. Over a PID, flat is equivalent to torsion-free. Over a local ring (R, m), the local criterion for flatness says M is flat if and only if Tor_1^R(R/m, M) = 0. Over a Noetherian local ring, a finitely generated module is flat if and only if it is free -- this dramatic simplification means flatness is most interesting for infinitely generated modules or for module-like objects (ring extensions). Lazard's theorem provides a general characterization: an R-module is flat if and only if it is a directed colimit of free modules.

The algebraic geometry of flat morphisms is central to modern scheme theory. A morphism of schemes f: X → Y is flat if O_{X,x} is flat over O_{Y,f(x)} for every point x. Flat morphisms are the algebraic analogue of "fiber bundles" or "smooth families" -- the fibers vary continuously (in an algebraic sense). Specifically, flat morphisms satisfy the going down property, preserve dimension of fibers, and interact well with base change. Localization, completion, and extension of scalars are all flat operations, which is why they preserve so many algebraic properties.

Faithful flatness adds a conservativity condition: M is faithfully flat if M is flat and M ⊗_R N = 0 implies N = 0. Equivalently, a sequence of R-modules is exact if and only if it becomes exact after tensoring with M. Faithful flatness enables descent: properties of modules (or algebras) over S can be descended to properties over R when R → S is faithfully flat. The completion of a Noetherian local ring is faithfully flat over the original ring, which is why the Cohen structure theorem for complete local rings has consequences for non-complete rings. Faithfully flat descent is one of the key technical tools in Grothendieck's approach to algebraic geometry.

Practice Questions 5 questions

Prerequisite Chain

Understanding ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesSet Operations: Union, Intersection, and ComplementProof by CasesProving by Cases and ExhaustionVacuous Truth and Trivial CasesProof by Cases (Proof by Exhaustion)Mathematical InductionBinary Operations and Algebraic StructuresGroup Definition and ExamplesBasic Properties of GroupsGroup HomomorphismsGroup IsomorphismsCayley's TheoremCosets and Lagrange's TheoremNormal SubgroupsQuotient GroupsFirst Isomorphism Theorem for GroupsFirst Isomorphism Theorem for RingsFirst Isomorphism Theorem for GroupsThird Isomorphism Theorem for GroupsFirst Isomorphism Theorem for RingsIntegral DomainsPrime and Maximal IdealsLocalizationFlatness

Longest path: 92 steps · 454 total prerequisite topics

Prerequisites (3)

Leads To (1)