WikiLean · Articles Articles Brain Contribute About

Preliminary: these links have not yet had an independent audit.

Bijection, injection and surjection

62 passages44 formalized2 statement only11 partial5 not formalized

More ways to filter
Library
About this page

This page

  • Wikipedia revision 1372610632, pinned: the text here is that revision, not today's article.
  • WikiProject Mathematics: B-class, High importance
  • Annotated article on WikiLean.
  • 62 passages checked, 85 Lean locations (and 29 related declarations).

Central statements: 22 of the 62 passages state the article's subject or a named result or definition; the other 40 are supporting (examples, setup). Of these 22: 20 formalized, 2 partial.

What the colours mean

  • Formalized a Lean declaration states it, proved, or a Lean definition defines it
  • Statement only Lean states it, but the proof is not finished
  • Partial Lean states part of it, or a more general or special form
  • Not formalized searched every library and not found

Libraries searched

Searched 48 Lean libraries, pinned 2026-10-17, 3 left out (library set u1).

How these links were made

  • Accuracy, from an audit of a sample of 224 items (blind, not independent): Strong links (exact, close or broad match) on supporting passages that have exactly the right relation: 92% (95% interval 49–99%), from 36 drawn of 1029, weighted by relation and library, an effective sample of 5.1; Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation: 73% (95% interval 40–92%), from 48 drawn of 1740, weighted by relation and library, an effective sample of 8.1; Central and subject passages whose formalization status is right: 86% (95% interval 73–94%), from 44 drawn of 1905, weighted by recorded status, an effective sample of 42; 'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it): 60% (95% interval 25–87%), from 12 drawn of 1236, weighted by article, an effective sample of 6.1.
  • Audit run tierA-batch1-audit, run by jack, 2 Nov 2026, 21:10 – 3 Nov 2026, 02:10 UTC: judged by Claude Opus 5.5 (claude-opus-5-5).
  • Record set tierA-b1b (cf-locate-recordset/2, statuses by status rule 3), exported 1 Nov 2026 by formal-companion at commit d85385a.
  • Seal sha256 23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602.
  • Inventory run inv-tierA-b1r, run by jack, 30 Oct 2026, 07:23–20:00 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). It listed the formal passages, each with its kind and prominence, that the locate run then searched.
  • Locate run loc-tierA-b1b, run by jack, 31 Oct 2026, 04:59 – 1 Nov 2026, 03:06 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5).
  • Challenge run chal-tierA-b1, run by jack, 1 Nov 2026, 03:19–14:25 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). In this article it re-checked every Lean location on a central or subject passage (35 locations); on supporting passages, a seeded sample (seed 0; drawn at 0.5 for strong matches, 0.2 for weaker links and 0.25 for absences): 37 of 50 locations and 2 of 6 absences. In all, 72 of 85 Lean locations (85%) and 2 of 6 absences (33%) were re-checked.
  • Passage text: 62 of 62 passages shown in full, each the slice of the pinned revision's text that its record's span sha256 hashes, checked when the store was built.
  • Lean code: each declaration's type, from the declaration corpus of universe u1 (built 18 Oct 2026, sha256 a364fd6aede5), at the commit its card links.

How the text is shown

