Jump to content

Talk:Equality (mathematics)

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

Antisymmetry

[edit]

Given the definition of "antisymmetric" on the binary relation page uses "=", isn't it a triviality to list it as a property of "="? -- Tarquin

Yes, it's pretty trivial that equality is antisymmetric. From a certain POV (the one that holds that equality is a purely logical relation with the axioms shown here), the other properties are trivial as well (since they follow from pure logic) -- but this one is particularly trivial (since it follows from pure logic even if you don't take that POV). Still, it's worth knowing that equality is unique among equivalence relations as the only antisymmetric one, so the fact has some use. -- Toby 08:10 Dec 1, 2002 (UTC)

Equality in different branches of mathematics

[edit]

As I understand it, each branch of mathematics defines equality independently. That is, the axioms of number theory (implicitly) define numeric equality as some particular equivalence relation over the set of integers, the axioms of set theory define set equality as some particular equivalence relation over the set of sets, etc.. But, aside from saying equality must always be an equivalence relation, mathematics seems to have nothing to say about equality "in general". Thus there seems to be no definition with which to make sense of the claim that, e.g. 3 = {1, 4, 9}. In addition, it seems I could define a class of mathematical objects without bothering to define any equality relation over them. Is any or all of this correct? If so, I have some changes in mind for the article. --Ryguasu 13:31, 9 Sep 2003 (EDT)

I think it fair to say (a) the = symbol is heavily overloaded in mathematical usage, and (b) typical manoeuvres such as passage to the quotient are carried out without regard to the existence of a computable equality relation.

Charles Matthews 09:05, 10 Sep 2003 (UTC)

circular definition of equality

[edit]

Isn't it a circular definition to say that

1. equality is the only binary relation that is

  reflexive, transitive, symmetric and antisymmetric

and

2. a binary relation R is antisymmetric iff

  R(x,y) and R(y,x) implies equality of x and y.

When it is possible to define antisymmetry without refering to equality, fine.- 193.175.133.66

The first is not presented as a definition but as a property.--Patrick 23:47, 27 Aug 2004 (UTC)

Japanese usage

[edit]

I have removed the following text from the article:

The equal sign that is currently used in Japan (・) also is used as a punctuation to separate
the first and last names when a western person's name is written in Katakana.

1. I cannot find any references for the use of ・ as an equality sign in Japan. The usual sign I see in Japanese texts is =.

2. Even if ・ has such a use, its relevance to a discussion of the symbol "=" is unclear, and the relevance of its regular use to the history of the aforementioned symbol is extremely unclear.

If someone can come up with a reference that describes or demonstrates this usage of ・ as an equal sign, it might be a good idea to add a section on "other equals signs around the world". (If there are any. Might Arabic or Sanskrit have their own?)

Proposition to edit Basic Properties Substitution property

[edit]

This section seems unclear, and takes much more research to unravel.

So, in spirit of clarity, I would like to change this section to something along the lines of:

Substitution property: For any quantities a and b and any well-formed expression F(x) or formula φ(x), if a = b, then F(a) = F(b) and φ(a) ⇔ φ(b)

Some specific examples of this are: For any a, b, c ∈ ℤ, (a = b) → (a + c = b + c) (Here, F(x) = x + c);

For any a, b, c ∈ ℚ, (a = b) → (a^2 + 2c + 1 = b^2 + 2c + 1) (Here, F(x) = x^2 + 2c + 1);

For any a, b, c ∈ ℝ, (a = b) → (0 ≤ a ⇔ 0 ≤ b) (Here, φ(x) is x ≥ 0)

Given a set S with a strict partial ordering (<), and any a, b, c ∈ S, If a = b and b < c, then a < c (This is given by φ(x): x < c) Farkle Griffen (talk) 04:52, 28 June 2024 (UTC)[reply]

