## Mintys.MatematikosIšsiaiškinimoBūdai istorija

2016 birželio 18 d., 17:38 atliko AndriusKulikauskas -
Pakeistos 1-46 eilutės iš
Attach:matematikos-issiaiskinimo-budai.png

Zermelo-Fraenkel axioms of set theory

* Axiom of Extensionality. Two sets are the same set if they have the same elements.
* Axiom of Regularity. Every non-empty set x contains a member y such that x and y are disjoint sets. This implies, for example, that no set is an element of itself and that every set has an ordinal rank.
* Axiom Schema of Specification. The subset of a set z obeying a formula ϕ(x) with one free variable x always exists.
* Axiom of Pairing. If x and y are sets, then there exists a set which contains x and y as elements.
* Axiom of Union. The union over the elements of a set exists.
* Axiom Schema of Replacement. The image of a set under any definable function will also fall inside a set.
* Axiom of Power Set. For any set x, there is a set y that contains every subset of x.
* Well-Ordering Theorem. For any set X, there is a binary relation R which well-orders X.

Also:
* Axiom of infinity. Let S(w) abbreviate w ∪ {w}, where w is some set. Then there exists a set X such that the empty set ∅ is a member of X and, whenever a set y is a member of X, then S(y) is also a member of X.

Implicit math: Sets are simplexes. Are simplexes defined by their subsimplexes as well?
* Well-ordering theorem. Each vertex is related by edges to the other vertices. Established by the q-weight.
* Axiom of power set. The power sets are the lattice paths in Pascal's triangle.
* Axiom of union. Simplexes combine to form larger simplexes.
* Axiom of pairing. Simplexes can be "collapsed" or "represented" by a vertex, the highest vertex. Two vertices are linked by an edge.
* Axiom of regularity.
* Axiom of extensionality. Simplexes are defined by their vertices. And the edges?

Eightfold way
* Axiom of Pairing. If x and y are sets, then there exists a set which contains x and y as elements.
* Axiom of Extensionality. Two sets are the same set if they have the same elements.
* Axiom of Union. The union over the elements of a set exists.
* Axiom of Power set. For any set x, there is a set y that contains every subset of x.

* Axiom of Regularity. Every non-empty set x contains a member y such that x and y are disjoint sets.
* Well-ordering theorem. For any set X, there is a binary relation R which well-orders X.
* Axiom Schema of Specification. The subset of a set z obeying a formula ϕ(x) with one free variable x always exists.
* Axiom Schema of Replacement. The image of a set under any definable function will also fall inside a set.

Reorganizings
* Evolution. Tree of variations. Axiom of Pairing (subbranches are part of a branch).
* Atlas. Adjacency graph. Axiom of Extensionality. Two levels of equality.
* Handbook. Total order. Well-Ordering Theorem.
* Chronicle. Powerset lattice. Axiom of Power Set.
* Catalog. Decomposition. Axiom of Union.
* Tour. Directed graph. Axiom of Regularity.

Relate to multiplication

http:
į:
Žr. [[Book/MathDiscovery]]
2016 birželio 18 d., 01:20 atliko AndriusKulikauskas -
Pakeistos 37-41 eilutės iš
* Evolution. Tree of variations.
* Atlas. Adjacency graph.
* Handbook. Total order.
* Chronicle. Powerset lattice
. Well-Ordering Theorem.
* Catalog. Decomposition.
į:
* Evolution. Tree of variations. Axiom of Pairing (subbranches are part of a branch).
* Atlas. Adjacency graph. Axiom of Extensionality. Two levels of equality.
* Handbook. Total order. Well-Ordering Theorem.
* Chronicle. Powerset lattice. Axiom of Power Set.
* Catalog. Decomposition. Axiom of Union.
2016 birželio 18 d., 01:16 atliko AndriusKulikauskas -
Pakeistos 42-46 eilutės iš
* Tour. Directed graph. Axiom of Regularity.
į:
* Tour. Directed graph. Axiom of Regularity.

Relate to multiplication

2016 birželio 18 d., 01:11 atliko AndriusKulikauskas -
Pakeistos 37-42 eilutės iš
* Evolution.
* Atlas.
* Handbook.
* Chronicle. Total order.
* Catalog.
* Tour. Directed graph.
į:
* Evolution. Tree of variations.
* Atlas. Adjacency graph.
* Handbook. Total order.
* Chronicle. Powerset lattice. Well-Ordering Theorem.
* Catalog. Decomposition.
* Tour. Directed graph. Axiom of Regularity
.
2016 birželio 18 d., 01:10 atliko AndriusKulikauskas -
Pridėtos 35-42 eilutės:

