Agda good first issues

23 open Agda issues currently match the default 10+ star filter. Scored difficulty: 5,946 at 1/5, 8,786 at 2/5, 12,696 at 3/5, 12,117 at 4/5, 857 at 5/5. This hub uses the same feed as the homepage, limited to repositories whose GitHub language is Agda.

All languages · Browse projects · How to find good first issues

Active projects

Unique repos with open help-wanted issues updated in the last 30 days

Showing 23 of ~23 matching filters (Agda · 10+ stars)

List

The dependent universal property of colimits follows from the non-dependent universal property

AI summary

This issue points out that the dependent universal property of colimits can be formally derived from its non-dependent counterpart, making an explicit derivation unnecessary. It also notes the equivalence of these properties to the dependent evaluation function having a section, a stronger condition than just a section of the non-dependent evaluation function.

good first issue
32
Difficulty
4/5

Random page button

AI summary

This issue proposes adding a 'random page' button to the web interface, similar to one found in the agda-unimath project. This enhancement would provide users with a way to discover new content by navigating to a random page within the application.

enhancementgood first issueweb
32
Difficulty
2/5

Finitely generated free 𝕀-algebras are quasicoherent

AI summary

This issue proposes to prove a mathematical lemma (Lemma 7.6 from a specific arXiv paper) stating that finitely generated free I-algebras are quasicoherent. The proof is expected to be relatively straightforward, building upon existing concepts in abstract algebra and category theory.

good first issueAlgebra
32
Difficulty
2/5

Define 𝑛-coskeletal types

AI summary

This issue proposes defining the concept of an 'n-coskeletal type' within a formal system. The definition is tied to a specific inclusion of simplicial sets ($\partial\Delta^{n+1} \hookrightarrow \Delta^{n+1}$) and is known to align with an external definition from a provided arXiv paper.

good first issueSynthetic
32
Difficulty
3/5
the1lab/1lab

The universe of n-types is not an n-type

AI summary

This issue proposes formalizing the proof that the universe of n-types (`n-Type ℓ n`) does not have h-level `n`. While proving that `Set ℓ` is not a set is simple, this related proof is more complex and is suggested as a good first issue for contributors.

good first issuetype-theory
438
Difficulty
3/5

Localisations of synthetic categories

AI summary

This issue proposes exploring the concept of localisations of synthetic categories. It's tagged as a 'good first issue', suggesting it's intended for newcomers to the project and likely involves foundational understanding or implementation of a specific aspect of synthetic categories.

good first issueSynthetic.Categories
32
Difficulty
2/5

Δⁿ is a category

AI summary

This issue proposes that the mathematical concept of Δⁿ (likely referring to a finite difference operator or a similar structure) can be formally represented as a category. The goal is to establish this categorical structure within the project.

good first issueSynthetic.Categories
32
Difficulty
3/5

The family (i = 0) → X is covariant for a covariant family X

AI summary

This issue proposes a theoretical proof regarding the covariance of families in a category-theoretic context. Specifically, it suggests that a covariant family remains covariant when exponentiated by another covariant family, and more generally, that covariant families are closed under exponentiation by contravariant families. This is expected to follow from a known property of left-anodyne maps and right-fibrations.

good first issueSynthetic.Categories
32
Difficulty
4/5

Parametricity of 𝒮

AI summary

This issue proposes to demonstrate the parametricity of the category of spaces. Specifically, it states that for any object T in this category, the constant map from T to the functor mapping to T is an equivalence. This concept is further elaborated in a linked research paper.

good first issueSynthetic.Categories
32
Difficulty
4/5

Structure homomorphism principle

AI summary

This issue proposes the implementation of the "structure homomorphism principle" within the project. The principle likely relates to how structures are preserved or transformed under homomorphisms, a fundamental concept in abstract algebra and category theory.

good first issueSynthetic.Categories
32
Difficulty
3/5

Theorem 3.1 of Modalities in Homotopy Type Theory

AI summary

This issue aims to formally prove all equivalences for the definition of a 'Lex' modality in Homotopy Type Theory, building upon existing formalizations in a related issue. It involves translating a significant theoretical result into formal proofs within a proof assistant.

good first issueUnivalentFoundations
32
Difficulty
4/5

Wedge sum as pushout product

AI summary

This issue proposes refactoring code related to wedge sums by leveraging the mathematical concept of a pushout product. The core idea is that the inclusion of a wedge sum into a product can be viewed as a pushout product of two points, which could lead to code deduplication and simplification.

good first issueUnivalentFoundations
32
Difficulty
3/5

Adjunction infrastructure

AI summary

This issue identifies a lack of infrastructure surrounding the existing definition of (transposing) adjunctions in the library. The core task is to implement several missing properties and characterizations of adjunctions, such as composition closure, proving equivalences are adjoints, and establishing adjoint uniqueness. This will involve significant theoretical development and implementation within the synthetic categories library.

good first issueSynthetic.Categories
32
Difficulty
4/5

Clean up `tr-cov-idH` vs `tr-cov-hom-idH`

AI summary

This issue addresses a potential inconsistency in naming conventions within the `agda-synthetic-categories` repository. It specifically questions the distinction between `tr-cov-idH` and `tr-cov-hom-idH`, suggesting a cleanup to ensure clarity and uniformity in the codebase. The goal is to streamline the naming and potentially remove redundancy.

good first issuechore
32
Difficulty
2/5

Also browsing: Python , TypeScript , JavaScript