That looks to me very much less likely to be understood by an average user of the encyclopaedia than the current version. For example, most people won't know what ⇔ means, or what a, b, c ∈ ℚ means, etc etc. JBW (talk) 21:07, 3 July 2024 (UTC)[reply]
You're right, but the examples given are kinda confusing since F is only shown as a function. So, for instance, if I want to show that: "Given a partial order on a set P, if a = b, and b < c, then a < c". This is something that should be obvious, but the examples given wouldn't give someone confidence that they can describe F as "F(x) is (x < c)", since it's not a numerical operation as the others are. And moreover, the link to "expression" rather than the more formalized "formula" article (especially when the former link specifically distinguishes between the two) sort-of convolutes the message being sent to anyone who actually wants to look further (like I did).
I've talked to quite a few people about this and there is a lot of differing opinions on the specifics, but they all agree that something just isn't quite right with the way it is now.
Can we change the examples to include the example I gave here (or some other non-numeric example). And maybe link to "formula" from the word "expression" so those looking for more rigor have it, but those just reading over aren't more confused? Farkle Griffen (talk) 03:33, 17 July 2024 (UTC)[reply]
OK, Farkle Griffen I agree with you. Previously my attention got caught by the notation, rather than the content of what you said. I have made a small change in the direction you suggest. There is more to be done, but I don't have time now. JBW (talk) 16:31, 18 July 2024 (UTC)[reply]
Looking at that section again, I think the notation of "F(x) = F(y)" is far too removed from the original meaning of '=' and anyone reading through would only be left more confused.
For instance, as shown above in the Talk section, If we want to prove the transitive property from the substitution property, we would use F(x) = (x = c), and we have given a = b and b = c then (a=c) = (b=c). Does that last jumble of symbols then prove that a = c? How would an average reader know that? If your answer is in terms of truth values, why not just use standard logical notation and/or jargon?
This article is also constantly conflating 'expressions' and 'formulae'. The article links to 'well-formed formula' multiple times, but that article only really talks in detail about logical formulas and I can't find anywhere on here that defines a 'well formed mathematical formula'.
I agree, the word 'expression' is probably more accessable to the average reader, but we shouldn't be mixing the refferences. If "formula" is more correct, all links should be in terms of that. If 'expression' is more accessible, then let's just use the word 'expression' but link to formula articles. Farkle Griffen (talk) 23:35, 21 July 2024 (UTC)[reply]

Suggestion: Proof that Set equality satisfies the substitution property.

[edit]

The article starts off talking about the basic properties of equality, but talks a lot about set equality. It would be nice if there was a proof that set equality satisfies the axioms first stated since it's not really trivial, and the proof doesn't seem to be on any other article.

I'm just worried it it might take up too much space and distract from the topic since the proof has to go into the definition of a "well formed formula".

I can set up a basic proof, but it likely won't be pretty.

Thoughts? Farkle Griffen (talk) 14:15, 22 July 2024 (UTC)[reply]

Basic Properties section should not be defined as sets.

[edit]

The links to reflexive and such, link to specifically set relations. Equality should be defined more broadly than elements of a set, since we want to be able to declare equality between objects that can't form a set. The classes of Cardinals and Ordinals, for instance. Farkle Griffen (talk) 15:43, 22 July 2024 (UTC)[reply]

There is nothing in the present formulation that restricts the definition of equality to sets. Specifically, the basic properties are introduced with "for every a and b", and not "for every a and b in a given set". The names of the properties are linked to the Wikipedia article where the properties are defined. If you are not satisfied that the definitions do not include proper classes, you can edit the target article accordingly. D.Lazard (talk) 16:27, 22 July 2024 (UTC)[reply]

Section "In logic"

[edit]

Section § In logic is confusing by not distinguishing two different concepts of equality, the equality in philosophy and classical logic, and the equality in mathematics and in mathematical logic. It is true that the mathematical concept has been modeled after the philosophical concept, but it is false that the mathematical concept can be reduced to the philosophical one. For example the priciple of identity of indiscernibles is not true in modern mathematics, where two objects that share all their properties are isomorphic rather than equal. In other words, two equal objects share all their properties, but the convers is false.

So, the section must be completely rewritten to clarify the relation betwee philosophical equality and mathematicaal equality. D.Lazard (talk) 15:06, 24 July 2024 (UTC)[reply]

