Right, let's get this over with. You want me to… rewrite… Wikipedia? As if it were some kind of dusty tome begging for a facelift. Fine. But don't expect sunshine and rainbows. This is about structure, about the bones of things, not some saccharine decoration.
Additional mathematical object
You know, there are those who think "structure" is just some fancy word for "making things complicated." And maybe they're not entirely wrong. But in mathematics, it’s more about adding layers, giving a bare set some… substance. It's like taking a blank canvas and deciding it needs more than just paint; maybe it needs texture, a frame, a hidden meaning. We’re talking about endowing these sets with features – an operation, a relation, a metric, a topology. Something to anchor them, to give them a reason to exist beyond their mere existence. These aren't just random additions; they’re attached, woven into the very fabric of the set, giving it purpose, significance.
The list of these structural embellishments is… extensive. You've got your measures, those tell you "how much" of something there is. Then there are the algebraic structures – the groups, the fields, where things interact in predictable, albeit sometimes infuriating, ways. Topologies dictate proximity, how things are "near" each other. Metric structures, the bedrock of geometries, define distance. Orders impose a hierarchy, a sequence. Graphs map connections. And then there are more esoteric things like event structures, differential structures, categories, setoids, and the ever-present equivalence relations. Each one, a lens through which to view the same underlying set, but revealing entirely different facets.
Sometimes, mathematicians get ambitious. They don't just add one structure; they pile them on. Like an architect who decides a building needs both a foundation and a roof, and then wonders how they’ll connect. When a set is blessed – or cursed – with multiple features, it allows for a richer, more complex study. Take a set with both a topology and a group structure, where these two are somehow compatible, they don't clash violently. That’s how you get a topological group. [1] It’s a delicate dance, a precarious balance.
And when you have two sets, each similarly burdened with structures, a map that respects those structures? That’s a morphism. They're the messengers, the translators between these structured worlds. Homomorphisms for algebraic structures, continuous functions for topologies, differentiable functions for differential structures. They’re the threads that bind these disparate mathematical universes together. Without them, it’s just a collection of isolated, albeit structured, entities.
History
The notion of "structure" didn't just materialize out of thin air. It has a history, a lineage, if you will. Back in 1939, a shadowy collective operating under the pseudonym "Nicolas Bourbaki" decided that structures were, in fact, the foundation of all mathematics. They first laid this out in a "Fascicule" on the Theory of Sets, then expanded on it in the 1957 edition of their work. [2] They identified three "mother structures" – the algebraic, the topological, and the order. [2][3] It was a bold claim, an attempt to unify the sprawling landscape of mathematics under a single, elegant concept. Whether they succeeded entirely is debatable, but their influence is undeniable. They carved out a new way of thinking, a new language for describing mathematical reality.
Example: the real numbers
Consider the humble real numbers. They’re not just a line of numbers; they’re a veritable buffet of structures.
- An order: Each number has a definite place. It’s either less than, greater than, or equal to any other number. A rigid, undeniable hierarchy.
- Algebraic structure: Addition and multiplication. These aren't just arbitrary operations; they imbue the real numbers with a profound sense of order. Addition alone makes it a group, a fundamental building block. Together with multiplication, they form a field, a structure with predictable rules for interaction.
- A measure: Intervals have length. This concept, seemingly simple, can be extended, becoming the Lebesgue measure on many of its subsets. It tells us "how much" space these sets occupy.
- A metric: The concept of distance between any two points. It quantifies separation, a fundamental aspect of spatial understanding.
- A geometry: Equipped with its metric, it’s inherently flat. It’s the simplest of geometric landscapes.
- A topology: The notion of open sets. This defines neighborhoods, a sense of local proximity and continuity.
And the beauty, or perhaps the complexity, lies in the interfaces between these structures. They don't exist in isolation.
- The order, and independently, the metric structure, both induce the topology. They shape how we perceive closeness and openness.
- When you combine the order and the algebraic structure, you get an ordered field.
- And when the algebraic structure and the topology coalesce, you get a Lie group, a particularly elegant type of topological group. [1]
It’s a testament to the interconnectedness of mathematical ideas. Each structure informs the others, creating a rich, intricate tapestry from what might otherwise be a simple thread.
See also
- Abstract structure
- Algebraic structure
- Category (mathematics)
- Equivalent definitions of mathematical structures
- Forgetful functor
- Intuitionistic type theory
- Isomorphism
- Mathematical object
- Space (mathematics)
References
- ^ Mac Lane, Saunders (May 1996). "Structure in Mathematics" (PDF). Philosophia Mathematica. 4 (2): 176. doi:10.1093/PHILMAT/4.2.174. {{cite journal}} : CS1 maint: url-status (link)
- ^ a b Corry, Leo (September 1992). "Nicolas Bourbaki and the concept of mathematical structure". Synthese. 92 (3): 315–348. doi:10.1007/bf00414286. JSTOR 20117057. S2CID 16981077.
- ^ Wells, Richard B. (2010). Biological signal processing and computational neuroscience (PDF). pp. 296–335. Retrieved 7 April 2016. {{cite book}} : CS1 maint: url-status (link)
Further reading
- Bourbaki, Nikolas (1968). "Elements of Mathematics: Theory of Sets". Hermann, Addison-Wesley. pp. 259–346, 383–385.
- Foldes, Stephan (1994). Fundamental Structures of Algebra and Discrete Mathematics. Hoboken: John Wiley & Sons. ISBN 9781118031438.
- Hegedus, Stephen John; Moreno-Armella, Luis (2011). "The emergence of mathematical structures". Educational Studies in Mathematics. 77 (2): 369–388. doi:10.1007/s10649-010-9297-7. S2CID�.
- Kolman, Bernard; Busby, Robert C.; Ross, Sharon Cutler (2000). Discrete mathematical structures (4th ed.). Upper Saddle River, NJ: Prentice Hall. ISBN 978-0-13-083143-9.
- Malik, D.S.; Sen, M.K. (2004). Discrete mathematical structures : theory and applications. Australia: Thomson/Course Technology. ISBN 978-0-619-21558-3.
- Pudlák, Pavel (2013). "Mathematical structures". Logical foundations of mathematics and computational complexity a gentle introduction. Cham: Springer. pp. 2–24. ISBN 9783319001197.
- Senechal, M. (21 May 1993). "Mathematical Structures". Science. 260 (5111): 1170–1173. doi:10.1126/science.260.5111.1170. PMID 17806355.
External links
- "Structure". PlanetMath. (provides a model theoretic definition.)
- Mathematical structures in computer science (journal)
v t e
General
- Axiom
- list
- Cardinality
- First-order logic
- Formal proof
- Formal semantics
- Foundations of mathematics
- Information theory
- Lemma
- Logical consequence
- Model
- Theorem
- Theory
- Type theory
- Gödel's completeness and incompleteness theorems
- Tarski's undefinability
- Banach–Tarski paradox
- Cantor's theorem, paradox and diagonal argument
- Compactness
- Halting problem
- Lindström's
- Löwenheim–Skolem
- Russell's paradox
Traditional
- Classical logic
- Logical truth
- Tautology
- Proposition
- Inference
- Logical equivalence
- Consistency
- Equiconsistency
- Argument
- Soundness
- Validity
- Syllogism
- Square of opposition
- Venn diagram
- Boolean algebra
- Boolean functions
- Logical connectives
- Propositional calculus
- Propositional formula
- Truth tables
- Many-valued logic
- 3
- finite
- ∞
- First-order
- list
- Second-order
- Monadic
- Higher-order
- Fixed-point
- Free
- Quantifiers
- Predicate
- Monadic predicate calculus
- Set
- hereditary
- Class
- (Ur-)Element
- Ordinal number
- Extensionality
- Forcing
- Relation
- equivalence
- partition
- Set operations:
- Types of sets
- Maps and cardinality
- Set theories
Formal systems (list), language and syntax
- Alphabet
- Arity
- Automata
- Axiom schema
- Expression
- ground
- Extension
- by definition
- conservative
- Relation
- Formation rule
- Grammar
- Formula
- Free/bound variable
- Language
- Metalanguage
- Logical connective
- Predicate
- Proof
- Quantifier
- Sentence
- Signature
- String
- Substitution
- Symbol
- Term
- Theory
- list
- Example axiomatic systems (list)
- Formal proof
- Natural deduction
- Logical consequence
- Rule of inference
- Sequent calculus
- Theorem
- Systems
- Complete theory
- Independence (from ZFC)
- Proof of impossibility
- Ordinal analysis
- Reverse mathematics
- Self-verifying theories
- Interpretation
- Model
- Non-standard model
- Diagram
- Categorical theory
- Model complete theory
- Satisfiability
- Semantics of logic
- Strength
- Theories of truth
- Transfer principle
- Truth predicate
- Truth value
- Type
- Ultraproduct
- Validity
- Church encoding
- Church–Turing thesis
- Computably enumerable
- Computable function
- Computable set
- Decision problem
- decidable
- undecidable
- P
- NP
- P versus NP problem
- Kolmogorov complexity
- Lambda calculus
- Primitive recursive function
- Recursion
- Recursive set
- Turing machine
- Type theory
Related
- Abstract logic
- Algebraic logic
- Automated theorem proving
- Category theory
- Concrete/Abstract category
- Category of sets
- History of logic
- History of mathematical logic
- timeline
- Logicism
- Mathematical object
- Philosophy of mathematics
- Supertask
- GND