Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Special pages
Niidae Wiki
Search
Search
Appearance
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
Up to
(section)
Page
Discussion
English
Read
Edit
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
View history
General
What links here
Related changes
Page information
Appearance
move to sidebar
hide
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Examples== ===Tetris=== [[File:Tetrominoes IJLO STZ Worlds.svg|thumb|Tetris pieces I, J, L, O, S, T, Z]] Consider the seven [[Tetris]] pieces (I, J, L, O, S, T, Z), known mathematically as the [[tetromino]]es. If you consider all the possible rotations of these pieces β for example, if you consider the "I" oriented vertically to be distinct from the "I" oriented horizontally β then you find there are 19 distinct possible shapes to be displayed on the screen. (These 19 are the so-called "fixed" tetrominoes.<ref>{{MathWorld |id=Tetromino |title=Tetromino |access-date=2023-09-26}}</ref>) But if rotations are not considered distinct β so that we treat both "I vertically" and "I horizontally" indifferently as "I" β then there are only seven. We say that "there are seven [[tetromino]]es, up to rotation". One could also say that "there are five tetrominoes, up to rotation and reflection", which accounts for the fact that L reflected gives J, and S reflected gives Z. ===Eight queens=== [[File:Skak 8dronning.png|thumb|A solution of the eight queens problem]] In the [[eight queens puzzle]], if the queens are considered to be distinct (e.g. if they are colored with eight different colors), then there are 3709440 distinct solutions. Normally, however, the queens are considered to be interchangeable, and one usually says "there are {{math|1=3,709,440 / 8! = 92}} unique solutions up to [[permutation]] of the queens", or that "there are 92 solutions modulo the names of the queens", signifying that two different arrangements of the queens are considered equivalent if the queens have been permuted, as long as the set of occupied squares remains the same. If, in addition to treating the queens as identical, [[rotation]]s and [[Reflection (mathematics)|reflection]]s of the board were allowed, we would have only 12 distinct solutions "up to [[symmetry]] and the naming of the queens". For more, see {{format link|Eight queens puzzle#Solutions}}. ===Polygons=== The [[regular polygon|regular {{mvar|n}}-gon]], for a fixed {{mvar|n}}, is unique up to [[similarity (geometry)|similarity]]. In other words, the "similarity" equivalence relation over the regular {{mvar|n}}-gons (for a fixed {{mvar|n}}) has only one equivalence class; it is impossible to produce two regular {{mvar|n}}-gons which are not similar to each other. ===Group theory=== In [[group theory]], one may have a [[group (mathematics)|group]] {{mvar|G}} [[Group action (mathematics)|acting]] on a set {{mvar|X}}, in which case, one might say that two elements of {{mvar|X}} are equivalent "up to the group action"βif they lie in the same [[Group action (mathematics)|orbit]]. Another typical example is the statement that "there are two different [[group (mathematics)|groups]] of order 4 up to [[isomorphism]]", or "modulo isomorphism, there are two groups of order 4". This means that, if one considers [[group isomorphism|isomorphic]] groups "equivalent", there are only two equivalence classes of groups of order 4. ===Nonstandard analysis=== A [[hyperreal number|hyperreal]] {{mvar|x}} and its [[standard part function|standard part]] {{math|st(''x'')}} are equal up to an [[infinitesimal]] difference.
Summary:
Please note that all contributions to Niidae Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Encyclopedia:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Search
Search
Editing
Up to
(section)
Add topic