I agree, as it was, it wasn't very clear. I've updated the section to be closer in the direction you suggest. It still needs further improvement.
However, it should be noted that isomorphism as you suggest does not satisfy the axioms of equality as stated.
For instance, given structures A and B that are not equal, with an isomorphism F from A to B, we can take the statement φ(X): F is an isomorphism from X to B. If A and B were equal, we should have that φ(A) → φ(B) (F is an isomorphism from B to B). But this is false. Thus A and B are not equal by the axioms stated.
Farkle Griffen (talk) 16:54, 24 July 2024 (UTC)[reply]
Your example is wrong, since a statement cannot contain a free variable (F in your example). Nevertheless, I agree to restrict what I wrote above to the case of objects that are equal up to a unique isomorphism, such as initial objects. A famous example is the set of real numbers: The constructions with Dedekind cuts and Cauchy sequences produce two different sets, but, since the results satisfy the priciple of identity of indiscernibles, one identifes both with the set of real numbers, although this is formally wrong. Note that Barry Mazur's article cited in the article page discusses these questions in details. D.Lazard (talk) 17:29, 24 July 2024 (UTC)[reply]
I'm inclined to generalize your real-numbers example by claiming that, in modern mathematics, each theory comes with its own notion of equality. The theory's author actively prescribes (what you called "identifies") which of the objects one shall be able to distinguish, and which shall be indistinguishable. At least, this view applies to the well-known constructions of more sophisticated number sets (integer, rational, real, complex) from simpler ones. Cauchy identifies any two sequences that differ only by a sequence of limit 0 - i.e. he doesn't allow the theory users to distinguish them; this is his deliberate decision, and an important part of his theory.
If this general view can be accepted, I'd like to state something like In a given mathematical theory, equality is the finest equivalence relation that is available; it is prescribed/constructed/defined by the theory's author (wording is likely to need improvement as I'm not a native English speaker). This also would avoid circular definitions like defining "equal" by "same", which might be ok in the lead but is unsatisfactory in more advanced sections. - Jochen Burghardt (talk) 19:07, 24 July 2024 (UTC)[reply]
When mathematics is based on set theory, equality prescription is usually achieved by factoring w.r.t. some equivalence relation - a well-known construction. However, e.g. with a category theoretic foundation, I doubt that there is any other way than explicitly stating "We'll identify any two objects that are isomorphic". My point is that both ways serve the same purpose: defining the equality associated with the mathematical theory under consideration. - Jochen Burghardt (talk) 19:24, 24 July 2024 (UTC)[reply]
I was a bit short in my last reply, and I apologise for that. Let me try again and explain where I'm coming from.
First, as a defense of the axioms as stated, they are the axioms of equality in mathematics and mathematical logic. See: Springer Encyclopedia of Mathematics. In fact, this is the only definition of equality that I have found. The hyperlinks to the axioms are those specifically talked about by mathematitians like Bertrand Russell and Leibniz.
Second, after reading the article you mention, I agree it is useful for describing how mathematitians use equality categorically, but I would disagree that his interpretation should be the center focus in this article specifially. Equality as a concept, especially in mathematics, is a foundational concept. Defining equality in terms of Category theory would be a chronology issue, as if Category theory supports equality, what supports Category theory? Following the links of definitions from the category theory article, you always get back to set theory and logic. You then have to deal with accusations of circularity.
Lastly, to mention your example, let me offer an analogy. A pair of tomatoes is an instance of the number '2'. That does not mean that the number 2 is equal a pair of tomatoes, for instance, the tomatoes are fruit, and the number 2 is not a fruit. The number 2 is an abstraction, it is represented by any kind of pair of objects. It is not equal to any specific instance of pairs of objects, but it can be shown to exist using specific constructions of it, in this case, a pair of tomatoes.
Similarly, the real numbers are an abstraction; the real numbers are defined as any ordered field satisfying some given axioms. Both of the constructions you mentioned are instances of real numbers, but are not the real numbers. For instance, given one of those constructions, I can take the union of the sets defining 1 and 2. But for the real numbers 1 and 2, I can't. They are instances proving that such a construction exists, but they are not themselves the abstraction.
This is an article where pedantry over the specific details of "equality" is not only tolorated but required.
If you want this article to be about the categorical use of equality, that's fine, but given the number of articles in foundations that link directly to this one, it comes at the cost of either rewriting all of those articles to not mention equality, or creating a new article that defines equality foundationally.
What I've written for the article so far provides both an axiomatization of equality, which allows any mathematitian to choose their grounding (whether it be classical logic, mathematical logic, set theory, or otherwise), along with the specific construction supported by mathematical logic and philosophy of mathematics. Farkle Griffen (talk) 03:39, 25 July 2024 (UTC)[reply]
Some fundamental remarks that must be taken into account for every modification of of the article.
  • This article is about equality in mathematics. All modern mathematics are founded over Zermelo–Fraenkel set theory (ZFC). So, except for the section on logic, everything must be compatible with Zermelo–Fraenkel definition of equality. As far as I know, in ZFC, every object is a set, and the only axiom that defines equality is the axiom of extensionality.
  • There are two different notions of equality that must not be confused the semantic equality and the syntactic equality. This is for clarifying this fact that I have recently edited the lead ( is certainly not a syntactic equality).
  • The substitution property is presented in section § In logic as an axiom of logic. For being accurate, it must be said that this is an axiom for syntactic equality only in higher-order logic, since is contains a quantification over a predicate. In first-order logic this is only a axiom schema that defines infinitely many axioms. Moreover there are logical theories with equality that do not include this axiom schema.
  • Because of the foundational crisis of mathematics and the development of mathematical logic in view of its resolution, every reference before 1900 must be taken with care outside an history section.
These remarks are of few help for improving the article without making is too WP:TECHNICAL for a general audience, but they are certainly useful for not making the article more confusing than presently. D.Lazard (talk) 13:47, 25 July 2024 (UTC)[reply]
You're right. I will try to keep this article up to the standards you've set here.
However, there are a few things I somewhat disagree with. First, not everything should be compatible with ZF. For instance, the introduction of this article defines equality as a "relationship between two quantities", however ZF defines equality as an assertion declaring that they have the same elements, and moreover, ZF does not define an object type "quantity" at all. Meaning that the introductory definition is just wrong by ZF standards. However, as I'm sure you'd agree, the introduction should not use the ZF definition. Why? Because it is less accessible to readers, maybe, but more than that, it is not how most mathematicains think of equality.
Second, as it is written, the Substitution property is not an axiom of syntactic equality, it is specifically for semantic equality. That is what the "well-formed" part of formula means. To show an example you use, the identity (x+1)^2 = x^2 + 2x + 1 is not a syntactic equality, but it is a semantic equality. x is defined as an arbitrary element from a given domain. Functions are defined as sets, specifically, a set of ordered pairs of all elements from their domain to their codomain. So the functions on both sides of this equality reduce to the same set, and thus they are equal. An identity just means an equality of these function sets.
You might say that "These have diffrent properties, for instance, they have a diffrent number of terms", but ZF has no fundamental notion of "strings" or "terms". If you try to define some property that distinguishes the two, you will notice that this property is not well-formed in ZF, since both sides reduce to the same set, any well-formed formula in ZF cannot distinguish between them.
This brings me to my last note, I do believe that what I have written in the In logic section does meet all of the criteria you have mentioned. I've taken out most of the mentions to first-order logic and grounded the statements in ZF. It should be noted that the "asioms" I mention in that can be proved within ZF.
My goal of what I have written is to describe the framework in which mathematicians view equality. Mathematicians don't usually see equality as set equality but rather a notion of same-ness between two mathematical objects, which they may not necessarily think of as sets. Most mathematicans take the statements "x=x" and "x=y implies you can replace x with y" as axioms anyway. For instance, if I were to ask you why equality is transitive, you might say "Well if a=b then a and b are the same thing, so if b=c then we can just rewrite it as a=c" But this is exactly the substitution property. In reality, the transitive property of equality is not very trivial to prove from the basic axioms in ZF. But given the substitution property, it becomes much easier.
What I have now is an alternate framework; a place for mathematitians to point to justify their intuitions. It is still grounded in ZF, but now one can use and teach the substitution property as an axiom without worrying about rigor. Let me be clear on what this section doesn't say. It does not say that those two axioms form a complete axiomatization of equality, and it does not assume the identity of indiscernibles. It assumes the indiscernibility of identicals.
Identity of indiscernibles: "If Fx implies Fy for any formula F, then x = y". This is not assumed.
Indiscernibility of identicals: "If x=y, then Fx implies Fy, for any fomula F". This is assumed. It states that if two things are the same, then you can't distinguish between them, which should be an obvious truth.
As an incomplete set of axioms, it is not the case that if an object satisfies those axioms, then it is equality. It just proves statements about equality, like transitivity, and can prove things aren't equal. The only diffrence between standard set equality and this reinterpretation is that set equality is capable of declaring indiscernibles as unequal, which this isn't. It doen't say they are equal, it just can't say they aren't since they don't violate either axiom.
This is why I don't like the title of the section "In logic". As it is now, it is not founded in standard logic, but rather ZF. I will work on editing that section to make this more clear, but until then, I hope you will consider changing the section title. I would change it myself, but that feels dishonest since you were the one to put it in place. Farkle Griffen (talk) 03:29, 26 July 2024 (UTC)[reply]
I've rewritten that section for clarity in the ways we have talked about. Are there any parts of that section you still consider confusing or pressing issues? Farkle Griffen (talk) 15:51, 28 July 2024 (UTC)[reply]
The section has been completely rewritten as we talked about. Are there any specific issues you believe are still too confusing for most readers? I am planning on removing the "confusing" tag on by August 11th, if no response is given. Farkle Griffen (talk) 21:45, 8 August 2024 (UTC)[reply]
@D.Lazard, I would like to apologise; I somehow misread this comment multiple times, reading it as the opposite of what is meant. I read this as saying, roughly, "The indentity of indiscernibles is true in mathematics, and two objects that are isomorphic should be equal". Rereading this time, this is clearly not what is meant.
Though I believe I can see where the confusion came from. First, let me clear one thing up: that section has never said the identity of indiscernibles, it said the indiscernibility of identicals is true. To see the diffrence:
Identity of indiscernibles: "If two things share all properties, then they are equal"
Indiscernibility of identicals: "If two things are equal, then they share all properties"
The former is certainly controversial, but the latter is almost certainly true. However, because their spellings are so similar, it is very easy to mistake one for the other when reading, and I believe that is what happened here. Because of this, I replaced all instances of "indisceribility of identicals" with the more distinct "substitution property".
I apologise for any frustration this caused. Farkle Griffen (talk) 15:05, 17 September 2024 (UTC)[reply]

Congruence relation?

[edit]

While checking the 2 most recent edits, I found that in section "Basic properties", item "Operation application" is a special case of item "Substitution" (should better be "Substitutivity", to have an adjective there, too). "Operation application" handles expressions of height 1 (or 2, if variables are counted, too), while "Substitution" handles expressions of arbitrary height. Therefore, by a simple induction on expression height, "Substitution" follows from "Operation application", so both properties are equivalent. Moreover, due to the single property "Substitution"/"Operation application", equality is a congruence relation on every algebraic structure where it is defined at all.

Btw: The 2nd subitem of "Operation application" is wrong for b=0. In the 3rd subitem, both g and h need to be differentiable, and it should be clarified that the premise means g=h (equality of functions), not g(a)=h(a), which can be misread as equality of particular function values at input a.

To sum up, I suggest to change the current text as follows:

  • Substitutivity: for every a and b, and every operation , if a = b, then f(a) = f(b).[a][1] Informally, this just means that if a = b, then a can replace b in any mathematical expression or formula without changing its meaning.
    For example:
    • Given real numbers a, and b, if a = b, then .[b]
    • Given unary real-valued differentiable functions and , if , then . (Equality of functions is retained by the derivative operation.)

If restricted to the elements of a given set , those first three properties make equality an equivalence relation on . In fact, equality is the unique equivalence relation on whose equivalence classes are all singletons. On every algebraic structure, all four properties together make equality a congruence relation, if it is defined at all.

References

  1. ^ Equality axioms. Springer Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Equality_axioms&oldid=46837
  1. ^ This generalizes to functions f of higher (countable) arity: for each n-ary function f, whenever a = b, then f(x1,...,xk-1,a,xk+1,...,xn) = f(x1,...,xk-1,b,xk+1,...,xn) for all xi and each k.
  2. ^ In detail: a = b implies 2a = 2b, which implies in turn 2a-5 = 2b-5.

Comments are welcome. - Jochen Burghardt (talk) 11:19, 18 October 2024 (UTC)[reply]

Is the word "Substitutivity" actually used in English by mathematicians? I've never encountered it, and even the Wikipedia article that you have linked it to doesn't mention the word. The wiktionary article that you link to appears to confirm that the word exists and is used in philosophy, but no mention of mathematics. JBW (talk) 12:51, 18 October 2024 (UTC)[reply]
Also, what do you mean by "to have an adjective there, too"? Both "substitution" and "substitutivity" are nouns; like almost all nouns in English "substitution" can be used as an adjective, and presumably so can "substitutivity". JBW (talk) 13:36, 18 October 2024 (UTC)[reply]
Oops, you are right, "substitutivity" is indeed a noun. What I meant was, that it is derived from an adjective "substitutive" in the same way as e.g the noun "reflexivity" is derived from the adjective "reflexive". However, while "substitutive" has an entry in Wiktionary (wikt:substitutive), its meaning given there ("serving as a substitute") doesn't match the meaning used in my suggestion. "Substitutive" in the latter meaning is used e.g. by Milner (1990, Sect.3.4, p.1220-1222).[1] After he has shown in Prop.3.2.8 on p.1217, that ~ is an equivalence relation, he continues in the lead of Sect.3.4 on p.1220: "We must demonstrate that ~ is indeed a congruence relation, i.e. that it is substitutive everywhere." - I guess, a justification for that meaning would be "a relation R is called substitutive if it preserves substitution, i.e. if b can be used as a substitute [replacement] for a, then f(b) can be used as a substitute for f(a)". In wikt:Substitutivity, the explanation seems hardly comprehensible (it might even be flawed?), but the Quine citation matches "my" meaning exactly (Quine was an analytical philosopher, who, like Russell, used mathematical logic to a great extent in his philosophy). - Jochen Burghardt (talk) 20:51, 18 October 2024 (UTC)[reply]

References

  1. ^ Robin Milner (1990). "Operational and Algebraic Semantics of Concurrent Processes". In Jan van Leeuwen (ed.). Formal Models and Semantics. Handbook of Theoretical Computer Science. Vol. B. Elsevier. pp. 1203–1242. ISBN 0-444-88074-7.

Suggestions for further improvement

[edit]

@Farkle Griffen, I saw you asked for review of this article elsewhere and for suggestions for further improvement.

First, good work so far on the article: I think it's definitely much improved.

As one next improvement I'd suggest adding a "background" to the "In logic" section, mirroring the "background" for the "In set theory" subsection, that discusses how equalities were the defining predicates for the category of "quantity" in Aristotle's Categories and then (very briefly) the development of mathematical logical equality to Leibniz from the Scholastic study of the Categories as part of the Organon. I don't immediately have a source for that in mind, but one or two shouldn't be hard to find. RowanElder (talk) 20:35, 22 January 2025 (UTC)[reply]

@RowanElder, The bit about Aristotle is intresting, and seems relevant enough to the section; apart from that, I'm not sure how much more there is to say. From what I can find, Scholastics generally didn't really care much about quantitative equality, at least not in a way that seems relevant enough to mathematics to justify mentioning in the article. Does what I've added so far work? Farkle Griffen (talk) 21:21, 23 January 2025 (UTC)[reply]
Yes, what you've added should roughly work, though it may need a minor rewording to avoid creating the impression that Aristotle conflated identity and equality.
The stuff about the Scholastics is harder to find and it's not as high a priority as Aristotle's Categories. Mathematician-philosophers like Richard Swineshead were crucial for the development of the ideas of equalities of intensities, i.e., the development of intensive quantities (forces, pressures, temperatures) in contrast to the extensive quantities (lengths, areas, volumes) ubiquitous in Euclid and Aristotle. This was studied by historians of math and science like Marshall Clagett. The Scholastic developments involved some subtle reasoning about quality and quantity that proved crucial to the development of, e.g., quantifiable temperature (one of Clagett's thesis topics), and thereby also to the way in which Leibniz conceived of the properties relevant to the substitution principle.
That material can be a bear to wade through, though, so no rush: your existing addition will hold the eventual place for it well. If you're on the verge of nominating this as a good article and it's still a pain to find this even with the Clagett and Swineshead pointers, I'll be happy to go find some up-to-date summary sources for this article myself, just say when (and give me about a week to get around to it). RowanElder (talk) 22:06, 23 January 2025 (UTC)[reply]
@RowanElder, sorry for the delay, it's been busy.
Your pointers were very helpful, and I've done my best to try to summarize the sources I could find, but I may over/underemphasize details. Is what I've added satisfying?
I wouldn't say I'm on the verge. There's still a few details I need to iron out, better sources for some parts, and I'm not sure what I'm going to do about Homotopy type theory yet, so if there's any issues, there's time to get it worked out. Farkle Griffen (talk) 20:25, 10 February 2025 (UTC)[reply]
No rush at all on my end. I appreciate what you've added and I'll try an edit to sharpen it up in a little while. I've been wanting to make time to finish work I started at I. Bernard Cohen first, though, so it might be a week or two unless you'd like this done sooner rather than later. I hope you enjoy figuring out what to do with HoTT! RowanElder (talk) 20:40, 10 February 2025 (UTC)[reply]
@RowanElder, I've done more or less what I wanted to do. I think I'm going to hold off on an HoTT section for now unless theres a real push for it during GA review (I don't think its necessary for GA, but I'll add it if I go for FA).
I'd like to talk about the paragraph on the Scholastics. Looking at it again, I'm a bit lost on how exactly it relates to equality. "Equalities of intensities", sure, but that can just mean a number with units. Was there something fundamentally about equality in its definition that I'm missing here? Farkle Griffen (talk) 05:02, 1 March 2025 (UTC)[reply]
Sounds good re HoTT. Re the Scholastics, the fundamental thing there is that they worked out what it meant for intensities of qualities to be equal to each other and thereby what it meant for those intensities to be quantifiable (since equality was the predicate proper to quantities in the Categories). We now take it for granted that each is "just a number with units," but historically it was a difficult advance. RowanElder (talk) 17:46, 1 March 2025 (UTC)[reply]

Section on Type theory

[edit]

I'd like some opinions on this. I've been back and forth with myself for a month or so about what to do. Should this article include a section on Type Theory? On the one hand, Homotopy type theory has quite a bit (and quite interesting things) to say about equality, enough to fill a small section. On the other hand, it's somewhat obscure in that a mathematician could go their whole career never hearing about it. It makes it hard to determine how much is WP:DUE. I'd appreciate any opinions on this. Farkle Griffen (talk) 20:36, 10 February 2025 (UTC)[reply]

I think a small section is warranted, personally. It has a decent footprint in computing, especially in functional programming circles, in addition to its pure mathematical audience. It has come up in conversations at every recent AI conference I've attended. RowanElder (talk) 20:46, 10 February 2025 (UTC)[reply]

Peer review

[edit]


I've listed this article for peer review because I'm looking to prepare this article for a GA review. I've never done a GA review, so I don't really know what I'm doing. I'd mostly like to make sure this article isn't missing any major details, and doesn't have any issues that might cause it to quick-fail. Thank you! Farkle Griffen (talk) 05:24, 1 March 2025 (UTC)[reply]

In a different place regarding this, see here. I'm just passing the redirection. Dedhert.Jr (talk) 14:45, 4 March 2025 (UTC)[reply]


Article update

[edit]

Hi @Farkle Griffen: How goes it. I would start by finding references for each note entry. Its an auto-fail of GA before it even starts if they are missing. scope_creepTalk 09:23, 3 March 2025 (UTC)[reply]

Gotcha. I can work on that Farkle Griffen (talk) 02:27, 4 March 2025 (UTC)[reply]
I took a slightly different route. How's it looking? Farkle Griffen (talk) 07:36, 4 March 2025 (UTC)[reply]
@Farkle Griffen: The two remaining still need references. Next thing which is low hanging-fruit is to go around each image and add an alt tag. scope_creepTalk 10:06, 6 March 2025 (UTC)[reply]
@Farkle Griffen: On the references on many of them, you are missing location, publisher (e.g. ref 72) edition fields, isbn, page numbers (e.g. ref 19), most egregiously, authors, . There is no oclc links. You get that field from worldcat which links the the ref to the worldcat entry. These are quick fail at GA. scope_creepTalk 12:06, 6 March 2025 (UTC)[reply]
I see you have listed it at WP:PR. It will take 3 to 6 weeks before somebody comes acround. It might be longer due to the specialism of the subject. scope_creepTalk 12:10, 6 March 2025 (UTC)[reply]
@Scope creep What are oclc links? Farkle Griffen (talk) 00:20, 25 March 2025 (UTC)[reply]