Each passage is shown in full, as revision 1372610632 states it (checked against its record's span hash when the store was built). Where a passage is only part of a sentence, it is highlighted and the rest of the sentence is shown in grey around it, from the same copy of the revision; a list item also shows the sentence that introduces it. Formulas are drawn from their TeX; hover one to see it.

Each card's Lean code is its declaration's type as Lean prints it, from the declaration corpus of library set u1 at the card's commit, laid out as a header: binders before the colon, then the hypotheses as arrows (the corpus keeps no hypothesis names) and the conclusion, in Mathlib's notation (𝓝, π, R[X], Type*). It is not the source text; Source opens that.

Passages

What “exact match”, “more general” and the other labels mean
  1. Definition · main statement

    Formalized

    Formalized: Lean core states this exactly (a Prop-valued definition: it states the claim without proving it).

    Given a function f: X → Y:
    The function is injective, or one-to-one, if each element of the codomain is mapped to by at most one element of the domain, or equivalently, if distinct elements of the domain map to distinct elements in the codomain. An injective function is also called an injection.[1] Notationally: ∀x, x′ ∈ X, f(x) = f(x′) ⟹ x = x′,

    Show in article · Read it in context on Wikipedia

    Function.Injective exact match

    def Function.Injective {α : Sort u_1} {β : Sort u_2} : (α → β) → Prop

    Init.Data.Function · lines 53–54

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 757e1e626f3f · pair key a57c4c9de7b3.
  2. Theorem · supporting

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    ∀x, x′ ∈ X, f(x) = f(x′) ⟹ x = x′,
    or, equivalently (using logical transposition), ∀x, x′ ∈ X, x ≠ x′ ⟹ f(x) ≠ f(x′).

    Show in article · Read it in context on Wikipedia

    pairwise_ne_iff_injective close match

    theorem pairwise_ne_iff_injective {α : Type*} {ι : Type*} {f : ι → α} : (Pairwise fun i j ↦ f i ≠ f j) ↔ Function.Injective f

    Mathlib.Data.Set.Pairwise.Basic · lines 481–482

    Why close, not exact: Lean packs the contrapositive condition inside the `Pairwise` predicate, whose definition is the implication from i ≠ j to the relation, and states the equivalence with injectivity in that packed form.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 2560b3158be4 · pair key 4592406ad1bb.

    Function.injective_iff_pairwise_ne close match

    theorem Function.injective_iff_pairwise_ne {α : Type*} {ι : Type*} {f : ι → α} : Function.Injective f ↔ Pairwise (Function.onFun (fun x1 x2 ↦ x1 ≠ x2) f)

    Mathlib.Logic.Pairwise · lines 46–47

    Why close, not exact: Lean writes the same equivalence in the other orientation, with the inequality relation transported along f by `Function.onFun` and wrapped in `Pairwise`.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key a449943ec895 · pair key 8ff4e4195ff7.
  3. Definition · main statement

    Formalized

    Formalized: Lean core states this exactly (a Prop-valued definition: it states the claim without proving it).

    ∀x, x′ ∈ X, x ≠ x′ ⟹ f(x) ≠ f(x′). [2][3][4]
    The function is surjective, or onto, if each element of the codomain is mapped to by at least one element of the domain; that is, if the image and the codomain of the function are equal. A surjective function is a surjection.[1] Notationally: ∀y ∈ Y, ∃x ∈ X, y = f(x).

    Show in article · Read it in context on Wikipedia

    Function.Surjective exact match

    def Function.Surjective {α : Sort u_1} {β : Sort u_2} : (α → β) → Prop

    Init.Data.Function · lines 62–63

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 9d2dbea71327 · pair key 907ad1347aa0.

    Set.range_eq_univ close match

    theorem Set.range_eq_univ {α : Type*} {ι : Sort*} {f : ι → α} : Set.range f = Set.univ ↔ Function.Surjective f

    Mathlib.Data.Set.Image · lines 597–598

    Why close, not exact: Lean records the image of f as `Set.range f` and the whole codomain as `Set.univ`, and states that their equality is the same condition as the predicate the passage defines.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key d62751c0178a · pair key 5a8dec4091c1.
  4. Definition · main statement

    Formalized

    Formalized: Mathlib states this exactly (a Prop-valued definition: it states the claim without proving it).

    ∀y ∈ Y, ∃x ∈ X, y = f(x). [2][3][4]
    The function is bijective (one-to-one and onto, one-to-one correspondence, or invertible) if each element of the codomain is mapped to by exactly one element of the domain; that is, if the function is both injective and surjective. A bijective function is also called a bijection.[1][2][3][4] That is, combining the definitions of injective and surjective, ∀y ∈ Y, ∃!x ∈ X, y = f(x),

    Show in article · Read it in context on Wikipedia

    Function.Bijective exact match

    def Function.Bijective {α : Sort u₁} {β : Sort u₂} : (α → β) → Prop

    Mathlib.Logic.Function.Defs · lines 163–164

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key eede0a063f0c · pair key be9c2d9bad89.

    Function.bijective_iff_existsUnique close match

    theorem Function.bijective_iff_existsUnique {α : Sort*} {β : Sort*} (f : α → β) : Function.Bijective f ↔ ∀ (b : β), ∃! a, f a = b

    Mathlib.Logic.Function.Basic · lines 332–334

    Why close, not exact: Lean unfolds the predicate into the passage's displayed condition, writing the equation with the value on the left of the equality sign rather than on the right.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key d6aac50af7e5 · pair key 3759084f3547.
  5. Notation · supporting

    Formalized

    Formalized: Mathlib states this exactly (a Prop-valued definition: it states the claim without proving it).

    ∀y ∈ Y, ∃!x ∈ X, y = f(x),
    where ∃!x means "there exists exactly one x".

    Show in article · Read it in context on Wikipedia

    ExistsUnique exact match

    def ExistsUnique {α : Sort*} : (α → Prop) → Prop

    Mathlib.Basic.ExistsUnique · line 22

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 576e117add85 · pair key fe536b92503f.
  6. Theorem · supporting

    Formalized

    Formalized: Mathlib states a more general result (proved).

    In any case (for any function), the following holds: ∀x ∈ X, ∃!y ∈ Y, y = f(x).

    Show in article · Read it in context on Wikipedia

    existsUnique_eq more general

    theorem existsUnique_eq {α : Sort*} {a' : α} : ∃! a, a = a'

    Mathlib.Basic.ExistsUnique · lines 114–115

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 5561a7387c9d · pair key 730febdf7e1a.
  7. Theorem · supporting

    Not formalized
    An injective function need not be surjective (not all elements of the codomain may be associated with arguments), and a surjective function need not be injective (some images may be associated with more than one argument).

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 5577110869cb).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  8. Theorem · supporting

    Not formalized
    An injective function need not be surjective (not all elements of the codomain may be associated with arguments), and a surjective function need not be injective (some images may be associated with more than one argument).

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 279f4258b887).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  9. Definition · main statement · Injection

    Formalized

    Formalized: Lean core states this up to a convention difference (a Prop-valued definition: it states the claim without proving it).

    A function is injective (one-to-one) if each possible element of the codomain is mapped to by at most one argument.

    Show in article · Read it in context on Wikipedia

    Function.Injective close match

    def Function.Injective {α : Sort u_1} {β : Sort u_2} : (α → β) → Prop

    Init.Data.Function · lines 53–54

    Why close, not exact: Lean encodes the counting condition as the implication from equal values to equal arguments, so the condition is written about pairs of arguments rather than about the preimages of a codomain element.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 6ad435686f67 · pair key 10d6856b0798.
  10. Definition · supporting · Injection

    Partial

    Partial: Mathlib states this up to a convention difference, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.

    Equivalently, a function is injective if it maps distinct arguments to distinct images.

    Show in article · Read it in context on Wikipedia

    Function.injective_iff_pairwise_ne close match

    theorem Function.injective_iff_pairwise_ne {α : Type*} {ι : Type*} {f : ι → α} : Function.Injective f ↔ Pairwise (Function.onFun (fun x1 x2 ↦ x1 ≠ x2) f)

    Mathlib.Logic.Pairwise · lines 46–47

    Why close, not exact: Mathlib writes the distinctness condition by applying the Pairwise predicate through f, which unfolds to the quantified statement about two different arguments.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 9035a86cbeb1 · pair key 7d6d9edf798b.

    pairwise_ne_iff_injective close match

    theorem pairwise_ne_iff_injective {α : Type*} {ι : Type*} {f : ι → α} : (Pairwise fun i j ↦ f i ≠ f j) ↔ Function.Injective f

    Mathlib.Data.Set.Pairwise.Basic · lines 481–482

    Why close, not exact: The same equivalence with the two sides in the other order, the distinctness condition being spelled out inside the Pairwise predicate.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 51eb4e487e2f · pair key 81ff2eabafcd.

    Function.Injective.ne states part

    theorem Function.Injective.ne {α : Sort u_1} {β : Sort u_2} {f : α → β} : Function.Injective f → ∀ {a₁ a₂ : α}, a₁ ≠ a₂ → f a₁ ≠ f a₂

    Init.Data.Function · lines 124–125

    Why only part: It gives only the direction from injectivity to distinct images, not the return direction the passage's equivalence also asserts.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 618554242766 · pair key 6b28c2492334.
  11. Definition · main statement · Injection

    Formalized

    Formalized: Lean core states this exactly (a Prop-valued definition: it states the claim without proving it).

    The function f: X → Y is injective, if for all x, x′ ∈ X, f(x) = f(x′) ⇒ x = x′.

    Show in article · Read it in context on Wikipedia

    Function.Injective exact match

    def Function.Injective {α : Sort u_1} {β : Sort u_2} : (α → β) → Prop

    Init.Data.Function · lines 53–54

    Note: The library definition is the displayed implication of the passage, with the two arguments quantified implicitly over the domain.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 733538ea9d57 · pair key ed476a83ea33.
  12. Theorem · main statement · Injection

    Partial

    Partial: Mathlib states a special case (proved).

    The following are some facts related to injections:
    A function f: X → Y is injective if and only if X is empty or f is left-invertible; that is, there is a function g: f(X) → X such that g ∘ f = identity function on X.

    Show in article · Read it in context on Wikipedia

    Function.injective_iff_hasLeftInverse special case

    theorem Function.injective_iff_hasLeftInverse {α : Sort*} {β : Sort*} [Nonempty α] {f : α → β} : Function.Injective f ↔ Function.HasLeftInverse f

    Mathlib.Logic.Function.Basic · lines 558–559

    Why a special case: The left inverse it quantifies over is defined on the whole of Y, and restricting such a map to the set of values of f yields the article's g; the empty-domain situation, which the article treats by its first alternative, is excluded by the instance argument.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key d666f1711c25 · pair key 9595c6ae34dd.

    Set.leftInverse_rangeFactorization_iff_injective states part

    theorem Set.leftInverse_rangeFactorization_iff_injective {α : Type*} {β : Type*} (f : α → β) : Function.LeftInverse (Set.rangeSplitting f) (Set.rangeFactorization f) ↔ Function.Injective f

    Mathlib.Data.Set.Image · lines 973–976

    Why only part: It names one chosen map on the image rather than quantifying over all of them, so the article's return direction, starting from an arbitrary g, is not what it delivers.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 4f2043370caa · pair key 65ba3053c3c1.
  13. Notation · supporting · Injection

    Formalized

    Formalized: Mathlib states this up to a convention difference (a definition).

    A function f: X → Y is injective if and only if X is empty or f is left-invertible; that is, there is a function g: f(X) → X such that g ∘ f = identity function on X. Here, f(X) is the image of f.

    Show in article · Read it in context on Wikipedia

    Set.range close match

    def Set.range {α : Type u} {ι : Sort*} : (ι → α) → Set α

    Mathlib.Data.Set.Operations · line 172

    Why close, not exact: Mathlib writes this set as the range of f where the article writes the function applied to its whole domain; both name the set of values of f inside Y.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key d4307ec599c9 · pair key 96089b291852.
  14. Theorem · supporting · Injection

    Formalized

    Formalized: Mathlib states this exactly (proved).

    Since every function is surjective when its codomain is restricted to its image, every injection induces a bijection onto its image.

    Show in article · Read it in context on Wikipedia

    Set.rangeFactorization_surjective exact match

    theorem Set.rangeFactorization_surjective {α : Type u} {ι : Sort*} {f : ι → α} : Function.Surjective (Set.rangeFactorization f)

    Mathlib.Data.Set.Operations · lines 185–186

    Note: The library's range factorization is f with its codomain replaced by the set of its values, and the lemma states that this map is onto.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 99397bef02b8 · pair key b211390ef368.
  15. Theorem · main statement · Injection

    Formalized

    Formalized: Mathlib states this exactly (a definition).

    Since every function is surjective when its codomain is restricted to its image, every injection induces a bijection onto its image.

    Show in article · Read it in context on Wikipedia

    Equiv.ofInjective exact match

    def Equiv.ofInjective {α : Sort*} {β : Type*} (f : α → β) : Function.Injective f → α ≃ ↑(Set.range f)

    Mathlib.Logic.Equiv.Set · lines 543–544

    Note: The equivalence carries its inverse map and the two round trip equations alongside the forward map, which together are the bijection itself.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key a906830b7b68 · pair key 8b98d6e1881b.

    Set.rangeFactorization_bijective more general

    theorem Set.rangeFactorization_bijective {α : Type u} {ι : Sort*} {f : ι → α} : Function.Bijective (Set.rangeFactorization f) ↔ Function.Injective f

    Mathlib.Data.Set.Operations · lines 188–189

    Why more general: Mathlib proves the two way equivalence between injectivity of f and bijectivity of f with its codomain cut down to the set of its values.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 93ce35ed5364 · pair key 5b8a5e2ea35e.
  16. Theorem · supporting · Injection

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    More precisely, every injection f: X → Y can be factored as a bijection followed by an inclusion as follows.

    Show in article · Read it in context on Wikipedia

    Equiv.ofInjective_apply close match

    theorem Equiv.ofInjective_apply {α : Sort*} {β : Type*} (f : α → β) (hf : Function.Injective f) (a : α) : (Equiv.ofInjective f hf) a = ⟨f a, ⋯⟩

    Mathlib.Logic.Equiv.Set · line 542

    Why close, not exact: Mathlib records the factorisation argument by argument: the value of the canonical equivalence of X with the set of values of f, read back inside Y, is f at that argument, the second factor being the subtype coercion.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 8cb2b51a99bf · pair key 372b8f4f8091.

    Set.coe_comp_rangeFactorization states part

    theorem Set.coe_comp_rangeFactorization {β : Type*} {ι : Sort*} (f : ι → β) : Subtype.val ∘ Set.rangeFactorization f = f

    Mathlib.Data.Set.Image · line 904

    Why only part: It holds for every function and says nothing about the first factor being a bijection, which the passage also asserts.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 3398ed51415f · pair key 17b59d4b363a.

    Set.rangeFactorization_bijective states part

    theorem Set.rangeFactorization_bijective {α : Type u} {ι : Sort*} {f : ι → α} : Function.Bijective (Set.rangeFactorization f) ↔ Function.Injective f

    Mathlib.Data.Set.Operations · lines 188–189

    Why only part: It settles the nature of the first factor but states no equation identifying f with a composite.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key d1b59a8f63c5 · pair key ff1bb735d3a6.
  17. Theorem · supporting · Injection

    Formalized

    Formalized: Mathlib states a more general result (proved).

    Let fR: X → f(X) be f with codomain restricted to its image, and let i: f(X) → Y be the inclusion map from f(X) into Y. Then f = i ∘ fR.

    Show in article · Read it in context on Wikipedia

    Set.coe_comp_rangeFactorization more general

    theorem Set.coe_comp_rangeFactorization {β : Type*} {ι : Sort*} (f : ι → β) : Subtype.val ∘ Set.rangeFactorization f = f

    Mathlib.Data.Set.Image · line 904

    Why more general: Lean proves the factorization for an arbitrary function, so it also covers maps that are not injective, which is real content beyond what the passage claims.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 2713a914c5d0 · pair key 7724d68e2c9c.

    Set.rangeFactorization_eq more general

    theorem Set.rangeFactorization_eq {β : Type*} {ι : Sort*} {f : ι → β} : Subtype.val ∘ Set.rangeFactorization f = f

    Mathlib.Data.Set.Image · lines 896–897

    Why more general: This is the same identity recorded with the function left implicit, and like the previous card it holds for maps that are not injective as well.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key c96d86824db6 · pair key d65a5df89329.
  18. Theorem · main statement · Injection

    Formalized

    Formalized by 2 parts together:

    1. Function.Injective.comp Lean core (proved)
      • a composite of two injective functions is itself injective
    2. Function.Injective.of_comp Mathlib (proved)
      • if the composite g ∘ f is injective, then f is injective
    The composition of two injections is again an injection, but if g ∘ f is injective, then it can only be concluded that f is injective (see figure).

    Show in article · Read it in context on Wikipedia

    Function.Injective.comp states part

    theorem Function.Injective.comp {α : Sort u_1} {β : Sort u_2} {γ : Sort u_3} {g : β → γ} {f : α → β} : Function.Injective g → Function.Injective f → Function.Injective (g ∘ f)

    Init.Data.Function · lines 56–57

    Why only part: The declaration composes in the order the passage uses, with the second map applied after the first.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 13ded06cfcdd · pair key b0b5a8367c99.

    Function.Injective.of_comp states part

    theorem Function.Injective.of_comp {α : Sort*} {β : Sort*} {γ : Sort*} {f : α → β} {g : γ → α} : Function.Injective (f ∘ g) → Function.Injective g

    Mathlib.Logic.Function.Basic · lines 205–206

    Why only part: Lean names the inner map differently from the passage, which changes nothing about what is asserted.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 2f2acfac4058 · pair key 3caf938a2300.
  19. Theorem · supporting · Injection

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    Every embedding is injective.

    Show in article · Read it in context on Wikipedia

    Function.Embedding.injective close match

    theorem Function.Embedding.injective {α : Sort*} {β : Sort*} (f : α ↪ β) : Function.Injective ⇑f

    Mathlib.Logic.Embedding.Basic · lines 118–119

    Why close, not exact: Lean packages an embedding as a map carried together with a proof about its behaviour on distinct arguments, and this declaration hands back that proof for the underlying function.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 22b4c1d98a40 · pair key 83355f6bb60b.

    RelEmbedding.injective special case

    theorem RelEmbedding.injective {α : Type*} {β : Type*} {r : α → α → Prop} {s : β → β → Prop} (f : r ↪r s) : Function.Injective ⇑f

    Mathlib.Order.RelIso.Basic · lines 261–262

    Why a special case: Relation embeddings are one family of embeddings, so this is the passage read at those particular objects.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key d931a55cc0ec · pair key 75698bb70f0a.
  20. Definition · main statement · Surjection

    Formalized

    Formalized: Lean core states this exactly (a Prop-valued definition: it states the claim without proving it).

    A function is surjective or onto if each element of the codomain is mapped to by at least one element of the domain.

    Show in article · Read it in context on Wikipedia

    Function.Surjective exact match

    def Function.Surjective {α : Sort u_1} {β : Sort u_2} : (α → β) → Prop

    Init.Data.Function · lines 62–63

    Note: Lean's predicate says each element of the codomain equals the value of the function at some element of the domain, which is the condition the passage names.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 7b466b377a89 · pair key d2e559e9ac92.
  21. Definition · supporting · Surjection

    Formalized

    Formalized: Lean core states this up to a convention difference (a Prop-valued definition: it states the claim without proving it).

    In other words, each element of the codomain has a non-empty preimage.

    Show in article · Read it in context on Wikipedia

    Function.Surjective close match

    def Function.Surjective {α : Sort u_1} {β : Sort u_2} : (α → β) → Prop

    Init.Data.Function · lines 62–63

    Why close, not exact: Lean writes the condition as the existence of a domain element with the given value, rather than as the non-emptiness of the set of such elements.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 128ba1baa85d · pair key 1b09c27da5c9.
  22. Definition · supporting · Surjection

    Partial

    Partial: Mathlib states this up to a convention difference, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.

    Equivalently, a function is surjective if its image is equal to its codomain.

    Show in article · Read it in context on Wikipedia

    Set.range_eq_univ close match

    theorem Set.range_eq_univ {α : Type*} {ι : Sort*} {f : ι → α} : Set.range f = Set.univ ↔ Function.Surjective f

    Mathlib.Data.Set.Image · lines 597–598

    Why close, not exact: Lean writes the image as the range of the function and writes the whole codomain as the universal set of the codomain type.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 9ca4bb4e1098 · pair key 727a24cbc36a.
  23. Definition · main statement · Surjection

    Formalized

    Formalized: Lean core states this exactly (a Prop-valued definition: it states the claim without proving it).

    The function f: X → Y is surjective, if for all y ∈ Y, there is x ∈ X such that f(x) = y.

    Show in article · Read it in context on Wikipedia

    Function.Surjective exact match

    def Function.Surjective {α : Sort u_1} {β : Sort u_2} : (α → β) → Prop

    Init.Data.Function · lines 62–63

    Note: Lean's predicate quantifies over the codomain and asserts an element of the domain with the prescribed value, matching the passage's formal clause.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key bdd7dbc9dc90 · pair key 21b56e84c1d2.
  24. Theorem · main statement · Surjection

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    The following are some facts related to surjections:
    A function f: X → Y is surjective if and only if it is right-invertible; that is, if and only if there is a function g: Y → X such that f ∘ g = identity function on Y.

    Show in article · Read it in context on Wikipedia

    Function.surjective_iff_hasRightInverse close match

    theorem Function.surjective_iff_hasRightInverse {α : Sort u} {β : Sort v} {f : α → β} : Function.Surjective f ↔ Function.HasRightInverse f

    Mathlib.Logic.Function.Basic · lines 588–589

    Why close, not exact: Lean's right-inverse predicate is written pointwise, saying f sends the value of the candidate inverse at each element back to that element, where the passage writes an equation between the composite and the identity map.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 2e66dbc9fabb · pair key c46ca19fa0d0.
  25. Theorem · supporting · Surjection

    Not formalized
    (This statement is equivalent to the axiom of choice.)

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt c342ebee2f79).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  26. Theorem · main statement · Surjection

    Formalized

    Formalized: Mathlib states this exactly (a definition).

    (This statement is equivalent to the axiom of choice.)
    By collapsing all arguments mapping to a given fixed image, every surjection induces a bijection from a quotient set of its domain to its codomain.

    Show in article · Read it in context on Wikipedia

    Setoid.quotientKerEquivOfSurjective exact match

    def Setoid.quotientKerEquivOfSurjective {α : Type*} {β : Type*} (f : α → β) : Function.Surjective f → Quotient (Setoid.ker f) ≃ β

    Mathlib.Order.Setoid.Basic · lines 399–400

    Note: The relation quotiented by is Setoid.ker f, which relates two arguments precisely when f sends them to the same element.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 88fbc267835d · pair key 1b3f7420724f.
  27. Definition · supporting · Surjection

    Formalized

    Formalized: Mathlib states this exactly (a definition).

    More precisely, given a function f, define an equivalence relation on the domain of f, such that x and y are equivalent if and only if they have the same image under f ; then the equivalence classes of this relation are the preimages under f of the elements of the image of f.

    Show in article · Read it in context on Wikipedia

    Setoid.ker exact match

    def Setoid.ker {α : Type*} {β : Type*} : (α → β) → Setoid α

    Mathlib.Order.Setoid.Basic · lines 78–79

    Note: Lean packages the relation with its reflexivity, symmetry and transitivity proofs as a Setoid on the domain.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key e982d9c4a5f6 · pair key 88a63bbf17e8.

    Setoid.ker_def close match

    theorem Setoid.ker_def {α : Type*} {β : Type*} {f : α → β} {x y : α} : (Setoid.ker f) x y ↔ f x = f y

    Mathlib.Order.Setoid.Basic · lines 90–91

    Why close, not exact: Lean writes out the defining condition of the kernel relation as an iff with the equation of the two values.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 98dc4cf244a0 · pair key 2d1872f82b83.
  28. Theorem · supporting · Surjection

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    More precisely, given a function f, define an equivalence relation on the domain of f, such that x and y are equivalent if and only if they have the same image under f; then the equivalence classes of this relation are the preimages under f of the elements of the image of f.

    Show in article · Read it in context on Wikipedia

    Setoid.ker_iff_mem_preimage close match

    theorem Setoid.ker_iff_mem_preimage {α : Type*} {β : Type*} {f : α → β} {x y : α} : (Setoid.ker f) x y ↔ x ∈ f ⁻¹' {f y}

    Mathlib.Order.Setoid.Basic · lines 327–328

    Why close, not exact: Mathlib writes the identification argument by argument, as membership in the preimage of a single value, where the passage equates the family of classes with the family of preimages.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key d6f54e7b336d · pair key a8c6bd8c1625.
  29. Theorem · supporting · Surjection

    Formalized

    Formalized: Mathlib states this exactly (a definition).

    As all elements of any one of these equivalence classes are mapped by f on the same element of the codomain, this induces a bijection between the quotient set by this equivalence relation (the set of the equivalence classes) and the image of f (which is its codomain when f is surjective).

    Show in article · Read it in context on Wikipedia

    Setoid.quotientKerEquivRange exact match

    def Setoid.quotientKerEquivRange {α : Type*} {β : Type*} (f : α → β) : Quotient (Setoid.ker f) ≃ ↑(Set.range f)

    Mathlib.Order.Setoid.Basic · lines 382–383

    Note: Lean writes the image of f as Set.range f, and its docstring calls this the first isomorphism theorem for sets.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 50495e400d4d · pair key f5d3d4d8db1e.

    Setoid.quotientKerEquivOfSurjective special case

    def Setoid.quotientKerEquivOfSurjective {α : Type*} {β : Type*} (f : α → β) : Function.Surjective f → Quotient (Setoid.ker f) ≃ β

    Mathlib.Order.Setoid.Basic · lines 399–400

    Why a special case: This is the case the passage's closing remark names, where the image of f coincides with its codomain.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 62add878bc69 · pair key 6ff3671a6f8a.
  30. Theorem · supporting · Surjection

    Statement only

    With community edits: Statement only. As published it is Formalized.

    Statement only, by a community edit: Mathlib states part of this (proved).

    Moreover, f is the composition of the canonical projection from f to the quotient set, and the bijection between the quotient set and the codomain of f.

    Show in article · Read it in context on Wikipedia

    Setoid.kerLift_mk states part

    theorem Setoid.kerLift_mk {α : Type*} {β : Type*} (f : α → β) (x : α) : Setoid.kerLift f ⟦x⟧ = f x

    Mathlib.Order.Setoid.Basic · lines 348–349

    Community Agent The pipeline said close match; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.

    Why only part: Setoid.kerLift_mk states the factorization: f applied to x equals the induced map Setoid.kerLift f applied to the class of x. It does not state the passage's other clause, that this induced map is a bijection from the quotient onto the codomain. That needs f surjective; the library gives it separately as Setoid.quotientKerEquivOfSurjective.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key f5640d662750 · pair key f20cefd3403f.

    IndexedPartition.equivQuotient_symm_proj_apply close match

    No module or line: an editor named the declaration, not a place in the source.

    Mathlib

    Community Agent Added by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026

    Why close, not exact: Both clauses in one statement: the map index equals the bijection equivQuotient.symm (quotient onto the index type) applied after proj, the canonical projection onto the quotient by the kernel of index. The difference is packaging: the surjection appears as the index map of an indexed partition. The fibres of any surjection form such a partition with that map as index, and every index map is onto.

  31. Theorem · main statement · Surjection

    Formalized

    Formalized by 2 parts together:

    1. Function.Surjective.comp Lean core (proved)
      • a composite of two surjective functions is itself surjective
    2. Function.Surjective.of_comp Mathlib (proved)
      • if the composite g ∘ f is surjective, then g is surjective
    The composition of two surjections is again a surjection, but if g ∘ f is surjective, then it can only be concluded that g is surjective (see figure).

    Show in article · Read it in context on Wikipedia

    Function.Surjective.comp states part

    theorem Function.Surjective.comp {α : Sort u_1} {β : Sort u_2} {γ : Sort u_3} {g : β → γ} {f : α → β} : Function.Surjective g → Function.Surjective f → Function.Surjective (g ∘ f)

    Init.Data.Function · lines 65–69

    Why only part: Lean composes in the order outer after inner, the same order the article writes.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key df0ffa4e6ec4 · pair key fe33a7c5b76e.

    Function.Surjective.of_comp states part

    theorem Function.Surjective.of_comp {α : Sort*} {β : Sort*} {γ : Sort*} {f : α → β} {g : γ → α} : Function.Surjective (f ∘ g) → Function.Surjective f

    Mathlib.Logic.Function.Basic · lines 254–256

    Why only part: Lean names the outer map f and the inner one g, the reverse of the article's letters.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key c5d258d7be97 · pair key 79f403e972a5.
  32. Definition · main statement · Bijection

    Formalized

    Formalized: Mathlib states this exactly (a Prop-valued definition: it states the claim without proving it).

    A function is bijective if it is both injective and surjective.

    Show in article · Read it in context on Wikipedia

    Function.Bijective exact match

    def Function.Bijective {α : Sort u₁} {β : Sort u₂} : (α → β) → Prop

    Mathlib.Logic.Function.Defs · lines 163–164

    Note: Lean defines the predicate as the conjunction of injectivity and surjectivity, as its docstring records.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key af7c0384f2eb · pair key 779838606cd6.
  33. Theorem · supporting · Bijection

    Formalized

    Formalized: Mathlib states this exactly (proved).

    A function is bijective if and only if every possible image is mapped to by exactly one argument.[1]

    Show in article · Read it in context on Wikipedia

    Function.bijective_iff_existsUnique exact match

    theorem Function.bijective_iff_existsUnique {α : Sort*} {β : Sort*} (f : α → β) : Function.Bijective f ↔ ∀ (b : β), ∃! a, f a = b

    Mathlib.Logic.Function.Basic · lines 332–334

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 13d1328e2682 · pair key 569cb226600d.
  34. Definition · main statement · Bijection

    Formalized

    Formalized: Mathlib states this up to a convention difference (a Prop-valued definition: it states the claim without proving it).

    This equivalent condition is formally expressed as follows:
    The function f: X → Y is bijective, if for all y ∈ Y, there is a unique x ∈ X such that f(x) = y.

    Show in article · Read it in context on Wikipedia

    Function.Bijective close match

    def Function.Bijective {α : Sort u₁} {β : Sort u₂} : (α → β) → Prop

    Mathlib.Logic.Function.Defs · lines 163–164

    Why close, not exact: Mathlib writes the notion as injectivity together with surjectivity, which unfolds to the unique-existence condition the passage uses as its definiens.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key e978b0b2f1be · pair key d7f133f6dafe.

    Function.bijective_iff_existsUnique close match

    theorem Function.bijective_iff_existsUnique {α : Sort*} {β : Sort*} (f : α → β) : Function.Bijective f ↔ ∀ (b : β), ∃! a, f a = b

    Mathlib.Logic.Function.Basic · lines 332–334

    Why close, not exact: It writes the library's bijectivity predicate in the unique-existence form the passage uses to define the word.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 052fec55eb23 · pair key 5b208abf7b0b.
  35. Theorem · main statement · Bijection

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    The following are some facts related to bijections:
    A function f: X → Y is bijective if and only if it is invertible; that is, there is a function g: Y → X such that g ∘ f = identity function on X and f ∘ g = identity function on Y.

    Show in article · Read it in context on Wikipedia

    Function.bijective_iff_has_inverse close match

    theorem Function.bijective_iff_has_inverse {α : Sort u} {β : Sort v} {f : α → β} : Function.Bijective f ↔ ∃ g, Function.LeftInverse g f ∧ Function.RightInverse g f

    Mathlib.Logic.Function.Basic · lines 591–593

    Why close, not exact: Mathlib spells the two inverse conditions pointwise, as LeftInverse and RightInverse of g against f, where the passage writes the composites equal to the identity maps.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 76f0e7f07cbd · pair key c183706f1589.
  36. Theorem · supporting · Bijection

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    This function maps each image to its unique preimage.

    Show in article · Read it in context on Wikipedia

    Equiv.apply_eq_iff_eq_symm_apply close match

    theorem Equiv.apply_eq_iff_eq_symm_apply {α : Sort u} {β : Sort v} {x : α} {y : β} (f : α ≃ β) : f x = y ↔ x = f.symm y

    Deprecated at this commit, in favour of Equiv.eq_symm_apply.

    Mathlib.Logic.Equiv.Defs · lines 299–300

    Why close, not exact: Mathlib carries the map and its two-sided inverse together in one equivalence and states that x is sent to y exactly when x is the inverse's value at y.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key b511ff22f609 · pair key 2e79b0528d4a.
  37. Theorem · main statement · Bijection

    Formalized

    Formalized by 3 parts together (more general):

    1. Function.Bijective.comp Mathlib (proved)
      • a composite of two bijections is itself a bijection
    2. Function.Injective.of_comp Mathlib (proved)
      • if the composite g ∘ f is a bijection, then f is injective
    3. Function.Surjective.of_comp Mathlib (proved)
      • if the composite g ∘ f is a bijection, then g is surjective
    The composition of two bijections is again a bijection, but if g ∘ f is a bijection, then it can only be concluded that f is injective and g is surjective (see the figure at right and the remarks above regarding injections and surjections).

    Show in article · Read it in context on Wikipedia

    Function.Bijective.comp states part

    theorem Function.Bijective.comp {α : Sort u₁} {β : Sort u₂} {φ : Sort u₃} {g : β → φ} {f : α → β} : Function.Bijective g → Function.Bijective f → Function.Bijective (g ∘ f)

    Mathlib.Logic.Function.Defs · lines 166–167

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 1ff594b2d198 · pair key 845827ec2a83.

    Function.Injective.of_comp states part

    theorem Function.Injective.of_comp {α : Sort*} {β : Sort*} {γ : Sort*} {f : α → β} {g : γ → α} : Function.Injective (f ∘ g) → Function.Injective g

    Mathlib.Logic.Function.Basic · lines 205–206

    Why only part: Mathlib assumes only that the composite is injective, so the passage's bijective composite qualifies after taking its injective half.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 44f3a5b75156 · pair key 8ea8d42f90b4.

    Function.Surjective.of_comp states part

    theorem Function.Surjective.of_comp {α : Sort*} {β : Sort*} {γ : Sort*} {f : α → β} {g : γ → α} : Function.Surjective (f ∘ g) → Function.Surjective f

    Mathlib.Logic.Function.Basic · lines 254–256

    Why only part: Mathlib assumes only that the composite is surjective, so the passage's bijective composite qualifies after taking its surjective half.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 1fa9d44dea12 · pair key 17c1c67ed01b.
  38. Theorem · main statement · Bijection

    Formalized

    Formalized: Mathlib states this up to a convention difference (a definition).

    The bijections from a set to itself form a group under composition, called the symmetric group.

    Show in article · Read it in context on Wikipedia

    Equiv.Perm.permGroup close match

    instance Equiv.Perm.permGroup {α : Type*} : Group (Equiv.Perm α)

    Mathlib.Algebra.Group.End · lines 72–80

    Why close, not exact: Mathlib carries each self-bijection together with its inverse as an equivalence and equips that type, which it calls the permutation group, with the group structure whose multiplication is composition.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key ae07b7042794 · pair key a161b2ce7e8c.
  39. Definition · supporting · Bijection › Cardinality

    Partial

    Partial: Mathlib states this up to a convention difference, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.

    Suppose that one wants to define what it means for two sets to "have the same number of elements". One way to do this is to say that two sets "have the same number of elements", if and only if all the elements of one set can be paired with the elements of the other, in such a way that each element is paired with exactly one element.

    Show in article · Read it in context on Wikipedia

    Cardinal.eq close match

    theorem Cardinal.eq {α β : Type u} : Cardinal.mk α = Cardinal.mk β ↔ Nonempty (α ≃ β)

    Mathlib.SetTheory.Cardinal.Defs · lines 115–116

    Why close, not exact: Mathlib expresses the pairing as an inhabitant of the equivalence type between the two sets and unfolds equality of their cardinal numbers into the existence of such a pairing.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key c803c40624de · pair key e2522244247a.
  40. Definition · main statement · Bijection › Cardinality

    Partial

    Partial: Mathlib states this up to a convention difference, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.

    Accordingly, one can define two sets to "have the same number of elements"—if there is a bijection between them. In which case, the two sets are said to have the same cardinality.

    Show in article · Read it in context on Wikipedia

    Cardinal.eq close match

    theorem Cardinal.eq {α β : Type u} : Cardinal.mk α = Cardinal.mk β ↔ Nonempty (α ≃ β)

    Mathlib.SetTheory.Cardinal.Defs · lines 115–116

    Why close, not exact: Mathlib unfolds equality of the two cardinal numbers into the existence of a bijection carried together with its inverse as an equivalence.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key cabc23034786 · pair key 0c534cc70285.
  41. Definition · supporting · Bijection › Cardinality

    Partial

    Partial: Mathlib states this up to a convention difference, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.

    Likewise, one can say that set X "has fewer than or the same number of elements" as set Y, if there is an injection from X to Y ; one can also say that set X "has fewer than the number of elements" in set Y, if there is an injection from X to Y, but not a bijection between X and Y.

    Show in article · Read it in context on Wikipedia

    Cardinal.le_def close match

    theorem Cardinal.le_def (α β : Type u) : Cardinal.mk α ≤ Cardinal.mk β ↔ Nonempty (α ↪ β)

    Mathlib.SetTheory.Cardinal.Order · lines 103–104

    Why close, not exact: Mathlib measures size by the cardinal of a type and writes the injection as an element of the bundled embedding type X into Y.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 3541a1052d3f · pair key 3d69ece43390.
  42. Definition · supporting · Bijection › Cardinality

    Statement only

    With community edits: Statement only. As published it is Not formalized.

    Statement only, by a community edit: Mathlib states this up to a convention difference (statement only: the proof is not finished).

    Likewise, one can say that set X "has fewer than or the same number of elements" as set Y, if there is an injection from X to Y; one can also say that set X "has fewer than the number of elements" in set Y, if there is an injection from X to Y, but not a bijection between X and Y.

    Show in article · Read it in context on Wikipedia

    Cardinal.partialOrder close match

    No module or line: an editor named the declaration, not a place in the source.

    Mathlib

    Community Agent Added by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026

    Why close, not exact: Mathlib orders cardinalities by #X ≤ #Y iff there is an injection X → Y. This instance leaves < at its default, so #X < #Y means an injection X → Y and none back. Convention difference: the passage asks for an injection but no bijection. The two agree by Schröder-Bernstein (Function.Embedding.antisymm), which this instance's le_antisymm uses, and Cardinal.eq says #X = #Y iff a bijection exists.

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt b86f945b35d2).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  43. Example · supporting · Examples

    Formalized

    Formalized: Mathlib states a more general result (proved).

    Injective and surjective (bijective)
    The identity function idX for every non-empty set X, and thus specifically R → R : x ↦ x.

    Show in article · Read it in context on Wikipedia

    Function.bijective_id more general

    theorem Function.bijective_id {α : Sort u₁} : Function.Bijective id

    Mathlib.Logic.Function.Defs · lines 169–170

    Why more general: Mathlib proves it for every type at once, the empty one included, where the claim about the identity holds for want of elements to test.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key cc5d540d9294 · pair key c8b849b1765b.
  44. Example · supporting · Examples

    Formalized

    Formalized: Mathlib states a more general result (proved).

    The identity function idX for every non-empty set X, and thus specifically R → R : x ↦ x.

    Show in article · Read it in context on Wikipedia

    Function.bijective_id more general

    theorem Function.bijective_id {α : Sort u₁} : Function.Bijective id

    Mathlib.Logic.Function.Defs · lines 169–170

    Why more general: Mathlib states it of the identity of an arbitrary type, and the real line is one such type.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key c0c0ba2d8a6a · pair key 72e1c30f850c.
  45. Example · supporting · Examples

    Formalized

    Formalized: Mathlib states a more general result (proved).

    The identity function idX for every non-empty set X, and thus specifically R → R : x ↦ x.
    R+ → R+ : x ↦ x2, and thus also its inverse R+ → R+ : x ↦ √x.

    Show in article · Read it in context on Wikipedia

    NNReal.rpow_left_bijective more general

    theorem NNReal.rpow_left_bijective {x : ℝ} : x ≠ 0 → Function.Bijective fun y ↦ y ^ x

    Mathlib.Analysis.SpecialFunctions.Pow.NNReal · lines 396–397

    Why more general: Mathlib proves it for every non-zero real exponent and over all nonnegative reals, so it covers 0 as well, where the square is 0.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key b70a61e61365 · pair key 679f5afc08e7.
  46. Example · supporting · Examples

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    R+ → R+ : x ↦ x2, and thus also its inverse R+ → R+ : x ↦ √x.

    Show in article · Read it in context on Wikipedia

    NNReal.sqrt more general

    def NNReal.sqrt : NNReal ≃o NNReal

    Mathlib.Analysis.Real.Sqrt · lines 45–46

    Why more general: Mathlib bundles the square root of the nonnegative reals as an isomorphism of ordered sets, carrying the order on top of the one-to-one correspondence, and it covers 0 beside the positive numbers.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 94c7f4bbbe28 · pair key 32d773d19184.
  47. Example · supporting · Examples

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    R+ → R+ : x ↦ x2, and thus also its inverse R+ → R+ : x ↦ √x.
    The exponential function exp: R → R+ : x ↦ ex (that is, the exponential function with its codomain restricted to its image), and thus also its inverse the natural logarithm ln: R+ → R : x ↦ ln x. Here, R+ denotes the positive real numbers.

    Show in article · Read it in context on Wikipedia

    Real.expOrderIso more general

    def Real.expOrderIso : ℝ ≃o ↑(Set.Ioi 0)

    Mathlib.Analysis.SpecialFunctions.Exp · lines 304–309

    Why more general: Mathlib bundles the exponential as an isomorphism of ordered sets between the real line and the ray above 0, carrying the order besides the correspondence.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key c1f390c9709a · pair key 0fc89c32efd7.

    Real.expPartialHomeomorph more general

    def Real.expPartialHomeomorph : OpenPartialHomeomorph ℝ ℝ

    Mathlib.Analysis.SpecialFunctions.Log.Basic · lines 461–473

    Why more general: Mathlib bundles the exponential as a partial homeomorphism with the whole line as source and the positive reals as target, carrying continuity both ways besides the correspondence.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key d5aa2e9aeb26 · pair key 44604438f546.
  48. Example · supporting · Examples

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    The exponential function exp: R → R+ : x ↦ ex (that is, the exponential function with its codomain restricted to its image), and thus also its inverse the natural logarithm ln: R+ → R : x ↦ ln x. Here, R+ denotes the positive real numbers.

    Show in article · Read it in context on Wikipedia

    Real.expPartialHomeomorph more general

    def Real.expPartialHomeomorph : OpenPartialHomeomorph ℝ ℝ

    Mathlib.Analysis.SpecialFunctions.Log.Basic · lines 461–473

    Why more general: Mathlib bundles the exponential as a partial homeomorphism between the whole line and the positive reals whose inverse map is Real.log, carrying continuity both ways besides the inverse correspondence.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key c4da7a3be2c9 · pair key 578804e6949f.
  49. Notation · supporting · Examples

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    …exp: R → R+ : x ↦ ex (that is, the exponential function with its codomain restricted to its image), and thus also its inverse the natural logarithm ln: R+ → R : x ↦ ln x. Here, R+ denotes the positive real numbers.

    Show in article · Read it in context on Wikipedia

    Set.Ioi more general

    def Set.Ioi {α : Type*} [Preorder α] : α → Set α

    Mathlib.Order.Interval.Set.Defs · line 37

    Why more general: Lean defines the half-open unbounded interval for any preorder and any endpoint.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 816ac684406e · pair key e0b03661d477.
  50. Example · supporting · Examples

    Partial

    Partial: Mathlib states part of this (proved).

    R → R : x ↦ x3

    Show in article · Read it in context on Wikipedia

    Odd.pow_injective states part

    theorem Odd.pow_injective {R : Type*} [Semiring R] [LinearOrder R] [IsStrictOrderedRing R] [ExistsAddOfLE R] {n : ℕ} : Odd n → Function.Injective fun x ↦ x ^ n

    Mathlib.Algebra.Order.Ring.Basic · lines 211–212

    Why only part: It states injectivity of the power map and says nothing about every real being hit.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 1b408cb8ccae · pair key a744c4c8fe11.

    IsRealClosed.exists_eq_pow_of_odd states part

    theorem IsRealClosed.exists_eq_pow_of_odd {R : Type u} [Field R] [IsRealClosed R] (x : R) {n : ℕ} : Odd n → ∃ r, x = r ^ n

    Mathlib.FieldTheory.IsRealClosed.Basic · lines 82–84

    Why only part: It states that every element is an odd power and says nothing about uniqueness of the root.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 870d1a952c64 · pair key 4314e97850d4.
  51. Example · supporting · Examples

    Partial

    Partial: Mathlib states part of this (proved).

    Injective and non-surjective
    The exponential function exp: R → R : x ↦ ex.

    Show in article · Read it in context on Wikipedia

    Real.exp_injective states part

    theorem Real.exp_injective : Function.Injective Real.exp

    Mathlib.Analysis.Complex.Exponential · lines 320–321

    Why only part: It states injectivity and leaves the failure of surjectivity unsaid.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 7d8b21d1ef71 · pair key fe193e599a03.

    Real.range_exp states part

    theorem Real.range_exp : Set.range Real.exp = Set.Ioi 0

    Mathlib.Analysis.SpecialFunctions.Exp · lines 320–321

    Why only part: It pins the image of the exponential and leaves injectivity unsaid.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key d222d8fcd8ee · pair key 2e74ccc29c22.
  52. Example · supporting · Examples

    Not formalized
    Non-injective and surjective
    R → R : x ↦ (x − 1)x(x + 1) = x3 − x.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 74047e720b7a).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  53. Example · supporting · Examples

    Partial

    Partial: Mathlib states part of this (proved).

    R → R : x ↦ (x − 1)x(x + 1) = x3 − x.
    R → [−1, 1] : x ↦ sin(x).

    Show in article · Read it in context on Wikipedia

    Real.range_sin states part

    theorem Real.range_sin : Set.range Real.sin = Set.Icc (-1) 1

    Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic · lines 640–641

    Why only part: Equality of image and codomain is the passage's own reading of surjective; the lemma leaves the failure of injectivity unsaid.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 487e562abb75 · pair key 3aeae874645a.
  54. Example · supporting · Examples

    Partial

    Partial: Mathlib states part of this (proved).

    Non-injective and non-surjective
    R → R : x ↦ sin(x).

    Show in article · Read it in context on Wikipedia

    Real.range_sin states part

    theorem Real.range_sin : Set.range Real.sin = Set.Icc (-1) 1

    Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic · lines 640–641

    Why only part: It pins the image of sine and leaves the failure of injectivity unsaid.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 99045085b12d · pair key dde38209c504.
  55. Example · supporting · Examples

    Partial

    Partial: Mathlib states part of this (proved).

    R → R : x ↦ sin(x).
    R → R : x ↦ x2

    Show in article · Read it in context on Wikipedia

    pow_two_nonneg states part

    theorem pow_two_nonneg {R : Type u} [Semiring R] [LinearOrder R] [ExistsAddOfLE R] [PosMulMono R] [AddLeftMono R] (a : R) : 0 ≤ a ^ 2

    Mathlib.Algebra.Order.Ring.Unbundled.Basic · line 628

    Why only part: It bounds the values of squaring and leaves repeated values unsaid.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key f406188aa9e5 · pair key 81ce67f63c5a.

    sq_eq_sq_iff_eq_or_eq_neg states part

    theorem sq_eq_sq_iff_eq_or_eq_neg {R : Type u} [CommRing R] [NoZeroDivisors R] {a b : R} : a ^ 2 = b ^ 2 ↔ a = b ∨ a = -b

    Mathlib.Algebra.Ring.Commute · lines 216–217

    Why only part: It characterises equal squares and says nothing about which reals are values.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 69fd98339718 · pair key bc9fbe3e669a.
  56. Theorem · main statement · Properties

    Formalized

    Formalized by 2 parts together:

    1. Set.subset_preimage_image Mathlib (proved)
      • a subset of the domain is contained in the preimage of its own image under f
    2. Set.image_preimage_subset Mathlib (proved)
      • the image under f of the preimage of a subset of the codomain is contained in that subset
    For every function f, let X be a subset of the domain and Y a subset of the codomain. One has always X ⊂ f−1(f(X)) and f(f−1(Y)) ⊂ Y, where f(X) is the image of X and f−1(Y) is the preimage of Y under f.

    Show in article · Read it in context on Wikipedia

    Set.subset_preimage_image states part

    theorem Set.subset_preimage_image {α : Type*} {β : Type*} (f : α → β) (s : Set α) : s ⊆ f ⁻¹' f '' s

    Mathlib.Data.Set.Image · lines 418–419

    Why only part: Lean writes the image and the preimage with its own set notation.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 4d27be428736 · pair key 086d489a087c.

    Set.image_preimage_subset states part

    theorem Set.image_preimage_subset {α : Type*} {β : Type*} (f : α → β) (s : Set β) : f '' f ⁻¹' s ⊆ s

    Mathlib.Data.Set.Image · lines 415–416

    Why only part: Lean writes the image and the preimage with its own set notation.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 86a6e86ccc78 · pair key 16f49a6841a7.
  57. Theorem · supporting · Properties

    Formalized

    Formalized: Mathlib states this exactly (proved).

    If f is injective, then X = f−1(f(X)) , and if f is surjective, then f(f−1(Y)) = Y.

    Show in article · Read it in context on Wikipedia

    Set.preimage_image_eq exact match

    theorem Set.preimage_image_eq {α : Type*} {β : Type*} {f : α → β} (s : Set α) : Function.Injective f → f ⁻¹' f '' s = s

    Mathlib.Data.Set.Image · lines 425–426

    Note: Mathlib writes the equality with the preimage of the image on the left, which is the same assertion.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key dbe12845c096 · pair key 245494cbaed2.

    Function.Injective.preimage_image exact match

    theorem Function.Injective.preimage_image {α : Type*} {β : Type*} {f : α → β} : Function.Injective f → ∀ (s : Set α), f ⁻¹' f '' s = s

    Mathlib.Data.Set.Image · lines 1094–1095

    Note: This is the same equality offered for use after an injectivity proof, with the set argument given last.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 28f26be61cf9 · pair key 56941e50bdae.
  58. Theorem · supporting · Properties

    Formalized

    Formalized: Mathlib states this exactly (proved).

    If f is injective, then X = f−1(f(X)), and if f is surjective, then f(f−1(Y)) = Y.

    Show in article · Read it in context on Wikipedia

    Set.image_preimage_eq exact match

    theorem Set.image_preimage_eq {α : Type*} {β : Type*} {f : α → β} (s : Set β) : Function.Surjective f → f '' f ⁻¹' s = s

    Mathlib.Data.Set.Image · lines 429–432

    Note: Mathlib states the equality with the image of the preimage on the left, as the passage does.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 926d663a5b86 · pair key ed005648a1ca.

    Function.Surjective.image_preimage exact match

    theorem Function.Surjective.image_preimage {α : Type*} {β : Type*} {f : α → β} : Function.Surjective f → ∀ (s : Set β), f '' f ⁻¹' s = s

    Mathlib.Data.Set.Image · lines 1104–1105

    Note: This is the same equality packaged for use after a surjectivity proof, with the set argument last.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 331cf46d8a57 · pair key d24a4f1c4602.
  59. Definition · main statement · Properties

    Formalized

    Formalized by 2 parts together (more general):

    1. Set.rangeFactorization_surjective Mathlib (proved)
      • for a function h from X to Y, the map taking x to h(x) is a surjection from X onto the image h(X)
    2. Subtype.val_injective Mathlib (proved)
      • for a function h from X to Y, the map taking y to itself is an injection from the image h(X) into Y
    For every function h : X → Y, one can define a surjection H : X → h(X) : x ↦ h(x) and an injection I : h(X) → Y : y ↦ y.

    Show in article · Read it in context on Wikipedia

    Set.rangeFactorization_surjective states part

    theorem Set.rangeFactorization_surjective {α : Type u} {ι : Sort*} {f : ι → α} : Function.Surjective (Set.rangeFactorization f)

    Mathlib.Data.Set.Operations · lines 185–186

    Why only part: Mathlib carries the image of h as a subtype of Y, so the map records each value together with a proof that it lies in the image.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 357c9788573e · pair key 96af82ab1419.

    Subtype.val_injective states part

    theorem Subtype.val_injective {α : Sort*} {p : α → Prop} : Function.Injective Subtype.val

    Mathlib.Data.Subtype · lines 81–82

    Why only part: Mathlib proves injectivity of the projection for an arbitrary subtype of Y, and the image of h is one instance of that.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 847c8d5193ed · pair key f85111648029.
  60. Theorem · supporting · Properties

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    It follows that ⁠ h = I ∘ H ⁠.

    Show in article · Read it in context on Wikipedia

    Set.coe_comp_rangeFactorization close match

    theorem Set.coe_comp_rangeFactorization {β : Type*} {ι : Sort*} (f : ι → β) : Subtype.val ∘ Set.rangeFactorization f = f

    Mathlib.Data.Set.Image · line 904

    Why close, not exact: Mathlib keeps the image of h as a subtype of Y and writes the inclusion as the subtype projection, composing it with the factorization of h through that subtype.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 829d43e56a1b · pair key d44fac9129af.

    Set.rangeFactorization_eq close match

    theorem Set.rangeFactorization_eq {β : Type*} {ι : Sort*} {f : ι → β} : Subtype.val ∘ Set.rangeFactorization f = f

    Mathlib.Data.Set.Image · lines 896–897

    Why close, not exact: This is the same composite equality with the function left implicit, again writing the image of h as a subtype of Y.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key c2915eba5695 · pair key a91f113ddf26.
  61. Theorem · supporting · Properties

    Not formalized
    This decomposition as the composition of a surjection and an injection is unique up to an isomorphism, in the sense that, given such a decomposition, there is a unique bijection φ : h(X) → H(X) such that H(x) = φ(h(x)) and I(φ(h(x))) = h(x) for every x ∈ X.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 3 candidates examined (receipt 2d7f11cee55d).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  62. Theorem · main statement · Category theory

    Formalized

    Formalized by 3 parts together (close match):

    1. CategoryTheory.mono_iff_injective Mathlib (proved)
      • in the category of sets, the monomorphisms are exactly the injective functions
    2. CategoryTheory.epi_iff_surjective Mathlib (proved)
      • in the category of sets, the epimorphisms are exactly the surjective functions
    3. CategoryTheory.isIso_iff_bijective Mathlib (proved)
      • in the category of sets, the isomorphisms are exactly the bijective functions
    In the category of sets, injections, surjections, and bijections correspond precisely to monomorphisms, epimorphisms, and isomorphisms, respectively.

    Show in article · Read it in context on Wikipedia

    CategoryTheory.mono_iff_injective states part

    theorem CategoryTheory.mono_iff_injective {X Y : Type u} (f : X ⟶ Y) : CategoryTheory.Mono f ↔ Function.Injective ⇑(CategoryTheory.ConcreteCategory.hom f)

    Mathlib.CategoryTheory.Types.Basic · lines 325–326

    Why only part: Mathlib wraps a morphism of its category of types around the underlying function and coerces it back in the statement.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 2bc3829244a1 · pair key 5fdfb8f335e3.

    CategoryTheory.epi_iff_surjective states part

    theorem CategoryTheory.epi_iff_surjective {X Y : Type u} (f : X ⟶ Y) : CategoryTheory.Epi f ↔ Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom f)

    Mathlib.CategoryTheory.Types.Basic · lines 351–352

    Why only part: Mathlib wraps a morphism of its category of types around the underlying function and coerces it back in the statement.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key cb15bafc6441 · pair key 025a562980ea.

    CategoryTheory.isIso_iff_bijective states part

    theorem CategoryTheory.isIso_iff_bijective {X Y : Type u} (f : X ⟶ Y) : CategoryTheory.IsIso f ↔ Function.Bijective ⇑(CategoryTheory.ConcreteCategory.hom f)

    Mathlib.CategoryTheory.Types.Basic · lines 424–426

    Why only part: Mathlib wraps a morphism of its category of types around the underlying function and coerces it back in the statement.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 16aff284c180 · pair key 2c5717efdc56.

Data: view model (JSON) · Literature Links records (JSONL)