Reorganizings
* Evolution.
* Atlas.
* Handbook.
* Chronicle. Total order.
* Catalog.
* Tour. Directed graph.
2016 birželio 18 d., 00:58 atliko AndriusKulikauskas -
Pakeistos 7-13 eilutės iš
* Axiom schema of specification. The subset of a set z obeying a formula ϕ(x) with one free variable x always exists.
* Axiom of pairing. If x and y are sets, then there exists a set which contains x and y as elements.
* Axiom of union. The union over the elements of a set exists.
* Axiom schema of replacement. The image of a set under any definable function will also fall inside a set.
* Axiom of power set. For any set x, there is a set y that contains every subset of x
* Well-ordering theorem. For any set X, there is a binary relation R which well-orders X.
į:
* Axiom Schema of Specification. The subset of a set z obeying a formula ϕ(x) with one free variable x always exists.
* Axiom of Pairing. If x and y are sets, then there exists a set which contains x and y as elements.
* Axiom of Union. The union over the elements of a set exists.
* Axiom Schema of Replacement. The image of a set under any definable function will also fall inside a set.
* Axiom of Power Set. For any set x, there is a set y that contains every subset of x.
* Well-Ordering Theorem. For any set X, there is a binary relation R which well-orders X.
Pakeista 17 eilutė iš:
Implicit math: Sets are simplexes.
į:
Implicit math: Sets are simplexes. Are simplexes defined by their subsimplexes as well?
Pakeistos 21-34 eilutės iš
* Axiom of pairing.
į:
* Axiom of pairing. Simplexes can be "collapsed" or "represented" by a vertex, the highest vertex. Two vertices are linked by an edge.
* Axiom of regularity.
* Axiom of extensionality. Simplexes are defined by their vertices. And the edges?

Eightfold way
* Axiom of Pairing. If x and y are sets, then there exists a set which contains x and y as elements.
* Axiom of Extensionality. Two sets are the same set if they have the same elements.
* Axiom of Union. The union over the elements of a set exists.
* Axiom of Power set. For any set x, there is a set y that contains every subset of x.

* Axiom of Regularity. Every non-empty set x contains a member y such that x and y are disjoint sets.
* Well-ordering theorem. For any set X, there is a binary relation R which well-orders X.
* Axiom Schema of Specification. The subset of a set z obeying a formula ϕ(x) with one free variable x always exists.
* Axiom Schema of Replacement. The image of a set under any definable function will also fall inside a set
.
2016 birželio 18 d., 00:46 atliko AndriusKulikauskas -
Pakeistos 11-12 eilutės iš
* Axiom of power set. For any set x, there is a set y that contains every subset of x.
* Axiom of infinity. Let S(w) abbreviate w ∪ {w}, where w is some set. Then there exists a set X such that the empty set ∅ is a member of X and, whenever a set y is a member of X, then S(y) is also a member of X.
į:
* Axiom of power set. For any set x, there is a set y that contains every subset of x
* Well-ordering theorem. For any set X, there is a binary relation R which well-orders X.

Also:
* Axiom of infinity. Let S(w) abbreviate w ∪ {w}, where w is some set. Then there exists
a set X such that the empty set ∅ is a member of X and, whenever a set y is a member of X, then S(y) is also a member of X.

Implicit math: Sets are simplexes.
* Well-ordering theorem. Each vertex is related by edges to the other vertices. Established by the q-weight.
* Axiom of power set. The power sets are the lattice paths in Pascal's triangle.
* Axiom of union. Simplexes combine to form larger simplexes.
* Axiom of pairing.
2016 birželio 18 d., 00:28 atliko AndriusKulikauskas -
Pridėtos 1-12 eilutės:
Attach:matematikos-issiaiskinimo-budai.png

Zermelo-Fraenkel axioms of set theory

* Axiom of Extensionality. Two sets are the same set if they have the same elements.
* Axiom of Regularity. Every non-empty set x contains a member y such that x and y are disjoint sets. This implies, for example, that no set is an element of itself and that every set has an ordinal rank.
* Axiom schema of specification. The subset of a set z obeying a formula ϕ(x) with one free variable x always exists.
* Axiom of pairing. If x and y are sets, then there exists a set which contains x and y as elements.
* Axiom of union. The union over the elements of a set exists.
* Axiom schema of replacement. The image of a set under any definable function will also fall inside a set.
* Axiom of power set. For any set x, there is a set y that contains every subset of x.
* Axiom of infinity. Let S(w) abbreviate w ∪ {w}, where w is some set. Then there exists a set X such that the empty set ∅ is a member of X and, whenever a set y is a member of X, then S(y) is also a member of X.

#### MatematikosIšsiaiškinimoBūdai

Naujausi pakeitimai

Klausimai #FFFFC0

Teiginiai #FFFFFF

Kitų mintys #EFCFE1

Dievas man #FFECC0

Iš ankščiau #CCFFCC

Mieli skaitytojai, visa mano kūryba ir kartu visi šie puslapiai yra visuomenės turtas, kuriuo visi kviečiami laisvai naudotis, dalintis, visaip perkurti. - Andrius

 Puslapis paskutinį kartą pakeistas 2016 birželio 18 d., 17:38